/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/eureka_01-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:16:49,642 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:16:49,656 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:16:49,675 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:16:49,676 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:16:49,677 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:16:49,677 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:16:49,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:16:49,679 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:16:49,680 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:16:49,680 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:16:49,681 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:16:49,681 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:16:49,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:16:49,682 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:16:49,683 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:16:49,694 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:16:49,695 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:16:49,695 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:16:49,696 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:16:49,697 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:16:49,701 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:16:49,702 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:16:49,703 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:16:49,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:16:49,705 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:16:49,705 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:16:49,705 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:16:49,706 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:16:49,706 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:16:49,706 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:16:49,707 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:16:49,707 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:16:49,707 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:16:49,708 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:16:49,708 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:16:49,708 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:16:49,709 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:16:49,709 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:16:49,709 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:16:49,710 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:16:49,716 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:16:49,717 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:16:49,744 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:16:49,744 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:16:49,745 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:16:49,745 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:16:49,745 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:16:49,745 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:16:49,746 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:16:49,746 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:16:49,746 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:16:49,746 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:16:49,747 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:16:49,747 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:16:49,747 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:16:49,747 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:16:49,747 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:16:49,747 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:16:49,747 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:16:49,748 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:16:49,748 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:16:49,748 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:16:49,748 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:16:49,748 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:16:49,748 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:16:49,748 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:16:49,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:16:49,749 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:16:49,749 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:16:49,749 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:16:49,749 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:16:49,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:16:49,749 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:16:49,750 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:16:49,750 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:16:49,750 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 10:16:49,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:16:49,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:16:49,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:16:49,929 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:16:49,929 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:16:49,930 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-27 10:16:49,981 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/646ebb726/6a42651e658c4e21903d3f481e1be2de/FLAGf4802be88 [2022-04-27 10:16:50,295 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:16:50,296 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01-2.c [2022-04-27 10:16:50,301 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/646ebb726/6a42651e658c4e21903d3f481e1be2de/FLAGf4802be88 [2022-04-27 10:16:50,725 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/646ebb726/6a42651e658c4e21903d3f481e1be2de [2022-04-27 10:16:50,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:16:50,730 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:16:50,731 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:16:50,731 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:16:50,733 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:16:50,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:16:50" (1/1) ... [2022-04-27 10:16:50,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58e904af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:50, skipping insertion in model container [2022-04-27 10:16:50,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:16:50" (1/1) ... [2022-04-27 10:16:50,740 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:16:50,750 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:16:50,866 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-27 10:16:50,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:16:50,904 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:16:50,911 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-27 10:16:50,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:16:50,960 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:16:50,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:50 WrapperNode [2022-04-27 10:16:50,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:16:50,961 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:16:50,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:16:50,961 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:16:50,968 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:50" (1/1) ... [2022-04-27 10:16:50,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:50" (1/1) ... [2022-04-27 10:16:50,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:50" (1/1) ... [2022-04-27 10:16:50,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:50" (1/1) ... [2022-04-27 10:16:50,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:50" (1/1) ... [2022-04-27 10:16:51,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:50" (1/1) ... [2022-04-27 10:16:51,001 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:50" (1/1) ... [2022-04-27 10:16:51,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:16:51,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:16:51,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:16:51,004 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:16:51,011 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:50" (1/1) ... [2022-04-27 10:16:51,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:16:51,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:16:51,034 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-27 10:16:51,044 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-27 10:16:51,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:16:51,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:16:51,063 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:16:51,063 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:16:51,063 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:16:51,064 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:16:51,064 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:16:51,064 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:16:51,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:16:51,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:16:51,064 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:16:51,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 10:16:51,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:16:51,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:16:51,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:16:51,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:16:51,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:16:51,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:16:51,111 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:16:51,112 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:16:51,428 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:16:51,433 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:16:51,433 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-27 10:16:51,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:16:51 BoogieIcfgContainer [2022-04-27 10:16:51,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:16:51,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:16:51,436 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:16:51,444 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:16:51,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:16:50" (1/3) ... [2022-04-27 10:16:51,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b29ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:16:51, skipping insertion in model container [2022-04-27 10:16:51,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:50" (2/3) ... [2022-04-27 10:16:51,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b29ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:16:51, skipping insertion in model container [2022-04-27 10:16:51,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:16:51" (3/3) ... [2022-04-27 10:16:51,447 INFO L111 eAbstractionObserver]: Analyzing ICFG eureka_01-2.c [2022-04-27 10:16:51,457 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:16:51,458 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:16:51,508 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:16:51,520 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@559bfc36, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@32f6968 [2022-04-27 10:16:51,521 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:16:51,527 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-27 10:16:51,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 10:16:51,535 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:51,535 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:51,536 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:51,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:51,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1209894008, now seen corresponding path program 1 times [2022-04-27 10:16:51,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:51,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700647557] [2022-04-27 10:16:51,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:51,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:51,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:51,782 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-27 10:16:51,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-27 10:16:51,783 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #107#return; {38#true} is VALID [2022-04-27 10:16:51,785 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-27 10:16:51,785 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-27 10:16:51,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-27 10:16:51,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #107#return; {38#true} is VALID [2022-04-27 10:16:51,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret22 := main(); {38#true} is VALID [2022-04-27 10:16:51,791 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-27 10:16:51,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {38#true} assume !true; {39#false} is VALID [2022-04-27 10:16:51,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2022-04-27 10:16:51,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#false} assume !true; {39#false} is VALID [2022-04-27 10:16:51,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2022-04-27 10:16:51,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {39#false} assume !true; {39#false} is VALID [2022-04-27 10:16:51,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2022-04-27 10:16:51,795 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-27 10:16:51,795 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-27 10:16:51,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2022-04-27 10:16:51,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2022-04-27 10:16:51,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-04-27 10:16:51,796 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-27 10:16:51,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:51,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700647557] [2022-04-27 10:16:51,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700647557] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:16:51,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:16:51,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:16:51,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582210810] [2022-04-27 10:16:51,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:16:51,804 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-27 10:16:51,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:51,808 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-27 10:16:51,831 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-27 10:16:51,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:16:51,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:51,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:16:51,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:16:51,854 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-27 10:16:51,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:51,934 INFO L93 Difference]: Finished difference Result 61 states and 85 transitions. [2022-04-27 10:16:51,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:16:51,934 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-27 10:16:51,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:51,935 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-27 10:16:51,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2022-04-27 10:16:51,946 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-27 10:16:51,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2022-04-27 10:16:51,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 85 transitions. [2022-04-27 10:16:52,045 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-27 10:16:52,051 INFO L225 Difference]: With dead ends: 61 [2022-04-27 10:16:52,051 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 10:16:52,053 INFO L412 NwaCegarLoop]: 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-27 10:16:52,055 INFO L413 NwaCegarLoop]: 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-27 10:16:52,056 INFO L414 NwaCegarLoop]: 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-27 10:16:52,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 10:16:52,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-27 10:16:52,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:52,076 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-27 10:16:52,076 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-27 10:16:52,077 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-27 10:16:52,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:52,080 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-27 10:16:52,080 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-27 10:16:52,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:52,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:52,080 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-27 10:16:52,081 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-27 10:16:52,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:52,083 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-27 10:16:52,083 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-27 10:16:52,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:52,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:52,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:52,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:52,085 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-27 10:16:52,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-04-27 10:16:52,087 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 17 [2022-04-27 10:16:52,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:52,087 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-04-27 10:16:52,088 INFO L496 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-27 10:16:52,088 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-27 10:16:52,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 10:16:52,088 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:52,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:52,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:16:52,089 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:52,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:52,089 INFO L85 PathProgramCache]: Analyzing trace with hash -286620772, now seen corresponding path program 1 times [2022-04-27 10:16:52,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:52,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994878470] [2022-04-27 10:16:52,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:52,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:52,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:52,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {231#(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; {225#true} is VALID [2022-04-27 10:16:52,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {225#true} assume true; {225#true} is VALID [2022-04-27 10:16:52,181 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {225#true} {225#true} #107#return; {225#true} is VALID [2022-04-27 10:16:52,182 INFO L272 TraceCheckUtils]: 0: Hoare triple {225#true} call ULTIMATE.init(); {231#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:52,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {231#(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; {225#true} is VALID [2022-04-27 10:16:52,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {225#true} assume true; {225#true} is VALID [2022-04-27 10:16:52,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {225#true} {225#true} #107#return; {225#true} is VALID [2022-04-27 10:16:52,182 INFO L272 TraceCheckUtils]: 4: Hoare triple {225#true} call #t~ret22 := main(); {225#true} is VALID [2022-04-27 10:16:52,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {225#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {230#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:16:52,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {230#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !(~i~0 < ~nodecount~0); {226#false} is VALID [2022-04-27 10:16:52,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {226#false} ~i~0 := 0; {226#false} is VALID [2022-04-27 10:16:52,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {226#false} assume !(~i~0 < ~nodecount~0); {226#false} is VALID [2022-04-27 10:16:52,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {226#false} ~i~0 := 0; {226#false} is VALID [2022-04-27 10:16:52,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {226#false} assume !(~i~0 < ~edgecount~0); {226#false} is VALID [2022-04-27 10:16:52,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {226#false} ~i~0 := 0; {226#false} is VALID [2022-04-27 10:16:52,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {226#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {226#false} is VALID [2022-04-27 10:16:52,187 INFO L272 TraceCheckUtils]: 13: Hoare triple {226#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {226#false} is VALID [2022-04-27 10:16:52,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {226#false} ~cond := #in~cond; {226#false} is VALID [2022-04-27 10:16:52,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {226#false} assume 0 == ~cond; {226#false} is VALID [2022-04-27 10:16:52,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {226#false} assume !false; {226#false} is VALID [2022-04-27 10:16:52,188 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-27 10:16:52,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:52,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994878470] [2022-04-27 10:16:52,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994878470] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:16:52,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:16:52,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:16:52,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139259777] [2022-04-27 10:16:52,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:16:52,189 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-27 10:16:52,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:52,190 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-27 10:16:52,224 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-27 10:16:52,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:16:52,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:52,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:16:52,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:16:52,225 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-27 10:16:52,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:52,331 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2022-04-27 10:16:52,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:16:52,331 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-27 10:16:52,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:52,332 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-27 10:16:52,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-04-27 10:16:52,337 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-27 10:16:52,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-04-27 10:16:52,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 66 transitions. [2022-04-27 10:16:52,384 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-27 10:16:52,387 INFO L225 Difference]: With dead ends: 54 [2022-04-27 10:16:52,388 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 10:16:52,391 INFO L412 NwaCegarLoop]: 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-27 10:16:52,394 INFO L413 NwaCegarLoop]: 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-27 10:16:52,394 INFO L414 NwaCegarLoop]: 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-27 10:16:52,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 10:16:52,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2022-04-27 10:16:52,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:52,404 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-27 10:16:52,405 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-27 10:16:52,406 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-27 10:16:52,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:52,410 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-04-27 10:16:52,410 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-04-27 10:16:52,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:52,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:52,411 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-27 10:16:52,411 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-27 10:16:52,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:52,415 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-04-27 10:16:52,415 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-04-27 10:16:52,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:52,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:52,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:52,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:52,416 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-27 10:16:52,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-04-27 10:16:52,417 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 17 [2022-04-27 10:16:52,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:52,417 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-04-27 10:16:52,417 INFO L496 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-27 10:16:52,418 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-04-27 10:16:52,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 10:16:52,418 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:52,418 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:52,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:16:52,418 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:52,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:52,419 INFO L85 PathProgramCache]: Analyzing trace with hash -344225220, now seen corresponding path program 1 times [2022-04-27 10:16:52,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:52,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957937770] [2022-04-27 10:16:52,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:52,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:52,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:52,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {424#(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; {417#true} is VALID [2022-04-27 10:16:52,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-27 10:16:52,541 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {417#true} {417#true} #107#return; {417#true} is VALID [2022-04-27 10:16:52,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {417#true} call ULTIMATE.init(); {424#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:52,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {424#(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; {417#true} is VALID [2022-04-27 10:16:52,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-27 10:16:52,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {417#true} {417#true} #107#return; {417#true} is VALID [2022-04-27 10:16:52,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {417#true} call #t~ret22 := main(); {417#true} is VALID [2022-04-27 10:16:52,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {417#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {422#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-27 10:16:52,548 INFO L290 TraceCheckUtils]: 6: Hoare triple {422#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {422#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-27 10:16:52,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {422#(= (+ main_~nodecount~0 (- 5)) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {422#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-27 10:16:52,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {422#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {422#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-27 10:16:52,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {422#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 < ~nodecount~0); {422#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-27 10:16:52,550 INFO L290 TraceCheckUtils]: 10: Hoare triple {422#(= (+ main_~nodecount~0 (- 5)) 0)} ~i~0 := 0; {423#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:16:52,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {423#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !(~i~0 < ~nodecount~0); {418#false} is VALID [2022-04-27 10:16:52,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {418#false} ~i~0 := 0; {418#false} is VALID [2022-04-27 10:16:52,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {418#false} assume !(~i~0 < ~edgecount~0); {418#false} is VALID [2022-04-27 10:16:52,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {418#false} ~i~0 := 0; {418#false} is VALID [2022-04-27 10:16:52,552 INFO L290 TraceCheckUtils]: 15: Hoare triple {418#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {418#false} is VALID [2022-04-27 10:16:52,552 INFO L272 TraceCheckUtils]: 16: Hoare triple {418#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {418#false} is VALID [2022-04-27 10:16:52,552 INFO L290 TraceCheckUtils]: 17: Hoare triple {418#false} ~cond := #in~cond; {418#false} is VALID [2022-04-27 10:16:52,552 INFO L290 TraceCheckUtils]: 18: Hoare triple {418#false} assume 0 == ~cond; {418#false} is VALID [2022-04-27 10:16:52,552 INFO L290 TraceCheckUtils]: 19: Hoare triple {418#false} assume !false; {418#false} is VALID [2022-04-27 10:16:52,553 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-27 10:16:52,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:52,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957937770] [2022-04-27 10:16:52,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957937770] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:16:52,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:16:52,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:16:52,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265462195] [2022-04-27 10:16:52,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:16:52,554 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-27 10:16:52,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:52,554 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-27 10:16:52,572 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-27 10:16:52,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:16:52,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:52,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:16:52,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:16:52,573 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-27 10:16:52,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:52,759 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-04-27 10:16:52,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:16:52,760 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-27 10:16:52,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:52,760 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-27 10:16:52,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-04-27 10:16:52,763 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-27 10:16:52,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-04-27 10:16:52,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 74 transitions. [2022-04-27 10:16:52,831 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-27 10:16:52,834 INFO L225 Difference]: With dead ends: 61 [2022-04-27 10:16:52,834 INFO L226 Difference]: Without dead ends: 46 [2022-04-27 10:16:52,837 INFO L412 NwaCegarLoop]: 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-27 10:16:52,839 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 75 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:16:52,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 34 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:16:52,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-27 10:16:52,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 32. [2022-04-27 10:16:52,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:52,844 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-27 10:16:52,844 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-27 10:16:52,844 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-27 10:16:52,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:52,846 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-04-27 10:16:52,846 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-04-27 10:16:52,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:52,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:52,847 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-27 10:16:52,847 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-27 10:16:52,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:52,848 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-04-27 10:16:52,848 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-04-27 10:16:52,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:52,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:52,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:52,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:52,849 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-27 10:16:52,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-04-27 10:16:52,850 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 20 [2022-04-27 10:16:52,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:52,850 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-04-27 10:16:52,850 INFO L496 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-27 10:16:52,850 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-27 10:16:52,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 10:16:52,851 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:52,851 INFO L195 NwaCegarLoop]: 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-27 10:16:52,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 10:16:52,851 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:52,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:52,852 INFO L85 PathProgramCache]: Analyzing trace with hash -522475142, now seen corresponding path program 1 times [2022-04-27 10:16:52,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:52,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094067981] [2022-04-27 10:16:52,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:52,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:52,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:52,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {657#(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; {650#true} is VALID [2022-04-27 10:16:52,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {650#true} assume true; {650#true} is VALID [2022-04-27 10:16:52,941 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {650#true} {650#true} #107#return; {650#true} is VALID [2022-04-27 10:16:52,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {650#true} call ULTIMATE.init(); {657#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:52,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {657#(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; {650#true} is VALID [2022-04-27 10:16:52,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {650#true} assume true; {650#true} is VALID [2022-04-27 10:16:52,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {650#true} {650#true} #107#return; {650#true} is VALID [2022-04-27 10:16:52,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {650#true} call #t~ret22 := main(); {650#true} is VALID [2022-04-27 10:16:52,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {650#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {655#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:52,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {655#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {655#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:52,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {655#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {655#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:52,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {655#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {655#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:52,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {655#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {655#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:52,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {655#(<= 20 main_~edgecount~0)} ~i~0 := 0; {655#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:52,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {655#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {656#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:16:52,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {656#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} assume !(~j~0 < ~edgecount~0); {651#false} is VALID [2022-04-27 10:16:52,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {651#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {651#false} is VALID [2022-04-27 10:16:52,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {651#false} assume !(~i~0 < ~nodecount~0); {651#false} is VALID [2022-04-27 10:16:52,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {651#false} ~i~0 := 0; {651#false} is VALID [2022-04-27 10:16:52,947 INFO L290 TraceCheckUtils]: 16: Hoare triple {651#false} assume !(~i~0 < ~edgecount~0); {651#false} is VALID [2022-04-27 10:16:52,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {651#false} ~i~0 := 0; {651#false} is VALID [2022-04-27 10:16:52,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {651#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {651#false} is VALID [2022-04-27 10:16:52,948 INFO L272 TraceCheckUtils]: 19: Hoare triple {651#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {651#false} is VALID [2022-04-27 10:16:52,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {651#false} ~cond := #in~cond; {651#false} is VALID [2022-04-27 10:16:52,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {651#false} assume 0 == ~cond; {651#false} is VALID [2022-04-27 10:16:52,948 INFO L290 TraceCheckUtils]: 22: Hoare triple {651#false} assume !false; {651#false} is VALID [2022-04-27 10:16:52,948 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-27 10:16:52,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:52,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094067981] [2022-04-27 10:16:52,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094067981] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:16:52,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:16:52,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:16:52,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412583417] [2022-04-27 10:16:52,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:16:52,949 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-27 10:16:52,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:52,949 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-27 10:16:52,968 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-27 10:16:52,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:16:52,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:52,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:16:52,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:16:52,969 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-27 10:16:53,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:53,104 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2022-04-27 10:16:53,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:16:53,104 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-27 10:16:53,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:53,106 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-27 10:16:53,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 10:16:53,114 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-27 10:16:53,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 10:16:53,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-27 10:16:53,160 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-27 10:16:53,161 INFO L225 Difference]: With dead ends: 55 [2022-04-27 10:16:53,161 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 10:16:53,161 INFO L412 NwaCegarLoop]: 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-27 10:16:53,162 INFO L413 NwaCegarLoop]: 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-27 10:16:53,162 INFO L414 NwaCegarLoop]: 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-27 10:16:53,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 10:16:53,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-04-27 10:16:53,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:53,172 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-27 10:16:53,172 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-27 10:16:53,173 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-27 10:16:53,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:53,175 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-27 10:16:53,175 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-04-27 10:16:53,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:53,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:53,176 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-27 10:16:53,176 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-27 10:16:53,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:53,181 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-27 10:16:53,181 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-04-27 10:16:53,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:53,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:53,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:53,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:53,185 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-27 10:16:53,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-04-27 10:16:53,185 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 23 [2022-04-27 10:16:53,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:53,186 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-04-27 10:16:53,186 INFO L496 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-27 10:16:53,186 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-27 10:16:53,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 10:16:53,186 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:53,186 INFO L195 NwaCegarLoop]: 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-27 10:16:53,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 10:16:53,187 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:53,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:53,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1086024003, now seen corresponding path program 1 times [2022-04-27 10:16:53,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:53,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150446362] [2022-04-27 10:16:53,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:53,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:53,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:53,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {863#(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; {856#true} is VALID [2022-04-27 10:16:53,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {856#true} assume true; {856#true} is VALID [2022-04-27 10:16:53,234 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {856#true} {856#true} #107#return; {856#true} is VALID [2022-04-27 10:16:53,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {856#true} call ULTIMATE.init(); {863#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:53,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {863#(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; {856#true} is VALID [2022-04-27 10:16:53,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {856#true} assume true; {856#true} is VALID [2022-04-27 10:16:53,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {856#true} {856#true} #107#return; {856#true} is VALID [2022-04-27 10:16:53,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {856#true} call #t~ret22 := main(); {856#true} is VALID [2022-04-27 10:16:53,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {856#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {861#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:53,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {861#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {861#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:53,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {861#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {861#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:53,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {861#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {861#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:53,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {861#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {861#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:53,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {861#(<= 20 main_~edgecount~0)} ~i~0 := 0; {861#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:53,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {861#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {861#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:53,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {861#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {861#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:53,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {861#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {861#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:53,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {861#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {861#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:53,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {861#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {861#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:53,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {861#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {861#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:53,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {861#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {861#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:53,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {861#(<= 20 main_~edgecount~0)} ~i~0 := 0; {862#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-27 10:16:53,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {862#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} assume !(~i~0 < ~edgecount~0); {857#false} is VALID [2022-04-27 10:16:53,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {857#false} ~i~0 := 0; {857#false} is VALID [2022-04-27 10:16:53,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {857#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {857#false} is VALID [2022-04-27 10:16:53,241 INFO L272 TraceCheckUtils]: 22: Hoare triple {857#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {857#false} is VALID [2022-04-27 10:16:53,241 INFO L290 TraceCheckUtils]: 23: Hoare triple {857#false} ~cond := #in~cond; {857#false} is VALID [2022-04-27 10:16:53,241 INFO L290 TraceCheckUtils]: 24: Hoare triple {857#false} assume 0 == ~cond; {857#false} is VALID [2022-04-27 10:16:53,241 INFO L290 TraceCheckUtils]: 25: Hoare triple {857#false} assume !false; {857#false} is VALID [2022-04-27 10:16:53,242 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-27 10:16:53,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:53,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150446362] [2022-04-27 10:16:53,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150446362] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:16:53,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:16:53,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:16:53,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699152596] [2022-04-27 10:16:53,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:16:53,243 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-27 10:16:53,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:53,243 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-27 10:16:53,261 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-27 10:16:53,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:16:53,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:53,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:16:53,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:16:53,262 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-27 10:16:53,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:53,433 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2022-04-27 10:16:53,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:16:53,433 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-27 10:16:53,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:53,433 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-27 10:16:53,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 10:16:53,435 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-27 10:16:53,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 10:16:53,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-27 10:16:53,502 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-27 10:16:53,503 INFO L225 Difference]: With dead ends: 58 [2022-04-27 10:16:53,503 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 10:16:53,503 INFO L412 NwaCegarLoop]: 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-27 10:16:53,504 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 65 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:16:53,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 34 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:16:53,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 10:16:53,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2022-04-27 10:16:53,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:53,514 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-27 10:16:53,514 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-27 10:16:53,514 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-27 10:16:53,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:53,516 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-04-27 10:16:53,516 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-04-27 10:16:53,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:53,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:53,516 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-27 10:16:53,516 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-27 10:16:53,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:53,517 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-04-27 10:16:53,518 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-04-27 10:16:53,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:53,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:53,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:53,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:53,518 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-27 10:16:53,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-04-27 10:16:53,519 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 26 [2022-04-27 10:16:53,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:53,519 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-04-27 10:16:53,519 INFO L496 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-27 10:16:53,519 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-04-27 10:16:53,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 10:16:53,519 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:53,519 INFO L195 NwaCegarLoop]: 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-27 10:16:53,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 10:16:53,520 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:53,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:53,520 INFO L85 PathProgramCache]: Analyzing trace with hash -669976079, now seen corresponding path program 1 times [2022-04-27 10:16:53,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:53,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48467768] [2022-04-27 10:16:53,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:53,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:53,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:53,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {1100#(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; {1093#true} is VALID [2022-04-27 10:16:53,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {1093#true} assume true; {1093#true} is VALID [2022-04-27 10:16:53,624 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1093#true} {1093#true} #107#return; {1093#true} is VALID [2022-04-27 10:16:53,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {1093#true} call ULTIMATE.init(); {1100#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:53,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {1100#(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; {1093#true} is VALID [2022-04-27 10:16:53,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {1093#true} assume true; {1093#true} is VALID [2022-04-27 10:16:53,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1093#true} {1093#true} #107#return; {1093#true} is VALID [2022-04-27 10:16:53,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {1093#true} call #t~ret22 := main(); {1093#true} is VALID [2022-04-27 10:16:53,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {1093#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1098#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:16:53,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {1098#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {1098#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:16:53,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {1098#(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); {1098#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:16:53,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {1098#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1099#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:16:53,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {1099#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~i~0 < ~nodecount~0); {1094#false} is VALID [2022-04-27 10:16:53,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {1094#false} ~i~0 := 0; {1094#false} is VALID [2022-04-27 10:16:53,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {1094#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1094#false} is VALID [2022-04-27 10:16:53,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {1094#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {1094#false} is VALID [2022-04-27 10:16:53,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {1094#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {1094#false} is VALID [2022-04-27 10:16:53,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {1094#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1094#false} is VALID [2022-04-27 10:16:53,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {1094#false} assume !(~j~0 < ~edgecount~0); {1094#false} is VALID [2022-04-27 10:16:53,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {1094#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1094#false} is VALID [2022-04-27 10:16:53,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {1094#false} assume !(~i~0 < ~nodecount~0); {1094#false} is VALID [2022-04-27 10:16:53,628 INFO L290 TraceCheckUtils]: 18: Hoare triple {1094#false} ~i~0 := 0; {1094#false} is VALID [2022-04-27 10:16:53,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {1094#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); {1094#false} is VALID [2022-04-27 10:16:53,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {1094#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {1094#false} is VALID [2022-04-27 10:16:53,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {1094#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1094#false} is VALID [2022-04-27 10:16:53,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {1094#false} assume !(~i~0 < ~edgecount~0); {1094#false} is VALID [2022-04-27 10:16:53,629 INFO L290 TraceCheckUtils]: 23: Hoare triple {1094#false} ~i~0 := 0; {1094#false} is VALID [2022-04-27 10:16:53,629 INFO L290 TraceCheckUtils]: 24: Hoare triple {1094#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1094#false} is VALID [2022-04-27 10:16:53,629 INFO L272 TraceCheckUtils]: 25: Hoare triple {1094#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {1094#false} is VALID [2022-04-27 10:16:53,629 INFO L290 TraceCheckUtils]: 26: Hoare triple {1094#false} ~cond := #in~cond; {1094#false} is VALID [2022-04-27 10:16:53,629 INFO L290 TraceCheckUtils]: 27: Hoare triple {1094#false} assume 0 == ~cond; {1094#false} is VALID [2022-04-27 10:16:53,629 INFO L290 TraceCheckUtils]: 28: Hoare triple {1094#false} assume !false; {1094#false} is VALID [2022-04-27 10:16:53,630 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-27 10:16:53,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:53,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48467768] [2022-04-27 10:16:53,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48467768] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:16:53,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777035720] [2022-04-27 10:16:53,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:53,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:16:53,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:16:53,631 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-27 10:16:53,637 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-27 10:16:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:53,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 10:16:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:53,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:16:53,950 INFO L272 TraceCheckUtils]: 0: Hoare triple {1093#true} call ULTIMATE.init(); {1093#true} is VALID [2022-04-27 10:16:53,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {1093#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; {1093#true} is VALID [2022-04-27 10:16:53,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {1093#true} assume true; {1093#true} is VALID [2022-04-27 10:16:53,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1093#true} {1093#true} #107#return; {1093#true} is VALID [2022-04-27 10:16:53,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {1093#true} call #t~ret22 := main(); {1093#true} is VALID [2022-04-27 10:16:53,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {1093#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1119#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:16:53,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {1119#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0); {1119#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:16:53,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {1119#(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); {1119#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:16:53,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {1119#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1129#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:16:53,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {1129#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !(~i~0 < ~nodecount~0); {1094#false} is VALID [2022-04-27 10:16:53,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {1094#false} ~i~0 := 0; {1094#false} is VALID [2022-04-27 10:16:53,955 INFO L290 TraceCheckUtils]: 11: Hoare triple {1094#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1094#false} is VALID [2022-04-27 10:16:53,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {1094#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {1094#false} is VALID [2022-04-27 10:16:53,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {1094#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {1094#false} is VALID [2022-04-27 10:16:53,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {1094#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1094#false} is VALID [2022-04-27 10:16:53,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {1094#false} assume !(~j~0 < ~edgecount~0); {1094#false} is VALID [2022-04-27 10:16:53,955 INFO L290 TraceCheckUtils]: 16: Hoare triple {1094#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1094#false} is VALID [2022-04-27 10:16:53,955 INFO L290 TraceCheckUtils]: 17: Hoare triple {1094#false} assume !(~i~0 < ~nodecount~0); {1094#false} is VALID [2022-04-27 10:16:53,955 INFO L290 TraceCheckUtils]: 18: Hoare triple {1094#false} ~i~0 := 0; {1094#false} is VALID [2022-04-27 10:16:53,955 INFO L290 TraceCheckUtils]: 19: Hoare triple {1094#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); {1094#false} is VALID [2022-04-27 10:16:53,956 INFO L290 TraceCheckUtils]: 20: Hoare triple {1094#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {1094#false} is VALID [2022-04-27 10:16:53,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {1094#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1094#false} is VALID [2022-04-27 10:16:53,956 INFO L290 TraceCheckUtils]: 22: Hoare triple {1094#false} assume !(~i~0 < ~edgecount~0); {1094#false} is VALID [2022-04-27 10:16:53,956 INFO L290 TraceCheckUtils]: 23: Hoare triple {1094#false} ~i~0 := 0; {1094#false} is VALID [2022-04-27 10:16:53,956 INFO L290 TraceCheckUtils]: 24: Hoare triple {1094#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1094#false} is VALID [2022-04-27 10:16:53,956 INFO L272 TraceCheckUtils]: 25: Hoare triple {1094#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {1094#false} is VALID [2022-04-27 10:16:53,956 INFO L290 TraceCheckUtils]: 26: Hoare triple {1094#false} ~cond := #in~cond; {1094#false} is VALID [2022-04-27 10:16:53,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {1094#false} assume 0 == ~cond; {1094#false} is VALID [2022-04-27 10:16:53,956 INFO L290 TraceCheckUtils]: 28: Hoare triple {1094#false} assume !false; {1094#false} is VALID [2022-04-27 10:16:53,956 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-27 10:16:53,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:16:54,072 INFO L290 TraceCheckUtils]: 28: Hoare triple {1094#false} assume !false; {1094#false} is VALID [2022-04-27 10:16:54,072 INFO L290 TraceCheckUtils]: 27: Hoare triple {1094#false} assume 0 == ~cond; {1094#false} is VALID [2022-04-27 10:16:54,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {1094#false} ~cond := #in~cond; {1094#false} is VALID [2022-04-27 10:16:54,073 INFO L272 TraceCheckUtils]: 25: Hoare triple {1094#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {1094#false} is VALID [2022-04-27 10:16:54,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {1094#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1094#false} is VALID [2022-04-27 10:16:54,076 INFO L290 TraceCheckUtils]: 23: Hoare triple {1094#false} ~i~0 := 0; {1094#false} is VALID [2022-04-27 10:16:54,077 INFO L290 TraceCheckUtils]: 22: Hoare triple {1094#false} assume !(~i~0 < ~edgecount~0); {1094#false} is VALID [2022-04-27 10:16:54,077 INFO L290 TraceCheckUtils]: 21: Hoare triple {1094#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1094#false} is VALID [2022-04-27 10:16:54,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {1094#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {1094#false} is VALID [2022-04-27 10:16:54,077 INFO L290 TraceCheckUtils]: 19: Hoare triple {1094#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); {1094#false} is VALID [2022-04-27 10:16:54,077 INFO L290 TraceCheckUtils]: 18: Hoare triple {1094#false} ~i~0 := 0; {1094#false} is VALID [2022-04-27 10:16:54,077 INFO L290 TraceCheckUtils]: 17: Hoare triple {1094#false} assume !(~i~0 < ~nodecount~0); {1094#false} is VALID [2022-04-27 10:16:54,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {1094#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1094#false} is VALID [2022-04-27 10:16:54,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {1094#false} assume !(~j~0 < ~edgecount~0); {1094#false} is VALID [2022-04-27 10:16:54,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {1094#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1094#false} is VALID [2022-04-27 10:16:54,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {1094#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {1094#false} is VALID [2022-04-27 10:16:54,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {1094#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {1094#false} is VALID [2022-04-27 10:16:54,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {1094#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1094#false} is VALID [2022-04-27 10:16:54,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {1094#false} ~i~0 := 0; {1094#false} is VALID [2022-04-27 10:16:54,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {1247#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {1094#false} is VALID [2022-04-27 10:16:54,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {1251#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1247#(< main_~i~0 main_~nodecount~0)} is VALID [2022-04-27 10:16:54,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {1251#(< (+ main_~i~0 1) main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1251#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:16:54,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {1251#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {1251#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:16:54,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {1093#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1251#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:16:54,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {1093#true} call #t~ret22 := main(); {1093#true} is VALID [2022-04-27 10:16:54,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1093#true} {1093#true} #107#return; {1093#true} is VALID [2022-04-27 10:16:54,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {1093#true} assume true; {1093#true} is VALID [2022-04-27 10:16:54,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {1093#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; {1093#true} is VALID [2022-04-27 10:16:54,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {1093#true} call ULTIMATE.init(); {1093#true} is VALID [2022-04-27 10:16:54,085 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-27 10:16:54,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777035720] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:16:54,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:16:54,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-04-27 10:16:54,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276276092] [2022-04-27 10:16:54,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:16:54,086 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 10:16:54,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:54,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:54,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:54,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 10:16:54,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:54,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 10:16:54,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-27 10:16:54,118 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:54,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:54,369 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2022-04-27 10:16:54,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:16:54,369 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 10:16:54,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:54,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:54,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-04-27 10:16:54,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:54,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-04-27 10:16:54,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 77 transitions. [2022-04-27 10:16:54,427 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-27 10:16:54,428 INFO L225 Difference]: With dead ends: 67 [2022-04-27 10:16:54,428 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 10:16:54,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2022-04-27 10:16:54,429 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 57 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:16:54,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 46 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:16:54,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 10:16:54,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-27 10:16:54,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:54,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 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-27 10:16:54,442 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 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-27 10:16:54,443 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 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-27 10:16:54,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:54,444 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-04-27 10:16:54,444 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2022-04-27 10:16:54,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:54,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:54,444 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 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 43 states. [2022-04-27 10:16:54,444 INFO L87 Difference]: Start difference. First operand has 43 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 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 43 states. [2022-04-27 10:16:54,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:54,445 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-04-27 10:16:54,445 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2022-04-27 10:16:54,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:54,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:54,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:54,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:54,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 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-27 10:16:54,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2022-04-27 10:16:54,446 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 29 [2022-04-27 10:16:54,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:54,447 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2022-04-27 10:16:54,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:54,447 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2022-04-27 10:16:54,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 10:16:54,447 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:54,447 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2022-04-27 10:16:54,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 10:16:54,663 WARN L477 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-27 10:16:54,663 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:54,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:54,663 INFO L85 PathProgramCache]: Analyzing trace with hash 535991441, now seen corresponding path program 2 times [2022-04-27 10:16:54,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:54,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83189637] [2022-04-27 10:16:54,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:54,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:54,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:54,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {1534#(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; {1527#true} is VALID [2022-04-27 10:16:54,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {1527#true} assume true; {1527#true} is VALID [2022-04-27 10:16:54,723 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1527#true} {1527#true} #107#return; {1527#true} is VALID [2022-04-27 10:16:54,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {1527#true} call ULTIMATE.init(); {1534#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:54,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {1534#(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; {1527#true} is VALID [2022-04-27 10:16:54,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {1527#true} assume true; {1527#true} is VALID [2022-04-27 10:16:54,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1527#true} {1527#true} #107#return; {1527#true} is VALID [2022-04-27 10:16:54,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {1527#true} call #t~ret22 := main(); {1527#true} is VALID [2022-04-27 10:16:54,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {1527#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1532#(and (= main_~source~0 0) (= main_~i~0 0))} is VALID [2022-04-27 10:16:54,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {1532#(and (= main_~source~0 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {1532#(and (= main_~source~0 0) (= main_~i~0 0))} is VALID [2022-04-27 10:16:54,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {1532#(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); {1532#(and (= main_~source~0 0) (= main_~i~0 0))} is VALID [2022-04-27 10:16:54,727 INFO L290 TraceCheckUtils]: 8: Hoare triple {1532#(and (= main_~source~0 0) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1533#(and (= main_~source~0 0) (not (= main_~i~0 0)))} is VALID [2022-04-27 10:16:54,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {1533#(and (= main_~source~0 0) (not (= main_~i~0 0)))} assume !!(~i~0 < ~nodecount~0); {1533#(and (= main_~source~0 0) (not (= main_~i~0 0)))} is VALID [2022-04-27 10:16:54,727 INFO L290 TraceCheckUtils]: 10: Hoare triple {1533#(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); {1528#false} is VALID [2022-04-27 10:16:54,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {1528#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1528#false} is VALID [2022-04-27 10:16:54,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {1528#false} assume !!(~i~0 < ~nodecount~0); {1528#false} is VALID [2022-04-27 10:16:54,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {1528#false} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1528#false} is VALID [2022-04-27 10:16:54,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {1528#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1528#false} is VALID [2022-04-27 10:16:54,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {1528#false} assume !!(~i~0 < ~nodecount~0); {1528#false} is VALID [2022-04-27 10:16:54,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {1528#false} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1528#false} is VALID [2022-04-27 10:16:54,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {1528#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1528#false} is VALID [2022-04-27 10:16:54,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {1528#false} assume !(~i~0 < ~nodecount~0); {1528#false} is VALID [2022-04-27 10:16:54,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {1528#false} ~i~0 := 0; {1528#false} is VALID [2022-04-27 10:16:54,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {1528#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1528#false} is VALID [2022-04-27 10:16:54,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {1528#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {1528#false} is VALID [2022-04-27 10:16:54,728 INFO L290 TraceCheckUtils]: 22: Hoare triple {1528#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {1528#false} is VALID [2022-04-27 10:16:54,729 INFO L290 TraceCheckUtils]: 23: Hoare triple {1528#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1528#false} is VALID [2022-04-27 10:16:54,729 INFO L290 TraceCheckUtils]: 24: Hoare triple {1528#false} assume !(~j~0 < ~edgecount~0); {1528#false} is VALID [2022-04-27 10:16:54,729 INFO L290 TraceCheckUtils]: 25: Hoare triple {1528#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1528#false} is VALID [2022-04-27 10:16:54,729 INFO L290 TraceCheckUtils]: 26: Hoare triple {1528#false} assume !(~i~0 < ~nodecount~0); {1528#false} is VALID [2022-04-27 10:16:54,729 INFO L290 TraceCheckUtils]: 27: Hoare triple {1528#false} ~i~0 := 0; {1528#false} is VALID [2022-04-27 10:16:54,729 INFO L290 TraceCheckUtils]: 28: Hoare triple {1528#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); {1528#false} is VALID [2022-04-27 10:16:54,729 INFO L290 TraceCheckUtils]: 29: Hoare triple {1528#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {1528#false} is VALID [2022-04-27 10:16:54,729 INFO L290 TraceCheckUtils]: 30: Hoare triple {1528#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1528#false} is VALID [2022-04-27 10:16:54,729 INFO L290 TraceCheckUtils]: 31: Hoare triple {1528#false} assume !(~i~0 < ~edgecount~0); {1528#false} is VALID [2022-04-27 10:16:54,729 INFO L290 TraceCheckUtils]: 32: Hoare triple {1528#false} ~i~0 := 0; {1528#false} is VALID [2022-04-27 10:16:54,729 INFO L290 TraceCheckUtils]: 33: Hoare triple {1528#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1528#false} is VALID [2022-04-27 10:16:54,729 INFO L272 TraceCheckUtils]: 34: Hoare triple {1528#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {1528#false} is VALID [2022-04-27 10:16:54,729 INFO L290 TraceCheckUtils]: 35: Hoare triple {1528#false} ~cond := #in~cond; {1528#false} is VALID [2022-04-27 10:16:54,729 INFO L290 TraceCheckUtils]: 36: Hoare triple {1528#false} assume 0 == ~cond; {1528#false} is VALID [2022-04-27 10:16:54,730 INFO L290 TraceCheckUtils]: 37: Hoare triple {1528#false} assume !false; {1528#false} is VALID [2022-04-27 10:16:54,730 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 10:16:54,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:54,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83189637] [2022-04-27 10:16:54,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83189637] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:16:54,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063559531] [2022-04-27 10:16:54,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:16:54,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:16:54,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:16:54,736 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-27 10:16:54,737 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-27 10:16:54,819 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:16:54,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:16:54,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 10:16:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:54,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:16:54,978 INFO L272 TraceCheckUtils]: 0: Hoare triple {1527#true} call ULTIMATE.init(); {1527#true} is VALID [2022-04-27 10:16:54,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {1527#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; {1527#true} is VALID [2022-04-27 10:16:54,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {1527#true} assume true; {1527#true} is VALID [2022-04-27 10:16:54,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1527#true} {1527#true} #107#return; {1527#true} is VALID [2022-04-27 10:16:54,979 INFO L272 TraceCheckUtils]: 4: Hoare triple {1527#true} call #t~ret22 := main(); {1527#true} is VALID [2022-04-27 10:16:54,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {1527#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1553#(and (<= main_~source~0 0) (<= 0 main_~i~0))} is VALID [2022-04-27 10:16:54,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {1553#(and (<= main_~source~0 0) (<= 0 main_~i~0))} assume !!(~i~0 < ~nodecount~0); {1553#(and (<= main_~source~0 0) (<= 0 main_~i~0))} is VALID [2022-04-27 10:16:54,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {1553#(and (<= main_~source~0 0) (<= 0 main_~i~0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1553#(and (<= main_~source~0 0) (<= 0 main_~i~0))} is VALID [2022-04-27 10:16:54,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {1553#(and (<= main_~source~0 0) (<= 0 main_~i~0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1563#(and (<= main_~source~0 0) (<= 1 main_~i~0))} is VALID [2022-04-27 10:16:54,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {1563#(and (<= main_~source~0 0) (<= 1 main_~i~0))} assume !!(~i~0 < ~nodecount~0); {1563#(and (<= main_~source~0 0) (<= 1 main_~i~0))} is VALID [2022-04-27 10:16:54,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {1563#(and (<= main_~source~0 0) (<= 1 main_~i~0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1528#false} is VALID [2022-04-27 10:16:54,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {1528#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1528#false} is VALID [2022-04-27 10:16:54,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {1528#false} assume !!(~i~0 < ~nodecount~0); {1528#false} is VALID [2022-04-27 10:16:54,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {1528#false} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1528#false} is VALID [2022-04-27 10:16:54,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {1528#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1528#false} is VALID [2022-04-27 10:16:54,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {1528#false} assume !!(~i~0 < ~nodecount~0); {1528#false} is VALID [2022-04-27 10:16:54,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {1528#false} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1528#false} is VALID [2022-04-27 10:16:54,985 INFO L290 TraceCheckUtils]: 17: Hoare triple {1528#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1528#false} is VALID [2022-04-27 10:16:54,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {1528#false} assume !(~i~0 < ~nodecount~0); {1528#false} is VALID [2022-04-27 10:16:54,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {1528#false} ~i~0 := 0; {1528#false} is VALID [2022-04-27 10:16:54,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {1528#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1528#false} is VALID [2022-04-27 10:16:54,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {1528#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {1528#false} is VALID [2022-04-27 10:16:54,986 INFO L290 TraceCheckUtils]: 22: Hoare triple {1528#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {1528#false} is VALID [2022-04-27 10:16:54,986 INFO L290 TraceCheckUtils]: 23: Hoare triple {1528#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1528#false} is VALID [2022-04-27 10:16:54,986 INFO L290 TraceCheckUtils]: 24: Hoare triple {1528#false} assume !(~j~0 < ~edgecount~0); {1528#false} is VALID [2022-04-27 10:16:54,986 INFO L290 TraceCheckUtils]: 25: Hoare triple {1528#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1528#false} is VALID [2022-04-27 10:16:54,986 INFO L290 TraceCheckUtils]: 26: Hoare triple {1528#false} assume !(~i~0 < ~nodecount~0); {1528#false} is VALID [2022-04-27 10:16:54,986 INFO L290 TraceCheckUtils]: 27: Hoare triple {1528#false} ~i~0 := 0; {1528#false} is VALID [2022-04-27 10:16:54,986 INFO L290 TraceCheckUtils]: 28: Hoare triple {1528#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); {1528#false} is VALID [2022-04-27 10:16:54,986 INFO L290 TraceCheckUtils]: 29: Hoare triple {1528#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {1528#false} is VALID [2022-04-27 10:16:54,986 INFO L290 TraceCheckUtils]: 30: Hoare triple {1528#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1528#false} is VALID [2022-04-27 10:16:54,986 INFO L290 TraceCheckUtils]: 31: Hoare triple {1528#false} assume !(~i~0 < ~edgecount~0); {1528#false} is VALID [2022-04-27 10:16:54,986 INFO L290 TraceCheckUtils]: 32: Hoare triple {1528#false} ~i~0 := 0; {1528#false} is VALID [2022-04-27 10:16:54,986 INFO L290 TraceCheckUtils]: 33: Hoare triple {1528#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1528#false} is VALID [2022-04-27 10:16:54,986 INFO L272 TraceCheckUtils]: 34: Hoare triple {1528#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {1528#false} is VALID [2022-04-27 10:16:54,986 INFO L290 TraceCheckUtils]: 35: Hoare triple {1528#false} ~cond := #in~cond; {1528#false} is VALID [2022-04-27 10:16:54,987 INFO L290 TraceCheckUtils]: 36: Hoare triple {1528#false} assume 0 == ~cond; {1528#false} is VALID [2022-04-27 10:16:54,987 INFO L290 TraceCheckUtils]: 37: Hoare triple {1528#false} assume !false; {1528#false} is VALID [2022-04-27 10:16:54,987 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 10:16:54,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 10:16:54,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063559531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:16:54,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 10:16:54,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-04-27 10:16:54,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262989204] [2022-04-27 10:16:54,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:16:54,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 38 [2022-04-27 10:16:54,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:54,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-27 10:16:55,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:55,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:16:55,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:55,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:16:55,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:16:55,009 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-27 10:16:55,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:55,175 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2022-04-27 10:16:55,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:16:55,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 38 [2022-04-27 10:16:55,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:55,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-27 10:16:55,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-04-27 10:16:55,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-27 10:16:55,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-04-27 10:16:55,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 85 transitions. [2022-04-27 10:16:55,232 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-27 10:16:55,233 INFO L225 Difference]: With dead ends: 86 [2022-04-27 10:16:55,234 INFO L226 Difference]: Without dead ends: 54 [2022-04-27 10:16:55,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 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-27 10:16:55,234 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 28 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:16:55,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 51 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:16:55,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-27 10:16:55,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 43. [2022-04-27 10:16:55,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:55,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 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-27 10:16:55,264 INFO L74 IsIncluded]: Start isIncluded. First operand 54 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-27 10:16:55,264 INFO L87 Difference]: Start difference. First operand 54 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-27 10:16:55,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:55,265 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-27 10:16:55,266 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-27 10:16:55,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:55,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:55,266 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 54 states. [2022-04-27 10:16:55,266 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 54 states. [2022-04-27 10:16:55,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:55,267 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-27 10:16:55,267 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-27 10:16:55,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:55,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:55,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:55,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:55,268 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-27 10:16:55,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-04-27 10:16:55,268 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 38 [2022-04-27 10:16:55,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:55,269 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-04-27 10:16:55,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-27 10:16:55,269 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-04-27 10:16:55,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 10:16:55,269 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:55,269 INFO L195 NwaCegarLoop]: 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-27 10:16:55,289 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-27 10:16:55,486 WARN L477 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-27 10:16:55,486 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:55,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:55,487 INFO L85 PathProgramCache]: Analyzing trace with hash 385921679, now seen corresponding path program 1 times [2022-04-27 10:16:55,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:55,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106091657] [2022-04-27 10:16:55,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:55,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:55,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:55,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:55,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {1949#(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; {1939#true} is VALID [2022-04-27 10:16:55,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {1939#true} assume true; {1939#true} is VALID [2022-04-27 10:16:55,596 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1939#true} {1939#true} #107#return; {1939#true} is VALID [2022-04-27 10:16:55,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {1939#true} call ULTIMATE.init(); {1949#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:55,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {1949#(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; {1939#true} is VALID [2022-04-27 10:16:55,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {1939#true} assume true; {1939#true} is VALID [2022-04-27 10:16:55,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1939#true} {1939#true} #107#return; {1939#true} is VALID [2022-04-27 10:16:55,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {1939#true} call #t~ret22 := main(); {1939#true} is VALID [2022-04-27 10:16:55,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {1939#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1944#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:16:55,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {1944#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {1944#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:16:55,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {1944#(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); {1944#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:16:55,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {1944#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1945#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:16:55,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {1945#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~i~0 < ~nodecount~0); {1945#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:16:55,600 INFO L290 TraceCheckUtils]: 10: Hoare triple {1945#(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); {1945#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:16:55,600 INFO L290 TraceCheckUtils]: 11: Hoare triple {1945#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1946#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:16:55,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {1946#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~i~0 < ~nodecount~0); {1946#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:16:55,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {1946#(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); {1946#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:16:55,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {1946#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1947#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:16:55,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {1947#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~i~0 < ~nodecount~0); {1947#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:16:55,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {1947#(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); {1947#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:16:55,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {1947#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1948#(and (<= main_~i~0 4) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:16:55,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {1948#(and (<= main_~i~0 4) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~i~0 < ~nodecount~0); {1940#false} is VALID [2022-04-27 10:16:55,606 INFO L290 TraceCheckUtils]: 19: Hoare triple {1940#false} ~i~0 := 0; {1940#false} is VALID [2022-04-27 10:16:55,606 INFO L290 TraceCheckUtils]: 20: Hoare triple {1940#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1940#false} is VALID [2022-04-27 10:16:55,606 INFO L290 TraceCheckUtils]: 21: Hoare triple {1940#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {1940#false} is VALID [2022-04-27 10:16:55,606 INFO L290 TraceCheckUtils]: 22: Hoare triple {1940#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {1940#false} is VALID [2022-04-27 10:16:55,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {1940#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1940#false} is VALID [2022-04-27 10:16:55,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {1940#false} assume !(~j~0 < ~edgecount~0); {1940#false} is VALID [2022-04-27 10:16:55,606 INFO L290 TraceCheckUtils]: 25: Hoare triple {1940#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1940#false} is VALID [2022-04-27 10:16:55,606 INFO L290 TraceCheckUtils]: 26: Hoare triple {1940#false} assume !(~i~0 < ~nodecount~0); {1940#false} is VALID [2022-04-27 10:16:55,606 INFO L290 TraceCheckUtils]: 27: Hoare triple {1940#false} ~i~0 := 0; {1940#false} is VALID [2022-04-27 10:16:55,606 INFO L290 TraceCheckUtils]: 28: Hoare triple {1940#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); {1940#false} is VALID [2022-04-27 10:16:55,606 INFO L290 TraceCheckUtils]: 29: Hoare triple {1940#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {1940#false} is VALID [2022-04-27 10:16:55,606 INFO L290 TraceCheckUtils]: 30: Hoare triple {1940#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1940#false} is VALID [2022-04-27 10:16:55,606 INFO L290 TraceCheckUtils]: 31: Hoare triple {1940#false} assume !(~i~0 < ~edgecount~0); {1940#false} is VALID [2022-04-27 10:16:55,606 INFO L290 TraceCheckUtils]: 32: Hoare triple {1940#false} ~i~0 := 0; {1940#false} is VALID [2022-04-27 10:16:55,607 INFO L290 TraceCheckUtils]: 33: Hoare triple {1940#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1940#false} is VALID [2022-04-27 10:16:55,607 INFO L272 TraceCheckUtils]: 34: Hoare triple {1940#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {1940#false} is VALID [2022-04-27 10:16:55,607 INFO L290 TraceCheckUtils]: 35: Hoare triple {1940#false} ~cond := #in~cond; {1940#false} is VALID [2022-04-27 10:16:55,607 INFO L290 TraceCheckUtils]: 36: Hoare triple {1940#false} assume 0 == ~cond; {1940#false} is VALID [2022-04-27 10:16:55,607 INFO L290 TraceCheckUtils]: 37: Hoare triple {1940#false} assume !false; {1940#false} is VALID [2022-04-27 10:16:55,607 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-27 10:16:55,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:55,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106091657] [2022-04-27 10:16:55,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106091657] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:16:55,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065400694] [2022-04-27 10:16:55,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:55,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:16:55,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:16:55,608 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-27 10:16:55,609 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-27 10:16:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:55,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 10:16:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:55,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:16:55,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {1939#true} call ULTIMATE.init(); {1939#true} is VALID [2022-04-27 10:16:55,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {1939#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; {1939#true} is VALID [2022-04-27 10:16:55,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {1939#true} assume true; {1939#true} is VALID [2022-04-27 10:16:55,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1939#true} {1939#true} #107#return; {1939#true} is VALID [2022-04-27 10:16:55,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {1939#true} call #t~ret22 := main(); {1939#true} is VALID [2022-04-27 10:16:55,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {1939#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1968#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:16:55,934 INFO L290 TraceCheckUtils]: 6: Hoare triple {1968#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0); {1968#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:16:55,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {1968#(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); {1968#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:16:55,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {1968#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1978#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:16:55,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {1978#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0); {1978#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:16:55,935 INFO L290 TraceCheckUtils]: 10: Hoare triple {1978#(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); {1978#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:16:55,936 INFO L290 TraceCheckUtils]: 11: Hoare triple {1978#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1988#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:16:55,936 INFO L290 TraceCheckUtils]: 12: Hoare triple {1988#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0); {1988#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:16:55,936 INFO L290 TraceCheckUtils]: 13: Hoare triple {1988#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1988#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:16:55,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {1988#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1998#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:16:55,937 INFO L290 TraceCheckUtils]: 15: Hoare triple {1998#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} assume !!(~i~0 < ~nodecount~0); {1998#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:16:55,938 INFO L290 TraceCheckUtils]: 16: Hoare triple {1998#(and (<= 5 main_~nodecount~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); {1998#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:16:55,940 INFO L290 TraceCheckUtils]: 17: Hoare triple {1998#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2008#(and (<= main_~i~0 4) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:16:55,940 INFO L290 TraceCheckUtils]: 18: Hoare triple {2008#(and (<= main_~i~0 4) (<= 5 main_~nodecount~0))} assume !(~i~0 < ~nodecount~0); {1940#false} is VALID [2022-04-27 10:16:55,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {1940#false} ~i~0 := 0; {1940#false} is VALID [2022-04-27 10:16:55,941 INFO L290 TraceCheckUtils]: 20: Hoare triple {1940#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1940#false} is VALID [2022-04-27 10:16:55,941 INFO L290 TraceCheckUtils]: 21: Hoare triple {1940#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {1940#false} is VALID [2022-04-27 10:16:55,941 INFO L290 TraceCheckUtils]: 22: Hoare triple {1940#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {1940#false} is VALID [2022-04-27 10:16:55,941 INFO L290 TraceCheckUtils]: 23: Hoare triple {1940#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1940#false} is VALID [2022-04-27 10:16:55,941 INFO L290 TraceCheckUtils]: 24: Hoare triple {1940#false} assume !(~j~0 < ~edgecount~0); {1940#false} is VALID [2022-04-27 10:16:55,941 INFO L290 TraceCheckUtils]: 25: Hoare triple {1940#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1940#false} is VALID [2022-04-27 10:16:55,941 INFO L290 TraceCheckUtils]: 26: Hoare triple {1940#false} assume !(~i~0 < ~nodecount~0); {1940#false} is VALID [2022-04-27 10:16:55,941 INFO L290 TraceCheckUtils]: 27: Hoare triple {1940#false} ~i~0 := 0; {1940#false} is VALID [2022-04-27 10:16:55,941 INFO L290 TraceCheckUtils]: 28: Hoare triple {1940#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); {1940#false} is VALID [2022-04-27 10:16:55,941 INFO L290 TraceCheckUtils]: 29: Hoare triple {1940#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {1940#false} is VALID [2022-04-27 10:16:55,941 INFO L290 TraceCheckUtils]: 30: Hoare triple {1940#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1940#false} is VALID [2022-04-27 10:16:55,941 INFO L290 TraceCheckUtils]: 31: Hoare triple {1940#false} assume !(~i~0 < ~edgecount~0); {1940#false} is VALID [2022-04-27 10:16:55,941 INFO L290 TraceCheckUtils]: 32: Hoare triple {1940#false} ~i~0 := 0; {1940#false} is VALID [2022-04-27 10:16:55,941 INFO L290 TraceCheckUtils]: 33: Hoare triple {1940#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1940#false} is VALID [2022-04-27 10:16:55,941 INFO L272 TraceCheckUtils]: 34: Hoare triple {1940#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {1940#false} is VALID [2022-04-27 10:16:55,942 INFO L290 TraceCheckUtils]: 35: Hoare triple {1940#false} ~cond := #in~cond; {1940#false} is VALID [2022-04-27 10:16:55,942 INFO L290 TraceCheckUtils]: 36: Hoare triple {1940#false} assume 0 == ~cond; {1940#false} is VALID [2022-04-27 10:16:55,942 INFO L290 TraceCheckUtils]: 37: Hoare triple {1940#false} assume !false; {1940#false} is VALID [2022-04-27 10:16:55,942 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-27 10:16:55,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:16:56,127 INFO L290 TraceCheckUtils]: 37: Hoare triple {1940#false} assume !false; {1940#false} is VALID [2022-04-27 10:16:56,127 INFO L290 TraceCheckUtils]: 36: Hoare triple {1940#false} assume 0 == ~cond; {1940#false} is VALID [2022-04-27 10:16:56,127 INFO L290 TraceCheckUtils]: 35: Hoare triple {1940#false} ~cond := #in~cond; {1940#false} is VALID [2022-04-27 10:16:56,127 INFO L272 TraceCheckUtils]: 34: Hoare triple {1940#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {1940#false} is VALID [2022-04-27 10:16:56,127 INFO L290 TraceCheckUtils]: 33: Hoare triple {1940#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1940#false} is VALID [2022-04-27 10:16:56,127 INFO L290 TraceCheckUtils]: 32: Hoare triple {1940#false} ~i~0 := 0; {1940#false} is VALID [2022-04-27 10:16:56,127 INFO L290 TraceCheckUtils]: 31: Hoare triple {1940#false} assume !(~i~0 < ~edgecount~0); {1940#false} is VALID [2022-04-27 10:16:56,127 INFO L290 TraceCheckUtils]: 30: Hoare triple {1940#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1940#false} is VALID [2022-04-27 10:16:56,127 INFO L290 TraceCheckUtils]: 29: Hoare triple {1940#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {1940#false} is VALID [2022-04-27 10:16:56,128 INFO L290 TraceCheckUtils]: 28: Hoare triple {1940#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); {1940#false} is VALID [2022-04-27 10:16:56,128 INFO L290 TraceCheckUtils]: 27: Hoare triple {1940#false} ~i~0 := 0; {1940#false} is VALID [2022-04-27 10:16:56,128 INFO L290 TraceCheckUtils]: 26: Hoare triple {1940#false} assume !(~i~0 < ~nodecount~0); {1940#false} is VALID [2022-04-27 10:16:56,128 INFO L290 TraceCheckUtils]: 25: Hoare triple {1940#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1940#false} is VALID [2022-04-27 10:16:56,128 INFO L290 TraceCheckUtils]: 24: Hoare triple {1940#false} assume !(~j~0 < ~edgecount~0); {1940#false} is VALID [2022-04-27 10:16:56,128 INFO L290 TraceCheckUtils]: 23: Hoare triple {1940#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1940#false} is VALID [2022-04-27 10:16:56,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {1940#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {1940#false} is VALID [2022-04-27 10:16:56,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {1940#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {1940#false} is VALID [2022-04-27 10:16:56,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {1940#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1940#false} is VALID [2022-04-27 10:16:56,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {1940#false} ~i~0 := 0; {1940#false} is VALID [2022-04-27 10:16:56,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {2126#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {1940#false} is VALID [2022-04-27 10:16:56,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {2130#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2126#(< main_~i~0 main_~nodecount~0)} is VALID [2022-04-27 10:16:56,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {2130#(< (+ 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); {2130#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:16:56,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {2130#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2130#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:16:56,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {2140#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2130#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:16:56,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {2140#(< (+ main_~i~0 2) main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2140#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:16:56,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {2140#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2140#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:16:56,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {2150#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2140#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:16:56,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {2150#(< (+ main_~i~0 3) main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2150#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:16:56,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {2150#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2150#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:16:56,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {2160#(< (+ main_~i~0 4) main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2150#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:16:56,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {2160#(< (+ main_~i~0 4) main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2160#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:16:56,136 INFO L290 TraceCheckUtils]: 6: Hoare triple {2160#(< (+ main_~i~0 4) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2160#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:16:56,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {1939#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2160#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:16:56,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {1939#true} call #t~ret22 := main(); {1939#true} is VALID [2022-04-27 10:16:56,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1939#true} {1939#true} #107#return; {1939#true} is VALID [2022-04-27 10:16:56,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {1939#true} assume true; {1939#true} is VALID [2022-04-27 10:16:56,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {1939#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; {1939#true} is VALID [2022-04-27 10:16:56,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {1939#true} call ULTIMATE.init(); {1939#true} is VALID [2022-04-27 10:16:56,138 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-27 10:16:56,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065400694] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:16:56,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:16:56,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2022-04-27 10:16:56,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532743519] [2022-04-27 10:16:56,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:16:56,139 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 17 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-27 10:16:56,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:56,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 3.5) internal successors, (63), 17 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:56,190 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-27 10:16:56,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 10:16:56,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:56,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 10:16:56,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2022-04-27 10:16:56,191 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 18 states, 18 states have (on average 3.5) internal successors, (63), 17 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:56,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:56,599 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-04-27 10:16:56,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:16:56,599 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 17 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-27 10:16:56,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:56,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.5) internal successors, (63), 17 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:56,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 77 transitions. [2022-04-27 10:16:56,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.5) internal successors, (63), 17 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:56,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 77 transitions. [2022-04-27 10:16:56,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 77 transitions. [2022-04-27 10:16:56,662 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-27 10:16:56,662 INFO L225 Difference]: With dead ends: 72 [2022-04-27 10:16:56,663 INFO L226 Difference]: Without dead ends: 48 [2022-04-27 10:16:56,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=365, Unknown=0, NotChecked=0, Total=552 [2022-04-27 10:16:56,664 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 69 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:16:56,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 61 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:16:56,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-27 10:16:56,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2022-04-27 10:16:56,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:56,690 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-27 10:16:56,691 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-27 10:16:56,691 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-27 10:16:56,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:56,692 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-27 10:16:56,692 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-04-27 10:16:56,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:56,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:56,692 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-27 10:16:56,692 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-27 10:16:56,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:56,693 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-27 10:16:56,693 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-04-27 10:16:56,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:56,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:56,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:56,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:56,694 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-27 10:16:56,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2022-04-27 10:16:56,694 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 38 [2022-04-27 10:16:56,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:56,695 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2022-04-27 10:16:56,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 17 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:56,695 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2022-04-27 10:16:56,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 10:16:56,695 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:56,695 INFO L195 NwaCegarLoop]: 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-27 10:16:56,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-27 10:16:56,914 WARN L477 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-27 10:16:56,916 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:56,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:56,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1361731471, now seen corresponding path program 2 times [2022-04-27 10:16:56,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:56,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109446401] [2022-04-27 10:16:56,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:56,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:56,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:56,977 INFO L290 TraceCheckUtils]: 0: Hoare triple {2468#(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; {2460#true} is VALID [2022-04-27 10:16:56,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {2460#true} assume true; {2460#true} is VALID [2022-04-27 10:16:56,978 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2460#true} {2460#true} #107#return; {2460#true} is VALID [2022-04-27 10:16:56,978 INFO L272 TraceCheckUtils]: 0: Hoare triple {2460#true} call ULTIMATE.init(); {2468#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:56,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {2468#(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; {2460#true} is VALID [2022-04-27 10:16:56,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {2460#true} assume true; {2460#true} is VALID [2022-04-27 10:16:56,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2460#true} {2460#true} #107#return; {2460#true} is VALID [2022-04-27 10:16:56,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {2460#true} call #t~ret22 := main(); {2460#true} is VALID [2022-04-27 10:16:56,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {2460#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,980 INFO L290 TraceCheckUtils]: 6: Hoare triple {2465#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {2465#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {2465#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {2465#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {2465#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {2465#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {2465#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {2465#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {2465#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {2465#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {2465#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,983 INFO L290 TraceCheckUtils]: 17: Hoare triple {2465#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,983 INFO L290 TraceCheckUtils]: 18: Hoare triple {2465#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {2465#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {2465#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,984 INFO L290 TraceCheckUtils]: 21: Hoare triple {2465#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,984 INFO L290 TraceCheckUtils]: 22: Hoare triple {2465#(<= 20 main_~edgecount~0)} ~i~0 := 0; {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,984 INFO L290 TraceCheckUtils]: 23: Hoare triple {2465#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2466#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:16:56,985 INFO L290 TraceCheckUtils]: 24: Hoare triple {2466#(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); {2466#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:16:56,985 INFO L290 TraceCheckUtils]: 25: Hoare triple {2466#(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; {2466#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:16:56,986 INFO L290 TraceCheckUtils]: 26: Hoare triple {2466#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {2467#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-27 10:16:56,986 INFO L290 TraceCheckUtils]: 27: Hoare triple {2467#(<= (+ 19 main_~j~0) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {2461#false} is VALID [2022-04-27 10:16:56,986 INFO L290 TraceCheckUtils]: 28: Hoare triple {2461#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2461#false} is VALID [2022-04-27 10:16:56,986 INFO L290 TraceCheckUtils]: 29: Hoare triple {2461#false} assume !(~i~0 < ~nodecount~0); {2461#false} is VALID [2022-04-27 10:16:56,986 INFO L290 TraceCheckUtils]: 30: Hoare triple {2461#false} ~i~0 := 0; {2461#false} is VALID [2022-04-27 10:16:56,986 INFO L290 TraceCheckUtils]: 31: Hoare triple {2461#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); {2461#false} is VALID [2022-04-27 10:16:56,986 INFO L290 TraceCheckUtils]: 32: Hoare triple {2461#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {2461#false} is VALID [2022-04-27 10:16:56,986 INFO L290 TraceCheckUtils]: 33: Hoare triple {2461#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2461#false} is VALID [2022-04-27 10:16:56,986 INFO L290 TraceCheckUtils]: 34: Hoare triple {2461#false} assume !(~i~0 < ~edgecount~0); {2461#false} is VALID [2022-04-27 10:16:56,987 INFO L290 TraceCheckUtils]: 35: Hoare triple {2461#false} ~i~0 := 0; {2461#false} is VALID [2022-04-27 10:16:56,987 INFO L290 TraceCheckUtils]: 36: Hoare triple {2461#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2461#false} is VALID [2022-04-27 10:16:56,987 INFO L272 TraceCheckUtils]: 37: Hoare triple {2461#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {2461#false} is VALID [2022-04-27 10:16:56,987 INFO L290 TraceCheckUtils]: 38: Hoare triple {2461#false} ~cond := #in~cond; {2461#false} is VALID [2022-04-27 10:16:56,987 INFO L290 TraceCheckUtils]: 39: Hoare triple {2461#false} assume 0 == ~cond; {2461#false} is VALID [2022-04-27 10:16:56,987 INFO L290 TraceCheckUtils]: 40: Hoare triple {2461#false} assume !false; {2461#false} is VALID [2022-04-27 10:16:56,987 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-27 10:16:56,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:56,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109446401] [2022-04-27 10:16:56,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109446401] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:16:56,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082782769] [2022-04-27 10:16:56,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:16:56,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:16:56,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:16:56,989 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-27 10:16:56,991 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-27 10:16:57,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:16:57,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:16:57,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 10:16:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:57,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:16:57,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {2460#true} call ULTIMATE.init(); {2460#true} is VALID [2022-04-27 10:16:57,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {2460#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; {2460#true} is VALID [2022-04-27 10:16:57,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {2460#true} assume true; {2460#true} is VALID [2022-04-27 10:16:57,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2460#true} {2460#true} #107#return; {2460#true} is VALID [2022-04-27 10:16:57,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {2460#true} call #t~ret22 := main(); {2460#true} is VALID [2022-04-27 10:16:57,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {2460#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {2465#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {2465#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {2465#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {2465#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,265 INFO L290 TraceCheckUtils]: 10: Hoare triple {2465#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {2465#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {2465#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {2465#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {2465#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {2465#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {2465#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,267 INFO L290 TraceCheckUtils]: 17: Hoare triple {2465#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {2465#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {2465#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {2465#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {2465#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,268 INFO L290 TraceCheckUtils]: 22: Hoare triple {2465#(<= 20 main_~edgecount~0)} ~i~0 := 0; {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,269 INFO L290 TraceCheckUtils]: 23: Hoare triple {2465#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {2465#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,269 INFO L290 TraceCheckUtils]: 25: Hoare triple {2465#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,269 INFO L290 TraceCheckUtils]: 26: Hoare triple {2465#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,270 INFO L290 TraceCheckUtils]: 27: Hoare triple {2465#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,270 INFO L290 TraceCheckUtils]: 28: Hoare triple {2465#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,270 INFO L290 TraceCheckUtils]: 29: Hoare triple {2465#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {2465#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,270 INFO L290 TraceCheckUtils]: 30: Hoare triple {2465#(<= 20 main_~edgecount~0)} ~i~0 := 0; {2562#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:16:57,271 INFO L290 TraceCheckUtils]: 31: Hoare triple {2562#(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); {2562#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:16:57,271 INFO L290 TraceCheckUtils]: 32: Hoare triple {2562#(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; {2562#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:16:57,272 INFO L290 TraceCheckUtils]: 33: Hoare triple {2562#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2572#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:16:57,272 INFO L290 TraceCheckUtils]: 34: Hoare triple {2572#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {2461#false} is VALID [2022-04-27 10:16:57,272 INFO L290 TraceCheckUtils]: 35: Hoare triple {2461#false} ~i~0 := 0; {2461#false} is VALID [2022-04-27 10:16:57,272 INFO L290 TraceCheckUtils]: 36: Hoare triple {2461#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2461#false} is VALID [2022-04-27 10:16:57,272 INFO L272 TraceCheckUtils]: 37: Hoare triple {2461#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {2461#false} is VALID [2022-04-27 10:16:57,272 INFO L290 TraceCheckUtils]: 38: Hoare triple {2461#false} ~cond := #in~cond; {2461#false} is VALID [2022-04-27 10:16:57,272 INFO L290 TraceCheckUtils]: 39: Hoare triple {2461#false} assume 0 == ~cond; {2461#false} is VALID [2022-04-27 10:16:57,272 INFO L290 TraceCheckUtils]: 40: Hoare triple {2461#false} assume !false; {2461#false} is VALID [2022-04-27 10:16:57,273 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-27 10:16:57,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:16:57,424 INFO L290 TraceCheckUtils]: 40: Hoare triple {2461#false} assume !false; {2461#false} is VALID [2022-04-27 10:16:57,424 INFO L290 TraceCheckUtils]: 39: Hoare triple {2461#false} assume 0 == ~cond; {2461#false} is VALID [2022-04-27 10:16:57,424 INFO L290 TraceCheckUtils]: 38: Hoare triple {2461#false} ~cond := #in~cond; {2461#false} is VALID [2022-04-27 10:16:57,424 INFO L272 TraceCheckUtils]: 37: Hoare triple {2461#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {2461#false} is VALID [2022-04-27 10:16:57,424 INFO L290 TraceCheckUtils]: 36: Hoare triple {2461#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2461#false} is VALID [2022-04-27 10:16:57,424 INFO L290 TraceCheckUtils]: 35: Hoare triple {2461#false} ~i~0 := 0; {2461#false} is VALID [2022-04-27 10:16:57,425 INFO L290 TraceCheckUtils]: 34: Hoare triple {2612#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {2461#false} is VALID [2022-04-27 10:16:57,425 INFO L290 TraceCheckUtils]: 33: Hoare triple {2616#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2612#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,425 INFO L290 TraceCheckUtils]: 32: Hoare triple {2616#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {2616#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-27 10:16:57,426 INFO L290 TraceCheckUtils]: 31: Hoare triple {2616#(< (+ 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); {2616#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-27 10:16:57,426 INFO L290 TraceCheckUtils]: 30: Hoare triple {2626#(< 1 main_~edgecount~0)} ~i~0 := 0; {2616#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-27 10:16:57,426 INFO L290 TraceCheckUtils]: 29: Hoare triple {2626#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {2626#(< 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,426 INFO L290 TraceCheckUtils]: 28: Hoare triple {2626#(< 1 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2626#(< 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,427 INFO L290 TraceCheckUtils]: 27: Hoare triple {2626#(< 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {2626#(< 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,427 INFO L290 TraceCheckUtils]: 26: Hoare triple {2626#(< 1 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {2626#(< 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,427 INFO L290 TraceCheckUtils]: 25: Hoare triple {2626#(< 1 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {2626#(< 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {2626#(< 1 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {2626#(< 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {2626#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2626#(< 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {2626#(< 1 main_~edgecount~0)} ~i~0 := 0; {2626#(< 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {2626#(< 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {2626#(< 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {2626#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2626#(< 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,434 INFO L290 TraceCheckUtils]: 19: Hoare triple {2626#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2626#(< 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {2626#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {2626#(< 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {2626#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2626#(< 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,435 INFO L290 TraceCheckUtils]: 16: Hoare triple {2626#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2626#(< 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {2626#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {2626#(< 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {2626#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2626#(< 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {2626#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2626#(< 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {2626#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {2626#(< 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {2626#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2626#(< 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {2626#(< 1 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2626#(< 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {2626#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {2626#(< 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {2626#(< 1 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2626#(< 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {2626#(< 1 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2626#(< 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,438 INFO L290 TraceCheckUtils]: 6: Hoare triple {2626#(< 1 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {2626#(< 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {2460#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2626#(< 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:57,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {2460#true} call #t~ret22 := main(); {2460#true} is VALID [2022-04-27 10:16:57,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2460#true} {2460#true} #107#return; {2460#true} is VALID [2022-04-27 10:16:57,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {2460#true} assume true; {2460#true} is VALID [2022-04-27 10:16:57,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {2460#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; {2460#true} is VALID [2022-04-27 10:16:57,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {2460#true} call ULTIMATE.init(); {2460#true} is VALID [2022-04-27 10:16:57,440 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-27 10:16:57,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082782769] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:16:57,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:16:57,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-04-27 10:16:57,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976219353] [2022-04-27 10:16:57,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:16:57,441 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-27 10:16:57,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:57,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:57,491 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-27 10:16:57,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 10:16:57,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:57,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 10:16:57,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-04-27 10:16:57,492 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:58,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:58,271 INFO L93 Difference]: Finished difference Result 144 states and 187 transitions. [2022-04-27 10:16:58,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-27 10:16:58,271 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-27 10:16:58,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:58,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:58,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 184 transitions. [2022-04-27 10:16:58,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:58,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 184 transitions. [2022-04-27 10:16:58,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 184 transitions. [2022-04-27 10:16:58,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:58,432 INFO L225 Difference]: With dead ends: 144 [2022-04-27 10:16:58,432 INFO L226 Difference]: Without dead ends: 122 [2022-04-27 10:16:58,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=228, Invalid=422, Unknown=0, NotChecked=0, Total=650 [2022-04-27 10:16:58,434 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 287 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:16:58,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 46 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:16:58,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-27 10:16:58,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 58. [2022-04-27 10:16:58,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:58,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 58 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 52 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:16:58,493 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 58 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 52 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:16:58,493 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 58 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 52 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:16:58,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:58,496 INFO L93 Difference]: Finished difference Result 122 states and 153 transitions. [2022-04-27 10:16:58,496 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2022-04-27 10:16:58,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:58,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:58,496 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 52 states have internal predecessors, (60), 3 states have call successors, (3), 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 122 states. [2022-04-27 10:16:58,497 INFO L87 Difference]: Start difference. First operand has 58 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 52 states have internal predecessors, (60), 3 states have call successors, (3), 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 122 states. [2022-04-27 10:16:58,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:58,498 INFO L93 Difference]: Finished difference Result 122 states and 153 transitions. [2022-04-27 10:16:58,498 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2022-04-27 10:16:58,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:58,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:58,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:58,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:58,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 52 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:16:58,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2022-04-27 10:16:58,500 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 41 [2022-04-27 10:16:58,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:58,500 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2022-04-27 10:16:58,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:58,500 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-04-27 10:16:58,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-27 10:16:58,500 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:58,501 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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-27 10:16:58,521 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-27 10:16:58,715 WARN L477 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-27 10:16:58,715 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:58,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:58,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1886267226, now seen corresponding path program 3 times [2022-04-27 10:16:58,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:58,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326341271] [2022-04-27 10:16:58,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:58,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:58,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:58,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {3281#(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; {3272#true} is VALID [2022-04-27 10:16:58,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {3272#true} assume true; {3272#true} is VALID [2022-04-27 10:16:58,790 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3272#true} {3272#true} #107#return; {3272#true} is VALID [2022-04-27 10:16:58,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {3272#true} call ULTIMATE.init(); {3281#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:58,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {3281#(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; {3272#true} is VALID [2022-04-27 10:16:58,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {3272#true} assume true; {3272#true} is VALID [2022-04-27 10:16:58,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3272#true} {3272#true} #107#return; {3272#true} is VALID [2022-04-27 10:16:58,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {3272#true} call #t~ret22 := main(); {3272#true} is VALID [2022-04-27 10:16:58,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {3272#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {3277#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:58,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {3277#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3277#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:58,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {3277#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3277#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:58,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {3277#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3277#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:58,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {3277#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3277#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:58,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {3277#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3277#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:58,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {3277#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3277#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:58,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {3277#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3277#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:58,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {3277#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3277#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:58,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {3277#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3277#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:58,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {3277#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3277#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:58,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {3277#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3277#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:58,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {3277#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3277#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:58,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {3277#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3277#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:58,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {3277#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3277#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:58,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {3277#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3277#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:58,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {3277#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {3277#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:58,797 INFO L290 TraceCheckUtils]: 22: Hoare triple {3277#(<= 20 main_~edgecount~0)} ~i~0 := 0; {3277#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:16:58,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {3277#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3278#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:16:58,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {3278#(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); {3278#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:16:58,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {3278#(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; {3278#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:16:58,798 INFO L290 TraceCheckUtils]: 26: Hoare triple {3278#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {3279#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-27 10:16:58,798 INFO L290 TraceCheckUtils]: 27: Hoare triple {3279#(<= (+ 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); {3279#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-27 10:16:58,798 INFO L290 TraceCheckUtils]: 28: Hoare triple {3279#(<= (+ 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; {3279#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-27 10:16:58,799 INFO L290 TraceCheckUtils]: 29: Hoare triple {3279#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {3280#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-27 10:16:58,799 INFO L290 TraceCheckUtils]: 30: Hoare triple {3280#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {3273#false} is VALID [2022-04-27 10:16:58,799 INFO L290 TraceCheckUtils]: 31: Hoare triple {3273#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3273#false} is VALID [2022-04-27 10:16:58,799 INFO L290 TraceCheckUtils]: 32: Hoare triple {3273#false} assume !(~i~0 < ~nodecount~0); {3273#false} is VALID [2022-04-27 10:16:58,799 INFO L290 TraceCheckUtils]: 33: Hoare triple {3273#false} ~i~0 := 0; {3273#false} is VALID [2022-04-27 10:16:58,799 INFO L290 TraceCheckUtils]: 34: Hoare triple {3273#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); {3273#false} is VALID [2022-04-27 10:16:58,799 INFO L290 TraceCheckUtils]: 35: Hoare triple {3273#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {3273#false} is VALID [2022-04-27 10:16:58,799 INFO L290 TraceCheckUtils]: 36: Hoare triple {3273#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3273#false} is VALID [2022-04-27 10:16:58,800 INFO L290 TraceCheckUtils]: 37: Hoare triple {3273#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); {3273#false} is VALID [2022-04-27 10:16:58,800 INFO L290 TraceCheckUtils]: 38: Hoare triple {3273#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {3273#false} is VALID [2022-04-27 10:16:58,800 INFO L290 TraceCheckUtils]: 39: Hoare triple {3273#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3273#false} is VALID [2022-04-27 10:16:58,800 INFO L290 TraceCheckUtils]: 40: Hoare triple {3273#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); {3273#false} is VALID [2022-04-27 10:16:58,800 INFO L290 TraceCheckUtils]: 41: Hoare triple {3273#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {3273#false} is VALID [2022-04-27 10:16:58,800 INFO L290 TraceCheckUtils]: 42: Hoare triple {3273#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3273#false} is VALID [2022-04-27 10:16:58,800 INFO L290 TraceCheckUtils]: 43: Hoare triple {3273#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); {3273#false} is VALID [2022-04-27 10:16:58,800 INFO L290 TraceCheckUtils]: 44: Hoare triple {3273#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {3273#false} is VALID [2022-04-27 10:16:58,800 INFO L290 TraceCheckUtils]: 45: Hoare triple {3273#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3273#false} is VALID [2022-04-27 10:16:58,800 INFO L290 TraceCheckUtils]: 46: Hoare triple {3273#false} assume !(~i~0 < ~edgecount~0); {3273#false} is VALID [2022-04-27 10:16:58,800 INFO L290 TraceCheckUtils]: 47: Hoare triple {3273#false} ~i~0 := 0; {3273#false} is VALID [2022-04-27 10:16:58,801 INFO L290 TraceCheckUtils]: 48: Hoare triple {3273#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3273#false} is VALID [2022-04-27 10:16:58,801 INFO L272 TraceCheckUtils]: 49: Hoare triple {3273#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {3273#false} is VALID [2022-04-27 10:16:58,801 INFO L290 TraceCheckUtils]: 50: Hoare triple {3273#false} ~cond := #in~cond; {3273#false} is VALID [2022-04-27 10:16:58,801 INFO L290 TraceCheckUtils]: 51: Hoare triple {3273#false} assume 0 == ~cond; {3273#false} is VALID [2022-04-27 10:16:58,801 INFO L290 TraceCheckUtils]: 52: Hoare triple {3273#false} assume !false; {3273#false} is VALID [2022-04-27 10:16:58,801 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-04-27 10:16:58,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:58,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326341271] [2022-04-27 10:16:58,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326341271] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:16:58,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944106898] [2022-04-27 10:16:58,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 10:16:58,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:16:58,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:16:58,802 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-27 10:16:58,803 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-27 10:16:58,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-27 10:16:58,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:16:58,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 10:16:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:58,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:16:59,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {3272#true} call ULTIMATE.init(); {3272#true} is VALID [2022-04-27 10:16:59,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {3272#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; {3272#true} is VALID [2022-04-27 10:16:59,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {3272#true} assume true; {3272#true} is VALID [2022-04-27 10:16:59,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3272#true} {3272#true} #107#return; {3272#true} is VALID [2022-04-27 10:16:59,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {3272#true} call #t~ret22 := main(); {3272#true} is VALID [2022-04-27 10:16:59,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {3272#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {3300#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {3300#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3300#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {3300#(<= 5 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3300#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {3300#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3300#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {3300#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3300#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {3300#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3300#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,079 INFO L290 TraceCheckUtils]: 11: Hoare triple {3300#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3300#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {3300#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3300#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {3300#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3300#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {3300#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3300#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {3300#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3300#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {3300#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3300#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {3300#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3300#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,080 INFO L290 TraceCheckUtils]: 18: Hoare triple {3300#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3300#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,080 INFO L290 TraceCheckUtils]: 19: Hoare triple {3300#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3300#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {3300#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3300#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {3300#(<= 5 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {3300#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,081 INFO L290 TraceCheckUtils]: 22: Hoare triple {3300#(<= 5 main_~nodecount~0)} ~i~0 := 0; {3352#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:16:59,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {3352#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3352#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:16:59,082 INFO L290 TraceCheckUtils]: 24: Hoare triple {3352#(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); {3352#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:16:59,083 INFO L290 TraceCheckUtils]: 25: Hoare triple {3352#(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; {3352#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:16:59,083 INFO L290 TraceCheckUtils]: 26: Hoare triple {3352#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {3352#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:16:59,083 INFO L290 TraceCheckUtils]: 27: Hoare triple {3352#(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); {3352#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:16:59,084 INFO L290 TraceCheckUtils]: 28: Hoare triple {3352#(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; {3352#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:16:59,084 INFO L290 TraceCheckUtils]: 29: Hoare triple {3352#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {3352#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:16:59,084 INFO L290 TraceCheckUtils]: 30: Hoare triple {3352#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {3352#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:16:59,085 INFO L290 TraceCheckUtils]: 31: Hoare triple {3352#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3380#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:16:59,085 INFO L290 TraceCheckUtils]: 32: Hoare triple {3380#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !(~i~0 < ~nodecount~0); {3273#false} is VALID [2022-04-27 10:16:59,085 INFO L290 TraceCheckUtils]: 33: Hoare triple {3273#false} ~i~0 := 0; {3273#false} is VALID [2022-04-27 10:16:59,085 INFO L290 TraceCheckUtils]: 34: Hoare triple {3273#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); {3273#false} is VALID [2022-04-27 10:16:59,085 INFO L290 TraceCheckUtils]: 35: Hoare triple {3273#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {3273#false} is VALID [2022-04-27 10:16:59,085 INFO L290 TraceCheckUtils]: 36: Hoare triple {3273#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3273#false} is VALID [2022-04-27 10:16:59,085 INFO L290 TraceCheckUtils]: 37: Hoare triple {3273#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); {3273#false} is VALID [2022-04-27 10:16:59,085 INFO L290 TraceCheckUtils]: 38: Hoare triple {3273#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {3273#false} is VALID [2022-04-27 10:16:59,085 INFO L290 TraceCheckUtils]: 39: Hoare triple {3273#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3273#false} is VALID [2022-04-27 10:16:59,085 INFO L290 TraceCheckUtils]: 40: Hoare triple {3273#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); {3273#false} is VALID [2022-04-27 10:16:59,085 INFO L290 TraceCheckUtils]: 41: Hoare triple {3273#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {3273#false} is VALID [2022-04-27 10:16:59,086 INFO L290 TraceCheckUtils]: 42: Hoare triple {3273#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3273#false} is VALID [2022-04-27 10:16:59,086 INFO L290 TraceCheckUtils]: 43: Hoare triple {3273#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); {3273#false} is VALID [2022-04-27 10:16:59,086 INFO L290 TraceCheckUtils]: 44: Hoare triple {3273#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {3273#false} is VALID [2022-04-27 10:16:59,086 INFO L290 TraceCheckUtils]: 45: Hoare triple {3273#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3273#false} is VALID [2022-04-27 10:16:59,086 INFO L290 TraceCheckUtils]: 46: Hoare triple {3273#false} assume !(~i~0 < ~edgecount~0); {3273#false} is VALID [2022-04-27 10:16:59,086 INFO L290 TraceCheckUtils]: 47: Hoare triple {3273#false} ~i~0 := 0; {3273#false} is VALID [2022-04-27 10:16:59,086 INFO L290 TraceCheckUtils]: 48: Hoare triple {3273#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3273#false} is VALID [2022-04-27 10:16:59,086 INFO L272 TraceCheckUtils]: 49: Hoare triple {3273#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {3273#false} is VALID [2022-04-27 10:16:59,086 INFO L290 TraceCheckUtils]: 50: Hoare triple {3273#false} ~cond := #in~cond; {3273#false} is VALID [2022-04-27 10:16:59,086 INFO L290 TraceCheckUtils]: 51: Hoare triple {3273#false} assume 0 == ~cond; {3273#false} is VALID [2022-04-27 10:16:59,086 INFO L290 TraceCheckUtils]: 52: Hoare triple {3273#false} assume !false; {3273#false} is VALID [2022-04-27 10:16:59,086 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-04-27 10:16:59,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:16:59,255 INFO L290 TraceCheckUtils]: 52: Hoare triple {3273#false} assume !false; {3273#false} is VALID [2022-04-27 10:16:59,255 INFO L290 TraceCheckUtils]: 51: Hoare triple {3273#false} assume 0 == ~cond; {3273#false} is VALID [2022-04-27 10:16:59,255 INFO L290 TraceCheckUtils]: 50: Hoare triple {3273#false} ~cond := #in~cond; {3273#false} is VALID [2022-04-27 10:16:59,255 INFO L272 TraceCheckUtils]: 49: Hoare triple {3273#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {3273#false} is VALID [2022-04-27 10:16:59,255 INFO L290 TraceCheckUtils]: 48: Hoare triple {3273#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3273#false} is VALID [2022-04-27 10:16:59,255 INFO L290 TraceCheckUtils]: 47: Hoare triple {3273#false} ~i~0 := 0; {3273#false} is VALID [2022-04-27 10:16:59,255 INFO L290 TraceCheckUtils]: 46: Hoare triple {3273#false} assume !(~i~0 < ~edgecount~0); {3273#false} is VALID [2022-04-27 10:16:59,256 INFO L290 TraceCheckUtils]: 45: Hoare triple {3273#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3273#false} is VALID [2022-04-27 10:16:59,256 INFO L290 TraceCheckUtils]: 44: Hoare triple {3273#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {3273#false} is VALID [2022-04-27 10:16:59,256 INFO L290 TraceCheckUtils]: 43: Hoare triple {3273#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); {3273#false} is VALID [2022-04-27 10:16:59,256 INFO L290 TraceCheckUtils]: 42: Hoare triple {3273#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3273#false} is VALID [2022-04-27 10:16:59,256 INFO L290 TraceCheckUtils]: 41: Hoare triple {3273#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {3273#false} is VALID [2022-04-27 10:16:59,256 INFO L290 TraceCheckUtils]: 40: Hoare triple {3273#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); {3273#false} is VALID [2022-04-27 10:16:59,256 INFO L290 TraceCheckUtils]: 39: Hoare triple {3273#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3273#false} is VALID [2022-04-27 10:16:59,256 INFO L290 TraceCheckUtils]: 38: Hoare triple {3273#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {3273#false} is VALID [2022-04-27 10:16:59,256 INFO L290 TraceCheckUtils]: 37: Hoare triple {3273#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); {3273#false} is VALID [2022-04-27 10:16:59,256 INFO L290 TraceCheckUtils]: 36: Hoare triple {3273#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3273#false} is VALID [2022-04-27 10:16:59,256 INFO L290 TraceCheckUtils]: 35: Hoare triple {3273#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {3273#false} is VALID [2022-04-27 10:16:59,256 INFO L290 TraceCheckUtils]: 34: Hoare triple {3273#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); {3273#false} is VALID [2022-04-27 10:16:59,256 INFO L290 TraceCheckUtils]: 33: Hoare triple {3273#false} ~i~0 := 0; {3273#false} is VALID [2022-04-27 10:16:59,256 INFO L290 TraceCheckUtils]: 32: Hoare triple {3504#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {3273#false} is VALID [2022-04-27 10:16:59,257 INFO L290 TraceCheckUtils]: 31: Hoare triple {3508#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3504#(< main_~i~0 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,257 INFO L290 TraceCheckUtils]: 30: Hoare triple {3508#(< (+ main_~i~0 1) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {3508#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:16:59,257 INFO L290 TraceCheckUtils]: 29: Hoare triple {3508#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {3508#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:16:59,257 INFO L290 TraceCheckUtils]: 28: Hoare triple {3508#(< (+ 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; {3508#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:16:59,258 INFO L290 TraceCheckUtils]: 27: Hoare triple {3508#(< (+ 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); {3508#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:16:59,258 INFO L290 TraceCheckUtils]: 26: Hoare triple {3508#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {3508#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:16:59,258 INFO L290 TraceCheckUtils]: 25: Hoare triple {3508#(< (+ 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; {3508#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:16:59,258 INFO L290 TraceCheckUtils]: 24: Hoare triple {3508#(< (+ 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); {3508#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:16:59,259 INFO L290 TraceCheckUtils]: 23: Hoare triple {3508#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3508#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:16:59,259 INFO L290 TraceCheckUtils]: 22: Hoare triple {3536#(< 1 main_~nodecount~0)} ~i~0 := 0; {3508#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:16:59,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {3536#(< 1 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {3536#(< 1 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {3536#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3536#(< 1 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,260 INFO L290 TraceCheckUtils]: 19: Hoare triple {3536#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3536#(< 1 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {3536#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3536#(< 1 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {3536#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3536#(< 1 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {3536#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3536#(< 1 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {3536#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3536#(< 1 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {3536#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3536#(< 1 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {3536#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3536#(< 1 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {3536#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3536#(< 1 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {3536#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3536#(< 1 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {3536#(< 1 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3536#(< 1 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {3536#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3536#(< 1 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {3536#(< 1 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3536#(< 1 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {3536#(< 1 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3536#(< 1 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {3536#(< 1 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3536#(< 1 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {3272#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {3536#(< 1 main_~nodecount~0)} is VALID [2022-04-27 10:16:59,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {3272#true} call #t~ret22 := main(); {3272#true} is VALID [2022-04-27 10:16:59,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3272#true} {3272#true} #107#return; {3272#true} is VALID [2022-04-27 10:16:59,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {3272#true} assume true; {3272#true} is VALID [2022-04-27 10:16:59,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {3272#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; {3272#true} is VALID [2022-04-27 10:16:59,268 INFO L272 TraceCheckUtils]: 0: Hoare triple {3272#true} call ULTIMATE.init(); {3272#true} is VALID [2022-04-27 10:16:59,268 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-04-27 10:16:59,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944106898] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:16:59,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:16:59,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2022-04-27 10:16:59,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143232660] [2022-04-27 10:16:59,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:16:59,269 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-27 10:16:59,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:59,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:59,307 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-27 10:16:59,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 10:16:59,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:59,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 10:16:59,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-27 10:16:59,308 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:00,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:00,378 INFO L93 Difference]: Finished difference Result 154 states and 193 transitions. [2022-04-27 10:17:00,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-27 10:17:00,378 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-27 10:17:00,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:00,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:00,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 175 transitions. [2022-04-27 10:17:00,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:00,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 175 transitions. [2022-04-27 10:17:00,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 175 transitions. [2022-04-27 10:17:00,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:00,531 INFO L225 Difference]: With dead ends: 154 [2022-04-27 10:17:00,531 INFO L226 Difference]: Without dead ends: 120 [2022-04-27 10:17:00,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=304, Invalid=566, Unknown=0, NotChecked=0, Total=870 [2022-04-27 10:17:00,532 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 449 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:17:00,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 55 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:17:00,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-27 10:17:00,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 97. [2022-04-27 10:17:00,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:17:00,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 97 states, 91 states have (on average 1.2307692307692308) internal successors, (112), 91 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:00,663 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 97 states, 91 states have (on average 1.2307692307692308) internal successors, (112), 91 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:00,663 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 97 states, 91 states have (on average 1.2307692307692308) internal successors, (112), 91 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:00,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:00,665 INFO L93 Difference]: Finished difference Result 120 states and 147 transitions. [2022-04-27 10:17:00,665 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 147 transitions. [2022-04-27 10:17:00,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:00,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:00,666 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 91 states have (on average 1.2307692307692308) internal successors, (112), 91 states have internal predecessors, (112), 3 states have call successors, (3), 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 120 states. [2022-04-27 10:17:00,666 INFO L87 Difference]: Start difference. First operand has 97 states, 91 states have (on average 1.2307692307692308) internal successors, (112), 91 states have internal predecessors, (112), 3 states have call successors, (3), 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 120 states. [2022-04-27 10:17:00,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:00,668 INFO L93 Difference]: Finished difference Result 120 states and 147 transitions. [2022-04-27 10:17:00,668 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 147 transitions. [2022-04-27 10:17:00,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:00,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:00,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:17:00,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:17:00,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 91 states have (on average 1.2307692307692308) internal successors, (112), 91 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:00,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2022-04-27 10:17:00,670 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 53 [2022-04-27 10:17:00,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:17:00,670 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2022-04-27 10:17:00,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:00,670 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2022-04-27 10:17:00,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-27 10:17:00,670 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:00,671 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:17:00,687 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-27 10:17:00,871 WARN L477 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-27 10:17:00,871 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:00,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:00,872 INFO L85 PathProgramCache]: Analyzing trace with hash 461332056, now seen corresponding path program 4 times [2022-04-27 10:17:00,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:00,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973199924] [2022-04-27 10:17:00,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:00,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:00,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:17:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:00,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {4237#(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; {4227#true} is VALID [2022-04-27 10:17:00,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {4227#true} assume true; {4227#true} is VALID [2022-04-27 10:17:00,982 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4227#true} {4227#true} #107#return; {4227#true} is VALID [2022-04-27 10:17:00,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {4227#true} call ULTIMATE.init(); {4237#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:17:00,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {4237#(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; {4227#true} is VALID [2022-04-27 10:17:00,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {4227#true} assume true; {4227#true} is VALID [2022-04-27 10:17:00,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4227#true} {4227#true} #107#return; {4227#true} is VALID [2022-04-27 10:17:00,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {4227#true} call #t~ret22 := main(); {4227#true} is VALID [2022-04-27 10:17:00,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {4227#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {4232#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:00,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {4232#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4232#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:00,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {4232#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4232#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:00,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {4232#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4232#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:00,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {4232#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4232#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:00,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {4232#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4232#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:00,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {4232#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4232#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:00,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {4232#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4232#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:00,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {4232#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4232#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:00,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {4232#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4232#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:00,987 INFO L290 TraceCheckUtils]: 15: Hoare triple {4232#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4232#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:00,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {4232#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4232#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:00,988 INFO L290 TraceCheckUtils]: 17: Hoare triple {4232#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4232#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:00,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {4232#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4232#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:00,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {4232#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4232#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:00,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {4232#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4232#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:00,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {4232#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {4232#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:00,989 INFO L290 TraceCheckUtils]: 22: Hoare triple {4232#(<= 20 main_~edgecount~0)} ~i~0 := 0; {4232#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:00,989 INFO L290 TraceCheckUtils]: 23: Hoare triple {4232#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4233#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:17:00,990 INFO L290 TraceCheckUtils]: 24: Hoare triple {4233#(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); {4233#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:17:00,990 INFO L290 TraceCheckUtils]: 25: Hoare triple {4233#(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; {4233#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:17:00,991 INFO L290 TraceCheckUtils]: 26: Hoare triple {4233#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4234#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-27 10:17:00,991 INFO L290 TraceCheckUtils]: 27: Hoare triple {4234#(<= (+ 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); {4234#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-27 10:17:00,991 INFO L290 TraceCheckUtils]: 28: Hoare triple {4234#(<= (+ 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; {4234#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-27 10:17:00,991 INFO L290 TraceCheckUtils]: 29: Hoare triple {4234#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4235#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-27 10:17:00,992 INFO L290 TraceCheckUtils]: 30: Hoare triple {4235#(<= (+ 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); {4235#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-27 10:17:00,992 INFO L290 TraceCheckUtils]: 31: Hoare triple {4235#(<= (+ 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; {4235#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-27 10:17:00,992 INFO L290 TraceCheckUtils]: 32: Hoare triple {4235#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4236#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-27 10:17:00,993 INFO L290 TraceCheckUtils]: 33: Hoare triple {4236#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {4228#false} is VALID [2022-04-27 10:17:00,993 INFO L290 TraceCheckUtils]: 34: Hoare triple {4228#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4228#false} is VALID [2022-04-27 10:17:00,993 INFO L290 TraceCheckUtils]: 35: Hoare triple {4228#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4228#false} is VALID [2022-04-27 10:17:00,993 INFO L290 TraceCheckUtils]: 36: Hoare triple {4228#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4228#false} is VALID [2022-04-27 10:17:00,993 INFO L290 TraceCheckUtils]: 37: Hoare triple {4228#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {4228#false} is VALID [2022-04-27 10:17:00,993 INFO L290 TraceCheckUtils]: 38: Hoare triple {4228#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4228#false} is VALID [2022-04-27 10:17:00,993 INFO L290 TraceCheckUtils]: 39: Hoare triple {4228#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4228#false} is VALID [2022-04-27 10:17:00,993 INFO L290 TraceCheckUtils]: 40: Hoare triple {4228#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {4228#false} is VALID [2022-04-27 10:17:00,993 INFO L290 TraceCheckUtils]: 41: Hoare triple {4228#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4228#false} is VALID [2022-04-27 10:17:00,993 INFO L290 TraceCheckUtils]: 42: Hoare triple {4228#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4228#false} is VALID [2022-04-27 10:17:00,993 INFO L290 TraceCheckUtils]: 43: Hoare triple {4228#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {4228#false} is VALID [2022-04-27 10:17:00,993 INFO L290 TraceCheckUtils]: 44: Hoare triple {4228#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4228#false} is VALID [2022-04-27 10:17:00,993 INFO L290 TraceCheckUtils]: 45: Hoare triple {4228#false} assume !(~j~0 < ~edgecount~0); {4228#false} is VALID [2022-04-27 10:17:00,994 INFO L290 TraceCheckUtils]: 46: Hoare triple {4228#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4228#false} is VALID [2022-04-27 10:17:00,994 INFO L290 TraceCheckUtils]: 47: Hoare triple {4228#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4228#false} is VALID [2022-04-27 10:17:00,994 INFO L290 TraceCheckUtils]: 48: Hoare triple {4228#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4228#false} is VALID [2022-04-27 10:17:00,994 INFO L290 TraceCheckUtils]: 49: Hoare triple {4228#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {4228#false} is VALID [2022-04-27 10:17:00,994 INFO L290 TraceCheckUtils]: 50: Hoare triple {4228#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4228#false} is VALID [2022-04-27 10:17:00,994 INFO L290 TraceCheckUtils]: 51: Hoare triple {4228#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4228#false} is VALID [2022-04-27 10:17:00,994 INFO L290 TraceCheckUtils]: 52: Hoare triple {4228#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {4228#false} is VALID [2022-04-27 10:17:00,994 INFO L290 TraceCheckUtils]: 53: Hoare triple {4228#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4228#false} is VALID [2022-04-27 10:17:00,994 INFO L290 TraceCheckUtils]: 54: Hoare triple {4228#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4228#false} is VALID [2022-04-27 10:17:00,994 INFO L290 TraceCheckUtils]: 55: Hoare triple {4228#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {4228#false} is VALID [2022-04-27 10:17:00,994 INFO L290 TraceCheckUtils]: 56: Hoare triple {4228#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4228#false} is VALID [2022-04-27 10:17:00,994 INFO L290 TraceCheckUtils]: 57: Hoare triple {4228#false} assume !(~j~0 < ~edgecount~0); {4228#false} is VALID [2022-04-27 10:17:00,994 INFO L290 TraceCheckUtils]: 58: Hoare triple {4228#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4228#false} is VALID [2022-04-27 10:17:00,994 INFO L290 TraceCheckUtils]: 59: Hoare triple {4228#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4228#false} is VALID [2022-04-27 10:17:00,994 INFO L290 TraceCheckUtils]: 60: Hoare triple {4228#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4228#false} is VALID [2022-04-27 10:17:00,995 INFO L290 TraceCheckUtils]: 61: Hoare triple {4228#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {4228#false} is VALID [2022-04-27 10:17:00,995 INFO L290 TraceCheckUtils]: 62: Hoare triple {4228#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4228#false} is VALID [2022-04-27 10:17:00,995 INFO L290 TraceCheckUtils]: 63: Hoare triple {4228#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4228#false} is VALID [2022-04-27 10:17:00,995 INFO L290 TraceCheckUtils]: 64: Hoare triple {4228#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {4228#false} is VALID [2022-04-27 10:17:00,995 INFO L290 TraceCheckUtils]: 65: Hoare triple {4228#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4228#false} is VALID [2022-04-27 10:17:00,995 INFO L290 TraceCheckUtils]: 66: Hoare triple {4228#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4228#false} is VALID [2022-04-27 10:17:00,995 INFO L290 TraceCheckUtils]: 67: Hoare triple {4228#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {4228#false} is VALID [2022-04-27 10:17:00,995 INFO L290 TraceCheckUtils]: 68: Hoare triple {4228#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4228#false} is VALID [2022-04-27 10:17:00,995 INFO L290 TraceCheckUtils]: 69: Hoare triple {4228#false} assume !(~j~0 < ~edgecount~0); {4228#false} is VALID [2022-04-27 10:17:00,995 INFO L290 TraceCheckUtils]: 70: Hoare triple {4228#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4228#false} is VALID [2022-04-27 10:17:00,995 INFO L290 TraceCheckUtils]: 71: Hoare triple {4228#false} assume !(~i~0 < ~nodecount~0); {4228#false} is VALID [2022-04-27 10:17:00,995 INFO L290 TraceCheckUtils]: 72: Hoare triple {4228#false} ~i~0 := 0; {4228#false} is VALID [2022-04-27 10:17:00,995 INFO L290 TraceCheckUtils]: 73: Hoare triple {4228#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); {4228#false} is VALID [2022-04-27 10:17:00,995 INFO L290 TraceCheckUtils]: 74: Hoare triple {4228#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {4228#false} is VALID [2022-04-27 10:17:00,996 INFO L290 TraceCheckUtils]: 75: Hoare triple {4228#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4228#false} is VALID [2022-04-27 10:17:00,996 INFO L290 TraceCheckUtils]: 76: Hoare triple {4228#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); {4228#false} is VALID [2022-04-27 10:17:00,996 INFO L290 TraceCheckUtils]: 77: Hoare triple {4228#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {4228#false} is VALID [2022-04-27 10:17:00,996 INFO L290 TraceCheckUtils]: 78: Hoare triple {4228#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4228#false} is VALID [2022-04-27 10:17:00,996 INFO L290 TraceCheckUtils]: 79: Hoare triple {4228#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); {4228#false} is VALID [2022-04-27 10:17:00,996 INFO L290 TraceCheckUtils]: 80: Hoare triple {4228#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {4228#false} is VALID [2022-04-27 10:17:00,996 INFO L290 TraceCheckUtils]: 81: Hoare triple {4228#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4228#false} is VALID [2022-04-27 10:17:00,996 INFO L290 TraceCheckUtils]: 82: Hoare triple {4228#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); {4228#false} is VALID [2022-04-27 10:17:00,996 INFO L290 TraceCheckUtils]: 83: Hoare triple {4228#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {4228#false} is VALID [2022-04-27 10:17:00,996 INFO L290 TraceCheckUtils]: 84: Hoare triple {4228#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4228#false} is VALID [2022-04-27 10:17:00,996 INFO L290 TraceCheckUtils]: 85: Hoare triple {4228#false} assume !(~i~0 < ~edgecount~0); {4228#false} is VALID [2022-04-27 10:17:00,996 INFO L290 TraceCheckUtils]: 86: Hoare triple {4228#false} ~i~0 := 0; {4228#false} is VALID [2022-04-27 10:17:00,996 INFO L290 TraceCheckUtils]: 87: Hoare triple {4228#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4228#false} is VALID [2022-04-27 10:17:00,996 INFO L272 TraceCheckUtils]: 88: Hoare triple {4228#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {4228#false} is VALID [2022-04-27 10:17:00,996 INFO L290 TraceCheckUtils]: 89: Hoare triple {4228#false} ~cond := #in~cond; {4228#false} is VALID [2022-04-27 10:17:00,997 INFO L290 TraceCheckUtils]: 90: Hoare triple {4228#false} assume 0 == ~cond; {4228#false} is VALID [2022-04-27 10:17:00,997 INFO L290 TraceCheckUtils]: 91: Hoare triple {4228#false} assume !false; {4228#false} is VALID [2022-04-27 10:17:00,997 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 106 proven. 12 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-04-27 10:17:00,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:00,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973199924] [2022-04-27 10:17:00,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973199924] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:17:00,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605844414] [2022-04-27 10:17:00,997 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 10:17:00,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:00,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:17:00,998 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-27 10:17:00,999 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-27 10:17:01,108 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 10:17:01,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:17:01,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 10:17:01,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:01,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:17:01,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {4227#true} call ULTIMATE.init(); {4227#true} is VALID [2022-04-27 10:17:01,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {4227#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; {4227#true} is VALID [2022-04-27 10:17:01,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {4227#true} assume true; {4227#true} is VALID [2022-04-27 10:17:01,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4227#true} {4227#true} #107#return; {4227#true} is VALID [2022-04-27 10:17:01,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {4227#true} call #t~ret22 := main(); {4227#true} is VALID [2022-04-27 10:17:01,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {4227#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {4227#true} is VALID [2022-04-27 10:17:01,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {4227#true} assume !!(~i~0 < ~nodecount~0); {4227#true} is VALID [2022-04-27 10:17:01,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {4227#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4227#true} is VALID [2022-04-27 10:17:01,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {4227#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4227#true} is VALID [2022-04-27 10:17:01,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {4227#true} assume !!(~i~0 < ~nodecount~0); {4227#true} is VALID [2022-04-27 10:17:01,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {4227#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4227#true} is VALID [2022-04-27 10:17:01,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {4227#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4227#true} is VALID [2022-04-27 10:17:01,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {4227#true} assume !!(~i~0 < ~nodecount~0); {4227#true} is VALID [2022-04-27 10:17:01,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {4227#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4227#true} is VALID [2022-04-27 10:17:01,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {4227#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4227#true} is VALID [2022-04-27 10:17:01,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {4227#true} assume !!(~i~0 < ~nodecount~0); {4227#true} is VALID [2022-04-27 10:17:01,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {4227#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4227#true} is VALID [2022-04-27 10:17:01,544 INFO L290 TraceCheckUtils]: 17: Hoare triple {4227#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4227#true} is VALID [2022-04-27 10:17:01,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {4227#true} assume !!(~i~0 < ~nodecount~0); {4227#true} is VALID [2022-04-27 10:17:01,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {4227#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4227#true} is VALID [2022-04-27 10:17:01,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {4227#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4227#true} is VALID [2022-04-27 10:17:01,544 INFO L290 TraceCheckUtils]: 21: Hoare triple {4227#true} assume !(~i~0 < ~nodecount~0); {4227#true} is VALID [2022-04-27 10:17:01,544 INFO L290 TraceCheckUtils]: 22: Hoare triple {4227#true} ~i~0 := 0; {4227#true} is VALID [2022-04-27 10:17:01,545 INFO L290 TraceCheckUtils]: 23: Hoare triple {4227#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4310#(<= main_~j~0 0)} is VALID [2022-04-27 10:17:01,545 INFO L290 TraceCheckUtils]: 24: Hoare triple {4310#(<= 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); {4310#(<= main_~j~0 0)} is VALID [2022-04-27 10:17:01,545 INFO L290 TraceCheckUtils]: 25: Hoare triple {4310#(<= 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; {4310#(<= main_~j~0 0)} is VALID [2022-04-27 10:17:01,546 INFO L290 TraceCheckUtils]: 26: Hoare triple {4310#(<= main_~j~0 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4320#(<= main_~j~0 1)} is VALID [2022-04-27 10:17:01,546 INFO L290 TraceCheckUtils]: 27: Hoare triple {4320#(<= 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); {4320#(<= main_~j~0 1)} is VALID [2022-04-27 10:17:01,546 INFO L290 TraceCheckUtils]: 28: Hoare triple {4320#(<= 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; {4320#(<= main_~j~0 1)} is VALID [2022-04-27 10:17:01,546 INFO L290 TraceCheckUtils]: 29: Hoare triple {4320#(<= main_~j~0 1)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4330#(<= main_~j~0 2)} is VALID [2022-04-27 10:17:01,547 INFO L290 TraceCheckUtils]: 30: Hoare triple {4330#(<= 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); {4330#(<= main_~j~0 2)} is VALID [2022-04-27 10:17:01,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {4330#(<= 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; {4330#(<= main_~j~0 2)} is VALID [2022-04-27 10:17:01,547 INFO L290 TraceCheckUtils]: 32: Hoare triple {4330#(<= main_~j~0 2)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4340#(<= main_~j~0 3)} is VALID [2022-04-27 10:17:01,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {4340#(<= main_~j~0 3)} assume !(~j~0 < ~edgecount~0); {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,548 INFO L290 TraceCheckUtils]: 34: Hoare triple {4344#(<= main_~edgecount~0 3)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,548 INFO L290 TraceCheckUtils]: 35: Hoare triple {4344#(<= main_~edgecount~0 3)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,548 INFO L290 TraceCheckUtils]: 36: Hoare triple {4344#(<= main_~edgecount~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); {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,548 INFO L290 TraceCheckUtils]: 37: Hoare triple {4344#(<= main_~edgecount~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; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,549 INFO L290 TraceCheckUtils]: 38: Hoare triple {4344#(<= main_~edgecount~0 3)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,549 INFO L290 TraceCheckUtils]: 39: Hoare triple {4344#(<= main_~edgecount~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); {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,549 INFO L290 TraceCheckUtils]: 40: Hoare triple {4344#(<= main_~edgecount~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; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,549 INFO L290 TraceCheckUtils]: 41: Hoare triple {4344#(<= main_~edgecount~0 3)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,549 INFO L290 TraceCheckUtils]: 42: Hoare triple {4344#(<= main_~edgecount~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); {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,550 INFO L290 TraceCheckUtils]: 43: Hoare triple {4344#(<= main_~edgecount~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; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,550 INFO L290 TraceCheckUtils]: 44: Hoare triple {4344#(<= main_~edgecount~0 3)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,550 INFO L290 TraceCheckUtils]: 45: Hoare triple {4344#(<= main_~edgecount~0 3)} assume !(~j~0 < ~edgecount~0); {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,550 INFO L290 TraceCheckUtils]: 46: Hoare triple {4344#(<= main_~edgecount~0 3)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,551 INFO L290 TraceCheckUtils]: 47: Hoare triple {4344#(<= main_~edgecount~0 3)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,551 INFO L290 TraceCheckUtils]: 48: Hoare triple {4344#(<= main_~edgecount~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); {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,551 INFO L290 TraceCheckUtils]: 49: Hoare triple {4344#(<= main_~edgecount~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; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,551 INFO L290 TraceCheckUtils]: 50: Hoare triple {4344#(<= main_~edgecount~0 3)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,551 INFO L290 TraceCheckUtils]: 51: Hoare triple {4344#(<= main_~edgecount~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); {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,552 INFO L290 TraceCheckUtils]: 52: Hoare triple {4344#(<= main_~edgecount~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; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,552 INFO L290 TraceCheckUtils]: 53: Hoare triple {4344#(<= main_~edgecount~0 3)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,552 INFO L290 TraceCheckUtils]: 54: Hoare triple {4344#(<= main_~edgecount~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); {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,552 INFO L290 TraceCheckUtils]: 55: Hoare triple {4344#(<= main_~edgecount~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; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,553 INFO L290 TraceCheckUtils]: 56: Hoare triple {4344#(<= main_~edgecount~0 3)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,553 INFO L290 TraceCheckUtils]: 57: Hoare triple {4344#(<= main_~edgecount~0 3)} assume !(~j~0 < ~edgecount~0); {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,553 INFO L290 TraceCheckUtils]: 58: Hoare triple {4344#(<= main_~edgecount~0 3)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,553 INFO L290 TraceCheckUtils]: 59: Hoare triple {4344#(<= main_~edgecount~0 3)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,553 INFO L290 TraceCheckUtils]: 60: Hoare triple {4344#(<= main_~edgecount~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); {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,554 INFO L290 TraceCheckUtils]: 61: Hoare triple {4344#(<= main_~edgecount~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; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,554 INFO L290 TraceCheckUtils]: 62: Hoare triple {4344#(<= main_~edgecount~0 3)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,554 INFO L290 TraceCheckUtils]: 63: Hoare triple {4344#(<= main_~edgecount~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); {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,554 INFO L290 TraceCheckUtils]: 64: Hoare triple {4344#(<= main_~edgecount~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; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,555 INFO L290 TraceCheckUtils]: 65: Hoare triple {4344#(<= main_~edgecount~0 3)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,555 INFO L290 TraceCheckUtils]: 66: Hoare triple {4344#(<= main_~edgecount~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); {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,555 INFO L290 TraceCheckUtils]: 67: Hoare triple {4344#(<= main_~edgecount~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; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,555 INFO L290 TraceCheckUtils]: 68: Hoare triple {4344#(<= main_~edgecount~0 3)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,555 INFO L290 TraceCheckUtils]: 69: Hoare triple {4344#(<= main_~edgecount~0 3)} assume !(~j~0 < ~edgecount~0); {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,556 INFO L290 TraceCheckUtils]: 70: Hoare triple {4344#(<= main_~edgecount~0 3)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,556 INFO L290 TraceCheckUtils]: 71: Hoare triple {4344#(<= main_~edgecount~0 3)} assume !(~i~0 < ~nodecount~0); {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,556 INFO L290 TraceCheckUtils]: 72: Hoare triple {4344#(<= main_~edgecount~0 3)} ~i~0 := 0; {4462#(and (<= main_~edgecount~0 3) (<= 0 main_~i~0))} is VALID [2022-04-27 10:17:01,557 INFO L290 TraceCheckUtils]: 73: Hoare triple {4462#(and (<= main_~edgecount~0 3) (<= 0 main_~i~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); {4462#(and (<= main_~edgecount~0 3) (<= 0 main_~i~0))} is VALID [2022-04-27 10:17:01,557 INFO L290 TraceCheckUtils]: 74: Hoare triple {4462#(and (<= main_~edgecount~0 3) (<= 0 main_~i~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {4462#(and (<= main_~edgecount~0 3) (<= 0 main_~i~0))} is VALID [2022-04-27 10:17:01,557 INFO L290 TraceCheckUtils]: 75: Hoare triple {4462#(and (<= main_~edgecount~0 3) (<= 0 main_~i~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4472#(and (<= main_~edgecount~0 3) (<= 1 main_~i~0))} is VALID [2022-04-27 10:17:01,558 INFO L290 TraceCheckUtils]: 76: Hoare triple {4472#(and (<= main_~edgecount~0 3) (<= 1 main_~i~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); {4472#(and (<= main_~edgecount~0 3) (<= 1 main_~i~0))} is VALID [2022-04-27 10:17:01,558 INFO L290 TraceCheckUtils]: 77: Hoare triple {4472#(and (<= main_~edgecount~0 3) (<= 1 main_~i~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {4472#(and (<= main_~edgecount~0 3) (<= 1 main_~i~0))} is VALID [2022-04-27 10:17:01,558 INFO L290 TraceCheckUtils]: 78: Hoare triple {4472#(and (<= main_~edgecount~0 3) (<= 1 main_~i~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4482#(and (<= main_~edgecount~0 3) (<= 2 main_~i~0))} is VALID [2022-04-27 10:17:01,559 INFO L290 TraceCheckUtils]: 79: Hoare triple {4482#(and (<= main_~edgecount~0 3) (<= 2 main_~i~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); {4482#(and (<= main_~edgecount~0 3) (<= 2 main_~i~0))} is VALID [2022-04-27 10:17:01,559 INFO L290 TraceCheckUtils]: 80: Hoare triple {4482#(and (<= main_~edgecount~0 3) (<= 2 main_~i~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {4482#(and (<= main_~edgecount~0 3) (<= 2 main_~i~0))} is VALID [2022-04-27 10:17:01,560 INFO L290 TraceCheckUtils]: 81: Hoare triple {4482#(and (<= main_~edgecount~0 3) (<= 2 main_~i~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4492#(and (<= main_~edgecount~0 3) (<= 3 main_~i~0))} is VALID [2022-04-27 10:17:01,560 INFO L290 TraceCheckUtils]: 82: Hoare triple {4492#(and (<= main_~edgecount~0 3) (<= 3 main_~i~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); {4228#false} is VALID [2022-04-27 10:17:01,560 INFO L290 TraceCheckUtils]: 83: Hoare triple {4228#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {4228#false} is VALID [2022-04-27 10:17:01,560 INFO L290 TraceCheckUtils]: 84: Hoare triple {4228#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4228#false} is VALID [2022-04-27 10:17:01,560 INFO L290 TraceCheckUtils]: 85: Hoare triple {4228#false} assume !(~i~0 < ~edgecount~0); {4228#false} is VALID [2022-04-27 10:17:01,560 INFO L290 TraceCheckUtils]: 86: Hoare triple {4228#false} ~i~0 := 0; {4228#false} is VALID [2022-04-27 10:17:01,560 INFO L290 TraceCheckUtils]: 87: Hoare triple {4228#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4228#false} is VALID [2022-04-27 10:17:01,560 INFO L272 TraceCheckUtils]: 88: Hoare triple {4228#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {4228#false} is VALID [2022-04-27 10:17:01,560 INFO L290 TraceCheckUtils]: 89: Hoare triple {4228#false} ~cond := #in~cond; {4228#false} is VALID [2022-04-27 10:17:01,561 INFO L290 TraceCheckUtils]: 90: Hoare triple {4228#false} assume 0 == ~cond; {4228#false} is VALID [2022-04-27 10:17:01,561 INFO L290 TraceCheckUtils]: 91: Hoare triple {4228#false} assume !false; {4228#false} is VALID [2022-04-27 10:17:01,561 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 26 proven. 114 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2022-04-27 10:17:01,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:17:01,906 INFO L290 TraceCheckUtils]: 91: Hoare triple {4228#false} assume !false; {4228#false} is VALID [2022-04-27 10:17:01,907 INFO L290 TraceCheckUtils]: 90: Hoare triple {4228#false} assume 0 == ~cond; {4228#false} is VALID [2022-04-27 10:17:01,907 INFO L290 TraceCheckUtils]: 89: Hoare triple {4228#false} ~cond := #in~cond; {4228#false} is VALID [2022-04-27 10:17:01,907 INFO L272 TraceCheckUtils]: 88: Hoare triple {4228#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {4228#false} is VALID [2022-04-27 10:17:01,907 INFO L290 TraceCheckUtils]: 87: Hoare triple {4228#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4228#false} is VALID [2022-04-27 10:17:01,907 INFO L290 TraceCheckUtils]: 86: Hoare triple {4228#false} ~i~0 := 0; {4228#false} is VALID [2022-04-27 10:17:01,907 INFO L290 TraceCheckUtils]: 85: Hoare triple {4228#false} assume !(~i~0 < ~edgecount~0); {4228#false} is VALID [2022-04-27 10:17:01,907 INFO L290 TraceCheckUtils]: 84: Hoare triple {4228#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4228#false} is VALID [2022-04-27 10:17:01,907 INFO L290 TraceCheckUtils]: 83: Hoare triple {4228#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {4228#false} is VALID [2022-04-27 10:17:01,907 INFO L290 TraceCheckUtils]: 82: Hoare triple {4550#(not (< 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); {4228#false} is VALID [2022-04-27 10:17:01,908 INFO L290 TraceCheckUtils]: 81: Hoare triple {4554#(<= main_~edgecount~0 (+ main_~i~0 1))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4550#(not (< main_~i~0 main_~edgecount~0))} is VALID [2022-04-27 10:17:01,908 INFO L290 TraceCheckUtils]: 80: Hoare triple {4554#(<= main_~edgecount~0 (+ main_~i~0 1))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {4554#(<= main_~edgecount~0 (+ main_~i~0 1))} is VALID [2022-04-27 10:17:01,908 INFO L290 TraceCheckUtils]: 79: Hoare triple {4554#(<= 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); {4554#(<= main_~edgecount~0 (+ main_~i~0 1))} is VALID [2022-04-27 10:17:01,923 INFO L290 TraceCheckUtils]: 78: Hoare triple {4564#(<= main_~edgecount~0 (+ main_~i~0 2))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4554#(<= main_~edgecount~0 (+ main_~i~0 1))} is VALID [2022-04-27 10:17:01,924 INFO L290 TraceCheckUtils]: 77: Hoare triple {4564#(<= main_~edgecount~0 (+ main_~i~0 2))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {4564#(<= main_~edgecount~0 (+ main_~i~0 2))} is VALID [2022-04-27 10:17:01,924 INFO L290 TraceCheckUtils]: 76: Hoare triple {4564#(<= 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); {4564#(<= main_~edgecount~0 (+ main_~i~0 2))} is VALID [2022-04-27 10:17:01,924 INFO L290 TraceCheckUtils]: 75: Hoare triple {4574#(<= main_~edgecount~0 (+ main_~i~0 3))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {4564#(<= main_~edgecount~0 (+ main_~i~0 2))} is VALID [2022-04-27 10:17:01,925 INFO L290 TraceCheckUtils]: 74: Hoare triple {4574#(<= main_~edgecount~0 (+ main_~i~0 3))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {4574#(<= main_~edgecount~0 (+ main_~i~0 3))} is VALID [2022-04-27 10:17:01,925 INFO L290 TraceCheckUtils]: 73: Hoare triple {4574#(<= 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); {4574#(<= main_~edgecount~0 (+ main_~i~0 3))} is VALID [2022-04-27 10:17:01,925 INFO L290 TraceCheckUtils]: 72: Hoare triple {4344#(<= main_~edgecount~0 3)} ~i~0 := 0; {4574#(<= main_~edgecount~0 (+ main_~i~0 3))} is VALID [2022-04-27 10:17:01,925 INFO L290 TraceCheckUtils]: 71: Hoare triple {4344#(<= main_~edgecount~0 3)} assume !(~i~0 < ~nodecount~0); {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,926 INFO L290 TraceCheckUtils]: 70: Hoare triple {4344#(<= main_~edgecount~0 3)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,926 INFO L290 TraceCheckUtils]: 69: Hoare triple {4344#(<= main_~edgecount~0 3)} assume !(~j~0 < ~edgecount~0); {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,926 INFO L290 TraceCheckUtils]: 68: Hoare triple {4344#(<= main_~edgecount~0 3)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,926 INFO L290 TraceCheckUtils]: 67: Hoare triple {4344#(<= main_~edgecount~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; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,927 INFO L290 TraceCheckUtils]: 66: Hoare triple {4344#(<= main_~edgecount~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); {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,927 INFO L290 TraceCheckUtils]: 65: Hoare triple {4344#(<= main_~edgecount~0 3)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,927 INFO L290 TraceCheckUtils]: 64: Hoare triple {4344#(<= main_~edgecount~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; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,927 INFO L290 TraceCheckUtils]: 63: Hoare triple {4344#(<= main_~edgecount~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); {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,928 INFO L290 TraceCheckUtils]: 62: Hoare triple {4344#(<= main_~edgecount~0 3)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,928 INFO L290 TraceCheckUtils]: 61: Hoare triple {4344#(<= main_~edgecount~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; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,928 INFO L290 TraceCheckUtils]: 60: Hoare triple {4344#(<= main_~edgecount~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); {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,928 INFO L290 TraceCheckUtils]: 59: Hoare triple {4344#(<= main_~edgecount~0 3)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,929 INFO L290 TraceCheckUtils]: 58: Hoare triple {4344#(<= main_~edgecount~0 3)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,929 INFO L290 TraceCheckUtils]: 57: Hoare triple {4344#(<= main_~edgecount~0 3)} assume !(~j~0 < ~edgecount~0); {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,929 INFO L290 TraceCheckUtils]: 56: Hoare triple {4344#(<= main_~edgecount~0 3)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,929 INFO L290 TraceCheckUtils]: 55: Hoare triple {4344#(<= main_~edgecount~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; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,930 INFO L290 TraceCheckUtils]: 54: Hoare triple {4344#(<= main_~edgecount~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); {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,930 INFO L290 TraceCheckUtils]: 53: Hoare triple {4344#(<= main_~edgecount~0 3)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,930 INFO L290 TraceCheckUtils]: 52: Hoare triple {4344#(<= main_~edgecount~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; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,930 INFO L290 TraceCheckUtils]: 51: Hoare triple {4344#(<= main_~edgecount~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); {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,931 INFO L290 TraceCheckUtils]: 50: Hoare triple {4344#(<= main_~edgecount~0 3)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,931 INFO L290 TraceCheckUtils]: 49: Hoare triple {4344#(<= main_~edgecount~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; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,931 INFO L290 TraceCheckUtils]: 48: Hoare triple {4344#(<= main_~edgecount~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); {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,931 INFO L290 TraceCheckUtils]: 47: Hoare triple {4344#(<= main_~edgecount~0 3)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,932 INFO L290 TraceCheckUtils]: 46: Hoare triple {4344#(<= main_~edgecount~0 3)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,932 INFO L290 TraceCheckUtils]: 45: Hoare triple {4344#(<= main_~edgecount~0 3)} assume !(~j~0 < ~edgecount~0); {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,932 INFO L290 TraceCheckUtils]: 44: Hoare triple {4344#(<= main_~edgecount~0 3)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,932 INFO L290 TraceCheckUtils]: 43: Hoare triple {4344#(<= main_~edgecount~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; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,932 INFO L290 TraceCheckUtils]: 42: Hoare triple {4344#(<= main_~edgecount~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); {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,933 INFO L290 TraceCheckUtils]: 41: Hoare triple {4344#(<= main_~edgecount~0 3)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,933 INFO L290 TraceCheckUtils]: 40: Hoare triple {4344#(<= main_~edgecount~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; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,934 INFO L290 TraceCheckUtils]: 39: Hoare triple {4344#(<= main_~edgecount~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); {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,934 INFO L290 TraceCheckUtils]: 38: Hoare triple {4344#(<= main_~edgecount~0 3)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,934 INFO L290 TraceCheckUtils]: 37: Hoare triple {4344#(<= main_~edgecount~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; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,934 INFO L290 TraceCheckUtils]: 36: Hoare triple {4344#(<= main_~edgecount~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); {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,935 INFO L290 TraceCheckUtils]: 35: Hoare triple {4344#(<= main_~edgecount~0 3)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,935 INFO L290 TraceCheckUtils]: 34: Hoare triple {4344#(<= main_~edgecount~0 3)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,935 INFO L290 TraceCheckUtils]: 33: Hoare triple {4340#(<= main_~j~0 3)} assume !(~j~0 < ~edgecount~0); {4344#(<= main_~edgecount~0 3)} is VALID [2022-04-27 10:17:01,936 INFO L290 TraceCheckUtils]: 32: Hoare triple {4330#(<= main_~j~0 2)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4340#(<= main_~j~0 3)} is VALID [2022-04-27 10:17:01,936 INFO L290 TraceCheckUtils]: 31: Hoare triple {4330#(<= 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; {4330#(<= main_~j~0 2)} is VALID [2022-04-27 10:17:01,936 INFO L290 TraceCheckUtils]: 30: Hoare triple {4330#(<= 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); {4330#(<= main_~j~0 2)} is VALID [2022-04-27 10:17:01,936 INFO L290 TraceCheckUtils]: 29: Hoare triple {4320#(<= main_~j~0 1)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4330#(<= main_~j~0 2)} is VALID [2022-04-27 10:17:01,937 INFO L290 TraceCheckUtils]: 28: Hoare triple {4320#(<= 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; {4320#(<= main_~j~0 1)} is VALID [2022-04-27 10:17:01,937 INFO L290 TraceCheckUtils]: 27: Hoare triple {4320#(<= 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); {4320#(<= main_~j~0 1)} is VALID [2022-04-27 10:17:01,937 INFO L290 TraceCheckUtils]: 26: Hoare triple {4310#(<= main_~j~0 0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {4320#(<= main_~j~0 1)} is VALID [2022-04-27 10:17:01,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {4310#(<= 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; {4310#(<= main_~j~0 0)} is VALID [2022-04-27 10:17:01,938 INFO L290 TraceCheckUtils]: 24: Hoare triple {4310#(<= 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); {4310#(<= main_~j~0 0)} is VALID [2022-04-27 10:17:01,938 INFO L290 TraceCheckUtils]: 23: Hoare triple {4227#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4310#(<= main_~j~0 0)} is VALID [2022-04-27 10:17:01,938 INFO L290 TraceCheckUtils]: 22: Hoare triple {4227#true} ~i~0 := 0; {4227#true} is VALID [2022-04-27 10:17:01,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {4227#true} assume !(~i~0 < ~nodecount~0); {4227#true} is VALID [2022-04-27 10:17:01,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {4227#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4227#true} is VALID [2022-04-27 10:17:01,939 INFO L290 TraceCheckUtils]: 19: Hoare triple {4227#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4227#true} is VALID [2022-04-27 10:17:01,939 INFO L290 TraceCheckUtils]: 18: Hoare triple {4227#true} assume !!(~i~0 < ~nodecount~0); {4227#true} is VALID [2022-04-27 10:17:01,939 INFO L290 TraceCheckUtils]: 17: Hoare triple {4227#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4227#true} is VALID [2022-04-27 10:17:01,939 INFO L290 TraceCheckUtils]: 16: Hoare triple {4227#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4227#true} is VALID [2022-04-27 10:17:01,939 INFO L290 TraceCheckUtils]: 15: Hoare triple {4227#true} assume !!(~i~0 < ~nodecount~0); {4227#true} is VALID [2022-04-27 10:17:01,939 INFO L290 TraceCheckUtils]: 14: Hoare triple {4227#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4227#true} is VALID [2022-04-27 10:17:01,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {4227#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4227#true} is VALID [2022-04-27 10:17:01,940 INFO L290 TraceCheckUtils]: 12: Hoare triple {4227#true} assume !!(~i~0 < ~nodecount~0); {4227#true} is VALID [2022-04-27 10:17:01,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {4227#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4227#true} is VALID [2022-04-27 10:17:01,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {4227#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4227#true} is VALID [2022-04-27 10:17:01,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {4227#true} assume !!(~i~0 < ~nodecount~0); {4227#true} is VALID [2022-04-27 10:17:01,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {4227#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4227#true} is VALID [2022-04-27 10:17:01,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {4227#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4227#true} is VALID [2022-04-27 10:17:01,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {4227#true} assume !!(~i~0 < ~nodecount~0); {4227#true} is VALID [2022-04-27 10:17:01,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {4227#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {4227#true} is VALID [2022-04-27 10:17:01,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {4227#true} call #t~ret22 := main(); {4227#true} is VALID [2022-04-27 10:17:01,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4227#true} {4227#true} #107#return; {4227#true} is VALID [2022-04-27 10:17:01,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {4227#true} assume true; {4227#true} is VALID [2022-04-27 10:17:01,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {4227#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; {4227#true} is VALID [2022-04-27 10:17:01,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {4227#true} call ULTIMATE.init(); {4227#true} is VALID [2022-04-27 10:17:01,941 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 26 proven. 114 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2022-04-27 10:17:01,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605844414] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:17:01,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:17:01,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 21 [2022-04-27 10:17:01,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487405524] [2022-04-27 10:17:01,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:17:01,943 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 20 states have internal predecessors, (85), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-27 10:17:01,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:01,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 20 states have internal predecessors, (85), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:01,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:01,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-27 10:17:01,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:02,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-27 10:17:02,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-04-27 10:17:02,000 INFO L87 Difference]: Start difference. First operand 97 states and 117 transitions. Second operand has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 20 states have internal predecessors, (85), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:02,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:02,769 INFO L93 Difference]: Finished difference Result 180 states and 226 transitions. [2022-04-27 10:17:02,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:17:02,770 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 20 states have internal predecessors, (85), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-27 10:17:02,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:02,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 20 states have internal predecessors, (85), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:02,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 77 transitions. [2022-04-27 10:17:02,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 20 states have internal predecessors, (85), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:02,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 77 transitions. [2022-04-27 10:17:02,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 77 transitions. [2022-04-27 10:17:02,825 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-27 10:17:02,826 INFO L225 Difference]: With dead ends: 180 [2022-04-27 10:17:02,826 INFO L226 Difference]: Without dead ends: 117 [2022-04-27 10:17:02,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2022-04-27 10:17:02,828 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 94 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:17:02,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 90 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 10:17:02,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-27 10:17:02,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 109. [2022-04-27 10:17:02,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:17:02,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 109 states, 103 states have (on average 1.2427184466019416) internal successors, (128), 103 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:02,958 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 109 states, 103 states have (on average 1.2427184466019416) internal successors, (128), 103 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:02,959 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 109 states, 103 states have (on average 1.2427184466019416) internal successors, (128), 103 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:02,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:02,960 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2022-04-27 10:17:02,960 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 145 transitions. [2022-04-27 10:17:02,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:02,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:02,961 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 103 states have (on average 1.2427184466019416) internal successors, (128), 103 states have internal predecessors, (128), 3 states have call successors, (3), 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 117 states. [2022-04-27 10:17:02,961 INFO L87 Difference]: Start difference. First operand has 109 states, 103 states have (on average 1.2427184466019416) internal successors, (128), 103 states have internal predecessors, (128), 3 states have call successors, (3), 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 117 states. [2022-04-27 10:17:02,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:02,962 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2022-04-27 10:17:02,962 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 145 transitions. [2022-04-27 10:17:02,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:02,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:02,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:17:02,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:17:02,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 103 states have (on average 1.2427184466019416) internal successors, (128), 103 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:02,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2022-04-27 10:17:02,964 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 92 [2022-04-27 10:17:02,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:17:02,964 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2022-04-27 10:17:02,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 20 states have internal predecessors, (85), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:02,965 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2022-04-27 10:17:02,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-27 10:17:02,965 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:02,965 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:17:02,982 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-27 10:17:03,179 WARN L477 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-27 10:17:03,179 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:03,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:03,180 INFO L85 PathProgramCache]: Analyzing trace with hash -405995204, now seen corresponding path program 5 times [2022-04-27 10:17:03,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:03,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262923621] [2022-04-27 10:17:03,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:03,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:03,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:17:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:03,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {5459#(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; {5448#true} is VALID [2022-04-27 10:17:03,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {5448#true} assume true; {5448#true} is VALID [2022-04-27 10:17:03,310 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5448#true} {5448#true} #107#return; {5448#true} is VALID [2022-04-27 10:17:03,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {5448#true} call ULTIMATE.init(); {5459#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:17:03,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {5459#(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; {5448#true} is VALID [2022-04-27 10:17:03,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {5448#true} assume true; {5448#true} is VALID [2022-04-27 10:17:03,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5448#true} {5448#true} #107#return; {5448#true} is VALID [2022-04-27 10:17:03,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {5448#true} call #t~ret22 := main(); {5448#true} is VALID [2022-04-27 10:17:03,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {5448#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:03,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:03,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:03,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {5453#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:03,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:03,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:03,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {5453#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:03,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:03,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:03,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {5453#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:03,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:03,316 INFO L290 TraceCheckUtils]: 16: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:03,316 INFO L290 TraceCheckUtils]: 17: Hoare triple {5453#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:03,316 INFO L290 TraceCheckUtils]: 18: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:03,316 INFO L290 TraceCheckUtils]: 19: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:03,317 INFO L290 TraceCheckUtils]: 20: Hoare triple {5453#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:03,317 INFO L290 TraceCheckUtils]: 21: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:03,317 INFO L290 TraceCheckUtils]: 22: Hoare triple {5453#(<= 20 main_~edgecount~0)} ~i~0 := 0; {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:03,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5454#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:17:03,318 INFO L290 TraceCheckUtils]: 24: Hoare triple {5454#(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); {5454#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:17:03,318 INFO L290 TraceCheckUtils]: 25: Hoare triple {5454#(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; {5454#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:17:03,319 INFO L290 TraceCheckUtils]: 26: Hoare triple {5454#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5455#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-27 10:17:03,319 INFO L290 TraceCheckUtils]: 27: Hoare triple {5455#(<= (+ 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); {5455#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-27 10:17:03,319 INFO L290 TraceCheckUtils]: 28: Hoare triple {5455#(<= (+ 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; {5455#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-27 10:17:03,319 INFO L290 TraceCheckUtils]: 29: Hoare triple {5455#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5456#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-27 10:17:03,320 INFO L290 TraceCheckUtils]: 30: Hoare triple {5456#(<= (+ 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); {5456#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-27 10:17:03,320 INFO L290 TraceCheckUtils]: 31: Hoare triple {5456#(<= (+ 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; {5456#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-27 10:17:03,320 INFO L290 TraceCheckUtils]: 32: Hoare triple {5456#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5457#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-27 10:17:03,321 INFO L290 TraceCheckUtils]: 33: Hoare triple {5457#(<= (+ 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); {5457#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-27 10:17:03,321 INFO L290 TraceCheckUtils]: 34: Hoare triple {5457#(<= (+ 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; {5457#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-27 10:17:03,321 INFO L290 TraceCheckUtils]: 35: Hoare triple {5457#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5458#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-27 10:17:03,321 INFO L290 TraceCheckUtils]: 36: Hoare triple {5458#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {5449#false} is VALID [2022-04-27 10:17:03,322 INFO L290 TraceCheckUtils]: 37: Hoare triple {5449#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5449#false} is VALID [2022-04-27 10:17:03,322 INFO L290 TraceCheckUtils]: 38: Hoare triple {5449#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5449#false} is VALID [2022-04-27 10:17:03,322 INFO L290 TraceCheckUtils]: 39: Hoare triple {5449#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5449#false} is VALID [2022-04-27 10:17:03,322 INFO L290 TraceCheckUtils]: 40: Hoare triple {5449#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5449#false} is VALID [2022-04-27 10:17:03,322 INFO L290 TraceCheckUtils]: 41: Hoare triple {5449#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5449#false} is VALID [2022-04-27 10:17:03,322 INFO L290 TraceCheckUtils]: 42: Hoare triple {5449#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5449#false} is VALID [2022-04-27 10:17:03,322 INFO L290 TraceCheckUtils]: 43: Hoare triple {5449#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5449#false} is VALID [2022-04-27 10:17:03,322 INFO L290 TraceCheckUtils]: 44: Hoare triple {5449#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5449#false} is VALID [2022-04-27 10:17:03,322 INFO L290 TraceCheckUtils]: 45: Hoare triple {5449#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5449#false} is VALID [2022-04-27 10:17:03,322 INFO L290 TraceCheckUtils]: 46: Hoare triple {5449#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5449#false} is VALID [2022-04-27 10:17:03,322 INFO L290 TraceCheckUtils]: 47: Hoare triple {5449#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5449#false} is VALID [2022-04-27 10:17:03,322 INFO L290 TraceCheckUtils]: 48: Hoare triple {5449#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5449#false} is VALID [2022-04-27 10:17:03,322 INFO L290 TraceCheckUtils]: 49: Hoare triple {5449#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5449#false} is VALID [2022-04-27 10:17:03,322 INFO L290 TraceCheckUtils]: 50: Hoare triple {5449#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5449#false} is VALID [2022-04-27 10:17:03,322 INFO L290 TraceCheckUtils]: 51: Hoare triple {5449#false} assume !(~j~0 < ~edgecount~0); {5449#false} is VALID [2022-04-27 10:17:03,322 INFO L290 TraceCheckUtils]: 52: Hoare triple {5449#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5449#false} is VALID [2022-04-27 10:17:03,322 INFO L290 TraceCheckUtils]: 53: Hoare triple {5449#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5449#false} is VALID [2022-04-27 10:17:03,322 INFO L290 TraceCheckUtils]: 54: Hoare triple {5449#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5449#false} is VALID [2022-04-27 10:17:03,322 INFO L290 TraceCheckUtils]: 55: Hoare triple {5449#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5449#false} is VALID [2022-04-27 10:17:03,322 INFO L290 TraceCheckUtils]: 56: Hoare triple {5449#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5449#false} is VALID [2022-04-27 10:17:03,323 INFO L290 TraceCheckUtils]: 57: Hoare triple {5449#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5449#false} is VALID [2022-04-27 10:17:03,323 INFO L290 TraceCheckUtils]: 58: Hoare triple {5449#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5449#false} is VALID [2022-04-27 10:17:03,323 INFO L290 TraceCheckUtils]: 59: Hoare triple {5449#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5449#false} is VALID [2022-04-27 10:17:03,323 INFO L290 TraceCheckUtils]: 60: Hoare triple {5449#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5449#false} is VALID [2022-04-27 10:17:03,323 INFO L290 TraceCheckUtils]: 61: Hoare triple {5449#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5449#false} is VALID [2022-04-27 10:17:03,323 INFO L290 TraceCheckUtils]: 62: Hoare triple {5449#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5449#false} is VALID [2022-04-27 10:17:03,323 INFO L290 TraceCheckUtils]: 63: Hoare triple {5449#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5449#false} is VALID [2022-04-27 10:17:03,323 INFO L290 TraceCheckUtils]: 64: Hoare triple {5449#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5449#false} is VALID [2022-04-27 10:17:03,323 INFO L290 TraceCheckUtils]: 65: Hoare triple {5449#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5449#false} is VALID [2022-04-27 10:17:03,323 INFO L290 TraceCheckUtils]: 66: Hoare triple {5449#false} assume !(~j~0 < ~edgecount~0); {5449#false} is VALID [2022-04-27 10:17:03,323 INFO L290 TraceCheckUtils]: 67: Hoare triple {5449#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5449#false} is VALID [2022-04-27 10:17:03,323 INFO L290 TraceCheckUtils]: 68: Hoare triple {5449#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5449#false} is VALID [2022-04-27 10:17:03,323 INFO L290 TraceCheckUtils]: 69: Hoare triple {5449#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5449#false} is VALID [2022-04-27 10:17:03,323 INFO L290 TraceCheckUtils]: 70: Hoare triple {5449#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5449#false} is VALID [2022-04-27 10:17:03,323 INFO L290 TraceCheckUtils]: 71: Hoare triple {5449#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5449#false} is VALID [2022-04-27 10:17:03,323 INFO L290 TraceCheckUtils]: 72: Hoare triple {5449#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5449#false} is VALID [2022-04-27 10:17:03,323 INFO L290 TraceCheckUtils]: 73: Hoare triple {5449#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5449#false} is VALID [2022-04-27 10:17:03,323 INFO L290 TraceCheckUtils]: 74: Hoare triple {5449#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5449#false} is VALID [2022-04-27 10:17:03,323 INFO L290 TraceCheckUtils]: 75: Hoare triple {5449#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5449#false} is VALID [2022-04-27 10:17:03,323 INFO L290 TraceCheckUtils]: 76: Hoare triple {5449#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5449#false} is VALID [2022-04-27 10:17:03,323 INFO L290 TraceCheckUtils]: 77: Hoare triple {5449#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5449#false} is VALID [2022-04-27 10:17:03,324 INFO L290 TraceCheckUtils]: 78: Hoare triple {5449#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5449#false} is VALID [2022-04-27 10:17:03,324 INFO L290 TraceCheckUtils]: 79: Hoare triple {5449#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5449#false} is VALID [2022-04-27 10:17:03,324 INFO L290 TraceCheckUtils]: 80: Hoare triple {5449#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5449#false} is VALID [2022-04-27 10:17:03,324 INFO L290 TraceCheckUtils]: 81: Hoare triple {5449#false} assume !(~j~0 < ~edgecount~0); {5449#false} is VALID [2022-04-27 10:17:03,324 INFO L290 TraceCheckUtils]: 82: Hoare triple {5449#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5449#false} is VALID [2022-04-27 10:17:03,324 INFO L290 TraceCheckUtils]: 83: Hoare triple {5449#false} assume !(~i~0 < ~nodecount~0); {5449#false} is VALID [2022-04-27 10:17:03,324 INFO L290 TraceCheckUtils]: 84: Hoare triple {5449#false} ~i~0 := 0; {5449#false} is VALID [2022-04-27 10:17:03,324 INFO L290 TraceCheckUtils]: 85: Hoare triple {5449#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); {5449#false} is VALID [2022-04-27 10:17:03,324 INFO L290 TraceCheckUtils]: 86: Hoare triple {5449#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {5449#false} is VALID [2022-04-27 10:17:03,324 INFO L290 TraceCheckUtils]: 87: Hoare triple {5449#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5449#false} is VALID [2022-04-27 10:17:03,324 INFO L290 TraceCheckUtils]: 88: Hoare triple {5449#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); {5449#false} is VALID [2022-04-27 10:17:03,324 INFO L290 TraceCheckUtils]: 89: Hoare triple {5449#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {5449#false} is VALID [2022-04-27 10:17:03,324 INFO L290 TraceCheckUtils]: 90: Hoare triple {5449#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5449#false} is VALID [2022-04-27 10:17:03,324 INFO L290 TraceCheckUtils]: 91: Hoare triple {5449#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); {5449#false} is VALID [2022-04-27 10:17:03,324 INFO L290 TraceCheckUtils]: 92: Hoare triple {5449#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {5449#false} is VALID [2022-04-27 10:17:03,324 INFO L290 TraceCheckUtils]: 93: Hoare triple {5449#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5449#false} is VALID [2022-04-27 10:17:03,324 INFO L290 TraceCheckUtils]: 94: Hoare triple {5449#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); {5449#false} is VALID [2022-04-27 10:17:03,324 INFO L290 TraceCheckUtils]: 95: Hoare triple {5449#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {5449#false} is VALID [2022-04-27 10:17:03,324 INFO L290 TraceCheckUtils]: 96: Hoare triple {5449#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5449#false} is VALID [2022-04-27 10:17:03,324 INFO L290 TraceCheckUtils]: 97: Hoare triple {5449#false} assume !(~i~0 < ~edgecount~0); {5449#false} is VALID [2022-04-27 10:17:03,324 INFO L290 TraceCheckUtils]: 98: Hoare triple {5449#false} ~i~0 := 0; {5449#false} is VALID [2022-04-27 10:17:03,325 INFO L290 TraceCheckUtils]: 99: Hoare triple {5449#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5449#false} is VALID [2022-04-27 10:17:03,325 INFO L272 TraceCheckUtils]: 100: Hoare triple {5449#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {5449#false} is VALID [2022-04-27 10:17:03,325 INFO L290 TraceCheckUtils]: 101: Hoare triple {5449#false} ~cond := #in~cond; {5449#false} is VALID [2022-04-27 10:17:03,325 INFO L290 TraceCheckUtils]: 102: Hoare triple {5449#false} assume 0 == ~cond; {5449#false} is VALID [2022-04-27 10:17:03,325 INFO L290 TraceCheckUtils]: 103: Hoare triple {5449#false} assume !false; {5449#false} is VALID [2022-04-27 10:17:03,325 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 175 proven. 22 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2022-04-27 10:17:03,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:03,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262923621] [2022-04-27 10:17:03,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262923621] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:17:03,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256388786] [2022-04-27 10:17:03,325 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 10:17:03,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:03,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:17:03,327 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-27 10:17:03,328 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-27 10:17:54,177 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2022-04-27 10:17:54,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:17:54,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 10:17:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:54,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:17:54,576 INFO L272 TraceCheckUtils]: 0: Hoare triple {5448#true} call ULTIMATE.init(); {5448#true} is VALID [2022-04-27 10:17:54,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {5448#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; {5448#true} is VALID [2022-04-27 10:17:54,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {5448#true} assume true; {5448#true} is VALID [2022-04-27 10:17:54,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5448#true} {5448#true} #107#return; {5448#true} is VALID [2022-04-27 10:17:54,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {5448#true} call #t~ret22 := main(); {5448#true} is VALID [2022-04-27 10:17:54,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {5448#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {5453#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,579 INFO L290 TraceCheckUtils]: 10: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {5453#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {5453#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {5453#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,581 INFO L290 TraceCheckUtils]: 18: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,581 INFO L290 TraceCheckUtils]: 20: Hoare triple {5453#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,583 INFO L290 TraceCheckUtils]: 22: Hoare triple {5453#(<= 20 main_~edgecount~0)} ~i~0 := 0; {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,584 INFO L290 TraceCheckUtils]: 23: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,584 INFO L290 TraceCheckUtils]: 24: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,584 INFO L290 TraceCheckUtils]: 25: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,584 INFO L290 TraceCheckUtils]: 26: Hoare triple {5453#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,584 INFO L290 TraceCheckUtils]: 27: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,585 INFO L290 TraceCheckUtils]: 28: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,585 INFO L290 TraceCheckUtils]: 29: Hoare triple {5453#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,585 INFO L290 TraceCheckUtils]: 30: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,585 INFO L290 TraceCheckUtils]: 31: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,586 INFO L290 TraceCheckUtils]: 32: Hoare triple {5453#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,586 INFO L290 TraceCheckUtils]: 33: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,586 INFO L290 TraceCheckUtils]: 34: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,586 INFO L290 TraceCheckUtils]: 35: Hoare triple {5453#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,587 INFO L290 TraceCheckUtils]: 36: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,587 INFO L290 TraceCheckUtils]: 37: Hoare triple {5453#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5453#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,587 INFO L290 TraceCheckUtils]: 38: Hoare triple {5453#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5577#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-27 10:17:54,588 INFO L290 TraceCheckUtils]: 39: Hoare triple {5577#(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); {5577#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-27 10:17:54,588 INFO L290 TraceCheckUtils]: 40: Hoare triple {5577#(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; {5577#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-27 10:17:54,588 INFO L290 TraceCheckUtils]: 41: Hoare triple {5577#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5587#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:54,589 INFO L290 TraceCheckUtils]: 42: Hoare triple {5587#(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); {5587#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:54,589 INFO L290 TraceCheckUtils]: 43: Hoare triple {5587#(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; {5587#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:54,589 INFO L290 TraceCheckUtils]: 44: Hoare triple {5587#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5597#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:17:54,590 INFO L290 TraceCheckUtils]: 45: Hoare triple {5597#(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); {5597#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:17:54,590 INFO L290 TraceCheckUtils]: 46: Hoare triple {5597#(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; {5597#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:17:54,591 INFO L290 TraceCheckUtils]: 47: Hoare triple {5597#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5607#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-27 10:17:54,591 INFO L290 TraceCheckUtils]: 48: Hoare triple {5607#(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); {5607#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-27 10:17:54,591 INFO L290 TraceCheckUtils]: 49: Hoare triple {5607#(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; {5607#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-27 10:17:54,592 INFO L290 TraceCheckUtils]: 50: Hoare triple {5607#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5617#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-27 10:17:54,592 INFO L290 TraceCheckUtils]: 51: Hoare triple {5617#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !(~j~0 < ~edgecount~0); {5449#false} is VALID [2022-04-27 10:17:54,592 INFO L290 TraceCheckUtils]: 52: Hoare triple {5449#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5449#false} is VALID [2022-04-27 10:17:54,592 INFO L290 TraceCheckUtils]: 53: Hoare triple {5449#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5449#false} is VALID [2022-04-27 10:17:54,592 INFO L290 TraceCheckUtils]: 54: Hoare triple {5449#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5449#false} is VALID [2022-04-27 10:17:54,592 INFO L290 TraceCheckUtils]: 55: Hoare triple {5449#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5449#false} is VALID [2022-04-27 10:17:54,592 INFO L290 TraceCheckUtils]: 56: Hoare triple {5449#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5449#false} is VALID [2022-04-27 10:17:54,592 INFO L290 TraceCheckUtils]: 57: Hoare triple {5449#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5449#false} is VALID [2022-04-27 10:17:54,593 INFO L290 TraceCheckUtils]: 58: Hoare triple {5449#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5449#false} is VALID [2022-04-27 10:17:54,593 INFO L290 TraceCheckUtils]: 59: Hoare triple {5449#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5449#false} is VALID [2022-04-27 10:17:54,593 INFO L290 TraceCheckUtils]: 60: Hoare triple {5449#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5449#false} is VALID [2022-04-27 10:17:54,593 INFO L290 TraceCheckUtils]: 61: Hoare triple {5449#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5449#false} is VALID [2022-04-27 10:17:54,593 INFO L290 TraceCheckUtils]: 62: Hoare triple {5449#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5449#false} is VALID [2022-04-27 10:17:54,593 INFO L290 TraceCheckUtils]: 63: Hoare triple {5449#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5449#false} is VALID [2022-04-27 10:17:54,593 INFO L290 TraceCheckUtils]: 64: Hoare triple {5449#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5449#false} is VALID [2022-04-27 10:17:54,593 INFO L290 TraceCheckUtils]: 65: Hoare triple {5449#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5449#false} is VALID [2022-04-27 10:17:54,593 INFO L290 TraceCheckUtils]: 66: Hoare triple {5449#false} assume !(~j~0 < ~edgecount~0); {5449#false} is VALID [2022-04-27 10:17:54,593 INFO L290 TraceCheckUtils]: 67: Hoare triple {5449#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5449#false} is VALID [2022-04-27 10:17:54,593 INFO L290 TraceCheckUtils]: 68: Hoare triple {5449#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5449#false} is VALID [2022-04-27 10:17:54,593 INFO L290 TraceCheckUtils]: 69: Hoare triple {5449#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5449#false} is VALID [2022-04-27 10:17:54,593 INFO L290 TraceCheckUtils]: 70: Hoare triple {5449#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5449#false} is VALID [2022-04-27 10:17:54,593 INFO L290 TraceCheckUtils]: 71: Hoare triple {5449#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5449#false} is VALID [2022-04-27 10:17:54,593 INFO L290 TraceCheckUtils]: 72: Hoare triple {5449#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5449#false} is VALID [2022-04-27 10:17:54,593 INFO L290 TraceCheckUtils]: 73: Hoare triple {5449#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5449#false} is VALID [2022-04-27 10:17:54,593 INFO L290 TraceCheckUtils]: 74: Hoare triple {5449#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5449#false} is VALID [2022-04-27 10:17:54,593 INFO L290 TraceCheckUtils]: 75: Hoare triple {5449#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5449#false} is VALID [2022-04-27 10:17:54,593 INFO L290 TraceCheckUtils]: 76: Hoare triple {5449#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5449#false} is VALID [2022-04-27 10:17:54,593 INFO L290 TraceCheckUtils]: 77: Hoare triple {5449#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5449#false} is VALID [2022-04-27 10:17:54,593 INFO L290 TraceCheckUtils]: 78: Hoare triple {5449#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5449#false} is VALID [2022-04-27 10:17:54,594 INFO L290 TraceCheckUtils]: 79: Hoare triple {5449#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5449#false} is VALID [2022-04-27 10:17:54,594 INFO L290 TraceCheckUtils]: 80: Hoare triple {5449#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5449#false} is VALID [2022-04-27 10:17:54,594 INFO L290 TraceCheckUtils]: 81: Hoare triple {5449#false} assume !(~j~0 < ~edgecount~0); {5449#false} is VALID [2022-04-27 10:17:54,594 INFO L290 TraceCheckUtils]: 82: Hoare triple {5449#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5449#false} is VALID [2022-04-27 10:17:54,594 INFO L290 TraceCheckUtils]: 83: Hoare triple {5449#false} assume !(~i~0 < ~nodecount~0); {5449#false} is VALID [2022-04-27 10:17:54,594 INFO L290 TraceCheckUtils]: 84: Hoare triple {5449#false} ~i~0 := 0; {5449#false} is VALID [2022-04-27 10:17:54,594 INFO L290 TraceCheckUtils]: 85: Hoare triple {5449#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); {5449#false} is VALID [2022-04-27 10:17:54,594 INFO L290 TraceCheckUtils]: 86: Hoare triple {5449#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {5449#false} is VALID [2022-04-27 10:17:54,594 INFO L290 TraceCheckUtils]: 87: Hoare triple {5449#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5449#false} is VALID [2022-04-27 10:17:54,594 INFO L290 TraceCheckUtils]: 88: Hoare triple {5449#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); {5449#false} is VALID [2022-04-27 10:17:54,594 INFO L290 TraceCheckUtils]: 89: Hoare triple {5449#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {5449#false} is VALID [2022-04-27 10:17:54,594 INFO L290 TraceCheckUtils]: 90: Hoare triple {5449#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5449#false} is VALID [2022-04-27 10:17:54,594 INFO L290 TraceCheckUtils]: 91: Hoare triple {5449#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); {5449#false} is VALID [2022-04-27 10:17:54,594 INFO L290 TraceCheckUtils]: 92: Hoare triple {5449#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {5449#false} is VALID [2022-04-27 10:17:54,594 INFO L290 TraceCheckUtils]: 93: Hoare triple {5449#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5449#false} is VALID [2022-04-27 10:17:54,594 INFO L290 TraceCheckUtils]: 94: Hoare triple {5449#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); {5449#false} is VALID [2022-04-27 10:17:54,594 INFO L290 TraceCheckUtils]: 95: Hoare triple {5449#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {5449#false} is VALID [2022-04-27 10:17:54,594 INFO L290 TraceCheckUtils]: 96: Hoare triple {5449#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5449#false} is VALID [2022-04-27 10:17:54,594 INFO L290 TraceCheckUtils]: 97: Hoare triple {5449#false} assume !(~i~0 < ~edgecount~0); {5449#false} is VALID [2022-04-27 10:17:54,594 INFO L290 TraceCheckUtils]: 98: Hoare triple {5449#false} ~i~0 := 0; {5449#false} is VALID [2022-04-27 10:17:54,594 INFO L290 TraceCheckUtils]: 99: Hoare triple {5449#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5449#false} is VALID [2022-04-27 10:17:54,595 INFO L272 TraceCheckUtils]: 100: Hoare triple {5449#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {5449#false} is VALID [2022-04-27 10:17:54,595 INFO L290 TraceCheckUtils]: 101: Hoare triple {5449#false} ~cond := #in~cond; {5449#false} is VALID [2022-04-27 10:17:54,595 INFO L290 TraceCheckUtils]: 102: Hoare triple {5449#false} assume 0 == ~cond; {5449#false} is VALID [2022-04-27 10:17:54,595 INFO L290 TraceCheckUtils]: 103: Hoare triple {5449#false} assume !false; {5449#false} is VALID [2022-04-27 10:17:54,595 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 294 proven. 22 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2022-04-27 10:17:54,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:17:54,934 INFO L290 TraceCheckUtils]: 103: Hoare triple {5449#false} assume !false; {5449#false} is VALID [2022-04-27 10:17:54,934 INFO L290 TraceCheckUtils]: 102: Hoare triple {5449#false} assume 0 == ~cond; {5449#false} is VALID [2022-04-27 10:17:54,934 INFO L290 TraceCheckUtils]: 101: Hoare triple {5449#false} ~cond := #in~cond; {5449#false} is VALID [2022-04-27 10:17:54,934 INFO L272 TraceCheckUtils]: 100: Hoare triple {5449#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {5449#false} is VALID [2022-04-27 10:17:54,934 INFO L290 TraceCheckUtils]: 99: Hoare triple {5449#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5449#false} is VALID [2022-04-27 10:17:54,934 INFO L290 TraceCheckUtils]: 98: Hoare triple {5449#false} ~i~0 := 0; {5449#false} is VALID [2022-04-27 10:17:54,934 INFO L290 TraceCheckUtils]: 97: Hoare triple {5449#false} assume !(~i~0 < ~edgecount~0); {5449#false} is VALID [2022-04-27 10:17:54,934 INFO L290 TraceCheckUtils]: 96: Hoare triple {5449#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5449#false} is VALID [2022-04-27 10:17:54,934 INFO L290 TraceCheckUtils]: 95: Hoare triple {5449#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {5449#false} is VALID [2022-04-27 10:17:54,935 INFO L290 TraceCheckUtils]: 94: Hoare triple {5449#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); {5449#false} is VALID [2022-04-27 10:17:54,935 INFO L290 TraceCheckUtils]: 93: Hoare triple {5449#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5449#false} is VALID [2022-04-27 10:17:54,935 INFO L290 TraceCheckUtils]: 92: Hoare triple {5449#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {5449#false} is VALID [2022-04-27 10:17:54,935 INFO L290 TraceCheckUtils]: 91: Hoare triple {5449#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); {5449#false} is VALID [2022-04-27 10:17:54,935 INFO L290 TraceCheckUtils]: 90: Hoare triple {5449#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5449#false} is VALID [2022-04-27 10:17:54,935 INFO L290 TraceCheckUtils]: 89: Hoare triple {5449#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {5449#false} is VALID [2022-04-27 10:17:54,935 INFO L290 TraceCheckUtils]: 88: Hoare triple {5449#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); {5449#false} is VALID [2022-04-27 10:17:54,935 INFO L290 TraceCheckUtils]: 87: Hoare triple {5449#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5449#false} is VALID [2022-04-27 10:17:54,935 INFO L290 TraceCheckUtils]: 86: Hoare triple {5449#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {5449#false} is VALID [2022-04-27 10:17:54,935 INFO L290 TraceCheckUtils]: 85: Hoare triple {5449#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); {5449#false} is VALID [2022-04-27 10:17:54,935 INFO L290 TraceCheckUtils]: 84: Hoare triple {5449#false} ~i~0 := 0; {5449#false} is VALID [2022-04-27 10:17:54,935 INFO L290 TraceCheckUtils]: 83: Hoare triple {5449#false} assume !(~i~0 < ~nodecount~0); {5449#false} is VALID [2022-04-27 10:17:54,935 INFO L290 TraceCheckUtils]: 82: Hoare triple {5449#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5449#false} is VALID [2022-04-27 10:17:54,935 INFO L290 TraceCheckUtils]: 81: Hoare triple {5449#false} assume !(~j~0 < ~edgecount~0); {5449#false} is VALID [2022-04-27 10:17:54,935 INFO L290 TraceCheckUtils]: 80: Hoare triple {5449#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5449#false} is VALID [2022-04-27 10:17:54,935 INFO L290 TraceCheckUtils]: 79: Hoare triple {5449#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5449#false} is VALID [2022-04-27 10:17:54,935 INFO L290 TraceCheckUtils]: 78: Hoare triple {5449#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5449#false} is VALID [2022-04-27 10:17:54,935 INFO L290 TraceCheckUtils]: 77: Hoare triple {5449#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5449#false} is VALID [2022-04-27 10:17:54,935 INFO L290 TraceCheckUtils]: 76: Hoare triple {5449#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5449#false} is VALID [2022-04-27 10:17:54,935 INFO L290 TraceCheckUtils]: 75: Hoare triple {5449#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5449#false} is VALID [2022-04-27 10:17:54,936 INFO L290 TraceCheckUtils]: 74: Hoare triple {5449#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5449#false} is VALID [2022-04-27 10:17:54,936 INFO L290 TraceCheckUtils]: 73: Hoare triple {5449#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5449#false} is VALID [2022-04-27 10:17:54,936 INFO L290 TraceCheckUtils]: 72: Hoare triple {5449#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5449#false} is VALID [2022-04-27 10:17:54,936 INFO L290 TraceCheckUtils]: 71: Hoare triple {5449#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5449#false} is VALID [2022-04-27 10:17:54,936 INFO L290 TraceCheckUtils]: 70: Hoare triple {5449#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5449#false} is VALID [2022-04-27 10:17:54,936 INFO L290 TraceCheckUtils]: 69: Hoare triple {5449#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5449#false} is VALID [2022-04-27 10:17:54,936 INFO L290 TraceCheckUtils]: 68: Hoare triple {5449#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5449#false} is VALID [2022-04-27 10:17:54,936 INFO L290 TraceCheckUtils]: 67: Hoare triple {5449#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5449#false} is VALID [2022-04-27 10:17:54,936 INFO L290 TraceCheckUtils]: 66: Hoare triple {5449#false} assume !(~j~0 < ~edgecount~0); {5449#false} is VALID [2022-04-27 10:17:54,936 INFO L290 TraceCheckUtils]: 65: Hoare triple {5449#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5449#false} is VALID [2022-04-27 10:17:54,936 INFO L290 TraceCheckUtils]: 64: Hoare triple {5449#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5449#false} is VALID [2022-04-27 10:17:54,936 INFO L290 TraceCheckUtils]: 63: Hoare triple {5449#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5449#false} is VALID [2022-04-27 10:17:54,936 INFO L290 TraceCheckUtils]: 62: Hoare triple {5449#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5449#false} is VALID [2022-04-27 10:17:54,936 INFO L290 TraceCheckUtils]: 61: Hoare triple {5449#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5449#false} is VALID [2022-04-27 10:17:54,936 INFO L290 TraceCheckUtils]: 60: Hoare triple {5449#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5449#false} is VALID [2022-04-27 10:17:54,936 INFO L290 TraceCheckUtils]: 59: Hoare triple {5449#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5449#false} is VALID [2022-04-27 10:17:54,936 INFO L290 TraceCheckUtils]: 58: Hoare triple {5449#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5449#false} is VALID [2022-04-27 10:17:54,936 INFO L290 TraceCheckUtils]: 57: Hoare triple {5449#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5449#false} is VALID [2022-04-27 10:17:54,936 INFO L290 TraceCheckUtils]: 56: Hoare triple {5449#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5449#false} is VALID [2022-04-27 10:17:54,936 INFO L290 TraceCheckUtils]: 55: Hoare triple {5449#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5449#false} is VALID [2022-04-27 10:17:54,937 INFO L290 TraceCheckUtils]: 54: Hoare triple {5449#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5449#false} is VALID [2022-04-27 10:17:54,937 INFO L290 TraceCheckUtils]: 53: Hoare triple {5449#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5449#false} is VALID [2022-04-27 10:17:54,937 INFO L290 TraceCheckUtils]: 52: Hoare triple {5449#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5449#false} is VALID [2022-04-27 10:17:54,937 INFO L290 TraceCheckUtils]: 51: Hoare triple {5933#(< main_~j~0 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {5449#false} is VALID [2022-04-27 10:17:54,937 INFO L290 TraceCheckUtils]: 50: Hoare triple {5937#(< (+ main_~j~0 1) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5933#(< main_~j~0 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,937 INFO L290 TraceCheckUtils]: 49: Hoare triple {5937#(< (+ 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; {5937#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-27 10:17:54,938 INFO L290 TraceCheckUtils]: 48: Hoare triple {5937#(< (+ 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); {5937#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-27 10:17:54,938 INFO L290 TraceCheckUtils]: 47: Hoare triple {5947#(< (+ main_~j~0 2) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5937#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-27 10:17:54,938 INFO L290 TraceCheckUtils]: 46: Hoare triple {5947#(< (+ 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; {5947#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-27 10:17:54,939 INFO L290 TraceCheckUtils]: 45: Hoare triple {5947#(< (+ 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); {5947#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-27 10:17:54,939 INFO L290 TraceCheckUtils]: 44: Hoare triple {5957#(< (+ main_~j~0 3) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5947#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-27 10:17:54,940 INFO L290 TraceCheckUtils]: 43: Hoare triple {5957#(< (+ 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; {5957#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-27 10:17:54,940 INFO L290 TraceCheckUtils]: 42: Hoare triple {5957#(< (+ 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); {5957#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-27 10:17:54,940 INFO L290 TraceCheckUtils]: 41: Hoare triple {5967#(< (+ main_~j~0 4) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5957#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-27 10:17:54,941 INFO L290 TraceCheckUtils]: 40: Hoare triple {5967#(< (+ 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; {5967#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-27 10:17:54,941 INFO L290 TraceCheckUtils]: 39: Hoare triple {5967#(< (+ 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); {5967#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-27 10:17:54,941 INFO L290 TraceCheckUtils]: 38: Hoare triple {5977#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5967#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-27 10:17:54,941 INFO L290 TraceCheckUtils]: 37: Hoare triple {5977#(< 4 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5977#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,942 INFO L290 TraceCheckUtils]: 36: Hoare triple {5977#(< 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {5977#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,942 INFO L290 TraceCheckUtils]: 35: Hoare triple {5977#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5977#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,942 INFO L290 TraceCheckUtils]: 34: Hoare triple {5977#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5977#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,942 INFO L290 TraceCheckUtils]: 33: Hoare triple {5977#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5977#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,943 INFO L290 TraceCheckUtils]: 32: Hoare triple {5977#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5977#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,943 INFO L290 TraceCheckUtils]: 31: Hoare triple {5977#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5977#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,943 INFO L290 TraceCheckUtils]: 30: Hoare triple {5977#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5977#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,943 INFO L290 TraceCheckUtils]: 29: Hoare triple {5977#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5977#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,943 INFO L290 TraceCheckUtils]: 28: Hoare triple {5977#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5977#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,944 INFO L290 TraceCheckUtils]: 27: Hoare triple {5977#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5977#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,944 INFO L290 TraceCheckUtils]: 26: Hoare triple {5977#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {5977#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,944 INFO L290 TraceCheckUtils]: 25: Hoare triple {5977#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {5977#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,944 INFO L290 TraceCheckUtils]: 24: Hoare triple {5977#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5977#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {5977#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5977#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {5977#(< 4 main_~edgecount~0)} ~i~0 := 0; {5977#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {5977#(< 4 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {5977#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {5977#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5977#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {5977#(< 4 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5977#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {5977#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5977#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {5977#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5977#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {5977#(< 4 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5977#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {5977#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5977#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {5977#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5977#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {5977#(< 4 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5977#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {5977#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5977#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {5977#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5977#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {5977#(< 4 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5977#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {5977#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5977#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {5977#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5977#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {5977#(< 4 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5977#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {5977#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5977#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {5448#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {5977#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:54,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {5448#true} call #t~ret22 := main(); {5448#true} is VALID [2022-04-27 10:17:54,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5448#true} {5448#true} #107#return; {5448#true} is VALID [2022-04-27 10:17:54,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {5448#true} assume true; {5448#true} is VALID [2022-04-27 10:17:54,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {5448#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; {5448#true} is VALID [2022-04-27 10:17:54,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {5448#true} call ULTIMATE.init(); {5448#true} is VALID [2022-04-27 10:17:54,959 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 237 proven. 79 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2022-04-27 10:17:54,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256388786] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:17:54,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:17:54,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2022-04-27 10:17:54,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365965858] [2022-04-27 10:17:54,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:17:54,960 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 19 states have internal predecessors, (88), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2022-04-27 10:17:54,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:54,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 4.4) internal successors, (88), 19 states have internal predecessors, (88), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:55,019 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-27 10:17:55,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 10:17:55,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:55,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 10:17:55,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=231, Unknown=0, NotChecked=0, Total=380 [2022-04-27 10:17:55,020 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand has 20 states, 20 states have (on average 4.4) internal successors, (88), 19 states have internal predecessors, (88), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:55,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:55,635 INFO L93 Difference]: Finished difference Result 253 states and 342 transitions. [2022-04-27 10:17:55,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 10:17:55,635 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 19 states have internal predecessors, (88), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2022-04-27 10:17:55,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:55,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 4.4) internal successors, (88), 19 states have internal predecessors, (88), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:55,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 103 transitions. [2022-04-27 10:17:55,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 4.4) internal successors, (88), 19 states have internal predecessors, (88), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:55,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 103 transitions. [2022-04-27 10:17:55,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 103 transitions. [2022-04-27 10:17:55,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:55,719 INFO L225 Difference]: With dead ends: 253 [2022-04-27 10:17:55,719 INFO L226 Difference]: Without dead ends: 181 [2022-04-27 10:17:55,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=329, Invalid=601, Unknown=0, NotChecked=0, Total=930 [2022-04-27 10:17:55,720 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 130 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:17:55,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 50 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:17:55,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-04-27 10:17:55,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-04-27 10:17:55,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:17:55,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand has 181 states, 175 states have (on average 1.28) internal successors, (224), 175 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:55,966 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand has 181 states, 175 states have (on average 1.28) internal successors, (224), 175 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:55,966 INFO L87 Difference]: Start difference. First operand 181 states. Second operand has 181 states, 175 states have (on average 1.28) internal successors, (224), 175 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:55,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:55,968 INFO L93 Difference]: Finished difference Result 181 states and 229 transitions. [2022-04-27 10:17:55,968 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 229 transitions. [2022-04-27 10:17:55,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:55,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:55,969 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 175 states have (on average 1.28) internal successors, (224), 175 states have internal predecessors, (224), 3 states have call successors, (3), 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 181 states. [2022-04-27 10:17:55,969 INFO L87 Difference]: Start difference. First operand has 181 states, 175 states have (on average 1.28) internal successors, (224), 175 states have internal predecessors, (224), 3 states have call successors, (3), 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 181 states. [2022-04-27 10:17:55,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:55,972 INFO L93 Difference]: Finished difference Result 181 states and 229 transitions. [2022-04-27 10:17:55,972 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 229 transitions. [2022-04-27 10:17:55,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:55,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:55,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:17:55,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:17:55,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 175 states have (on average 1.28) internal successors, (224), 175 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:55,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 229 transitions. [2022-04-27 10:17:55,975 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 229 transitions. Word has length 104 [2022-04-27 10:17:55,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:17:55,975 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 229 transitions. [2022-04-27 10:17:55,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 19 states have internal predecessors, (88), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:55,975 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 229 transitions. [2022-04-27 10:17:55,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-04-27 10:17:55,976 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:55,976 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:17:56,007 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-27 10:17:56,194 WARN L477 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-27 10:17:56,195 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:56,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:56,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1254494148, now seen corresponding path program 6 times [2022-04-27 10:17:56,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:56,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235193007] [2022-04-27 10:17:56,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:56,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:56,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:17:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:56,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {7090#(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; {7073#true} is VALID [2022-04-27 10:17:56,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {7073#true} assume true; {7073#true} is VALID [2022-04-27 10:17:56,509 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7073#true} {7073#true} #107#return; {7073#true} is VALID [2022-04-27 10:17:56,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {7073#true} call ULTIMATE.init(); {7090#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:17:56,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {7090#(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; {7073#true} is VALID [2022-04-27 10:17:56,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {7073#true} assume true; {7073#true} is VALID [2022-04-27 10:17:56,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7073#true} {7073#true} #107#return; {7073#true} is VALID [2022-04-27 10:17:56,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {7073#true} call #t~ret22 := main(); {7073#true} is VALID [2022-04-27 10:17:56,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {7073#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {7078#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-27 10:17:56,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {7078#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {7078#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-27 10:17:56,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {7078#(= (+ (- 20) main_~edgecount~0) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7078#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-27 10:17:56,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {7078#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7078#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-27 10:17:56,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {7078#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {7078#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-27 10:17:56,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {7078#(= (+ (- 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); {7078#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-27 10:17:56,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {7078#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7078#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-27 10:17:56,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {7078#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {7078#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-27 10:17:56,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {7078#(= (+ (- 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); {7078#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-27 10:17:56,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {7078#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7078#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-27 10:17:56,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {7078#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {7078#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-27 10:17:56,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {7078#(= (+ (- 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); {7078#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-27 10:17:56,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {7078#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7078#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-27 10:17:56,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {7078#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0); {7078#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-27 10:17:56,515 INFO L290 TraceCheckUtils]: 19: Hoare triple {7078#(= (+ (- 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); {7078#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-27 10:17:56,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {7078#(= (+ (- 20) main_~edgecount~0) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7078#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-27 10:17:56,515 INFO L290 TraceCheckUtils]: 21: Hoare triple {7078#(= (+ (- 20) main_~edgecount~0) 0)} assume !(~i~0 < ~nodecount~0); {7078#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-27 10:17:56,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {7078#(= (+ (- 20) main_~edgecount~0) 0)} ~i~0 := 0; {7078#(= (+ (- 20) main_~edgecount~0) 0)} is VALID [2022-04-27 10:17:56,516 INFO L290 TraceCheckUtils]: 23: Hoare triple {7078#(= (+ (- 20) main_~edgecount~0) 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7079#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-27 10:17:56,516 INFO L290 TraceCheckUtils]: 24: Hoare triple {7079#(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); {7079#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-27 10:17:56,517 INFO L290 TraceCheckUtils]: 25: Hoare triple {7079#(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; {7079#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-27 10:17:56,517 INFO L290 TraceCheckUtils]: 26: Hoare triple {7079#(and (= main_~j~0 0) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7080#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:56,517 INFO L290 TraceCheckUtils]: 27: Hoare triple {7080#(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); {7080#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:56,518 INFO L290 TraceCheckUtils]: 28: Hoare triple {7080#(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; {7080#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:56,518 INFO L290 TraceCheckUtils]: 29: Hoare triple {7080#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7081#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-27 10:17:56,519 INFO L290 TraceCheckUtils]: 30: Hoare triple {7081#(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); {7081#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-27 10:17:56,519 INFO L290 TraceCheckUtils]: 31: Hoare triple {7081#(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; {7081#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-27 10:17:56,520 INFO L290 TraceCheckUtils]: 32: Hoare triple {7081#(and (<= main_~j~0 2) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7082#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-27 10:17:56,520 INFO L290 TraceCheckUtils]: 33: Hoare triple {7082#(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); {7082#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-27 10:17:56,520 INFO L290 TraceCheckUtils]: 34: Hoare triple {7082#(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; {7082#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} is VALID [2022-04-27 10:17:56,521 INFO L290 TraceCheckUtils]: 35: Hoare triple {7082#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7083#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-27 10:17:56,521 INFO L290 TraceCheckUtils]: 36: Hoare triple {7083#(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); {7083#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-27 10:17:56,522 INFO L290 TraceCheckUtils]: 37: Hoare triple {7083#(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; {7083#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} is VALID [2022-04-27 10:17:56,522 INFO L290 TraceCheckUtils]: 38: Hoare triple {7083#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7084#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-27 10:17:56,523 INFO L290 TraceCheckUtils]: 39: Hoare triple {7084#(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); {7084#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-27 10:17:56,523 INFO L290 TraceCheckUtils]: 40: Hoare triple {7084#(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; {7084#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} is VALID [2022-04-27 10:17:56,523 INFO L290 TraceCheckUtils]: 41: Hoare triple {7084#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7085#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-27 10:17:56,524 INFO L290 TraceCheckUtils]: 42: Hoare triple {7085#(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); {7085#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-27 10:17:56,524 INFO L290 TraceCheckUtils]: 43: Hoare triple {7085#(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; {7085#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-27 10:17:56,525 INFO L290 TraceCheckUtils]: 44: Hoare triple {7085#(and (<= main_~j~0 6) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7086#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-27 10:17:56,525 INFO L290 TraceCheckUtils]: 45: Hoare triple {7086#(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); {7086#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-27 10:17:56,526 INFO L290 TraceCheckUtils]: 46: Hoare triple {7086#(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; {7086#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-27 10:17:56,526 INFO L290 TraceCheckUtils]: 47: Hoare triple {7086#(and (<= main_~j~0 7) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7087#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-27 10:17:56,526 INFO L290 TraceCheckUtils]: 48: Hoare triple {7087#(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); {7087#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-27 10:17:56,527 INFO L290 TraceCheckUtils]: 49: Hoare triple {7087#(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; {7087#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-27 10:17:56,527 INFO L290 TraceCheckUtils]: 50: Hoare triple {7087#(and (<= main_~j~0 8) (= (+ (- 20) main_~edgecount~0) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7088#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-27 10:17:56,528 INFO L290 TraceCheckUtils]: 51: Hoare triple {7088#(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); {7088#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-27 10:17:56,528 INFO L290 TraceCheckUtils]: 52: Hoare triple {7088#(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; {7088#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} is VALID [2022-04-27 10:17:56,528 INFO L290 TraceCheckUtils]: 53: Hoare triple {7088#(and (= (+ (- 20) main_~edgecount~0) 0) (<= main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7089#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} is VALID [2022-04-27 10:17:56,529 INFO L290 TraceCheckUtils]: 54: Hoare triple {7089#(and (<= main_~j~0 10) (= (+ (- 20) main_~edgecount~0) 0))} assume !(~j~0 < ~edgecount~0); {7074#false} is VALID [2022-04-27 10:17:56,529 INFO L290 TraceCheckUtils]: 55: Hoare triple {7074#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7074#false} is VALID [2022-04-27 10:17:56,529 INFO L290 TraceCheckUtils]: 56: Hoare triple {7074#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7074#false} is VALID [2022-04-27 10:17:56,529 INFO L290 TraceCheckUtils]: 57: Hoare triple {7074#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7074#false} is VALID [2022-04-27 10:17:56,529 INFO L290 TraceCheckUtils]: 58: Hoare triple {7074#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7074#false} is VALID [2022-04-27 10:17:56,529 INFO L290 TraceCheckUtils]: 59: Hoare triple {7074#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7074#false} is VALID [2022-04-27 10:17:56,529 INFO L290 TraceCheckUtils]: 60: Hoare triple {7074#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7074#false} is VALID [2022-04-27 10:17:56,529 INFO L290 TraceCheckUtils]: 61: Hoare triple {7074#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7074#false} is VALID [2022-04-27 10:17:56,529 INFO L290 TraceCheckUtils]: 62: Hoare triple {7074#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7074#false} is VALID [2022-04-27 10:17:56,529 INFO L290 TraceCheckUtils]: 63: Hoare triple {7074#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7074#false} is VALID [2022-04-27 10:17:56,529 INFO L290 TraceCheckUtils]: 64: Hoare triple {7074#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7074#false} is VALID [2022-04-27 10:17:56,529 INFO L290 TraceCheckUtils]: 65: Hoare triple {7074#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7074#false} is VALID [2022-04-27 10:17:56,529 INFO L290 TraceCheckUtils]: 66: Hoare triple {7074#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7074#false} is VALID [2022-04-27 10:17:56,529 INFO L290 TraceCheckUtils]: 67: Hoare triple {7074#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7074#false} is VALID [2022-04-27 10:17:56,530 INFO L290 TraceCheckUtils]: 68: Hoare triple {7074#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7074#false} is VALID [2022-04-27 10:17:56,530 INFO L290 TraceCheckUtils]: 69: Hoare triple {7074#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7074#false} is VALID [2022-04-27 10:17:56,530 INFO L290 TraceCheckUtils]: 70: Hoare triple {7074#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7074#false} is VALID [2022-04-27 10:17:56,530 INFO L290 TraceCheckUtils]: 71: Hoare triple {7074#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7074#false} is VALID [2022-04-27 10:17:56,530 INFO L290 TraceCheckUtils]: 72: Hoare triple {7074#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7074#false} is VALID [2022-04-27 10:17:56,530 INFO L290 TraceCheckUtils]: 73: Hoare triple {7074#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7074#false} is VALID [2022-04-27 10:17:56,530 INFO L290 TraceCheckUtils]: 74: Hoare triple {7074#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7074#false} is VALID [2022-04-27 10:17:56,530 INFO L290 TraceCheckUtils]: 75: Hoare triple {7074#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7074#false} is VALID [2022-04-27 10:17:56,530 INFO L290 TraceCheckUtils]: 76: Hoare triple {7074#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7074#false} is VALID [2022-04-27 10:17:56,530 INFO L290 TraceCheckUtils]: 77: Hoare triple {7074#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7074#false} is VALID [2022-04-27 10:17:56,530 INFO L290 TraceCheckUtils]: 78: Hoare triple {7074#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7074#false} is VALID [2022-04-27 10:17:56,530 INFO L290 TraceCheckUtils]: 79: Hoare triple {7074#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7074#false} is VALID [2022-04-27 10:17:56,530 INFO L290 TraceCheckUtils]: 80: Hoare triple {7074#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7074#false} is VALID [2022-04-27 10:17:56,530 INFO L290 TraceCheckUtils]: 81: Hoare triple {7074#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7074#false} is VALID [2022-04-27 10:17:56,530 INFO L290 TraceCheckUtils]: 82: Hoare triple {7074#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7074#false} is VALID [2022-04-27 10:17:56,530 INFO L290 TraceCheckUtils]: 83: Hoare triple {7074#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7074#false} is VALID [2022-04-27 10:17:56,530 INFO L290 TraceCheckUtils]: 84: Hoare triple {7074#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7074#false} is VALID [2022-04-27 10:17:56,530 INFO L290 TraceCheckUtils]: 85: Hoare triple {7074#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7074#false} is VALID [2022-04-27 10:17:56,530 INFO L290 TraceCheckUtils]: 86: Hoare triple {7074#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7074#false} is VALID [2022-04-27 10:17:56,530 INFO L290 TraceCheckUtils]: 87: Hoare triple {7074#false} assume !(~j~0 < ~edgecount~0); {7074#false} is VALID [2022-04-27 10:17:56,530 INFO L290 TraceCheckUtils]: 88: Hoare triple {7074#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7074#false} is VALID [2022-04-27 10:17:56,531 INFO L290 TraceCheckUtils]: 89: Hoare triple {7074#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7074#false} is VALID [2022-04-27 10:17:56,531 INFO L290 TraceCheckUtils]: 90: Hoare triple {7074#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7074#false} is VALID [2022-04-27 10:17:56,531 INFO L290 TraceCheckUtils]: 91: Hoare triple {7074#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7074#false} is VALID [2022-04-27 10:17:56,531 INFO L290 TraceCheckUtils]: 92: Hoare triple {7074#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7074#false} is VALID [2022-04-27 10:17:56,531 INFO L290 TraceCheckUtils]: 93: Hoare triple {7074#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7074#false} is VALID [2022-04-27 10:17:56,531 INFO L290 TraceCheckUtils]: 94: Hoare triple {7074#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7074#false} is VALID [2022-04-27 10:17:56,531 INFO L290 TraceCheckUtils]: 95: Hoare triple {7074#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7074#false} is VALID [2022-04-27 10:17:56,531 INFO L290 TraceCheckUtils]: 96: Hoare triple {7074#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7074#false} is VALID [2022-04-27 10:17:56,531 INFO L290 TraceCheckUtils]: 97: Hoare triple {7074#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7074#false} is VALID [2022-04-27 10:17:56,531 INFO L290 TraceCheckUtils]: 98: Hoare triple {7074#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7074#false} is VALID [2022-04-27 10:17:56,531 INFO L290 TraceCheckUtils]: 99: Hoare triple {7074#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7074#false} is VALID [2022-04-27 10:17:56,531 INFO L290 TraceCheckUtils]: 100: Hoare triple {7074#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7074#false} is VALID [2022-04-27 10:17:56,531 INFO L290 TraceCheckUtils]: 101: Hoare triple {7074#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7074#false} is VALID [2022-04-27 10:17:56,531 INFO L290 TraceCheckUtils]: 102: Hoare triple {7074#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7074#false} is VALID [2022-04-27 10:17:56,531 INFO L290 TraceCheckUtils]: 103: Hoare triple {7074#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7074#false} is VALID [2022-04-27 10:17:56,531 INFO L290 TraceCheckUtils]: 104: Hoare triple {7074#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7074#false} is VALID [2022-04-27 10:17:56,531 INFO L290 TraceCheckUtils]: 105: Hoare triple {7074#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7074#false} is VALID [2022-04-27 10:17:56,531 INFO L290 TraceCheckUtils]: 106: Hoare triple {7074#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7074#false} is VALID [2022-04-27 10:17:56,531 INFO L290 TraceCheckUtils]: 107: Hoare triple {7074#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7074#false} is VALID [2022-04-27 10:17:56,531 INFO L290 TraceCheckUtils]: 108: Hoare triple {7074#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7074#false} is VALID [2022-04-27 10:17:56,531 INFO L290 TraceCheckUtils]: 109: Hoare triple {7074#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7074#false} is VALID [2022-04-27 10:17:56,532 INFO L290 TraceCheckUtils]: 110: Hoare triple {7074#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7074#false} is VALID [2022-04-27 10:17:56,532 INFO L290 TraceCheckUtils]: 111: Hoare triple {7074#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7074#false} is VALID [2022-04-27 10:17:56,532 INFO L290 TraceCheckUtils]: 112: Hoare triple {7074#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7074#false} is VALID [2022-04-27 10:17:56,532 INFO L290 TraceCheckUtils]: 113: Hoare triple {7074#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7074#false} is VALID [2022-04-27 10:17:56,532 INFO L290 TraceCheckUtils]: 114: Hoare triple {7074#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7074#false} is VALID [2022-04-27 10:17:56,532 INFO L290 TraceCheckUtils]: 115: Hoare triple {7074#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7074#false} is VALID [2022-04-27 10:17:56,532 INFO L290 TraceCheckUtils]: 116: Hoare triple {7074#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7074#false} is VALID [2022-04-27 10:17:56,532 INFO L290 TraceCheckUtils]: 117: Hoare triple {7074#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7074#false} is VALID [2022-04-27 10:17:56,532 INFO L290 TraceCheckUtils]: 118: Hoare triple {7074#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7074#false} is VALID [2022-04-27 10:17:56,532 INFO L290 TraceCheckUtils]: 119: Hoare triple {7074#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7074#false} is VALID [2022-04-27 10:17:56,532 INFO L290 TraceCheckUtils]: 120: Hoare triple {7074#false} assume !(~j~0 < ~edgecount~0); {7074#false} is VALID [2022-04-27 10:17:56,532 INFO L290 TraceCheckUtils]: 121: Hoare triple {7074#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7074#false} is VALID [2022-04-27 10:17:56,532 INFO L290 TraceCheckUtils]: 122: Hoare triple {7074#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7074#false} is VALID [2022-04-27 10:17:56,532 INFO L290 TraceCheckUtils]: 123: Hoare triple {7074#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7074#false} is VALID [2022-04-27 10:17:56,532 INFO L290 TraceCheckUtils]: 124: Hoare triple {7074#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7074#false} is VALID [2022-04-27 10:17:56,532 INFO L290 TraceCheckUtils]: 125: Hoare triple {7074#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7074#false} is VALID [2022-04-27 10:17:56,532 INFO L290 TraceCheckUtils]: 126: Hoare triple {7074#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7074#false} is VALID [2022-04-27 10:17:56,532 INFO L290 TraceCheckUtils]: 127: Hoare triple {7074#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7074#false} is VALID [2022-04-27 10:17:56,532 INFO L290 TraceCheckUtils]: 128: Hoare triple {7074#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7074#false} is VALID [2022-04-27 10:17:56,532 INFO L290 TraceCheckUtils]: 129: Hoare triple {7074#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7074#false} is VALID [2022-04-27 10:17:56,532 INFO L290 TraceCheckUtils]: 130: Hoare triple {7074#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7074#false} is VALID [2022-04-27 10:17:56,533 INFO L290 TraceCheckUtils]: 131: Hoare triple {7074#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7074#false} is VALID [2022-04-27 10:17:56,533 INFO L290 TraceCheckUtils]: 132: Hoare triple {7074#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7074#false} is VALID [2022-04-27 10:17:56,533 INFO L290 TraceCheckUtils]: 133: Hoare triple {7074#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7074#false} is VALID [2022-04-27 10:17:56,533 INFO L290 TraceCheckUtils]: 134: Hoare triple {7074#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7074#false} is VALID [2022-04-27 10:17:56,533 INFO L290 TraceCheckUtils]: 135: Hoare triple {7074#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7074#false} is VALID [2022-04-27 10:17:56,533 INFO L290 TraceCheckUtils]: 136: Hoare triple {7074#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7074#false} is VALID [2022-04-27 10:17:56,533 INFO L290 TraceCheckUtils]: 137: Hoare triple {7074#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7074#false} is VALID [2022-04-27 10:17:56,533 INFO L290 TraceCheckUtils]: 138: Hoare triple {7074#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7074#false} is VALID [2022-04-27 10:17:56,533 INFO L290 TraceCheckUtils]: 139: Hoare triple {7074#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7074#false} is VALID [2022-04-27 10:17:56,533 INFO L290 TraceCheckUtils]: 140: Hoare triple {7074#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7074#false} is VALID [2022-04-27 10:17:56,533 INFO L290 TraceCheckUtils]: 141: Hoare triple {7074#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7074#false} is VALID [2022-04-27 10:17:56,533 INFO L290 TraceCheckUtils]: 142: Hoare triple {7074#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7074#false} is VALID [2022-04-27 10:17:56,533 INFO L290 TraceCheckUtils]: 143: Hoare triple {7074#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7074#false} is VALID [2022-04-27 10:17:56,533 INFO L290 TraceCheckUtils]: 144: Hoare triple {7074#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7074#false} is VALID [2022-04-27 10:17:56,533 INFO L290 TraceCheckUtils]: 145: Hoare triple {7074#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7074#false} is VALID [2022-04-27 10:17:56,533 INFO L290 TraceCheckUtils]: 146: Hoare triple {7074#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7074#false} is VALID [2022-04-27 10:17:56,533 INFO L290 TraceCheckUtils]: 147: Hoare triple {7074#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7074#false} is VALID [2022-04-27 10:17:56,533 INFO L290 TraceCheckUtils]: 148: Hoare triple {7074#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7074#false} is VALID [2022-04-27 10:17:56,533 INFO L290 TraceCheckUtils]: 149: Hoare triple {7074#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7074#false} is VALID [2022-04-27 10:17:56,533 INFO L290 TraceCheckUtils]: 150: Hoare triple {7074#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7074#false} is VALID [2022-04-27 10:17:56,533 INFO L290 TraceCheckUtils]: 151: Hoare triple {7074#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7074#false} is VALID [2022-04-27 10:17:56,534 INFO L290 TraceCheckUtils]: 152: Hoare triple {7074#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7074#false} is VALID [2022-04-27 10:17:56,534 INFO L290 TraceCheckUtils]: 153: Hoare triple {7074#false} assume !(~j~0 < ~edgecount~0); {7074#false} is VALID [2022-04-27 10:17:56,534 INFO L290 TraceCheckUtils]: 154: Hoare triple {7074#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7074#false} is VALID [2022-04-27 10:17:56,534 INFO L290 TraceCheckUtils]: 155: Hoare triple {7074#false} assume !(~i~0 < ~nodecount~0); {7074#false} is VALID [2022-04-27 10:17:56,534 INFO L290 TraceCheckUtils]: 156: Hoare triple {7074#false} ~i~0 := 0; {7074#false} is VALID [2022-04-27 10:17:56,534 INFO L290 TraceCheckUtils]: 157: Hoare triple {7074#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); {7074#false} is VALID [2022-04-27 10:17:56,534 INFO L290 TraceCheckUtils]: 158: Hoare triple {7074#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {7074#false} is VALID [2022-04-27 10:17:56,534 INFO L290 TraceCheckUtils]: 159: Hoare triple {7074#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7074#false} is VALID [2022-04-27 10:17:56,534 INFO L290 TraceCheckUtils]: 160: Hoare triple {7074#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); {7074#false} is VALID [2022-04-27 10:17:56,534 INFO L290 TraceCheckUtils]: 161: Hoare triple {7074#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {7074#false} is VALID [2022-04-27 10:17:56,534 INFO L290 TraceCheckUtils]: 162: Hoare triple {7074#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7074#false} is VALID [2022-04-27 10:17:56,534 INFO L290 TraceCheckUtils]: 163: Hoare triple {7074#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); {7074#false} is VALID [2022-04-27 10:17:56,534 INFO L290 TraceCheckUtils]: 164: Hoare triple {7074#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {7074#false} is VALID [2022-04-27 10:17:56,534 INFO L290 TraceCheckUtils]: 165: Hoare triple {7074#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7074#false} is VALID [2022-04-27 10:17:56,534 INFO L290 TraceCheckUtils]: 166: Hoare triple {7074#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); {7074#false} is VALID [2022-04-27 10:17:56,534 INFO L290 TraceCheckUtils]: 167: Hoare triple {7074#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {7074#false} is VALID [2022-04-27 10:17:56,534 INFO L290 TraceCheckUtils]: 168: Hoare triple {7074#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7074#false} is VALID [2022-04-27 10:17:56,534 INFO L290 TraceCheckUtils]: 169: Hoare triple {7074#false} assume !(~i~0 < ~edgecount~0); {7074#false} is VALID [2022-04-27 10:17:56,534 INFO L290 TraceCheckUtils]: 170: Hoare triple {7074#false} ~i~0 := 0; {7074#false} is VALID [2022-04-27 10:17:56,534 INFO L290 TraceCheckUtils]: 171: Hoare triple {7074#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7074#false} is VALID [2022-04-27 10:17:56,534 INFO L272 TraceCheckUtils]: 172: Hoare triple {7074#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {7074#false} is VALID [2022-04-27 10:17:56,535 INFO L290 TraceCheckUtils]: 173: Hoare triple {7074#false} ~cond := #in~cond; {7074#false} is VALID [2022-04-27 10:17:56,535 INFO L290 TraceCheckUtils]: 174: Hoare triple {7074#false} assume 0 == ~cond; {7074#false} is VALID [2022-04-27 10:17:56,535 INFO L290 TraceCheckUtils]: 175: Hoare triple {7074#false} assume !false; {7074#false} is VALID [2022-04-27 10:17:56,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2579 backedges. 967 proven. 145 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2022-04-27 10:17:56,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:56,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235193007] [2022-04-27 10:17:56,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235193007] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:17:56,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403448795] [2022-04-27 10:17:56,536 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 10:17:56,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:56,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:17:56,537 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-27 10:17:56,538 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-27 10:17:57,232 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-27 10:17:57,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:17:57,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 10:17:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:57,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:17:57,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {7073#true} call ULTIMATE.init(); {7073#true} is VALID [2022-04-27 10:17:57,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {7073#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; {7073#true} is VALID [2022-04-27 10:17:57,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {7073#true} assume true; {7073#true} is VALID [2022-04-27 10:17:57,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7073#true} {7073#true} #107#return; {7073#true} is VALID [2022-04-27 10:17:57,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {7073#true} call #t~ret22 := main(); {7073#true} is VALID [2022-04-27 10:17:57,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {7073#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,901 INFO L290 TraceCheckUtils]: 17: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,902 INFO L290 TraceCheckUtils]: 19: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,902 INFO L290 TraceCheckUtils]: 20: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,902 INFO L290 TraceCheckUtils]: 21: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,903 INFO L290 TraceCheckUtils]: 22: Hoare triple {7109#(<= 20 main_~edgecount~0)} ~i~0 := 0; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,903 INFO L290 TraceCheckUtils]: 23: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,904 INFO L290 TraceCheckUtils]: 26: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,904 INFO L290 TraceCheckUtils]: 27: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,904 INFO L290 TraceCheckUtils]: 28: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,904 INFO L290 TraceCheckUtils]: 29: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,904 INFO L290 TraceCheckUtils]: 30: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,905 INFO L290 TraceCheckUtils]: 31: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,905 INFO L290 TraceCheckUtils]: 32: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,905 INFO L290 TraceCheckUtils]: 33: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,907 INFO L290 TraceCheckUtils]: 34: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,907 INFO L290 TraceCheckUtils]: 35: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,907 INFO L290 TraceCheckUtils]: 36: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,908 INFO L290 TraceCheckUtils]: 37: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,908 INFO L290 TraceCheckUtils]: 38: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,908 INFO L290 TraceCheckUtils]: 39: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,908 INFO L290 TraceCheckUtils]: 40: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,908 INFO L290 TraceCheckUtils]: 41: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,909 INFO L290 TraceCheckUtils]: 42: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,909 INFO L290 TraceCheckUtils]: 43: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,909 INFO L290 TraceCheckUtils]: 44: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,909 INFO L290 TraceCheckUtils]: 45: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,910 INFO L290 TraceCheckUtils]: 46: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,910 INFO L290 TraceCheckUtils]: 47: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,910 INFO L290 TraceCheckUtils]: 48: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,910 INFO L290 TraceCheckUtils]: 49: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,911 INFO L290 TraceCheckUtils]: 50: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,911 INFO L290 TraceCheckUtils]: 51: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,911 INFO L290 TraceCheckUtils]: 52: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,911 INFO L290 TraceCheckUtils]: 53: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,911 INFO L290 TraceCheckUtils]: 54: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,912 INFO L290 TraceCheckUtils]: 55: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,912 INFO L290 TraceCheckUtils]: 56: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,912 INFO L290 TraceCheckUtils]: 57: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,912 INFO L290 TraceCheckUtils]: 58: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,939 INFO L290 TraceCheckUtils]: 59: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,939 INFO L290 TraceCheckUtils]: 60: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,940 INFO L290 TraceCheckUtils]: 61: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,940 INFO L290 TraceCheckUtils]: 62: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,940 INFO L290 TraceCheckUtils]: 63: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,940 INFO L290 TraceCheckUtils]: 64: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,941 INFO L290 TraceCheckUtils]: 65: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,941 INFO L290 TraceCheckUtils]: 66: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,941 INFO L290 TraceCheckUtils]: 67: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,941 INFO L290 TraceCheckUtils]: 68: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,942 INFO L290 TraceCheckUtils]: 69: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,942 INFO L290 TraceCheckUtils]: 70: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,942 INFO L290 TraceCheckUtils]: 71: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,942 INFO L290 TraceCheckUtils]: 72: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,942 INFO L290 TraceCheckUtils]: 73: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,943 INFO L290 TraceCheckUtils]: 74: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,943 INFO L290 TraceCheckUtils]: 75: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,943 INFO L290 TraceCheckUtils]: 76: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,943 INFO L290 TraceCheckUtils]: 77: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,944 INFO L290 TraceCheckUtils]: 78: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,944 INFO L290 TraceCheckUtils]: 79: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,944 INFO L290 TraceCheckUtils]: 80: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,944 INFO L290 TraceCheckUtils]: 81: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,945 INFO L290 TraceCheckUtils]: 82: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,945 INFO L290 TraceCheckUtils]: 83: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,945 INFO L290 TraceCheckUtils]: 84: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,945 INFO L290 TraceCheckUtils]: 85: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,945 INFO L290 TraceCheckUtils]: 86: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,946 INFO L290 TraceCheckUtils]: 87: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,946 INFO L290 TraceCheckUtils]: 88: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,946 INFO L290 TraceCheckUtils]: 89: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,946 INFO L290 TraceCheckUtils]: 90: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,947 INFO L290 TraceCheckUtils]: 91: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,947 INFO L290 TraceCheckUtils]: 92: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,947 INFO L290 TraceCheckUtils]: 93: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,947 INFO L290 TraceCheckUtils]: 94: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,948 INFO L290 TraceCheckUtils]: 95: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,948 INFO L290 TraceCheckUtils]: 96: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,948 INFO L290 TraceCheckUtils]: 97: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,948 INFO L290 TraceCheckUtils]: 98: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,948 INFO L290 TraceCheckUtils]: 99: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,949 INFO L290 TraceCheckUtils]: 100: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,949 INFO L290 TraceCheckUtils]: 101: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,949 INFO L290 TraceCheckUtils]: 102: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,949 INFO L290 TraceCheckUtils]: 103: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,950 INFO L290 TraceCheckUtils]: 104: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,950 INFO L290 TraceCheckUtils]: 105: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,950 INFO L290 TraceCheckUtils]: 106: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,950 INFO L290 TraceCheckUtils]: 107: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,951 INFO L290 TraceCheckUtils]: 108: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,951 INFO L290 TraceCheckUtils]: 109: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,951 INFO L290 TraceCheckUtils]: 110: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,951 INFO L290 TraceCheckUtils]: 111: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,952 INFO L290 TraceCheckUtils]: 112: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,952 INFO L290 TraceCheckUtils]: 113: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,952 INFO L290 TraceCheckUtils]: 114: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,952 INFO L290 TraceCheckUtils]: 115: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,952 INFO L290 TraceCheckUtils]: 116: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,953 INFO L290 TraceCheckUtils]: 117: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,953 INFO L290 TraceCheckUtils]: 118: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,953 INFO L290 TraceCheckUtils]: 119: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,953 INFO L290 TraceCheckUtils]: 120: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,954 INFO L290 TraceCheckUtils]: 121: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,954 INFO L290 TraceCheckUtils]: 122: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,954 INFO L290 TraceCheckUtils]: 123: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,954 INFO L290 TraceCheckUtils]: 124: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,954 INFO L290 TraceCheckUtils]: 125: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,955 INFO L290 TraceCheckUtils]: 126: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,955 INFO L290 TraceCheckUtils]: 127: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,955 INFO L290 TraceCheckUtils]: 128: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,955 INFO L290 TraceCheckUtils]: 129: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,956 INFO L290 TraceCheckUtils]: 130: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,956 INFO L290 TraceCheckUtils]: 131: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,956 INFO L290 TraceCheckUtils]: 132: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,956 INFO L290 TraceCheckUtils]: 133: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,957 INFO L290 TraceCheckUtils]: 134: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,957 INFO L290 TraceCheckUtils]: 135: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,957 INFO L290 TraceCheckUtils]: 136: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,957 INFO L290 TraceCheckUtils]: 137: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,958 INFO L290 TraceCheckUtils]: 138: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,958 INFO L290 TraceCheckUtils]: 139: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,958 INFO L290 TraceCheckUtils]: 140: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,958 INFO L290 TraceCheckUtils]: 141: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,959 INFO L290 TraceCheckUtils]: 142: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,959 INFO L290 TraceCheckUtils]: 143: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,959 INFO L290 TraceCheckUtils]: 144: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,959 INFO L290 TraceCheckUtils]: 145: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,960 INFO L290 TraceCheckUtils]: 146: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,960 INFO L290 TraceCheckUtils]: 147: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,960 INFO L290 TraceCheckUtils]: 148: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,960 INFO L290 TraceCheckUtils]: 149: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,960 INFO L290 TraceCheckUtils]: 150: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,961 INFO L290 TraceCheckUtils]: 151: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,961 INFO L290 TraceCheckUtils]: 152: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,961 INFO L290 TraceCheckUtils]: 153: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,961 INFO L290 TraceCheckUtils]: 154: Hoare triple {7109#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,962 INFO L290 TraceCheckUtils]: 155: Hoare triple {7109#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {7109#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:17:57,962 INFO L290 TraceCheckUtils]: 156: Hoare triple {7109#(<= 20 main_~edgecount~0)} ~i~0 := 0; {7563#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:17:57,962 INFO L290 TraceCheckUtils]: 157: Hoare triple {7563#(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); {7563#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:17:57,963 INFO L290 TraceCheckUtils]: 158: Hoare triple {7563#(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; {7563#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:17:57,963 INFO L290 TraceCheckUtils]: 159: Hoare triple {7563#(and (<= main_~i~0 0) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7573#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:17:57,963 INFO L290 TraceCheckUtils]: 160: Hoare triple {7573#(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); {7573#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:17:57,985 INFO L290 TraceCheckUtils]: 161: Hoare triple {7573#(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; {7573#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:17:57,986 INFO L290 TraceCheckUtils]: 162: Hoare triple {7573#(and (<= main_~i~0 1) (<= 20 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7583#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:17:57,986 INFO L290 TraceCheckUtils]: 163: Hoare triple {7583#(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); {7583#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:17:57,987 INFO L290 TraceCheckUtils]: 164: Hoare triple {7583#(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; {7583#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:17:57,987 INFO L290 TraceCheckUtils]: 165: Hoare triple {7583#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7593#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:17:57,987 INFO L290 TraceCheckUtils]: 166: Hoare triple {7593#(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); {7593#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:17:57,988 INFO L290 TraceCheckUtils]: 167: Hoare triple {7593#(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; {7593#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:17:57,988 INFO L290 TraceCheckUtils]: 168: Hoare triple {7593#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7603#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} is VALID [2022-04-27 10:17:57,988 INFO L290 TraceCheckUtils]: 169: Hoare triple {7603#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} assume !(~i~0 < ~edgecount~0); {7074#false} is VALID [2022-04-27 10:17:57,988 INFO L290 TraceCheckUtils]: 170: Hoare triple {7074#false} ~i~0 := 0; {7074#false} is VALID [2022-04-27 10:17:57,988 INFO L290 TraceCheckUtils]: 171: Hoare triple {7074#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7074#false} is VALID [2022-04-27 10:17:57,989 INFO L272 TraceCheckUtils]: 172: Hoare triple {7074#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {7074#false} is VALID [2022-04-27 10:17:57,989 INFO L290 TraceCheckUtils]: 173: Hoare triple {7074#false} ~cond := #in~cond; {7074#false} is VALID [2022-04-27 10:17:57,989 INFO L290 TraceCheckUtils]: 174: Hoare triple {7074#false} assume 0 == ~cond; {7074#false} is VALID [2022-04-27 10:17:57,989 INFO L290 TraceCheckUtils]: 175: Hoare triple {7074#false} assume !false; {7074#false} is VALID [2022-04-27 10:17:57,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2579 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2557 trivial. 0 not checked. [2022-04-27 10:17:57,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:17:58,539 INFO L290 TraceCheckUtils]: 175: Hoare triple {7074#false} assume !false; {7074#false} is VALID [2022-04-27 10:17:58,539 INFO L290 TraceCheckUtils]: 174: Hoare triple {7074#false} assume 0 == ~cond; {7074#false} is VALID [2022-04-27 10:17:58,539 INFO L290 TraceCheckUtils]: 173: Hoare triple {7074#false} ~cond := #in~cond; {7074#false} is VALID [2022-04-27 10:17:58,539 INFO L272 TraceCheckUtils]: 172: Hoare triple {7074#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {7074#false} is VALID [2022-04-27 10:17:58,539 INFO L290 TraceCheckUtils]: 171: Hoare triple {7074#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7074#false} is VALID [2022-04-27 10:17:58,539 INFO L290 TraceCheckUtils]: 170: Hoare triple {7074#false} ~i~0 := 0; {7074#false} is VALID [2022-04-27 10:17:58,539 INFO L290 TraceCheckUtils]: 169: Hoare triple {7643#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {7074#false} is VALID [2022-04-27 10:17:58,540 INFO L290 TraceCheckUtils]: 168: Hoare triple {7647#(< (+ main_~i~0 1) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7643#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,540 INFO L290 TraceCheckUtils]: 167: Hoare triple {7647#(< (+ main_~i~0 1) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {7647#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-27 10:17:58,540 INFO L290 TraceCheckUtils]: 166: Hoare triple {7647#(< (+ 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); {7647#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-27 10:17:58,541 INFO L290 TraceCheckUtils]: 165: Hoare triple {7657#(< (+ main_~i~0 2) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7647#(< (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-27 10:17:58,541 INFO L290 TraceCheckUtils]: 164: Hoare triple {7657#(< (+ main_~i~0 2) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {7657#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-27 10:17:58,541 INFO L290 TraceCheckUtils]: 163: Hoare triple {7657#(< (+ 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); {7657#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-27 10:17:58,542 INFO L290 TraceCheckUtils]: 162: Hoare triple {7667#(< (+ main_~i~0 3) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7657#(< (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-27 10:17:58,542 INFO L290 TraceCheckUtils]: 161: Hoare triple {7667#(< (+ main_~i~0 3) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {7667#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-27 10:17:58,551 INFO L290 TraceCheckUtils]: 160: Hoare triple {7667#(< (+ 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); {7667#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-27 10:17:58,552 INFO L290 TraceCheckUtils]: 159: Hoare triple {7677#(< (+ main_~i~0 4) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7667#(< (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-27 10:17:58,552 INFO L290 TraceCheckUtils]: 158: Hoare triple {7677#(< (+ main_~i~0 4) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {7677#(< (+ main_~i~0 4) main_~edgecount~0)} is VALID [2022-04-27 10:17:58,552 INFO L290 TraceCheckUtils]: 157: Hoare triple {7677#(< (+ 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); {7677#(< (+ main_~i~0 4) main_~edgecount~0)} is VALID [2022-04-27 10:17:58,552 INFO L290 TraceCheckUtils]: 156: Hoare triple {7687#(< 4 main_~edgecount~0)} ~i~0 := 0; {7677#(< (+ main_~i~0 4) main_~edgecount~0)} is VALID [2022-04-27 10:17:58,553 INFO L290 TraceCheckUtils]: 155: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,553 INFO L290 TraceCheckUtils]: 154: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,553 INFO L290 TraceCheckUtils]: 153: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,553 INFO L290 TraceCheckUtils]: 152: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,554 INFO L290 TraceCheckUtils]: 151: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,554 INFO L290 TraceCheckUtils]: 150: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,554 INFO L290 TraceCheckUtils]: 149: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,554 INFO L290 TraceCheckUtils]: 148: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,555 INFO L290 TraceCheckUtils]: 147: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,555 INFO L290 TraceCheckUtils]: 146: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,555 INFO L290 TraceCheckUtils]: 145: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,555 INFO L290 TraceCheckUtils]: 144: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,556 INFO L290 TraceCheckUtils]: 143: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,556 INFO L290 TraceCheckUtils]: 142: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,556 INFO L290 TraceCheckUtils]: 141: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,556 INFO L290 TraceCheckUtils]: 140: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,557 INFO L290 TraceCheckUtils]: 139: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,557 INFO L290 TraceCheckUtils]: 138: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,557 INFO L290 TraceCheckUtils]: 137: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,557 INFO L290 TraceCheckUtils]: 136: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,558 INFO L290 TraceCheckUtils]: 135: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,558 INFO L290 TraceCheckUtils]: 134: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,558 INFO L290 TraceCheckUtils]: 133: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,558 INFO L290 TraceCheckUtils]: 132: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,559 INFO L290 TraceCheckUtils]: 131: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,559 INFO L290 TraceCheckUtils]: 130: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,559 INFO L290 TraceCheckUtils]: 129: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,559 INFO L290 TraceCheckUtils]: 128: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,560 INFO L290 TraceCheckUtils]: 127: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,560 INFO L290 TraceCheckUtils]: 126: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,560 INFO L290 TraceCheckUtils]: 125: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,560 INFO L290 TraceCheckUtils]: 124: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,560 INFO L290 TraceCheckUtils]: 123: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,561 INFO L290 TraceCheckUtils]: 122: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,561 INFO L290 TraceCheckUtils]: 121: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,561 INFO L290 TraceCheckUtils]: 120: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,561 INFO L290 TraceCheckUtils]: 119: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,562 INFO L290 TraceCheckUtils]: 118: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,562 INFO L290 TraceCheckUtils]: 117: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,562 INFO L290 TraceCheckUtils]: 116: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,562 INFO L290 TraceCheckUtils]: 115: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,563 INFO L290 TraceCheckUtils]: 114: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,563 INFO L290 TraceCheckUtils]: 113: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,563 INFO L290 TraceCheckUtils]: 112: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,563 INFO L290 TraceCheckUtils]: 111: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,564 INFO L290 TraceCheckUtils]: 110: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,564 INFO L290 TraceCheckUtils]: 109: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,564 INFO L290 TraceCheckUtils]: 108: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,564 INFO L290 TraceCheckUtils]: 107: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,565 INFO L290 TraceCheckUtils]: 106: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,565 INFO L290 TraceCheckUtils]: 105: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,565 INFO L290 TraceCheckUtils]: 104: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,565 INFO L290 TraceCheckUtils]: 103: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,566 INFO L290 TraceCheckUtils]: 102: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,566 INFO L290 TraceCheckUtils]: 101: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,566 INFO L290 TraceCheckUtils]: 100: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,566 INFO L290 TraceCheckUtils]: 99: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,567 INFO L290 TraceCheckUtils]: 98: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,567 INFO L290 TraceCheckUtils]: 97: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,567 INFO L290 TraceCheckUtils]: 96: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,567 INFO L290 TraceCheckUtils]: 95: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,568 INFO L290 TraceCheckUtils]: 94: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,568 INFO L290 TraceCheckUtils]: 93: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,568 INFO L290 TraceCheckUtils]: 92: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,568 INFO L290 TraceCheckUtils]: 91: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,569 INFO L290 TraceCheckUtils]: 90: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,569 INFO L290 TraceCheckUtils]: 89: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,569 INFO L290 TraceCheckUtils]: 88: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,569 INFO L290 TraceCheckUtils]: 87: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,570 INFO L290 TraceCheckUtils]: 86: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,570 INFO L290 TraceCheckUtils]: 85: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,570 INFO L290 TraceCheckUtils]: 84: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,570 INFO L290 TraceCheckUtils]: 83: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,571 INFO L290 TraceCheckUtils]: 82: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,571 INFO L290 TraceCheckUtils]: 81: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,571 INFO L290 TraceCheckUtils]: 80: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,571 INFO L290 TraceCheckUtils]: 79: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,572 INFO L290 TraceCheckUtils]: 78: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,572 INFO L290 TraceCheckUtils]: 77: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,572 INFO L290 TraceCheckUtils]: 76: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,572 INFO L290 TraceCheckUtils]: 75: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,573 INFO L290 TraceCheckUtils]: 74: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,573 INFO L290 TraceCheckUtils]: 73: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,573 INFO L290 TraceCheckUtils]: 72: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,573 INFO L290 TraceCheckUtils]: 71: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,574 INFO L290 TraceCheckUtils]: 70: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,574 INFO L290 TraceCheckUtils]: 69: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,574 INFO L290 TraceCheckUtils]: 68: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,574 INFO L290 TraceCheckUtils]: 67: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,575 INFO L290 TraceCheckUtils]: 66: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,575 INFO L290 TraceCheckUtils]: 65: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,575 INFO L290 TraceCheckUtils]: 64: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,575 INFO L290 TraceCheckUtils]: 63: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,576 INFO L290 TraceCheckUtils]: 62: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,576 INFO L290 TraceCheckUtils]: 61: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,576 INFO L290 TraceCheckUtils]: 60: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,576 INFO L290 TraceCheckUtils]: 59: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,577 INFO L290 TraceCheckUtils]: 58: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,577 INFO L290 TraceCheckUtils]: 57: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,577 INFO L290 TraceCheckUtils]: 56: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,577 INFO L290 TraceCheckUtils]: 55: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,578 INFO L290 TraceCheckUtils]: 54: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,578 INFO L290 TraceCheckUtils]: 53: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,578 INFO L290 TraceCheckUtils]: 52: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,578 INFO L290 TraceCheckUtils]: 51: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,579 INFO L290 TraceCheckUtils]: 50: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,579 INFO L290 TraceCheckUtils]: 49: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,579 INFO L290 TraceCheckUtils]: 48: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,579 INFO L290 TraceCheckUtils]: 47: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,580 INFO L290 TraceCheckUtils]: 46: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,580 INFO L290 TraceCheckUtils]: 45: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,580 INFO L290 TraceCheckUtils]: 44: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,580 INFO L290 TraceCheckUtils]: 43: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,581 INFO L290 TraceCheckUtils]: 42: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,581 INFO L290 TraceCheckUtils]: 41: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,581 INFO L290 TraceCheckUtils]: 40: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,581 INFO L290 TraceCheckUtils]: 39: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,581 INFO L290 TraceCheckUtils]: 38: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,582 INFO L290 TraceCheckUtils]: 37: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,582 INFO L290 TraceCheckUtils]: 36: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,582 INFO L290 TraceCheckUtils]: 35: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,582 INFO L290 TraceCheckUtils]: 34: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,582 INFO L290 TraceCheckUtils]: 33: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,583 INFO L290 TraceCheckUtils]: 32: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,583 INFO L290 TraceCheckUtils]: 31: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,583 INFO L290 TraceCheckUtils]: 30: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,583 INFO L290 TraceCheckUtils]: 29: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,584 INFO L290 TraceCheckUtils]: 28: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,584 INFO L290 TraceCheckUtils]: 27: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,584 INFO L290 TraceCheckUtils]: 26: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,584 INFO L290 TraceCheckUtils]: 25: Hoare triple {7687#(< 4 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,585 INFO L290 TraceCheckUtils]: 24: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,585 INFO L290 TraceCheckUtils]: 23: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,585 INFO L290 TraceCheckUtils]: 22: Hoare triple {7687#(< 4 main_~edgecount~0)} ~i~0 := 0; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {7687#(< 4 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {7687#(< 4 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {7687#(< 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {7073#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {7687#(< 4 main_~edgecount~0)} is VALID [2022-04-27 10:17:58,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {7073#true} call #t~ret22 := main(); {7073#true} is VALID [2022-04-27 10:17:58,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7073#true} {7073#true} #107#return; {7073#true} is VALID [2022-04-27 10:17:58,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {7073#true} assume true; {7073#true} is VALID [2022-04-27 10:17:58,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {7073#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; {7073#true} is VALID [2022-04-27 10:17:58,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {7073#true} call ULTIMATE.init(); {7073#true} is VALID [2022-04-27 10:17:58,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2579 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2557 trivial. 0 not checked. [2022-04-27 10:17:58,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403448795] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:17:58,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:17:58,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 8] total 27 [2022-04-27 10:17:58,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306551412] [2022-04-27 10:17:58,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:17:58,592 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.2592592592592595) internal successors, (115), 26 states have internal predecessors, (115), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 176 [2022-04-27 10:17:58,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:58,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 4.2592592592592595) internal successors, (115), 26 states have internal predecessors, (115), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:58,663 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-27 10:17:58,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-27 10:17:58,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:58,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-27 10:17:58,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2022-04-27 10:17:58,664 INFO L87 Difference]: Start difference. First operand 181 states and 229 transitions. Second operand has 27 states, 27 states have (on average 4.2592592592592595) internal successors, (115), 26 states have internal predecessors, (115), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:05,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:05,557 INFO L93 Difference]: Finished difference Result 678 states and 898 transitions. [2022-04-27 10:18:05,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2022-04-27 10:18:05,558 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.2592592592592595) internal successors, (115), 26 states have internal predecessors, (115), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 176 [2022-04-27 10:18:05,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:18:05,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 4.2592592592592595) internal successors, (115), 26 states have internal predecessors, (115), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:05,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 761 transitions. [2022-04-27 10:18:05,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 4.2592592592592595) internal successors, (115), 26 states have internal predecessors, (115), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:05,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 761 transitions. [2022-04-27 10:18:05,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 761 transitions. [2022-04-27 10:18:06,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 761 edges. 761 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:06,209 INFO L225 Difference]: With dead ends: 678 [2022-04-27 10:18:06,210 INFO L226 Difference]: Without dead ends: 552 [2022-04-27 10:18:06,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8984 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=7391, Invalid=17731, Unknown=0, NotChecked=0, Total=25122 [2022-04-27 10:18:06,217 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 2425 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 846 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2425 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 846 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 10:18:06,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2425 Valid, 45 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [846 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 10:18:06,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2022-04-27 10:18:06,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 211. [2022-04-27 10:18:06,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:18:06,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 552 states. Second operand has 211 states, 205 states have (on average 1.2585365853658537) internal successors, (258), 205 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:18:06,556 INFO L74 IsIncluded]: Start isIncluded. First operand 552 states. Second operand has 211 states, 205 states have (on average 1.2585365853658537) internal successors, (258), 205 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:18:06,556 INFO L87 Difference]: Start difference. First operand 552 states. Second operand has 211 states, 205 states have (on average 1.2585365853658537) internal successors, (258), 205 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:18:06,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:06,568 INFO L93 Difference]: Finished difference Result 552 states and 720 transitions. [2022-04-27 10:18:06,568 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 720 transitions. [2022-04-27 10:18:06,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:06,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:06,569 INFO L74 IsIncluded]: Start isIncluded. First operand has 211 states, 205 states have (on average 1.2585365853658537) internal successors, (258), 205 states have internal predecessors, (258), 3 states have call successors, (3), 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 552 states. [2022-04-27 10:18:06,569 INFO L87 Difference]: Start difference. First operand has 211 states, 205 states have (on average 1.2585365853658537) internal successors, (258), 205 states have internal predecessors, (258), 3 states have call successors, (3), 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 552 states. [2022-04-27 10:18:06,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:06,581 INFO L93 Difference]: Finished difference Result 552 states and 720 transitions. [2022-04-27 10:18:06,581 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 720 transitions. [2022-04-27 10:18:06,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:06,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:06,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:18:06,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:18:06,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 205 states have (on average 1.2585365853658537) internal successors, (258), 205 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:18:06,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 263 transitions. [2022-04-27 10:18:06,586 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 263 transitions. Word has length 176 [2022-04-27 10:18:06,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:18:06,586 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 263 transitions. [2022-04-27 10:18:06,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.2592592592592595) internal successors, (115), 26 states have internal predecessors, (115), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:06,586 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 263 transitions. [2022-04-27 10:18:06,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-04-27 10:18:06,588 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:18:06,588 INFO L195 NwaCegarLoop]: trace histogram [44, 44, 44, 10, 10, 10, 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-27 10:18:06,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-27 10:18:06,810 WARN L477 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-27 10:18:06,811 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:18:06,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:18:06,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1076955864, now seen corresponding path program 7 times [2022-04-27 10:18:06,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:18:06,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666702195] [2022-04-27 10:18:06,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:18:06,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:18:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:07,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:18:07,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:07,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {10747#(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; {10729#true} is VALID [2022-04-27 10:18:07,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {10729#true} assume true; {10729#true} is VALID [2022-04-27 10:18:07,060 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10729#true} {10729#true} #107#return; {10729#true} is VALID [2022-04-27 10:18:07,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {10729#true} call ULTIMATE.init(); {10747#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:18:07,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {10747#(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; {10729#true} is VALID [2022-04-27 10:18:07,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {10729#true} assume true; {10729#true} is VALID [2022-04-27 10:18:07,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10729#true} {10729#true} #107#return; {10729#true} is VALID [2022-04-27 10:18:07,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {10729#true} call #t~ret22 := main(); {10729#true} is VALID [2022-04-27 10:18:07,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {10729#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:07,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {10734#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:07,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {10734#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:07,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {10734#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:07,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {10734#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:07,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {10734#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:07,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {10734#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:07,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {10734#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:07,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {10734#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:07,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {10734#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:07,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {10734#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:07,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {10734#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:07,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {10734#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:07,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {10734#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:07,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {10734#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:07,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {10734#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:07,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {10734#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:07,067 INFO L290 TraceCheckUtils]: 22: Hoare triple {10734#(<= 20 main_~edgecount~0)} ~i~0 := 0; {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:07,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {10734#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {10735#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:18:07,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {10735#(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); {10735#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:18:07,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {10735#(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; {10735#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:18:07,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {10735#(and (= main_~j~0 0) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10736#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-27 10:18:07,068 INFO L290 TraceCheckUtils]: 27: Hoare triple {10736#(<= (+ 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); {10736#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-27 10:18:07,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {10736#(<= (+ 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; {10736#(<= (+ 19 main_~j~0) main_~edgecount~0)} is VALID [2022-04-27 10:18:07,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {10736#(<= (+ 19 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10737#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-27 10:18:07,069 INFO L290 TraceCheckUtils]: 30: Hoare triple {10737#(<= (+ 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); {10737#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-27 10:18:07,070 INFO L290 TraceCheckUtils]: 31: Hoare triple {10737#(<= (+ 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; {10737#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2022-04-27 10:18:07,070 INFO L290 TraceCheckUtils]: 32: Hoare triple {10737#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10738#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-27 10:18:07,070 INFO L290 TraceCheckUtils]: 33: Hoare triple {10738#(<= (+ 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); {10738#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-27 10:18:07,070 INFO L290 TraceCheckUtils]: 34: Hoare triple {10738#(<= (+ 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; {10738#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2022-04-27 10:18:07,071 INFO L290 TraceCheckUtils]: 35: Hoare triple {10738#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10739#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-27 10:18:07,071 INFO L290 TraceCheckUtils]: 36: Hoare triple {10739#(<= (+ 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); {10739#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-27 10:18:07,072 INFO L290 TraceCheckUtils]: 37: Hoare triple {10739#(<= (+ 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; {10739#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2022-04-27 10:18:07,072 INFO L290 TraceCheckUtils]: 38: Hoare triple {10739#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10740#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-27 10:18:07,072 INFO L290 TraceCheckUtils]: 39: Hoare triple {10740#(<= (+ 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); {10740#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-27 10:18:07,073 INFO L290 TraceCheckUtils]: 40: Hoare triple {10740#(<= (+ 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; {10740#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2022-04-27 10:18:07,073 INFO L290 TraceCheckUtils]: 41: Hoare triple {10740#(<= (+ main_~j~0 15) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10741#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-27 10:18:07,074 INFO L290 TraceCheckUtils]: 42: Hoare triple {10741#(<= (+ 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); {10741#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-27 10:18:07,074 INFO L290 TraceCheckUtils]: 43: Hoare triple {10741#(<= (+ 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; {10741#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2022-04-27 10:18:07,074 INFO L290 TraceCheckUtils]: 44: Hoare triple {10741#(<= (+ main_~j~0 14) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10742#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-27 10:18:07,075 INFO L290 TraceCheckUtils]: 45: Hoare triple {10742#(<= (+ 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); {10742#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-27 10:18:07,075 INFO L290 TraceCheckUtils]: 46: Hoare triple {10742#(<= (+ 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; {10742#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2022-04-27 10:18:07,075 INFO L290 TraceCheckUtils]: 47: Hoare triple {10742#(<= (+ main_~j~0 13) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10743#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-27 10:18:07,076 INFO L290 TraceCheckUtils]: 48: Hoare triple {10743#(<= (+ 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); {10743#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-27 10:18:07,076 INFO L290 TraceCheckUtils]: 49: Hoare triple {10743#(<= (+ 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; {10743#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-27 10:18:07,076 INFO L290 TraceCheckUtils]: 50: Hoare triple {10743#(<= (+ main_~j~0 12) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10744#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-27 10:18:07,076 INFO L290 TraceCheckUtils]: 51: Hoare triple {10744#(<= (+ 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); {10744#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-27 10:18:07,077 INFO L290 TraceCheckUtils]: 52: Hoare triple {10744#(<= (+ 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; {10744#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-27 10:18:07,077 INFO L290 TraceCheckUtils]: 53: Hoare triple {10744#(<= (+ main_~j~0 11) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10745#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-27 10:18:07,077 INFO L290 TraceCheckUtils]: 54: Hoare triple {10745#(<= (+ 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); {10745#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-27 10:18:07,078 INFO L290 TraceCheckUtils]: 55: Hoare triple {10745#(<= (+ 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; {10745#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-27 10:18:07,078 INFO L290 TraceCheckUtils]: 56: Hoare triple {10745#(<= (+ main_~j~0 10) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10746#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-27 10:18:07,078 INFO L290 TraceCheckUtils]: 57: Hoare triple {10746#(<= (+ main_~j~0 9) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {10730#false} is VALID [2022-04-27 10:18:07,078 INFO L290 TraceCheckUtils]: 58: Hoare triple {10730#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10730#false} is VALID [2022-04-27 10:18:07,078 INFO L290 TraceCheckUtils]: 59: Hoare triple {10730#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {10730#false} is VALID [2022-04-27 10:18:07,078 INFO L290 TraceCheckUtils]: 60: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,078 INFO L290 TraceCheckUtils]: 61: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:07,079 INFO L290 TraceCheckUtils]: 62: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:07,079 INFO L290 TraceCheckUtils]: 63: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,079 INFO L290 TraceCheckUtils]: 64: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:07,079 INFO L290 TraceCheckUtils]: 65: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:07,079 INFO L290 TraceCheckUtils]: 66: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,079 INFO L290 TraceCheckUtils]: 67: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:07,079 INFO L290 TraceCheckUtils]: 68: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:07,079 INFO L290 TraceCheckUtils]: 69: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,079 INFO L290 TraceCheckUtils]: 70: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:07,079 INFO L290 TraceCheckUtils]: 71: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:07,079 INFO L290 TraceCheckUtils]: 72: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,079 INFO L290 TraceCheckUtils]: 73: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:07,079 INFO L290 TraceCheckUtils]: 74: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:07,079 INFO L290 TraceCheckUtils]: 75: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,079 INFO L290 TraceCheckUtils]: 76: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:07,079 INFO L290 TraceCheckUtils]: 77: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:07,079 INFO L290 TraceCheckUtils]: 78: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,079 INFO L290 TraceCheckUtils]: 79: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:07,079 INFO L290 TraceCheckUtils]: 80: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:07,079 INFO L290 TraceCheckUtils]: 81: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,080 INFO L290 TraceCheckUtils]: 82: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:07,080 INFO L290 TraceCheckUtils]: 83: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:07,080 INFO L290 TraceCheckUtils]: 84: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,080 INFO L290 TraceCheckUtils]: 85: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:07,080 INFO L290 TraceCheckUtils]: 86: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:07,080 INFO L290 TraceCheckUtils]: 87: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,080 INFO L290 TraceCheckUtils]: 88: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:07,080 INFO L290 TraceCheckUtils]: 89: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:07,080 INFO L290 TraceCheckUtils]: 90: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,080 INFO L290 TraceCheckUtils]: 91: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:07,080 INFO L290 TraceCheckUtils]: 92: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:07,080 INFO L290 TraceCheckUtils]: 93: Hoare triple {10730#false} assume !(~j~0 < ~edgecount~0); {10730#false} is VALID [2022-04-27 10:18:07,080 INFO L290 TraceCheckUtils]: 94: Hoare triple {10730#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10730#false} is VALID [2022-04-27 10:18:07,080 INFO L290 TraceCheckUtils]: 95: Hoare triple {10730#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {10730#false} is VALID [2022-04-27 10:18:07,080 INFO L290 TraceCheckUtils]: 96: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,080 INFO L290 TraceCheckUtils]: 97: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:07,080 INFO L290 TraceCheckUtils]: 98: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:07,080 INFO L290 TraceCheckUtils]: 99: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,080 INFO L290 TraceCheckUtils]: 100: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:07,080 INFO L290 TraceCheckUtils]: 101: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:07,080 INFO L290 TraceCheckUtils]: 102: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,080 INFO L290 TraceCheckUtils]: 103: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:07,081 INFO L290 TraceCheckUtils]: 104: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:07,081 INFO L290 TraceCheckUtils]: 105: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,081 INFO L290 TraceCheckUtils]: 106: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:07,081 INFO L290 TraceCheckUtils]: 107: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:07,081 INFO L290 TraceCheckUtils]: 108: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,081 INFO L290 TraceCheckUtils]: 109: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:07,081 INFO L290 TraceCheckUtils]: 110: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:07,081 INFO L290 TraceCheckUtils]: 111: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,081 INFO L290 TraceCheckUtils]: 112: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:07,081 INFO L290 TraceCheckUtils]: 113: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:07,081 INFO L290 TraceCheckUtils]: 114: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,081 INFO L290 TraceCheckUtils]: 115: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:07,081 INFO L290 TraceCheckUtils]: 116: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:07,081 INFO L290 TraceCheckUtils]: 117: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,081 INFO L290 TraceCheckUtils]: 118: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:07,081 INFO L290 TraceCheckUtils]: 119: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:07,081 INFO L290 TraceCheckUtils]: 120: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,081 INFO L290 TraceCheckUtils]: 121: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:07,081 INFO L290 TraceCheckUtils]: 122: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:07,081 INFO L290 TraceCheckUtils]: 123: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,081 INFO L290 TraceCheckUtils]: 124: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:07,082 INFO L290 TraceCheckUtils]: 125: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:07,082 INFO L290 TraceCheckUtils]: 126: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,082 INFO L290 TraceCheckUtils]: 127: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:07,082 INFO L290 TraceCheckUtils]: 128: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:07,082 INFO L290 TraceCheckUtils]: 129: Hoare triple {10730#false} assume !(~j~0 < ~edgecount~0); {10730#false} is VALID [2022-04-27 10:18:07,082 INFO L290 TraceCheckUtils]: 130: Hoare triple {10730#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10730#false} is VALID [2022-04-27 10:18:07,082 INFO L290 TraceCheckUtils]: 131: Hoare triple {10730#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {10730#false} is VALID [2022-04-27 10:18:07,082 INFO L290 TraceCheckUtils]: 132: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,082 INFO L290 TraceCheckUtils]: 133: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:07,082 INFO L290 TraceCheckUtils]: 134: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:07,082 INFO L290 TraceCheckUtils]: 135: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,082 INFO L290 TraceCheckUtils]: 136: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:07,082 INFO L290 TraceCheckUtils]: 137: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:07,082 INFO L290 TraceCheckUtils]: 138: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,082 INFO L290 TraceCheckUtils]: 139: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:07,082 INFO L290 TraceCheckUtils]: 140: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:07,082 INFO L290 TraceCheckUtils]: 141: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,082 INFO L290 TraceCheckUtils]: 142: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:07,082 INFO L290 TraceCheckUtils]: 143: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:07,082 INFO L290 TraceCheckUtils]: 144: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,082 INFO L290 TraceCheckUtils]: 145: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:07,082 INFO L290 TraceCheckUtils]: 146: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:07,083 INFO L290 TraceCheckUtils]: 147: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,083 INFO L290 TraceCheckUtils]: 148: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:07,083 INFO L290 TraceCheckUtils]: 149: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:07,083 INFO L290 TraceCheckUtils]: 150: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,083 INFO L290 TraceCheckUtils]: 151: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:07,083 INFO L290 TraceCheckUtils]: 152: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:07,083 INFO L290 TraceCheckUtils]: 153: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,083 INFO L290 TraceCheckUtils]: 154: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:07,083 INFO L290 TraceCheckUtils]: 155: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:07,083 INFO L290 TraceCheckUtils]: 156: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,083 INFO L290 TraceCheckUtils]: 157: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:07,083 INFO L290 TraceCheckUtils]: 158: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:07,083 INFO L290 TraceCheckUtils]: 159: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,083 INFO L290 TraceCheckUtils]: 160: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:07,083 INFO L290 TraceCheckUtils]: 161: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:07,083 INFO L290 TraceCheckUtils]: 162: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,083 INFO L290 TraceCheckUtils]: 163: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:07,083 INFO L290 TraceCheckUtils]: 164: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:07,083 INFO L290 TraceCheckUtils]: 165: Hoare triple {10730#false} assume !(~j~0 < ~edgecount~0); {10730#false} is VALID [2022-04-27 10:18:07,083 INFO L290 TraceCheckUtils]: 166: Hoare triple {10730#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10730#false} is VALID [2022-04-27 10:18:07,083 INFO L290 TraceCheckUtils]: 167: Hoare triple {10730#false} assume !(~i~0 < ~nodecount~0); {10730#false} is VALID [2022-04-27 10:18:07,083 INFO L290 TraceCheckUtils]: 168: Hoare triple {10730#false} ~i~0 := 0; {10730#false} is VALID [2022-04-27 10:18:07,084 INFO L290 TraceCheckUtils]: 169: Hoare triple {10730#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); {10730#false} is VALID [2022-04-27 10:18:07,084 INFO L290 TraceCheckUtils]: 170: Hoare triple {10730#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10730#false} is VALID [2022-04-27 10:18:07,084 INFO L290 TraceCheckUtils]: 171: Hoare triple {10730#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10730#false} is VALID [2022-04-27 10:18:07,084 INFO L290 TraceCheckUtils]: 172: Hoare triple {10730#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); {10730#false} is VALID [2022-04-27 10:18:07,084 INFO L290 TraceCheckUtils]: 173: Hoare triple {10730#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10730#false} is VALID [2022-04-27 10:18:07,084 INFO L290 TraceCheckUtils]: 174: Hoare triple {10730#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10730#false} is VALID [2022-04-27 10:18:07,084 INFO L290 TraceCheckUtils]: 175: Hoare triple {10730#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); {10730#false} is VALID [2022-04-27 10:18:07,084 INFO L290 TraceCheckUtils]: 176: Hoare triple {10730#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10730#false} is VALID [2022-04-27 10:18:07,084 INFO L290 TraceCheckUtils]: 177: Hoare triple {10730#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10730#false} is VALID [2022-04-27 10:18:07,084 INFO L290 TraceCheckUtils]: 178: Hoare triple {10730#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); {10730#false} is VALID [2022-04-27 10:18:07,084 INFO L290 TraceCheckUtils]: 179: Hoare triple {10730#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10730#false} is VALID [2022-04-27 10:18:07,084 INFO L290 TraceCheckUtils]: 180: Hoare triple {10730#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10730#false} is VALID [2022-04-27 10:18:07,084 INFO L290 TraceCheckUtils]: 181: Hoare triple {10730#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); {10730#false} is VALID [2022-04-27 10:18:07,084 INFO L290 TraceCheckUtils]: 182: Hoare triple {10730#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10730#false} is VALID [2022-04-27 10:18:07,084 INFO L290 TraceCheckUtils]: 183: Hoare triple {10730#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10730#false} is VALID [2022-04-27 10:18:07,084 INFO L290 TraceCheckUtils]: 184: Hoare triple {10730#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); {10730#false} is VALID [2022-04-27 10:18:07,084 INFO L290 TraceCheckUtils]: 185: Hoare triple {10730#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10730#false} is VALID [2022-04-27 10:18:07,084 INFO L290 TraceCheckUtils]: 186: Hoare triple {10730#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10730#false} is VALID [2022-04-27 10:18:07,084 INFO L290 TraceCheckUtils]: 187: Hoare triple {10730#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); {10730#false} is VALID [2022-04-27 10:18:07,084 INFO L290 TraceCheckUtils]: 188: Hoare triple {10730#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10730#false} is VALID [2022-04-27 10:18:07,084 INFO L290 TraceCheckUtils]: 189: Hoare triple {10730#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10730#false} is VALID [2022-04-27 10:18:07,085 INFO L290 TraceCheckUtils]: 190: Hoare triple {10730#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); {10730#false} is VALID [2022-04-27 10:18:07,085 INFO L290 TraceCheckUtils]: 191: Hoare triple {10730#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10730#false} is VALID [2022-04-27 10:18:07,085 INFO L290 TraceCheckUtils]: 192: Hoare triple {10730#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10730#false} is VALID [2022-04-27 10:18:07,085 INFO L290 TraceCheckUtils]: 193: Hoare triple {10730#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); {10730#false} is VALID [2022-04-27 10:18:07,085 INFO L290 TraceCheckUtils]: 194: Hoare triple {10730#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10730#false} is VALID [2022-04-27 10:18:07,085 INFO L290 TraceCheckUtils]: 195: Hoare triple {10730#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10730#false} is VALID [2022-04-27 10:18:07,085 INFO L290 TraceCheckUtils]: 196: Hoare triple {10730#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); {10730#false} is VALID [2022-04-27 10:18:07,085 INFO L290 TraceCheckUtils]: 197: Hoare triple {10730#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10730#false} is VALID [2022-04-27 10:18:07,085 INFO L290 TraceCheckUtils]: 198: Hoare triple {10730#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10730#false} is VALID [2022-04-27 10:18:07,085 INFO L290 TraceCheckUtils]: 199: Hoare triple {10730#false} assume !(~i~0 < ~edgecount~0); {10730#false} is VALID [2022-04-27 10:18:07,085 INFO L290 TraceCheckUtils]: 200: Hoare triple {10730#false} ~i~0 := 0; {10730#false} is VALID [2022-04-27 10:18:07,085 INFO L290 TraceCheckUtils]: 201: Hoare triple {10730#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10730#false} is VALID [2022-04-27 10:18:07,085 INFO L272 TraceCheckUtils]: 202: Hoare triple {10730#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {10730#false} is VALID [2022-04-27 10:18:07,085 INFO L290 TraceCheckUtils]: 203: Hoare triple {10730#false} ~cond := #in~cond; {10730#false} is VALID [2022-04-27 10:18:07,085 INFO L290 TraceCheckUtils]: 204: Hoare triple {10730#false} assume 0 == ~cond; {10730#false} is VALID [2022-04-27 10:18:07,085 INFO L290 TraceCheckUtils]: 205: Hoare triple {10730#false} assume !false; {10730#false} is VALID [2022-04-27 10:18:07,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3216 backedges. 1162 proven. 176 refuted. 0 times theorem prover too weak. 1878 trivial. 0 not checked. [2022-04-27 10:18:07,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:18:07,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666702195] [2022-04-27 10:18:07,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666702195] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:18:07,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488594796] [2022-04-27 10:18:07,087 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 10:18:07,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:18:07,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:18:07,088 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-27 10:18:07,089 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-27 10:18:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:07,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 1249 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 10:18:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:07,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:18:08,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {10729#true} call ULTIMATE.init(); {10729#true} is VALID [2022-04-27 10:18:08,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {10729#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; {10729#true} is VALID [2022-04-27 10:18:08,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {10729#true} assume true; {10729#true} is VALID [2022-04-27 10:18:08,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10729#true} {10729#true} #107#return; {10729#true} is VALID [2022-04-27 10:18:08,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {10729#true} call #t~ret22 := main(); {10729#true} is VALID [2022-04-27 10:18:08,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {10729#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {10734#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {10734#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,037 INFO L290 TraceCheckUtils]: 8: Hoare triple {10734#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {10734#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {10734#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {10734#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {10734#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {10734#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {10734#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {10734#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {10734#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {10734#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {10734#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {10734#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {10734#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {10734#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,041 INFO L290 TraceCheckUtils]: 22: Hoare triple {10734#(<= 20 main_~edgecount~0)} ~i~0 := 0; {10734#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,041 INFO L290 TraceCheckUtils]: 23: Hoare triple {10734#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {10820#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-27 10:18:08,042 INFO L290 TraceCheckUtils]: 24: Hoare triple {10820#(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); {10820#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-27 10:18:08,042 INFO L290 TraceCheckUtils]: 25: Hoare triple {10820#(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; {10820#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-27 10:18:08,042 INFO L290 TraceCheckUtils]: 26: Hoare triple {10820#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10830#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:18:08,043 INFO L290 TraceCheckUtils]: 27: Hoare triple {10830#(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); {10830#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:18:08,043 INFO L290 TraceCheckUtils]: 28: Hoare triple {10830#(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; {10830#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:18:08,044 INFO L290 TraceCheckUtils]: 29: Hoare triple {10830#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10840#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:18:08,044 INFO L290 TraceCheckUtils]: 30: Hoare triple {10840#(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); {10840#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:18:08,044 INFO L290 TraceCheckUtils]: 31: Hoare triple {10840#(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; {10840#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:18:08,045 INFO L290 TraceCheckUtils]: 32: Hoare triple {10840#(and (<= main_~j~0 2) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10850#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-27 10:18:08,045 INFO L290 TraceCheckUtils]: 33: Hoare triple {10850#(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); {10850#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-27 10:18:08,046 INFO L290 TraceCheckUtils]: 34: Hoare triple {10850#(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; {10850#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2022-04-27 10:18:08,046 INFO L290 TraceCheckUtils]: 35: Hoare triple {10850#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10860#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-27 10:18:08,046 INFO L290 TraceCheckUtils]: 36: Hoare triple {10860#(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); {10860#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-27 10:18:08,047 INFO L290 TraceCheckUtils]: 37: Hoare triple {10860#(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; {10860#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2022-04-27 10:18:08,047 INFO L290 TraceCheckUtils]: 38: Hoare triple {10860#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10870#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-27 10:18:08,048 INFO L290 TraceCheckUtils]: 39: Hoare triple {10870#(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); {10870#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-27 10:18:08,048 INFO L290 TraceCheckUtils]: 40: Hoare triple {10870#(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; {10870#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2022-04-27 10:18:08,048 INFO L290 TraceCheckUtils]: 41: Hoare triple {10870#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10880#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:18:08,049 INFO L290 TraceCheckUtils]: 42: Hoare triple {10880#(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); {10880#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:18:08,049 INFO L290 TraceCheckUtils]: 43: Hoare triple {10880#(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; {10880#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:18:08,049 INFO L290 TraceCheckUtils]: 44: Hoare triple {10880#(and (<= main_~j~0 6) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10890#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:18:08,050 INFO L290 TraceCheckUtils]: 45: Hoare triple {10890#(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); {10890#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:18:08,050 INFO L290 TraceCheckUtils]: 46: Hoare triple {10890#(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; {10890#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:18:08,051 INFO L290 TraceCheckUtils]: 47: Hoare triple {10890#(and (<= main_~j~0 7) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10900#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:18:08,051 INFO L290 TraceCheckUtils]: 48: Hoare triple {10900#(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); {10900#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:18:08,051 INFO L290 TraceCheckUtils]: 49: Hoare triple {10900#(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; {10900#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:18:08,052 INFO L290 TraceCheckUtils]: 50: Hoare triple {10900#(and (<= main_~j~0 8) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10910#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-27 10:18:08,052 INFO L290 TraceCheckUtils]: 51: Hoare triple {10910#(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); {10910#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-27 10:18:08,052 INFO L290 TraceCheckUtils]: 52: Hoare triple {10910#(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; {10910#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2022-04-27 10:18:08,053 INFO L290 TraceCheckUtils]: 53: Hoare triple {10910#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10920#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:18:08,053 INFO L290 TraceCheckUtils]: 54: Hoare triple {10920#(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); {10920#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:18:08,054 INFO L290 TraceCheckUtils]: 55: Hoare triple {10920#(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; {10920#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:18:08,054 INFO L290 TraceCheckUtils]: 56: Hoare triple {10920#(and (<= main_~j~0 10) (<= 20 main_~edgecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10930#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} is VALID [2022-04-27 10:18:08,054 INFO L290 TraceCheckUtils]: 57: Hoare triple {10930#(and (<= main_~j~0 11) (<= 20 main_~edgecount~0))} assume !(~j~0 < ~edgecount~0); {10730#false} is VALID [2022-04-27 10:18:08,054 INFO L290 TraceCheckUtils]: 58: Hoare triple {10730#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10730#false} is VALID [2022-04-27 10:18:08,054 INFO L290 TraceCheckUtils]: 59: Hoare triple {10730#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {10730#false} is VALID [2022-04-27 10:18:08,054 INFO L290 TraceCheckUtils]: 60: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,055 INFO L290 TraceCheckUtils]: 61: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,055 INFO L290 TraceCheckUtils]: 62: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,055 INFO L290 TraceCheckUtils]: 63: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,055 INFO L290 TraceCheckUtils]: 64: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,055 INFO L290 TraceCheckUtils]: 65: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,055 INFO L290 TraceCheckUtils]: 66: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,055 INFO L290 TraceCheckUtils]: 67: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,055 INFO L290 TraceCheckUtils]: 68: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,055 INFO L290 TraceCheckUtils]: 69: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,055 INFO L290 TraceCheckUtils]: 70: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,055 INFO L290 TraceCheckUtils]: 71: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,055 INFO L290 TraceCheckUtils]: 72: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,055 INFO L290 TraceCheckUtils]: 73: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,055 INFO L290 TraceCheckUtils]: 74: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,055 INFO L290 TraceCheckUtils]: 75: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,055 INFO L290 TraceCheckUtils]: 76: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,055 INFO L290 TraceCheckUtils]: 77: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,055 INFO L290 TraceCheckUtils]: 78: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,055 INFO L290 TraceCheckUtils]: 79: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,055 INFO L290 TraceCheckUtils]: 80: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,055 INFO L290 TraceCheckUtils]: 81: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,056 INFO L290 TraceCheckUtils]: 82: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,056 INFO L290 TraceCheckUtils]: 83: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,056 INFO L290 TraceCheckUtils]: 84: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,056 INFO L290 TraceCheckUtils]: 85: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,056 INFO L290 TraceCheckUtils]: 86: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,056 INFO L290 TraceCheckUtils]: 87: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,056 INFO L290 TraceCheckUtils]: 88: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,056 INFO L290 TraceCheckUtils]: 89: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,056 INFO L290 TraceCheckUtils]: 90: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,056 INFO L290 TraceCheckUtils]: 91: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,056 INFO L290 TraceCheckUtils]: 92: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,056 INFO L290 TraceCheckUtils]: 93: Hoare triple {10730#false} assume !(~j~0 < ~edgecount~0); {10730#false} is VALID [2022-04-27 10:18:08,056 INFO L290 TraceCheckUtils]: 94: Hoare triple {10730#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10730#false} is VALID [2022-04-27 10:18:08,056 INFO L290 TraceCheckUtils]: 95: Hoare triple {10730#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {10730#false} is VALID [2022-04-27 10:18:08,056 INFO L290 TraceCheckUtils]: 96: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,056 INFO L290 TraceCheckUtils]: 97: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,056 INFO L290 TraceCheckUtils]: 98: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,056 INFO L290 TraceCheckUtils]: 99: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,056 INFO L290 TraceCheckUtils]: 100: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,056 INFO L290 TraceCheckUtils]: 101: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,056 INFO L290 TraceCheckUtils]: 102: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,057 INFO L290 TraceCheckUtils]: 103: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,057 INFO L290 TraceCheckUtils]: 104: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,057 INFO L290 TraceCheckUtils]: 105: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,057 INFO L290 TraceCheckUtils]: 106: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,057 INFO L290 TraceCheckUtils]: 107: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,057 INFO L290 TraceCheckUtils]: 108: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,057 INFO L290 TraceCheckUtils]: 109: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,057 INFO L290 TraceCheckUtils]: 110: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,057 INFO L290 TraceCheckUtils]: 111: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,057 INFO L290 TraceCheckUtils]: 112: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,057 INFO L290 TraceCheckUtils]: 113: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,057 INFO L290 TraceCheckUtils]: 114: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,057 INFO L290 TraceCheckUtils]: 115: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,057 INFO L290 TraceCheckUtils]: 116: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,057 INFO L290 TraceCheckUtils]: 117: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,057 INFO L290 TraceCheckUtils]: 118: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,057 INFO L290 TraceCheckUtils]: 119: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,057 INFO L290 TraceCheckUtils]: 120: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,057 INFO L290 TraceCheckUtils]: 121: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,057 INFO L290 TraceCheckUtils]: 122: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,057 INFO L290 TraceCheckUtils]: 123: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,057 INFO L290 TraceCheckUtils]: 124: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,058 INFO L290 TraceCheckUtils]: 125: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,058 INFO L290 TraceCheckUtils]: 126: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,058 INFO L290 TraceCheckUtils]: 127: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,058 INFO L290 TraceCheckUtils]: 128: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,058 INFO L290 TraceCheckUtils]: 129: Hoare triple {10730#false} assume !(~j~0 < ~edgecount~0); {10730#false} is VALID [2022-04-27 10:18:08,058 INFO L290 TraceCheckUtils]: 130: Hoare triple {10730#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10730#false} is VALID [2022-04-27 10:18:08,058 INFO L290 TraceCheckUtils]: 131: Hoare triple {10730#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {10730#false} is VALID [2022-04-27 10:18:08,058 INFO L290 TraceCheckUtils]: 132: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,058 INFO L290 TraceCheckUtils]: 133: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,058 INFO L290 TraceCheckUtils]: 134: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,058 INFO L290 TraceCheckUtils]: 135: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,058 INFO L290 TraceCheckUtils]: 136: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,058 INFO L290 TraceCheckUtils]: 137: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,058 INFO L290 TraceCheckUtils]: 138: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,058 INFO L290 TraceCheckUtils]: 139: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,058 INFO L290 TraceCheckUtils]: 140: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,058 INFO L290 TraceCheckUtils]: 141: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,058 INFO L290 TraceCheckUtils]: 142: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,058 INFO L290 TraceCheckUtils]: 143: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,058 INFO L290 TraceCheckUtils]: 144: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,058 INFO L290 TraceCheckUtils]: 145: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,059 INFO L290 TraceCheckUtils]: 146: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,059 INFO L290 TraceCheckUtils]: 147: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,059 INFO L290 TraceCheckUtils]: 148: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,059 INFO L290 TraceCheckUtils]: 149: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,059 INFO L290 TraceCheckUtils]: 150: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,059 INFO L290 TraceCheckUtils]: 151: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,059 INFO L290 TraceCheckUtils]: 152: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,059 INFO L290 TraceCheckUtils]: 153: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,059 INFO L290 TraceCheckUtils]: 154: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,059 INFO L290 TraceCheckUtils]: 155: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,059 INFO L290 TraceCheckUtils]: 156: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,059 INFO L290 TraceCheckUtils]: 157: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,059 INFO L290 TraceCheckUtils]: 158: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,059 INFO L290 TraceCheckUtils]: 159: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,059 INFO L290 TraceCheckUtils]: 160: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,059 INFO L290 TraceCheckUtils]: 161: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,059 INFO L290 TraceCheckUtils]: 162: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,059 INFO L290 TraceCheckUtils]: 163: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,059 INFO L290 TraceCheckUtils]: 164: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,059 INFO L290 TraceCheckUtils]: 165: Hoare triple {10730#false} assume !(~j~0 < ~edgecount~0); {10730#false} is VALID [2022-04-27 10:18:08,059 INFO L290 TraceCheckUtils]: 166: Hoare triple {10730#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10730#false} is VALID [2022-04-27 10:18:08,059 INFO L290 TraceCheckUtils]: 167: Hoare triple {10730#false} assume !(~i~0 < ~nodecount~0); {10730#false} is VALID [2022-04-27 10:18:08,060 INFO L290 TraceCheckUtils]: 168: Hoare triple {10730#false} ~i~0 := 0; {10730#false} is VALID [2022-04-27 10:18:08,060 INFO L290 TraceCheckUtils]: 169: Hoare triple {10730#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); {10730#false} is VALID [2022-04-27 10:18:08,060 INFO L290 TraceCheckUtils]: 170: Hoare triple {10730#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10730#false} is VALID [2022-04-27 10:18:08,060 INFO L290 TraceCheckUtils]: 171: Hoare triple {10730#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10730#false} is VALID [2022-04-27 10:18:08,060 INFO L290 TraceCheckUtils]: 172: Hoare triple {10730#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); {10730#false} is VALID [2022-04-27 10:18:08,060 INFO L290 TraceCheckUtils]: 173: Hoare triple {10730#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10730#false} is VALID [2022-04-27 10:18:08,060 INFO L290 TraceCheckUtils]: 174: Hoare triple {10730#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10730#false} is VALID [2022-04-27 10:18:08,060 INFO L290 TraceCheckUtils]: 175: Hoare triple {10730#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); {10730#false} is VALID [2022-04-27 10:18:08,060 INFO L290 TraceCheckUtils]: 176: Hoare triple {10730#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10730#false} is VALID [2022-04-27 10:18:08,060 INFO L290 TraceCheckUtils]: 177: Hoare triple {10730#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10730#false} is VALID [2022-04-27 10:18:08,060 INFO L290 TraceCheckUtils]: 178: Hoare triple {10730#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); {10730#false} is VALID [2022-04-27 10:18:08,060 INFO L290 TraceCheckUtils]: 179: Hoare triple {10730#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10730#false} is VALID [2022-04-27 10:18:08,060 INFO L290 TraceCheckUtils]: 180: Hoare triple {10730#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10730#false} is VALID [2022-04-27 10:18:08,060 INFO L290 TraceCheckUtils]: 181: Hoare triple {10730#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); {10730#false} is VALID [2022-04-27 10:18:08,060 INFO L290 TraceCheckUtils]: 182: Hoare triple {10730#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10730#false} is VALID [2022-04-27 10:18:08,060 INFO L290 TraceCheckUtils]: 183: Hoare triple {10730#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10730#false} is VALID [2022-04-27 10:18:08,060 INFO L290 TraceCheckUtils]: 184: Hoare triple {10730#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); {10730#false} is VALID [2022-04-27 10:18:08,060 INFO L290 TraceCheckUtils]: 185: Hoare triple {10730#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10730#false} is VALID [2022-04-27 10:18:08,060 INFO L290 TraceCheckUtils]: 186: Hoare triple {10730#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10730#false} is VALID [2022-04-27 10:18:08,060 INFO L290 TraceCheckUtils]: 187: Hoare triple {10730#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); {10730#false} is VALID [2022-04-27 10:18:08,060 INFO L290 TraceCheckUtils]: 188: Hoare triple {10730#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10730#false} is VALID [2022-04-27 10:18:08,061 INFO L290 TraceCheckUtils]: 189: Hoare triple {10730#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10730#false} is VALID [2022-04-27 10:18:08,061 INFO L290 TraceCheckUtils]: 190: Hoare triple {10730#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); {10730#false} is VALID [2022-04-27 10:18:08,061 INFO L290 TraceCheckUtils]: 191: Hoare triple {10730#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10730#false} is VALID [2022-04-27 10:18:08,061 INFO L290 TraceCheckUtils]: 192: Hoare triple {10730#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10730#false} is VALID [2022-04-27 10:18:08,061 INFO L290 TraceCheckUtils]: 193: Hoare triple {10730#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); {10730#false} is VALID [2022-04-27 10:18:08,061 INFO L290 TraceCheckUtils]: 194: Hoare triple {10730#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10730#false} is VALID [2022-04-27 10:18:08,061 INFO L290 TraceCheckUtils]: 195: Hoare triple {10730#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10730#false} is VALID [2022-04-27 10:18:08,061 INFO L290 TraceCheckUtils]: 196: Hoare triple {10730#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); {10730#false} is VALID [2022-04-27 10:18:08,061 INFO L290 TraceCheckUtils]: 197: Hoare triple {10730#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10730#false} is VALID [2022-04-27 10:18:08,061 INFO L290 TraceCheckUtils]: 198: Hoare triple {10730#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10730#false} is VALID [2022-04-27 10:18:08,061 INFO L290 TraceCheckUtils]: 199: Hoare triple {10730#false} assume !(~i~0 < ~edgecount~0); {10730#false} is VALID [2022-04-27 10:18:08,061 INFO L290 TraceCheckUtils]: 200: Hoare triple {10730#false} ~i~0 := 0; {10730#false} is VALID [2022-04-27 10:18:08,061 INFO L290 TraceCheckUtils]: 201: Hoare triple {10730#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,061 INFO L272 TraceCheckUtils]: 202: Hoare triple {10730#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {10730#false} is VALID [2022-04-27 10:18:08,061 INFO L290 TraceCheckUtils]: 203: Hoare triple {10730#false} ~cond := #in~cond; {10730#false} is VALID [2022-04-27 10:18:08,061 INFO L290 TraceCheckUtils]: 204: Hoare triple {10730#false} assume 0 == ~cond; {10730#false} is VALID [2022-04-27 10:18:08,061 INFO L290 TraceCheckUtils]: 205: Hoare triple {10730#false} assume !false; {10730#false} is VALID [2022-04-27 10:18:08,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3216 backedges. 1162 proven. 176 refuted. 0 times theorem prover too weak. 1878 trivial. 0 not checked. [2022-04-27 10:18:08,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:18:08,645 INFO L290 TraceCheckUtils]: 205: Hoare triple {10730#false} assume !false; {10730#false} is VALID [2022-04-27 10:18:08,646 INFO L290 TraceCheckUtils]: 204: Hoare triple {10730#false} assume 0 == ~cond; {10730#false} is VALID [2022-04-27 10:18:08,646 INFO L290 TraceCheckUtils]: 203: Hoare triple {10730#false} ~cond := #in~cond; {10730#false} is VALID [2022-04-27 10:18:08,646 INFO L272 TraceCheckUtils]: 202: Hoare triple {10730#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {10730#false} is VALID [2022-04-27 10:18:08,646 INFO L290 TraceCheckUtils]: 201: Hoare triple {10730#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,646 INFO L290 TraceCheckUtils]: 200: Hoare triple {10730#false} ~i~0 := 0; {10730#false} is VALID [2022-04-27 10:18:08,646 INFO L290 TraceCheckUtils]: 199: Hoare triple {10730#false} assume !(~i~0 < ~edgecount~0); {10730#false} is VALID [2022-04-27 10:18:08,646 INFO L290 TraceCheckUtils]: 198: Hoare triple {10730#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10730#false} is VALID [2022-04-27 10:18:08,646 INFO L290 TraceCheckUtils]: 197: Hoare triple {10730#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10730#false} is VALID [2022-04-27 10:18:08,646 INFO L290 TraceCheckUtils]: 196: Hoare triple {10730#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); {10730#false} is VALID [2022-04-27 10:18:08,646 INFO L290 TraceCheckUtils]: 195: Hoare triple {10730#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10730#false} is VALID [2022-04-27 10:18:08,646 INFO L290 TraceCheckUtils]: 194: Hoare triple {10730#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10730#false} is VALID [2022-04-27 10:18:08,646 INFO L290 TraceCheckUtils]: 193: Hoare triple {10730#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); {10730#false} is VALID [2022-04-27 10:18:08,646 INFO L290 TraceCheckUtils]: 192: Hoare triple {10730#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10730#false} is VALID [2022-04-27 10:18:08,646 INFO L290 TraceCheckUtils]: 191: Hoare triple {10730#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10730#false} is VALID [2022-04-27 10:18:08,646 INFO L290 TraceCheckUtils]: 190: Hoare triple {10730#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); {10730#false} is VALID [2022-04-27 10:18:08,646 INFO L290 TraceCheckUtils]: 189: Hoare triple {10730#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10730#false} is VALID [2022-04-27 10:18:08,646 INFO L290 TraceCheckUtils]: 188: Hoare triple {10730#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10730#false} is VALID [2022-04-27 10:18:08,646 INFO L290 TraceCheckUtils]: 187: Hoare triple {10730#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); {10730#false} is VALID [2022-04-27 10:18:08,646 INFO L290 TraceCheckUtils]: 186: Hoare triple {10730#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10730#false} is VALID [2022-04-27 10:18:08,646 INFO L290 TraceCheckUtils]: 185: Hoare triple {10730#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10730#false} is VALID [2022-04-27 10:18:08,647 INFO L290 TraceCheckUtils]: 184: Hoare triple {10730#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); {10730#false} is VALID [2022-04-27 10:18:08,647 INFO L290 TraceCheckUtils]: 183: Hoare triple {10730#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10730#false} is VALID [2022-04-27 10:18:08,647 INFO L290 TraceCheckUtils]: 182: Hoare triple {10730#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10730#false} is VALID [2022-04-27 10:18:08,647 INFO L290 TraceCheckUtils]: 181: Hoare triple {10730#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); {10730#false} is VALID [2022-04-27 10:18:08,647 INFO L290 TraceCheckUtils]: 180: Hoare triple {10730#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10730#false} is VALID [2022-04-27 10:18:08,647 INFO L290 TraceCheckUtils]: 179: Hoare triple {10730#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10730#false} is VALID [2022-04-27 10:18:08,647 INFO L290 TraceCheckUtils]: 178: Hoare triple {10730#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); {10730#false} is VALID [2022-04-27 10:18:08,647 INFO L290 TraceCheckUtils]: 177: Hoare triple {10730#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10730#false} is VALID [2022-04-27 10:18:08,647 INFO L290 TraceCheckUtils]: 176: Hoare triple {10730#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10730#false} is VALID [2022-04-27 10:18:08,647 INFO L290 TraceCheckUtils]: 175: Hoare triple {10730#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); {10730#false} is VALID [2022-04-27 10:18:08,647 INFO L290 TraceCheckUtils]: 174: Hoare triple {10730#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10730#false} is VALID [2022-04-27 10:18:08,647 INFO L290 TraceCheckUtils]: 173: Hoare triple {10730#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10730#false} is VALID [2022-04-27 10:18:08,647 INFO L290 TraceCheckUtils]: 172: Hoare triple {10730#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); {10730#false} is VALID [2022-04-27 10:18:08,647 INFO L290 TraceCheckUtils]: 171: Hoare triple {10730#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {10730#false} is VALID [2022-04-27 10:18:08,647 INFO L290 TraceCheckUtils]: 170: Hoare triple {10730#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {10730#false} is VALID [2022-04-27 10:18:08,647 INFO L290 TraceCheckUtils]: 169: Hoare triple {10730#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); {10730#false} is VALID [2022-04-27 10:18:08,647 INFO L290 TraceCheckUtils]: 168: Hoare triple {10730#false} ~i~0 := 0; {10730#false} is VALID [2022-04-27 10:18:08,647 INFO L290 TraceCheckUtils]: 167: Hoare triple {10730#false} assume !(~i~0 < ~nodecount~0); {10730#false} is VALID [2022-04-27 10:18:08,647 INFO L290 TraceCheckUtils]: 166: Hoare triple {10730#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10730#false} is VALID [2022-04-27 10:18:08,647 INFO L290 TraceCheckUtils]: 165: Hoare triple {10730#false} assume !(~j~0 < ~edgecount~0); {10730#false} is VALID [2022-04-27 10:18:08,647 INFO L290 TraceCheckUtils]: 164: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,648 INFO L290 TraceCheckUtils]: 163: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,648 INFO L290 TraceCheckUtils]: 162: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,648 INFO L290 TraceCheckUtils]: 161: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,648 INFO L290 TraceCheckUtils]: 160: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,648 INFO L290 TraceCheckUtils]: 159: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,648 INFO L290 TraceCheckUtils]: 158: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,648 INFO L290 TraceCheckUtils]: 157: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,648 INFO L290 TraceCheckUtils]: 156: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,648 INFO L290 TraceCheckUtils]: 155: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,648 INFO L290 TraceCheckUtils]: 154: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,648 INFO L290 TraceCheckUtils]: 153: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,648 INFO L290 TraceCheckUtils]: 152: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,648 INFO L290 TraceCheckUtils]: 151: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,648 INFO L290 TraceCheckUtils]: 150: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,648 INFO L290 TraceCheckUtils]: 149: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,648 INFO L290 TraceCheckUtils]: 148: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,648 INFO L290 TraceCheckUtils]: 147: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,648 INFO L290 TraceCheckUtils]: 146: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,648 INFO L290 TraceCheckUtils]: 145: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,648 INFO L290 TraceCheckUtils]: 144: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,649 INFO L290 TraceCheckUtils]: 143: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,649 INFO L290 TraceCheckUtils]: 142: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,649 INFO L290 TraceCheckUtils]: 141: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,649 INFO L290 TraceCheckUtils]: 140: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,649 INFO L290 TraceCheckUtils]: 139: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,649 INFO L290 TraceCheckUtils]: 138: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,649 INFO L290 TraceCheckUtils]: 137: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,649 INFO L290 TraceCheckUtils]: 136: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,649 INFO L290 TraceCheckUtils]: 135: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,649 INFO L290 TraceCheckUtils]: 134: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,649 INFO L290 TraceCheckUtils]: 133: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,649 INFO L290 TraceCheckUtils]: 132: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,649 INFO L290 TraceCheckUtils]: 131: Hoare triple {10730#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {10730#false} is VALID [2022-04-27 10:18:08,649 INFO L290 TraceCheckUtils]: 130: Hoare triple {10730#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10730#false} is VALID [2022-04-27 10:18:08,649 INFO L290 TraceCheckUtils]: 129: Hoare triple {10730#false} assume !(~j~0 < ~edgecount~0); {10730#false} is VALID [2022-04-27 10:18:08,649 INFO L290 TraceCheckUtils]: 128: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,649 INFO L290 TraceCheckUtils]: 127: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,649 INFO L290 TraceCheckUtils]: 126: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,649 INFO L290 TraceCheckUtils]: 125: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,649 INFO L290 TraceCheckUtils]: 124: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,649 INFO L290 TraceCheckUtils]: 123: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,650 INFO L290 TraceCheckUtils]: 122: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,650 INFO L290 TraceCheckUtils]: 121: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,650 INFO L290 TraceCheckUtils]: 120: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,650 INFO L290 TraceCheckUtils]: 119: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,650 INFO L290 TraceCheckUtils]: 118: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,650 INFO L290 TraceCheckUtils]: 117: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,650 INFO L290 TraceCheckUtils]: 116: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,650 INFO L290 TraceCheckUtils]: 115: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,650 INFO L290 TraceCheckUtils]: 114: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,650 INFO L290 TraceCheckUtils]: 113: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,650 INFO L290 TraceCheckUtils]: 112: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,650 INFO L290 TraceCheckUtils]: 111: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,650 INFO L290 TraceCheckUtils]: 110: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,650 INFO L290 TraceCheckUtils]: 109: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,650 INFO L290 TraceCheckUtils]: 108: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,650 INFO L290 TraceCheckUtils]: 107: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,650 INFO L290 TraceCheckUtils]: 106: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,650 INFO L290 TraceCheckUtils]: 105: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,650 INFO L290 TraceCheckUtils]: 104: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,650 INFO L290 TraceCheckUtils]: 103: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,650 INFO L290 TraceCheckUtils]: 102: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,650 INFO L290 TraceCheckUtils]: 101: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,651 INFO L290 TraceCheckUtils]: 100: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,651 INFO L290 TraceCheckUtils]: 99: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,651 INFO L290 TraceCheckUtils]: 98: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,651 INFO L290 TraceCheckUtils]: 97: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,651 INFO L290 TraceCheckUtils]: 96: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,651 INFO L290 TraceCheckUtils]: 95: Hoare triple {10730#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {10730#false} is VALID [2022-04-27 10:18:08,651 INFO L290 TraceCheckUtils]: 94: Hoare triple {10730#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10730#false} is VALID [2022-04-27 10:18:08,651 INFO L290 TraceCheckUtils]: 93: Hoare triple {10730#false} assume !(~j~0 < ~edgecount~0); {10730#false} is VALID [2022-04-27 10:18:08,651 INFO L290 TraceCheckUtils]: 92: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,651 INFO L290 TraceCheckUtils]: 91: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,651 INFO L290 TraceCheckUtils]: 90: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,651 INFO L290 TraceCheckUtils]: 89: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,651 INFO L290 TraceCheckUtils]: 88: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,651 INFO L290 TraceCheckUtils]: 87: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,651 INFO L290 TraceCheckUtils]: 86: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,651 INFO L290 TraceCheckUtils]: 85: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,651 INFO L290 TraceCheckUtils]: 84: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,651 INFO L290 TraceCheckUtils]: 83: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,651 INFO L290 TraceCheckUtils]: 82: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,651 INFO L290 TraceCheckUtils]: 81: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,652 INFO L290 TraceCheckUtils]: 80: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,652 INFO L290 TraceCheckUtils]: 79: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,652 INFO L290 TraceCheckUtils]: 78: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,652 INFO L290 TraceCheckUtils]: 77: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,652 INFO L290 TraceCheckUtils]: 76: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,652 INFO L290 TraceCheckUtils]: 75: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,652 INFO L290 TraceCheckUtils]: 74: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,652 INFO L290 TraceCheckUtils]: 73: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,652 INFO L290 TraceCheckUtils]: 72: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,652 INFO L290 TraceCheckUtils]: 71: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,652 INFO L290 TraceCheckUtils]: 70: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,652 INFO L290 TraceCheckUtils]: 69: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,652 INFO L290 TraceCheckUtils]: 68: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,652 INFO L290 TraceCheckUtils]: 67: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,652 INFO L290 TraceCheckUtils]: 66: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,652 INFO L290 TraceCheckUtils]: 65: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,652 INFO L290 TraceCheckUtils]: 64: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,652 INFO L290 TraceCheckUtils]: 63: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,652 INFO L290 TraceCheckUtils]: 62: Hoare triple {10730#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10730#false} is VALID [2022-04-27 10:18:08,652 INFO L290 TraceCheckUtils]: 61: Hoare triple {10730#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {10730#false} is VALID [2022-04-27 10:18:08,652 INFO L290 TraceCheckUtils]: 60: Hoare triple {10730#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {10730#false} is VALID [2022-04-27 10:18:08,652 INFO L290 TraceCheckUtils]: 59: Hoare triple {10730#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {10730#false} is VALID [2022-04-27 10:18:08,653 INFO L290 TraceCheckUtils]: 58: Hoare triple {10730#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10730#false} is VALID [2022-04-27 10:18:08,655 INFO L290 TraceCheckUtils]: 57: Hoare triple {11822#(< main_~j~0 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {10730#false} is VALID [2022-04-27 10:18:08,656 INFO L290 TraceCheckUtils]: 56: Hoare triple {11826#(< (+ main_~j~0 1) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11822#(< main_~j~0 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,656 INFO L290 TraceCheckUtils]: 55: Hoare triple {11826#(< (+ 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; {11826#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-27 10:18:08,656 INFO L290 TraceCheckUtils]: 54: Hoare triple {11826#(< (+ 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); {11826#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-27 10:18:08,656 INFO L290 TraceCheckUtils]: 53: Hoare triple {11836#(< (+ main_~j~0 2) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11826#(< (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-27 10:18:08,657 INFO L290 TraceCheckUtils]: 52: Hoare triple {11836#(< (+ 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; {11836#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-27 10:18:08,657 INFO L290 TraceCheckUtils]: 51: Hoare triple {11836#(< (+ 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); {11836#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-27 10:18:08,657 INFO L290 TraceCheckUtils]: 50: Hoare triple {11846#(< (+ main_~j~0 3) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11836#(< (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-27 10:18:08,658 INFO L290 TraceCheckUtils]: 49: Hoare triple {11846#(< (+ 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; {11846#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-27 10:18:08,658 INFO L290 TraceCheckUtils]: 48: Hoare triple {11846#(< (+ 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); {11846#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-27 10:18:08,659 INFO L290 TraceCheckUtils]: 47: Hoare triple {11856#(< (+ main_~j~0 4) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11846#(< (+ main_~j~0 3) main_~edgecount~0)} is VALID [2022-04-27 10:18:08,659 INFO L290 TraceCheckUtils]: 46: Hoare triple {11856#(< (+ 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; {11856#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-27 10:18:08,659 INFO L290 TraceCheckUtils]: 45: Hoare triple {11856#(< (+ 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); {11856#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-27 10:18:08,659 INFO L290 TraceCheckUtils]: 44: Hoare triple {11866#(< (+ 5 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11856#(< (+ main_~j~0 4) main_~edgecount~0)} is VALID [2022-04-27 10:18:08,660 INFO L290 TraceCheckUtils]: 43: Hoare triple {11866#(< (+ 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; {11866#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-27 10:18:08,660 INFO L290 TraceCheckUtils]: 42: Hoare triple {11866#(< (+ 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); {11866#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-27 10:18:08,660 INFO L290 TraceCheckUtils]: 41: Hoare triple {11876#(< (+ main_~j~0 6) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11866#(< (+ 5 main_~j~0) main_~edgecount~0)} is VALID [2022-04-27 10:18:08,660 INFO L290 TraceCheckUtils]: 40: Hoare triple {11876#(< (+ 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; {11876#(< (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-27 10:18:08,661 INFO L290 TraceCheckUtils]: 39: Hoare triple {11876#(< (+ 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); {11876#(< (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-27 10:18:08,661 INFO L290 TraceCheckUtils]: 38: Hoare triple {11886#(< (+ 7 main_~j~0) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11876#(< (+ main_~j~0 6) main_~edgecount~0)} is VALID [2022-04-27 10:18:08,661 INFO L290 TraceCheckUtils]: 37: Hoare triple {11886#(< (+ 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; {11886#(< (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-27 10:18:08,662 INFO L290 TraceCheckUtils]: 36: Hoare triple {11886#(< (+ 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); {11886#(< (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-27 10:18:08,662 INFO L290 TraceCheckUtils]: 35: Hoare triple {10746#(<= (+ main_~j~0 9) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {11886#(< (+ 7 main_~j~0) main_~edgecount~0)} is VALID [2022-04-27 10:18:08,662 INFO L290 TraceCheckUtils]: 34: Hoare triple {10746#(<= (+ 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; {10746#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-27 10:18:08,663 INFO L290 TraceCheckUtils]: 33: Hoare triple {10746#(<= (+ 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); {10746#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-27 10:18:08,663 INFO L290 TraceCheckUtils]: 32: Hoare triple {10745#(<= (+ main_~j~0 10) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10746#(<= (+ main_~j~0 9) main_~edgecount~0)} is VALID [2022-04-27 10:18:08,663 INFO L290 TraceCheckUtils]: 31: Hoare triple {10745#(<= (+ 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; {10745#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-27 10:18:08,664 INFO L290 TraceCheckUtils]: 30: Hoare triple {10745#(<= (+ 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); {10745#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-27 10:18:08,664 INFO L290 TraceCheckUtils]: 29: Hoare triple {10744#(<= (+ main_~j~0 11) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10745#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2022-04-27 10:18:08,664 INFO L290 TraceCheckUtils]: 28: Hoare triple {10744#(<= (+ 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; {10744#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-27 10:18:08,664 INFO L290 TraceCheckUtils]: 27: Hoare triple {10744#(<= (+ 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); {10744#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-27 10:18:08,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {10743#(<= (+ main_~j~0 12) main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {10744#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2022-04-27 10:18:08,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {10743#(<= (+ 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; {10743#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-27 10:18:08,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {10743#(<= (+ 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); {10743#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-27 10:18:08,665 INFO L290 TraceCheckUtils]: 23: Hoare triple {11932#(<= 12 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {10743#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2022-04-27 10:18:08,666 INFO L290 TraceCheckUtils]: 22: Hoare triple {11932#(<= 12 main_~edgecount~0)} ~i~0 := 0; {11932#(<= 12 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,666 INFO L290 TraceCheckUtils]: 21: Hoare triple {11932#(<= 12 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {11932#(<= 12 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,666 INFO L290 TraceCheckUtils]: 20: Hoare triple {11932#(<= 12 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11932#(<= 12 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {11932#(<= 12 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11932#(<= 12 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,667 INFO L290 TraceCheckUtils]: 18: Hoare triple {11932#(<= 12 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11932#(<= 12 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,667 INFO L290 TraceCheckUtils]: 17: Hoare triple {11932#(<= 12 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11932#(<= 12 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,667 INFO L290 TraceCheckUtils]: 16: Hoare triple {11932#(<= 12 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11932#(<= 12 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,667 INFO L290 TraceCheckUtils]: 15: Hoare triple {11932#(<= 12 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11932#(<= 12 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {11932#(<= 12 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11932#(<= 12 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {11932#(<= 12 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11932#(<= 12 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {11932#(<= 12 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11932#(<= 12 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {11932#(<= 12 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11932#(<= 12 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {11932#(<= 12 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11932#(<= 12 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {11932#(<= 12 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11932#(<= 12 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {11932#(<= 12 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11932#(<= 12 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {11932#(<= 12 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11932#(<= 12 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {11932#(<= 12 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11932#(<= 12 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {10729#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {11932#(<= 12 main_~edgecount~0)} is VALID [2022-04-27 10:18:08,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {10729#true} call #t~ret22 := main(); {10729#true} is VALID [2022-04-27 10:18:08,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10729#true} {10729#true} #107#return; {10729#true} is VALID [2022-04-27 10:18:08,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {10729#true} assume true; {10729#true} is VALID [2022-04-27 10:18:08,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {10729#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; {10729#true} is VALID [2022-04-27 10:18:08,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {10729#true} call ULTIMATE.init(); {10729#true} is VALID [2022-04-27 10:18:08,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3216 backedges. 1162 proven. 176 refuted. 0 times theorem prover too weak. 1878 trivial. 0 not checked. [2022-04-27 10:18:08,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488594796] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:18:08,672 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:18:08,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 37 [2022-04-27 10:18:08,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670788929] [2022-04-27 10:18:08,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:18:08,673 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.5135135135135136) internal successors, (130), 36 states have internal predecessors, (130), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 206 [2022-04-27 10:18:08,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:18:08,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 3.5135135135135136) internal successors, (130), 36 states have internal predecessors, (130), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:08,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:08,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-27 10:18:08,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:18:08,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-27 10:18:08,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=539, Invalid=793, Unknown=0, NotChecked=0, Total=1332 [2022-04-27 10:18:08,758 INFO L87 Difference]: Start difference. First operand 211 states and 263 transitions. Second operand has 37 states, 37 states have (on average 3.5135135135135136) internal successors, (130), 36 states have internal predecessors, (130), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:10,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:10,037 INFO L93 Difference]: Finished difference Result 472 states and 634 transitions. [2022-04-27 10:18:10,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-27 10:18:10,037 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.5135135135135136) internal successors, (130), 36 states have internal predecessors, (130), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 206 [2022-04-27 10:18:10,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:18:10,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 3.5135135135135136) internal successors, (130), 36 states have internal predecessors, (130), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:10,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 146 transitions. [2022-04-27 10:18:10,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 3.5135135135135136) internal successors, (130), 36 states have internal predecessors, (130), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:10,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 146 transitions. [2022-04-27 10:18:10,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 146 transitions. [2022-04-27 10:18:10,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:10,158 INFO L225 Difference]: With dead ends: 472 [2022-04-27 10:18:10,159 INFO L226 Difference]: Without dead ends: 319 [2022-04-27 10:18:10,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 392 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1142, Invalid=2164, Unknown=0, NotChecked=0, Total=3306 [2022-04-27 10:18:10,160 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 329 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:18:10,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 55 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:18:10,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-04-27 10:18:10,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2022-04-27 10:18:10,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:18:10,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 319 states. Second operand has 319 states, 313 states have (on average 1.2843450479233227) internal successors, (402), 313 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:18:10,660 INFO L74 IsIncluded]: Start isIncluded. First operand 319 states. Second operand has 319 states, 313 states have (on average 1.2843450479233227) internal successors, (402), 313 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:18:10,661 INFO L87 Difference]: Start difference. First operand 319 states. Second operand has 319 states, 313 states have (on average 1.2843450479233227) internal successors, (402), 313 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:18:10,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:10,665 INFO L93 Difference]: Finished difference Result 319 states and 407 transitions. [2022-04-27 10:18:10,665 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 407 transitions. [2022-04-27 10:18:10,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:10,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:10,666 INFO L74 IsIncluded]: Start isIncluded. First operand has 319 states, 313 states have (on average 1.2843450479233227) internal successors, (402), 313 states have internal predecessors, (402), 3 states have call successors, (3), 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 319 states. [2022-04-27 10:18:10,666 INFO L87 Difference]: Start difference. First operand has 319 states, 313 states have (on average 1.2843450479233227) internal successors, (402), 313 states have internal predecessors, (402), 3 states have call successors, (3), 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 319 states. [2022-04-27 10:18:10,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:10,671 INFO L93 Difference]: Finished difference Result 319 states and 407 transitions. [2022-04-27 10:18:10,671 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 407 transitions. [2022-04-27 10:18:10,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:10,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:10,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:18:10,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:18:10,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 313 states have (on average 1.2843450479233227) internal successors, (402), 313 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:18:10,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 407 transitions. [2022-04-27 10:18:10,677 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 407 transitions. Word has length 206 [2022-04-27 10:18:10,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:18:10,677 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 407 transitions. [2022-04-27 10:18:10,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.5135135135135136) internal successors, (130), 36 states have internal predecessors, (130), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:10,677 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 407 transitions. [2022-04-27 10:18:10,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2022-04-27 10:18:10,679 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:18:10,680 INFO L195 NwaCegarLoop]: trace histogram [80, 80, 80, 10, 10, 10, 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-27 10:18:10,699 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-27 10:18:10,895 WARN L477 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-27 10:18:10,896 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:18:10,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:18:10,896 INFO L85 PathProgramCache]: Analyzing trace with hash -104957764, now seen corresponding path program 8 times [2022-04-27 10:18:10,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:18:10,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925726510] [2022-04-27 10:18:10,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:18:10,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:18:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:11,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:18:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:11,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {13766#(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; {13755#true} is VALID [2022-04-27 10:18:11,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {13755#true} assume true; {13755#true} is VALID [2022-04-27 10:18:11,285 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13755#true} {13755#true} #107#return; {13755#true} is VALID [2022-04-27 10:18:11,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {13755#true} call ULTIMATE.init(); {13766#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:18:11,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {13766#(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; {13755#true} is VALID [2022-04-27 10:18:11,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {13755#true} assume true; {13755#true} is VALID [2022-04-27 10:18:11,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13755#true} {13755#true} #107#return; {13755#true} is VALID [2022-04-27 10:18:11,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {13755#true} call #t~ret22 := main(); {13755#true} is VALID [2022-04-27 10:18:11,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {13755#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {13760#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-27 10:18:11,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {13760#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {13760#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-27 10:18:11,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {13760#(= (+ main_~nodecount~0 (- 5)) 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13760#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-27 10:18:11,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {13760#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13760#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-27 10:18:11,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {13760#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {13760#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-27 10:18:11,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {13760#(= (+ 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); {13760#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-27 10:18:11,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {13760#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13760#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-27 10:18:11,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {13760#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {13760#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-27 10:18:11,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {13760#(= (+ 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); {13760#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-27 10:18:11,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {13760#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13760#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-27 10:18:11,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {13760#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {13760#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-27 10:18:11,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {13760#(= (+ 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); {13760#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-27 10:18:11,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {13760#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13760#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-27 10:18:11,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {13760#(= (+ main_~nodecount~0 (- 5)) 0)} assume !!(~i~0 < ~nodecount~0); {13760#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-27 10:18:11,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {13760#(= (+ 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); {13760#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-27 10:18:11,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {13760#(= (+ main_~nodecount~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13760#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-27 10:18:11,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {13760#(= (+ main_~nodecount~0 (- 5)) 0)} assume !(~i~0 < ~nodecount~0); {13760#(= (+ main_~nodecount~0 (- 5)) 0)} is VALID [2022-04-27 10:18:11,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {13760#(= (+ main_~nodecount~0 (- 5)) 0)} ~i~0 := 0; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,291 INFO L290 TraceCheckUtils]: 24: Hoare triple {13761#(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); {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,291 INFO L290 TraceCheckUtils]: 25: Hoare triple {13761#(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; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,292 INFO L290 TraceCheckUtils]: 26: Hoare triple {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,292 INFO L290 TraceCheckUtils]: 27: Hoare triple {13761#(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); {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,292 INFO L290 TraceCheckUtils]: 28: Hoare triple {13761#(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; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,293 INFO L290 TraceCheckUtils]: 29: Hoare triple {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,293 INFO L290 TraceCheckUtils]: 30: Hoare triple {13761#(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); {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,293 INFO L290 TraceCheckUtils]: 31: Hoare triple {13761#(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; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,294 INFO L290 TraceCheckUtils]: 32: Hoare triple {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,294 INFO L290 TraceCheckUtils]: 33: Hoare triple {13761#(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); {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,294 INFO L290 TraceCheckUtils]: 34: Hoare triple {13761#(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; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,295 INFO L290 TraceCheckUtils]: 35: Hoare triple {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,295 INFO L290 TraceCheckUtils]: 36: Hoare triple {13761#(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); {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,295 INFO L290 TraceCheckUtils]: 37: Hoare triple {13761#(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; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,296 INFO L290 TraceCheckUtils]: 38: Hoare triple {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,296 INFO L290 TraceCheckUtils]: 39: Hoare triple {13761#(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); {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,296 INFO L290 TraceCheckUtils]: 40: Hoare triple {13761#(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; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,297 INFO L290 TraceCheckUtils]: 41: Hoare triple {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,297 INFO L290 TraceCheckUtils]: 42: Hoare triple {13761#(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); {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,297 INFO L290 TraceCheckUtils]: 43: Hoare triple {13761#(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; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,298 INFO L290 TraceCheckUtils]: 44: Hoare triple {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,298 INFO L290 TraceCheckUtils]: 45: Hoare triple {13761#(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); {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,298 INFO L290 TraceCheckUtils]: 46: Hoare triple {13761#(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; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,299 INFO L290 TraceCheckUtils]: 47: Hoare triple {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,299 INFO L290 TraceCheckUtils]: 48: Hoare triple {13761#(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); {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,299 INFO L290 TraceCheckUtils]: 49: Hoare triple {13761#(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; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,300 INFO L290 TraceCheckUtils]: 50: Hoare triple {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,300 INFO L290 TraceCheckUtils]: 51: Hoare triple {13761#(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); {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,300 INFO L290 TraceCheckUtils]: 52: Hoare triple {13761#(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; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,301 INFO L290 TraceCheckUtils]: 53: Hoare triple {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,301 INFO L290 TraceCheckUtils]: 54: Hoare triple {13761#(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); {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,301 INFO L290 TraceCheckUtils]: 55: Hoare triple {13761#(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; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,302 INFO L290 TraceCheckUtils]: 56: Hoare triple {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,302 INFO L290 TraceCheckUtils]: 57: Hoare triple {13761#(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); {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,302 INFO L290 TraceCheckUtils]: 58: Hoare triple {13761#(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; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,303 INFO L290 TraceCheckUtils]: 59: Hoare triple {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,303 INFO L290 TraceCheckUtils]: 60: Hoare triple {13761#(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); {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,303 INFO L290 TraceCheckUtils]: 61: Hoare triple {13761#(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; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,304 INFO L290 TraceCheckUtils]: 62: Hoare triple {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,304 INFO L290 TraceCheckUtils]: 63: Hoare triple {13761#(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); {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,304 INFO L290 TraceCheckUtils]: 64: Hoare triple {13761#(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; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,305 INFO L290 TraceCheckUtils]: 65: Hoare triple {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,305 INFO L290 TraceCheckUtils]: 66: Hoare triple {13761#(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); {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,305 INFO L290 TraceCheckUtils]: 67: Hoare triple {13761#(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; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,306 INFO L290 TraceCheckUtils]: 68: Hoare triple {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,306 INFO L290 TraceCheckUtils]: 69: Hoare triple {13761#(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); {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,307 INFO L290 TraceCheckUtils]: 70: Hoare triple {13761#(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; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,307 INFO L290 TraceCheckUtils]: 71: Hoare triple {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,307 INFO L290 TraceCheckUtils]: 72: Hoare triple {13761#(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); {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,308 INFO L290 TraceCheckUtils]: 73: Hoare triple {13761#(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; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,308 INFO L290 TraceCheckUtils]: 74: Hoare triple {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,308 INFO L290 TraceCheckUtils]: 75: Hoare triple {13761#(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); {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,309 INFO L290 TraceCheckUtils]: 76: Hoare triple {13761#(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; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,309 INFO L290 TraceCheckUtils]: 77: Hoare triple {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,309 INFO L290 TraceCheckUtils]: 78: Hoare triple {13761#(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); {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,310 INFO L290 TraceCheckUtils]: 79: Hoare triple {13761#(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; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,310 INFO L290 TraceCheckUtils]: 80: Hoare triple {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,310 INFO L290 TraceCheckUtils]: 81: Hoare triple {13761#(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); {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,311 INFO L290 TraceCheckUtils]: 82: Hoare triple {13761#(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; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,311 INFO L290 TraceCheckUtils]: 83: Hoare triple {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,311 INFO L290 TraceCheckUtils]: 84: Hoare triple {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} assume !(~j~0 < ~edgecount~0); {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:11,311 INFO L290 TraceCheckUtils]: 85: Hoare triple {13761#(and (= (+ main_~nodecount~0 (- 5)) 0) (= main_~i~0 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,312 INFO L290 TraceCheckUtils]: 86: Hoare triple {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,312 INFO L290 TraceCheckUtils]: 87: Hoare triple {13762#(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); {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,312 INFO L290 TraceCheckUtils]: 88: Hoare triple {13762#(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; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,313 INFO L290 TraceCheckUtils]: 89: Hoare triple {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,313 INFO L290 TraceCheckUtils]: 90: Hoare triple {13762#(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); {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,313 INFO L290 TraceCheckUtils]: 91: Hoare triple {13762#(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; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,314 INFO L290 TraceCheckUtils]: 92: Hoare triple {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,314 INFO L290 TraceCheckUtils]: 93: Hoare triple {13762#(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); {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,314 INFO L290 TraceCheckUtils]: 94: Hoare triple {13762#(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; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,315 INFO L290 TraceCheckUtils]: 95: Hoare triple {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,315 INFO L290 TraceCheckUtils]: 96: Hoare triple {13762#(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); {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,316 INFO L290 TraceCheckUtils]: 97: Hoare triple {13762#(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; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,316 INFO L290 TraceCheckUtils]: 98: Hoare triple {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,316 INFO L290 TraceCheckUtils]: 99: Hoare triple {13762#(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); {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,317 INFO L290 TraceCheckUtils]: 100: Hoare triple {13762#(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; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,317 INFO L290 TraceCheckUtils]: 101: Hoare triple {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,317 INFO L290 TraceCheckUtils]: 102: Hoare triple {13762#(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); {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,318 INFO L290 TraceCheckUtils]: 103: Hoare triple {13762#(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; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,318 INFO L290 TraceCheckUtils]: 104: Hoare triple {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,318 INFO L290 TraceCheckUtils]: 105: Hoare triple {13762#(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); {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,319 INFO L290 TraceCheckUtils]: 106: Hoare triple {13762#(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; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,319 INFO L290 TraceCheckUtils]: 107: Hoare triple {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,319 INFO L290 TraceCheckUtils]: 108: Hoare triple {13762#(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); {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,320 INFO L290 TraceCheckUtils]: 109: Hoare triple {13762#(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; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,320 INFO L290 TraceCheckUtils]: 110: Hoare triple {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,320 INFO L290 TraceCheckUtils]: 111: Hoare triple {13762#(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); {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,321 INFO L290 TraceCheckUtils]: 112: Hoare triple {13762#(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; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,321 INFO L290 TraceCheckUtils]: 113: Hoare triple {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,321 INFO L290 TraceCheckUtils]: 114: Hoare triple {13762#(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); {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,322 INFO L290 TraceCheckUtils]: 115: Hoare triple {13762#(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; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,322 INFO L290 TraceCheckUtils]: 116: Hoare triple {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,322 INFO L290 TraceCheckUtils]: 117: Hoare triple {13762#(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); {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,323 INFO L290 TraceCheckUtils]: 118: Hoare triple {13762#(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; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,323 INFO L290 TraceCheckUtils]: 119: Hoare triple {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,323 INFO L290 TraceCheckUtils]: 120: Hoare triple {13762#(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); {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,324 INFO L290 TraceCheckUtils]: 121: Hoare triple {13762#(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; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,324 INFO L290 TraceCheckUtils]: 122: Hoare triple {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,324 INFO L290 TraceCheckUtils]: 123: Hoare triple {13762#(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); {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,325 INFO L290 TraceCheckUtils]: 124: Hoare triple {13762#(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; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,325 INFO L290 TraceCheckUtils]: 125: Hoare triple {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,325 INFO L290 TraceCheckUtils]: 126: Hoare triple {13762#(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); {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,326 INFO L290 TraceCheckUtils]: 127: Hoare triple {13762#(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; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,326 INFO L290 TraceCheckUtils]: 128: Hoare triple {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,326 INFO L290 TraceCheckUtils]: 129: Hoare triple {13762#(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); {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,327 INFO L290 TraceCheckUtils]: 130: Hoare triple {13762#(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; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,327 INFO L290 TraceCheckUtils]: 131: Hoare triple {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,327 INFO L290 TraceCheckUtils]: 132: Hoare triple {13762#(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); {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,328 INFO L290 TraceCheckUtils]: 133: Hoare triple {13762#(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; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,328 INFO L290 TraceCheckUtils]: 134: Hoare triple {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,328 INFO L290 TraceCheckUtils]: 135: Hoare triple {13762#(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); {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,329 INFO L290 TraceCheckUtils]: 136: Hoare triple {13762#(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; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,329 INFO L290 TraceCheckUtils]: 137: Hoare triple {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,329 INFO L290 TraceCheckUtils]: 138: Hoare triple {13762#(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); {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,330 INFO L290 TraceCheckUtils]: 139: Hoare triple {13762#(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; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,330 INFO L290 TraceCheckUtils]: 140: Hoare triple {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,330 INFO L290 TraceCheckUtils]: 141: Hoare triple {13762#(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); {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,331 INFO L290 TraceCheckUtils]: 142: Hoare triple {13762#(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; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,331 INFO L290 TraceCheckUtils]: 143: Hoare triple {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,331 INFO L290 TraceCheckUtils]: 144: Hoare triple {13762#(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); {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,332 INFO L290 TraceCheckUtils]: 145: Hoare triple {13762#(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; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,332 INFO L290 TraceCheckUtils]: 146: Hoare triple {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,332 INFO L290 TraceCheckUtils]: 147: Hoare triple {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~j~0 < ~edgecount~0); {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,333 INFO L290 TraceCheckUtils]: 148: Hoare triple {13762#(and (<= main_~i~0 1) (= (+ main_~nodecount~0 (- 5)) 0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,333 INFO L290 TraceCheckUtils]: 149: Hoare triple {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,333 INFO L290 TraceCheckUtils]: 150: Hoare triple {13763#(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); {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,334 INFO L290 TraceCheckUtils]: 151: Hoare triple {13763#(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; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,334 INFO L290 TraceCheckUtils]: 152: Hoare triple {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,334 INFO L290 TraceCheckUtils]: 153: Hoare triple {13763#(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); {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,335 INFO L290 TraceCheckUtils]: 154: Hoare triple {13763#(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; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,335 INFO L290 TraceCheckUtils]: 155: Hoare triple {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,335 INFO L290 TraceCheckUtils]: 156: Hoare triple {13763#(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); {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,336 INFO L290 TraceCheckUtils]: 157: Hoare triple {13763#(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; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,336 INFO L290 TraceCheckUtils]: 158: Hoare triple {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,336 INFO L290 TraceCheckUtils]: 159: Hoare triple {13763#(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); {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,337 INFO L290 TraceCheckUtils]: 160: Hoare triple {13763#(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; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,337 INFO L290 TraceCheckUtils]: 161: Hoare triple {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,337 INFO L290 TraceCheckUtils]: 162: Hoare triple {13763#(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); {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,338 INFO L290 TraceCheckUtils]: 163: Hoare triple {13763#(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; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,338 INFO L290 TraceCheckUtils]: 164: Hoare triple {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,338 INFO L290 TraceCheckUtils]: 165: Hoare triple {13763#(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); {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,339 INFO L290 TraceCheckUtils]: 166: Hoare triple {13763#(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; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,339 INFO L290 TraceCheckUtils]: 167: Hoare triple {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,339 INFO L290 TraceCheckUtils]: 168: Hoare triple {13763#(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); {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,340 INFO L290 TraceCheckUtils]: 169: Hoare triple {13763#(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; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,340 INFO L290 TraceCheckUtils]: 170: Hoare triple {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,340 INFO L290 TraceCheckUtils]: 171: Hoare triple {13763#(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); {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,341 INFO L290 TraceCheckUtils]: 172: Hoare triple {13763#(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; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,341 INFO L290 TraceCheckUtils]: 173: Hoare triple {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,341 INFO L290 TraceCheckUtils]: 174: Hoare triple {13763#(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); {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,342 INFO L290 TraceCheckUtils]: 175: Hoare triple {13763#(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; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,342 INFO L290 TraceCheckUtils]: 176: Hoare triple {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,342 INFO L290 TraceCheckUtils]: 177: Hoare triple {13763#(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); {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,343 INFO L290 TraceCheckUtils]: 178: Hoare triple {13763#(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; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,343 INFO L290 TraceCheckUtils]: 179: Hoare triple {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,343 INFO L290 TraceCheckUtils]: 180: Hoare triple {13763#(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); {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,344 INFO L290 TraceCheckUtils]: 181: Hoare triple {13763#(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; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,344 INFO L290 TraceCheckUtils]: 182: Hoare triple {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,344 INFO L290 TraceCheckUtils]: 183: Hoare triple {13763#(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); {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,345 INFO L290 TraceCheckUtils]: 184: Hoare triple {13763#(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; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,345 INFO L290 TraceCheckUtils]: 185: Hoare triple {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,345 INFO L290 TraceCheckUtils]: 186: Hoare triple {13763#(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); {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,346 INFO L290 TraceCheckUtils]: 187: Hoare triple {13763#(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; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,346 INFO L290 TraceCheckUtils]: 188: Hoare triple {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,346 INFO L290 TraceCheckUtils]: 189: Hoare triple {13763#(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); {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,347 INFO L290 TraceCheckUtils]: 190: Hoare triple {13763#(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; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,347 INFO L290 TraceCheckUtils]: 191: Hoare triple {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,348 INFO L290 TraceCheckUtils]: 192: Hoare triple {13763#(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); {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,348 INFO L290 TraceCheckUtils]: 193: Hoare triple {13763#(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; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,348 INFO L290 TraceCheckUtils]: 194: Hoare triple {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,349 INFO L290 TraceCheckUtils]: 195: Hoare triple {13763#(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); {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,349 INFO L290 TraceCheckUtils]: 196: Hoare triple {13763#(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; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,349 INFO L290 TraceCheckUtils]: 197: Hoare triple {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,350 INFO L290 TraceCheckUtils]: 198: Hoare triple {13763#(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); {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,350 INFO L290 TraceCheckUtils]: 199: Hoare triple {13763#(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; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,350 INFO L290 TraceCheckUtils]: 200: Hoare triple {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,351 INFO L290 TraceCheckUtils]: 201: Hoare triple {13763#(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); {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,351 INFO L290 TraceCheckUtils]: 202: Hoare triple {13763#(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; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,351 INFO L290 TraceCheckUtils]: 203: Hoare triple {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,352 INFO L290 TraceCheckUtils]: 204: Hoare triple {13763#(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); {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,352 INFO L290 TraceCheckUtils]: 205: Hoare triple {13763#(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; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,352 INFO L290 TraceCheckUtils]: 206: Hoare triple {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,353 INFO L290 TraceCheckUtils]: 207: Hoare triple {13763#(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); {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,353 INFO L290 TraceCheckUtils]: 208: Hoare triple {13763#(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; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,353 INFO L290 TraceCheckUtils]: 209: Hoare triple {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,353 INFO L290 TraceCheckUtils]: 210: Hoare triple {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} assume !(~j~0 < ~edgecount~0); {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} is VALID [2022-04-27 10:18:11,354 INFO L290 TraceCheckUtils]: 211: Hoare triple {13763#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 2))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,354 INFO L290 TraceCheckUtils]: 212: Hoare triple {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,355 INFO L290 TraceCheckUtils]: 213: Hoare triple {13764#(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); {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,355 INFO L290 TraceCheckUtils]: 214: Hoare triple {13764#(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; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,355 INFO L290 TraceCheckUtils]: 215: Hoare triple {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,356 INFO L290 TraceCheckUtils]: 216: Hoare triple {13764#(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); {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,356 INFO L290 TraceCheckUtils]: 217: Hoare triple {13764#(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; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,356 INFO L290 TraceCheckUtils]: 218: Hoare triple {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,357 INFO L290 TraceCheckUtils]: 219: Hoare triple {13764#(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); {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,357 INFO L290 TraceCheckUtils]: 220: Hoare triple {13764#(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; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,357 INFO L290 TraceCheckUtils]: 221: Hoare triple {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,358 INFO L290 TraceCheckUtils]: 222: Hoare triple {13764#(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); {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,358 INFO L290 TraceCheckUtils]: 223: Hoare triple {13764#(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; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,358 INFO L290 TraceCheckUtils]: 224: Hoare triple {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,359 INFO L290 TraceCheckUtils]: 225: Hoare triple {13764#(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); {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,359 INFO L290 TraceCheckUtils]: 226: Hoare triple {13764#(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; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,359 INFO L290 TraceCheckUtils]: 227: Hoare triple {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,360 INFO L290 TraceCheckUtils]: 228: Hoare triple {13764#(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); {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,360 INFO L290 TraceCheckUtils]: 229: Hoare triple {13764#(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; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,360 INFO L290 TraceCheckUtils]: 230: Hoare triple {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,361 INFO L290 TraceCheckUtils]: 231: Hoare triple {13764#(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); {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,361 INFO L290 TraceCheckUtils]: 232: Hoare triple {13764#(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; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,361 INFO L290 TraceCheckUtils]: 233: Hoare triple {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,362 INFO L290 TraceCheckUtils]: 234: Hoare triple {13764#(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); {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,362 INFO L290 TraceCheckUtils]: 235: Hoare triple {13764#(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; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,362 INFO L290 TraceCheckUtils]: 236: Hoare triple {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,363 INFO L290 TraceCheckUtils]: 237: Hoare triple {13764#(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); {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,363 INFO L290 TraceCheckUtils]: 238: Hoare triple {13764#(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; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,363 INFO L290 TraceCheckUtils]: 239: Hoare triple {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,364 INFO L290 TraceCheckUtils]: 240: Hoare triple {13764#(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); {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,364 INFO L290 TraceCheckUtils]: 241: Hoare triple {13764#(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; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,364 INFO L290 TraceCheckUtils]: 242: Hoare triple {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,365 INFO L290 TraceCheckUtils]: 243: Hoare triple {13764#(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); {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,365 INFO L290 TraceCheckUtils]: 244: Hoare triple {13764#(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; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,365 INFO L290 TraceCheckUtils]: 245: Hoare triple {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,366 INFO L290 TraceCheckUtils]: 246: Hoare triple {13764#(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); {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,366 INFO L290 TraceCheckUtils]: 247: Hoare triple {13764#(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; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,366 INFO L290 TraceCheckUtils]: 248: Hoare triple {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,367 INFO L290 TraceCheckUtils]: 249: Hoare triple {13764#(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); {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,367 INFO L290 TraceCheckUtils]: 250: Hoare triple {13764#(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; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,367 INFO L290 TraceCheckUtils]: 251: Hoare triple {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,368 INFO L290 TraceCheckUtils]: 252: Hoare triple {13764#(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); {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,368 INFO L290 TraceCheckUtils]: 253: Hoare triple {13764#(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; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,368 INFO L290 TraceCheckUtils]: 254: Hoare triple {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,369 INFO L290 TraceCheckUtils]: 255: Hoare triple {13764#(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); {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,369 INFO L290 TraceCheckUtils]: 256: Hoare triple {13764#(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; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,369 INFO L290 TraceCheckUtils]: 257: Hoare triple {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,370 INFO L290 TraceCheckUtils]: 258: Hoare triple {13764#(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); {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,370 INFO L290 TraceCheckUtils]: 259: Hoare triple {13764#(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; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,370 INFO L290 TraceCheckUtils]: 260: Hoare triple {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,371 INFO L290 TraceCheckUtils]: 261: Hoare triple {13764#(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); {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,371 INFO L290 TraceCheckUtils]: 262: Hoare triple {13764#(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; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,371 INFO L290 TraceCheckUtils]: 263: Hoare triple {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,372 INFO L290 TraceCheckUtils]: 264: Hoare triple {13764#(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); {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,372 INFO L290 TraceCheckUtils]: 265: Hoare triple {13764#(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; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,372 INFO L290 TraceCheckUtils]: 266: Hoare triple {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,373 INFO L290 TraceCheckUtils]: 267: Hoare triple {13764#(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); {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,373 INFO L290 TraceCheckUtils]: 268: Hoare triple {13764#(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; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,373 INFO L290 TraceCheckUtils]: 269: Hoare triple {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,374 INFO L290 TraceCheckUtils]: 270: Hoare triple {13764#(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); {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,374 INFO L290 TraceCheckUtils]: 271: Hoare triple {13764#(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; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,374 INFO L290 TraceCheckUtils]: 272: Hoare triple {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,375 INFO L290 TraceCheckUtils]: 273: Hoare triple {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} assume !(~j~0 < ~edgecount~0); {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:11,375 INFO L290 TraceCheckUtils]: 274: Hoare triple {13764#(and (= (+ main_~nodecount~0 (- 5)) 0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13765#(and (<= main_~i~0 4) (= (+ main_~nodecount~0 (- 5)) 0))} is VALID [2022-04-27 10:18:11,375 INFO L290 TraceCheckUtils]: 275: Hoare triple {13765#(and (<= main_~i~0 4) (= (+ main_~nodecount~0 (- 5)) 0))} assume !(~i~0 < ~nodecount~0); {13756#false} is VALID [2022-04-27 10:18:11,375 INFO L290 TraceCheckUtils]: 276: Hoare triple {13756#false} ~i~0 := 0; {13756#false} is VALID [2022-04-27 10:18:11,375 INFO L290 TraceCheckUtils]: 277: Hoare triple {13756#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); {13756#false} is VALID [2022-04-27 10:18:11,375 INFO L290 TraceCheckUtils]: 278: Hoare triple {13756#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13756#false} is VALID [2022-04-27 10:18:11,375 INFO L290 TraceCheckUtils]: 279: Hoare triple {13756#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13756#false} is VALID [2022-04-27 10:18:11,376 INFO L290 TraceCheckUtils]: 280: Hoare triple {13756#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); {13756#false} is VALID [2022-04-27 10:18:11,376 INFO L290 TraceCheckUtils]: 281: Hoare triple {13756#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13756#false} is VALID [2022-04-27 10:18:11,376 INFO L290 TraceCheckUtils]: 282: Hoare triple {13756#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13756#false} is VALID [2022-04-27 10:18:11,376 INFO L290 TraceCheckUtils]: 283: Hoare triple {13756#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); {13756#false} is VALID [2022-04-27 10:18:11,376 INFO L290 TraceCheckUtils]: 284: Hoare triple {13756#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13756#false} is VALID [2022-04-27 10:18:11,376 INFO L290 TraceCheckUtils]: 285: Hoare triple {13756#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13756#false} is VALID [2022-04-27 10:18:11,376 INFO L290 TraceCheckUtils]: 286: Hoare triple {13756#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); {13756#false} is VALID [2022-04-27 10:18:11,376 INFO L290 TraceCheckUtils]: 287: Hoare triple {13756#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13756#false} is VALID [2022-04-27 10:18:11,376 INFO L290 TraceCheckUtils]: 288: Hoare triple {13756#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13756#false} is VALID [2022-04-27 10:18:11,376 INFO L290 TraceCheckUtils]: 289: Hoare triple {13756#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); {13756#false} is VALID [2022-04-27 10:18:11,376 INFO L290 TraceCheckUtils]: 290: Hoare triple {13756#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13756#false} is VALID [2022-04-27 10:18:11,376 INFO L290 TraceCheckUtils]: 291: Hoare triple {13756#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13756#false} is VALID [2022-04-27 10:18:11,376 INFO L290 TraceCheckUtils]: 292: Hoare triple {13756#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); {13756#false} is VALID [2022-04-27 10:18:11,376 INFO L290 TraceCheckUtils]: 293: Hoare triple {13756#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13756#false} is VALID [2022-04-27 10:18:11,376 INFO L290 TraceCheckUtils]: 294: Hoare triple {13756#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13756#false} is VALID [2022-04-27 10:18:11,376 INFO L290 TraceCheckUtils]: 295: Hoare triple {13756#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); {13756#false} is VALID [2022-04-27 10:18:11,376 INFO L290 TraceCheckUtils]: 296: Hoare triple {13756#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13756#false} is VALID [2022-04-27 10:18:11,376 INFO L290 TraceCheckUtils]: 297: Hoare triple {13756#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13756#false} is VALID [2022-04-27 10:18:11,376 INFO L290 TraceCheckUtils]: 298: Hoare triple {13756#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); {13756#false} is VALID [2022-04-27 10:18:11,376 INFO L290 TraceCheckUtils]: 299: Hoare triple {13756#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13756#false} is VALID [2022-04-27 10:18:11,376 INFO L290 TraceCheckUtils]: 300: Hoare triple {13756#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13756#false} is VALID [2022-04-27 10:18:11,376 INFO L290 TraceCheckUtils]: 301: Hoare triple {13756#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); {13756#false} is VALID [2022-04-27 10:18:11,377 INFO L290 TraceCheckUtils]: 302: Hoare triple {13756#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13756#false} is VALID [2022-04-27 10:18:11,377 INFO L290 TraceCheckUtils]: 303: Hoare triple {13756#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13756#false} is VALID [2022-04-27 10:18:11,377 INFO L290 TraceCheckUtils]: 304: Hoare triple {13756#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); {13756#false} is VALID [2022-04-27 10:18:11,377 INFO L290 TraceCheckUtils]: 305: Hoare triple {13756#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13756#false} is VALID [2022-04-27 10:18:11,377 INFO L290 TraceCheckUtils]: 306: Hoare triple {13756#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13756#false} is VALID [2022-04-27 10:18:11,377 INFO L290 TraceCheckUtils]: 307: Hoare triple {13756#false} assume !(~i~0 < ~edgecount~0); {13756#false} is VALID [2022-04-27 10:18:11,377 INFO L290 TraceCheckUtils]: 308: Hoare triple {13756#false} ~i~0 := 0; {13756#false} is VALID [2022-04-27 10:18:11,377 INFO L290 TraceCheckUtils]: 309: Hoare triple {13756#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13756#false} is VALID [2022-04-27 10:18:11,377 INFO L272 TraceCheckUtils]: 310: Hoare triple {13756#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {13756#false} is VALID [2022-04-27 10:18:11,377 INFO L290 TraceCheckUtils]: 311: Hoare triple {13756#false} ~cond := #in~cond; {13756#false} is VALID [2022-04-27 10:18:11,377 INFO L290 TraceCheckUtils]: 312: Hoare triple {13756#false} assume 0 == ~cond; {13756#false} is VALID [2022-04-27 10:18:11,377 INFO L290 TraceCheckUtils]: 313: Hoare triple {13756#false} assume !false; {13756#false} is VALID [2022-04-27 10:18:11,380 INFO L134 CoverageAnalysis]: Checked inductivity of 10002 backedges. 0 proven. 7462 refuted. 0 times theorem prover too weak. 2540 trivial. 0 not checked. [2022-04-27 10:18:11,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:18:11,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925726510] [2022-04-27 10:18:11,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925726510] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:18:11,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682014537] [2022-04-27 10:18:11,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:18:11,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:18:11,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:18:11,382 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-27 10:18:11,422 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-27 10:18:11,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:18:11,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:18:11,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 1897 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 10:18:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:11,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:18:13,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {13755#true} call ULTIMATE.init(); {13755#true} is VALID [2022-04-27 10:18:13,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {13755#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; {13755#true} is VALID [2022-04-27 10:18:13,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {13755#true} assume true; {13755#true} is VALID [2022-04-27 10:18:13,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13755#true} {13755#true} #107#return; {13755#true} is VALID [2022-04-27 10:18:13,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {13755#true} call #t~ret22 := main(); {13755#true} is VALID [2022-04-27 10:18:13,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {13755#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:13,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {13785#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:13,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {13785#(<= 5 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:13,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {13785#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:13,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {13785#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:13,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {13785#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:13,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {13785#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:13,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {13785#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:13,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {13785#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:13,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {13785#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:13,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {13785#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:13,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {13785#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:13,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {13785#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:13,541 INFO L290 TraceCheckUtils]: 18: Hoare triple {13785#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:13,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {13785#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:13,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {13785#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:13,541 INFO L290 TraceCheckUtils]: 21: Hoare triple {13785#(<= 5 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:13,541 INFO L290 TraceCheckUtils]: 22: Hoare triple {13785#(<= 5 main_~nodecount~0)} ~i~0 := 0; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,542 INFO L290 TraceCheckUtils]: 23: Hoare triple {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {13837#(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); {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,543 INFO L290 TraceCheckUtils]: 25: Hoare triple {13837#(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; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,543 INFO L290 TraceCheckUtils]: 26: Hoare triple {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,543 INFO L290 TraceCheckUtils]: 27: Hoare triple {13837#(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); {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,544 INFO L290 TraceCheckUtils]: 28: Hoare triple {13837#(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; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,544 INFO L290 TraceCheckUtils]: 29: Hoare triple {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,544 INFO L290 TraceCheckUtils]: 30: Hoare triple {13837#(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); {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,545 INFO L290 TraceCheckUtils]: 31: Hoare triple {13837#(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; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,545 INFO L290 TraceCheckUtils]: 32: Hoare triple {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,545 INFO L290 TraceCheckUtils]: 33: Hoare triple {13837#(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); {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,546 INFO L290 TraceCheckUtils]: 34: Hoare triple {13837#(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; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,546 INFO L290 TraceCheckUtils]: 35: Hoare triple {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,547 INFO L290 TraceCheckUtils]: 36: Hoare triple {13837#(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); {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,547 INFO L290 TraceCheckUtils]: 37: Hoare triple {13837#(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; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,547 INFO L290 TraceCheckUtils]: 38: Hoare triple {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,548 INFO L290 TraceCheckUtils]: 39: Hoare triple {13837#(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); {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,548 INFO L290 TraceCheckUtils]: 40: Hoare triple {13837#(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; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,548 INFO L290 TraceCheckUtils]: 41: Hoare triple {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,549 INFO L290 TraceCheckUtils]: 42: Hoare triple {13837#(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); {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,549 INFO L290 TraceCheckUtils]: 43: Hoare triple {13837#(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; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,549 INFO L290 TraceCheckUtils]: 44: Hoare triple {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,550 INFO L290 TraceCheckUtils]: 45: Hoare triple {13837#(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); {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,550 INFO L290 TraceCheckUtils]: 46: Hoare triple {13837#(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; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,551 INFO L290 TraceCheckUtils]: 47: Hoare triple {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,551 INFO L290 TraceCheckUtils]: 48: Hoare triple {13837#(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); {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,551 INFO L290 TraceCheckUtils]: 49: Hoare triple {13837#(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; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,552 INFO L290 TraceCheckUtils]: 50: Hoare triple {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,552 INFO L290 TraceCheckUtils]: 51: Hoare triple {13837#(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); {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,552 INFO L290 TraceCheckUtils]: 52: Hoare triple {13837#(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; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,553 INFO L290 TraceCheckUtils]: 53: Hoare triple {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,553 INFO L290 TraceCheckUtils]: 54: Hoare triple {13837#(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); {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,553 INFO L290 TraceCheckUtils]: 55: Hoare triple {13837#(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; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,554 INFO L290 TraceCheckUtils]: 56: Hoare triple {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,554 INFO L290 TraceCheckUtils]: 57: Hoare triple {13837#(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); {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,555 INFO L290 TraceCheckUtils]: 58: Hoare triple {13837#(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; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,555 INFO L290 TraceCheckUtils]: 59: Hoare triple {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,555 INFO L290 TraceCheckUtils]: 60: Hoare triple {13837#(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); {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,556 INFO L290 TraceCheckUtils]: 61: Hoare triple {13837#(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; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,556 INFO L290 TraceCheckUtils]: 62: Hoare triple {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,556 INFO L290 TraceCheckUtils]: 63: Hoare triple {13837#(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); {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,557 INFO L290 TraceCheckUtils]: 64: Hoare triple {13837#(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; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,557 INFO L290 TraceCheckUtils]: 65: Hoare triple {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,557 INFO L290 TraceCheckUtils]: 66: Hoare triple {13837#(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); {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,558 INFO L290 TraceCheckUtils]: 67: Hoare triple {13837#(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; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,558 INFO L290 TraceCheckUtils]: 68: Hoare triple {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,558 INFO L290 TraceCheckUtils]: 69: Hoare triple {13837#(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); {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,559 INFO L290 TraceCheckUtils]: 70: Hoare triple {13837#(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; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,559 INFO L290 TraceCheckUtils]: 71: Hoare triple {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,560 INFO L290 TraceCheckUtils]: 72: Hoare triple {13837#(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); {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,560 INFO L290 TraceCheckUtils]: 73: Hoare triple {13837#(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; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,560 INFO L290 TraceCheckUtils]: 74: Hoare triple {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,561 INFO L290 TraceCheckUtils]: 75: Hoare triple {13837#(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); {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,561 INFO L290 TraceCheckUtils]: 76: Hoare triple {13837#(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; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,561 INFO L290 TraceCheckUtils]: 77: Hoare triple {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,562 INFO L290 TraceCheckUtils]: 78: Hoare triple {13837#(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); {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,562 INFO L290 TraceCheckUtils]: 79: Hoare triple {13837#(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; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,562 INFO L290 TraceCheckUtils]: 80: Hoare triple {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,563 INFO L290 TraceCheckUtils]: 81: Hoare triple {13837#(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); {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,563 INFO L290 TraceCheckUtils]: 82: Hoare triple {13837#(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; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,563 INFO L290 TraceCheckUtils]: 83: Hoare triple {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,564 INFO L290 TraceCheckUtils]: 84: Hoare triple {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,564 INFO L290 TraceCheckUtils]: 85: Hoare triple {13837#(and (<= main_~i~0 0) (<= 5 main_~nodecount~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,564 INFO L290 TraceCheckUtils]: 86: Hoare triple {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,565 INFO L290 TraceCheckUtils]: 87: Hoare triple {14027#(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); {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,565 INFO L290 TraceCheckUtils]: 88: Hoare triple {14027#(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; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,565 INFO L290 TraceCheckUtils]: 89: Hoare triple {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,566 INFO L290 TraceCheckUtils]: 90: Hoare triple {14027#(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); {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,566 INFO L290 TraceCheckUtils]: 91: Hoare triple {14027#(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; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,566 INFO L290 TraceCheckUtils]: 92: Hoare triple {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,567 INFO L290 TraceCheckUtils]: 93: Hoare triple {14027#(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); {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,567 INFO L290 TraceCheckUtils]: 94: Hoare triple {14027#(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; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,568 INFO L290 TraceCheckUtils]: 95: Hoare triple {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,568 INFO L290 TraceCheckUtils]: 96: Hoare triple {14027#(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); {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,568 INFO L290 TraceCheckUtils]: 97: Hoare triple {14027#(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; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,569 INFO L290 TraceCheckUtils]: 98: Hoare triple {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,569 INFO L290 TraceCheckUtils]: 99: Hoare triple {14027#(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); {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,569 INFO L290 TraceCheckUtils]: 100: Hoare triple {14027#(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; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,570 INFO L290 TraceCheckUtils]: 101: Hoare triple {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,570 INFO L290 TraceCheckUtils]: 102: Hoare triple {14027#(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); {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,570 INFO L290 TraceCheckUtils]: 103: Hoare triple {14027#(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; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,571 INFO L290 TraceCheckUtils]: 104: Hoare triple {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,571 INFO L290 TraceCheckUtils]: 105: Hoare triple {14027#(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); {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,572 INFO L290 TraceCheckUtils]: 106: Hoare triple {14027#(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; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,572 INFO L290 TraceCheckUtils]: 107: Hoare triple {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,572 INFO L290 TraceCheckUtils]: 108: Hoare triple {14027#(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); {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,573 INFO L290 TraceCheckUtils]: 109: Hoare triple {14027#(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; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,573 INFO L290 TraceCheckUtils]: 110: Hoare triple {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,573 INFO L290 TraceCheckUtils]: 111: Hoare triple {14027#(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); {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,574 INFO L290 TraceCheckUtils]: 112: Hoare triple {14027#(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; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,574 INFO L290 TraceCheckUtils]: 113: Hoare triple {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,574 INFO L290 TraceCheckUtils]: 114: Hoare triple {14027#(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); {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,575 INFO L290 TraceCheckUtils]: 115: Hoare triple {14027#(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; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,575 INFO L290 TraceCheckUtils]: 116: Hoare triple {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,575 INFO L290 TraceCheckUtils]: 117: Hoare triple {14027#(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); {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,576 INFO L290 TraceCheckUtils]: 118: Hoare triple {14027#(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; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,576 INFO L290 TraceCheckUtils]: 119: Hoare triple {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,576 INFO L290 TraceCheckUtils]: 120: Hoare triple {14027#(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); {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,577 INFO L290 TraceCheckUtils]: 121: Hoare triple {14027#(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; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,577 INFO L290 TraceCheckUtils]: 122: Hoare triple {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,577 INFO L290 TraceCheckUtils]: 123: Hoare triple {14027#(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); {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,579 INFO L290 TraceCheckUtils]: 124: Hoare triple {14027#(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; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,579 INFO L290 TraceCheckUtils]: 125: Hoare triple {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,580 INFO L290 TraceCheckUtils]: 126: Hoare triple {14027#(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); {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,580 INFO L290 TraceCheckUtils]: 127: Hoare triple {14027#(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; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,580 INFO L290 TraceCheckUtils]: 128: Hoare triple {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,581 INFO L290 TraceCheckUtils]: 129: Hoare triple {14027#(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); {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,581 INFO L290 TraceCheckUtils]: 130: Hoare triple {14027#(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; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,582 INFO L290 TraceCheckUtils]: 131: Hoare triple {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,582 INFO L290 TraceCheckUtils]: 132: Hoare triple {14027#(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); {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,582 INFO L290 TraceCheckUtils]: 133: Hoare triple {14027#(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; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,583 INFO L290 TraceCheckUtils]: 134: Hoare triple {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,583 INFO L290 TraceCheckUtils]: 135: Hoare triple {14027#(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); {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,583 INFO L290 TraceCheckUtils]: 136: Hoare triple {14027#(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; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,584 INFO L290 TraceCheckUtils]: 137: Hoare triple {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,584 INFO L290 TraceCheckUtils]: 138: Hoare triple {14027#(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); {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,584 INFO L290 TraceCheckUtils]: 139: Hoare triple {14027#(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; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,585 INFO L290 TraceCheckUtils]: 140: Hoare triple {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,585 INFO L290 TraceCheckUtils]: 141: Hoare triple {14027#(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); {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,585 INFO L290 TraceCheckUtils]: 142: Hoare triple {14027#(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; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,586 INFO L290 TraceCheckUtils]: 143: Hoare triple {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,586 INFO L290 TraceCheckUtils]: 144: Hoare triple {14027#(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); {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,587 INFO L290 TraceCheckUtils]: 145: Hoare triple {14027#(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; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,587 INFO L290 TraceCheckUtils]: 146: Hoare triple {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,587 INFO L290 TraceCheckUtils]: 147: Hoare triple {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,587 INFO L290 TraceCheckUtils]: 148: Hoare triple {14027#(and (<= main_~i~0 1) (<= 5 main_~nodecount~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,588 INFO L290 TraceCheckUtils]: 149: Hoare triple {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,588 INFO L290 TraceCheckUtils]: 150: Hoare triple {14217#(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); {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,589 INFO L290 TraceCheckUtils]: 151: Hoare triple {14217#(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; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,589 INFO L290 TraceCheckUtils]: 152: Hoare triple {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,589 INFO L290 TraceCheckUtils]: 153: Hoare triple {14217#(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); {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,590 INFO L290 TraceCheckUtils]: 154: Hoare triple {14217#(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; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,590 INFO L290 TraceCheckUtils]: 155: Hoare triple {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,590 INFO L290 TraceCheckUtils]: 156: Hoare triple {14217#(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); {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,591 INFO L290 TraceCheckUtils]: 157: Hoare triple {14217#(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; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,591 INFO L290 TraceCheckUtils]: 158: Hoare triple {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,591 INFO L290 TraceCheckUtils]: 159: Hoare triple {14217#(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); {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,592 INFO L290 TraceCheckUtils]: 160: Hoare triple {14217#(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; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,592 INFO L290 TraceCheckUtils]: 161: Hoare triple {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,592 INFO L290 TraceCheckUtils]: 162: Hoare triple {14217#(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); {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,593 INFO L290 TraceCheckUtils]: 163: Hoare triple {14217#(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; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,593 INFO L290 TraceCheckUtils]: 164: Hoare triple {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,594 INFO L290 TraceCheckUtils]: 165: Hoare triple {14217#(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); {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,594 INFO L290 TraceCheckUtils]: 166: Hoare triple {14217#(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; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,594 INFO L290 TraceCheckUtils]: 167: Hoare triple {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,595 INFO L290 TraceCheckUtils]: 168: Hoare triple {14217#(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); {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,595 INFO L290 TraceCheckUtils]: 169: Hoare triple {14217#(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; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,595 INFO L290 TraceCheckUtils]: 170: Hoare triple {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,596 INFO L290 TraceCheckUtils]: 171: Hoare triple {14217#(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); {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,596 INFO L290 TraceCheckUtils]: 172: Hoare triple {14217#(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; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,596 INFO L290 TraceCheckUtils]: 173: Hoare triple {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,597 INFO L290 TraceCheckUtils]: 174: Hoare triple {14217#(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); {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,597 INFO L290 TraceCheckUtils]: 175: Hoare triple {14217#(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; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,597 INFO L290 TraceCheckUtils]: 176: Hoare triple {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,598 INFO L290 TraceCheckUtils]: 177: Hoare triple {14217#(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); {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,598 INFO L290 TraceCheckUtils]: 178: Hoare triple {14217#(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; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,598 INFO L290 TraceCheckUtils]: 179: Hoare triple {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,599 INFO L290 TraceCheckUtils]: 180: Hoare triple {14217#(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); {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,599 INFO L290 TraceCheckUtils]: 181: Hoare triple {14217#(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; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,600 INFO L290 TraceCheckUtils]: 182: Hoare triple {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,600 INFO L290 TraceCheckUtils]: 183: Hoare triple {14217#(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); {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,600 INFO L290 TraceCheckUtils]: 184: Hoare triple {14217#(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; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,601 INFO L290 TraceCheckUtils]: 185: Hoare triple {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,601 INFO L290 TraceCheckUtils]: 186: Hoare triple {14217#(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); {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,601 INFO L290 TraceCheckUtils]: 187: Hoare triple {14217#(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; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,602 INFO L290 TraceCheckUtils]: 188: Hoare triple {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,602 INFO L290 TraceCheckUtils]: 189: Hoare triple {14217#(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); {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,602 INFO L290 TraceCheckUtils]: 190: Hoare triple {14217#(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; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,603 INFO L290 TraceCheckUtils]: 191: Hoare triple {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,603 INFO L290 TraceCheckUtils]: 192: Hoare triple {14217#(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); {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,604 INFO L290 TraceCheckUtils]: 193: Hoare triple {14217#(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; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,604 INFO L290 TraceCheckUtils]: 194: Hoare triple {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,604 INFO L290 TraceCheckUtils]: 195: Hoare triple {14217#(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); {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,605 INFO L290 TraceCheckUtils]: 196: Hoare triple {14217#(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; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,605 INFO L290 TraceCheckUtils]: 197: Hoare triple {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,605 INFO L290 TraceCheckUtils]: 198: Hoare triple {14217#(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); {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,606 INFO L290 TraceCheckUtils]: 199: Hoare triple {14217#(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; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,606 INFO L290 TraceCheckUtils]: 200: Hoare triple {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,606 INFO L290 TraceCheckUtils]: 201: Hoare triple {14217#(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); {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,607 INFO L290 TraceCheckUtils]: 202: Hoare triple {14217#(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; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,607 INFO L290 TraceCheckUtils]: 203: Hoare triple {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,607 INFO L290 TraceCheckUtils]: 204: Hoare triple {14217#(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); {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,608 INFO L290 TraceCheckUtils]: 205: Hoare triple {14217#(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; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,608 INFO L290 TraceCheckUtils]: 206: Hoare triple {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,608 INFO L290 TraceCheckUtils]: 207: Hoare triple {14217#(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); {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,609 INFO L290 TraceCheckUtils]: 208: Hoare triple {14217#(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; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,609 INFO L290 TraceCheckUtils]: 209: Hoare triple {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,609 INFO L290 TraceCheckUtils]: 210: Hoare triple {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,610 INFO L290 TraceCheckUtils]: 211: Hoare triple {14217#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,610 INFO L290 TraceCheckUtils]: 212: Hoare triple {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,610 INFO L290 TraceCheckUtils]: 213: Hoare triple {14407#(and (<= 5 main_~nodecount~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); {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,611 INFO L290 TraceCheckUtils]: 214: Hoare triple {14407#(and (<= 5 main_~nodecount~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; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,611 INFO L290 TraceCheckUtils]: 215: Hoare triple {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,612 INFO L290 TraceCheckUtils]: 216: Hoare triple {14407#(and (<= 5 main_~nodecount~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); {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,612 INFO L290 TraceCheckUtils]: 217: Hoare triple {14407#(and (<= 5 main_~nodecount~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; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,612 INFO L290 TraceCheckUtils]: 218: Hoare triple {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,613 INFO L290 TraceCheckUtils]: 219: Hoare triple {14407#(and (<= 5 main_~nodecount~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); {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,613 INFO L290 TraceCheckUtils]: 220: Hoare triple {14407#(and (<= 5 main_~nodecount~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; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,613 INFO L290 TraceCheckUtils]: 221: Hoare triple {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,614 INFO L290 TraceCheckUtils]: 222: Hoare triple {14407#(and (<= 5 main_~nodecount~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); {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,614 INFO L290 TraceCheckUtils]: 223: Hoare triple {14407#(and (<= 5 main_~nodecount~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; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,614 INFO L290 TraceCheckUtils]: 224: Hoare triple {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,615 INFO L290 TraceCheckUtils]: 225: Hoare triple {14407#(and (<= 5 main_~nodecount~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); {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,623 INFO L290 TraceCheckUtils]: 226: Hoare triple {14407#(and (<= 5 main_~nodecount~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; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,623 INFO L290 TraceCheckUtils]: 227: Hoare triple {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,624 INFO L290 TraceCheckUtils]: 228: Hoare triple {14407#(and (<= 5 main_~nodecount~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); {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,624 INFO L290 TraceCheckUtils]: 229: Hoare triple {14407#(and (<= 5 main_~nodecount~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; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,624 INFO L290 TraceCheckUtils]: 230: Hoare triple {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,625 INFO L290 TraceCheckUtils]: 231: Hoare triple {14407#(and (<= 5 main_~nodecount~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); {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,625 INFO L290 TraceCheckUtils]: 232: Hoare triple {14407#(and (<= 5 main_~nodecount~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; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,625 INFO L290 TraceCheckUtils]: 233: Hoare triple {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,626 INFO L290 TraceCheckUtils]: 234: Hoare triple {14407#(and (<= 5 main_~nodecount~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); {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,626 INFO L290 TraceCheckUtils]: 235: Hoare triple {14407#(and (<= 5 main_~nodecount~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; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,626 INFO L290 TraceCheckUtils]: 236: Hoare triple {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,627 INFO L290 TraceCheckUtils]: 237: Hoare triple {14407#(and (<= 5 main_~nodecount~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); {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,627 INFO L290 TraceCheckUtils]: 238: Hoare triple {14407#(and (<= 5 main_~nodecount~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; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,627 INFO L290 TraceCheckUtils]: 239: Hoare triple {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,628 INFO L290 TraceCheckUtils]: 240: Hoare triple {14407#(and (<= 5 main_~nodecount~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); {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,628 INFO L290 TraceCheckUtils]: 241: Hoare triple {14407#(and (<= 5 main_~nodecount~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; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,628 INFO L290 TraceCheckUtils]: 242: Hoare triple {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,629 INFO L290 TraceCheckUtils]: 243: Hoare triple {14407#(and (<= 5 main_~nodecount~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); {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,629 INFO L290 TraceCheckUtils]: 244: Hoare triple {14407#(and (<= 5 main_~nodecount~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; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,630 INFO L290 TraceCheckUtils]: 245: Hoare triple {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,630 INFO L290 TraceCheckUtils]: 246: Hoare triple {14407#(and (<= 5 main_~nodecount~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); {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,630 INFO L290 TraceCheckUtils]: 247: Hoare triple {14407#(and (<= 5 main_~nodecount~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; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,631 INFO L290 TraceCheckUtils]: 248: Hoare triple {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,631 INFO L290 TraceCheckUtils]: 249: Hoare triple {14407#(and (<= 5 main_~nodecount~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); {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,631 INFO L290 TraceCheckUtils]: 250: Hoare triple {14407#(and (<= 5 main_~nodecount~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; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,632 INFO L290 TraceCheckUtils]: 251: Hoare triple {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,632 INFO L290 TraceCheckUtils]: 252: Hoare triple {14407#(and (<= 5 main_~nodecount~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); {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,632 INFO L290 TraceCheckUtils]: 253: Hoare triple {14407#(and (<= 5 main_~nodecount~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; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,633 INFO L290 TraceCheckUtils]: 254: Hoare triple {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,633 INFO L290 TraceCheckUtils]: 255: Hoare triple {14407#(and (<= 5 main_~nodecount~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); {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,633 INFO L290 TraceCheckUtils]: 256: Hoare triple {14407#(and (<= 5 main_~nodecount~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; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,634 INFO L290 TraceCheckUtils]: 257: Hoare triple {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,635 INFO L290 TraceCheckUtils]: 258: Hoare triple {14407#(and (<= 5 main_~nodecount~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); {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,636 INFO L290 TraceCheckUtils]: 259: Hoare triple {14407#(and (<= 5 main_~nodecount~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; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,636 INFO L290 TraceCheckUtils]: 260: Hoare triple {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,636 INFO L290 TraceCheckUtils]: 261: Hoare triple {14407#(and (<= 5 main_~nodecount~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); {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,637 INFO L290 TraceCheckUtils]: 262: Hoare triple {14407#(and (<= 5 main_~nodecount~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; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,637 INFO L290 TraceCheckUtils]: 263: Hoare triple {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,638 INFO L290 TraceCheckUtils]: 264: Hoare triple {14407#(and (<= 5 main_~nodecount~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); {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,638 INFO L290 TraceCheckUtils]: 265: Hoare triple {14407#(and (<= 5 main_~nodecount~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; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,638 INFO L290 TraceCheckUtils]: 266: Hoare triple {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,639 INFO L290 TraceCheckUtils]: 267: Hoare triple {14407#(and (<= 5 main_~nodecount~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); {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,639 INFO L290 TraceCheckUtils]: 268: Hoare triple {14407#(and (<= 5 main_~nodecount~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; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,639 INFO L290 TraceCheckUtils]: 269: Hoare triple {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,640 INFO L290 TraceCheckUtils]: 270: Hoare triple {14407#(and (<= 5 main_~nodecount~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); {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,640 INFO L290 TraceCheckUtils]: 271: Hoare triple {14407#(and (<= 5 main_~nodecount~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; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,641 INFO L290 TraceCheckUtils]: 272: Hoare triple {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,641 INFO L290 TraceCheckUtils]: 273: Hoare triple {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} assume !(~j~0 < ~edgecount~0); {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:18:13,641 INFO L290 TraceCheckUtils]: 274: Hoare triple {14407#(and (<= 5 main_~nodecount~0) (<= main_~i~0 3))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14597#(and (<= main_~i~0 4) (<= 5 main_~nodecount~0))} is VALID [2022-04-27 10:18:13,642 INFO L290 TraceCheckUtils]: 275: Hoare triple {14597#(and (<= main_~i~0 4) (<= 5 main_~nodecount~0))} assume !(~i~0 < ~nodecount~0); {13756#false} is VALID [2022-04-27 10:18:13,642 INFO L290 TraceCheckUtils]: 276: Hoare triple {13756#false} ~i~0 := 0; {13756#false} is VALID [2022-04-27 10:18:13,642 INFO L290 TraceCheckUtils]: 277: Hoare triple {13756#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); {13756#false} is VALID [2022-04-27 10:18:13,642 INFO L290 TraceCheckUtils]: 278: Hoare triple {13756#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13756#false} is VALID [2022-04-27 10:18:13,642 INFO L290 TraceCheckUtils]: 279: Hoare triple {13756#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13756#false} is VALID [2022-04-27 10:18:13,642 INFO L290 TraceCheckUtils]: 280: Hoare triple {13756#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); {13756#false} is VALID [2022-04-27 10:18:13,642 INFO L290 TraceCheckUtils]: 281: Hoare triple {13756#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13756#false} is VALID [2022-04-27 10:18:13,642 INFO L290 TraceCheckUtils]: 282: Hoare triple {13756#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13756#false} is VALID [2022-04-27 10:18:13,642 INFO L290 TraceCheckUtils]: 283: Hoare triple {13756#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); {13756#false} is VALID [2022-04-27 10:18:13,642 INFO L290 TraceCheckUtils]: 284: Hoare triple {13756#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13756#false} is VALID [2022-04-27 10:18:13,642 INFO L290 TraceCheckUtils]: 285: Hoare triple {13756#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13756#false} is VALID [2022-04-27 10:18:13,642 INFO L290 TraceCheckUtils]: 286: Hoare triple {13756#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); {13756#false} is VALID [2022-04-27 10:18:13,642 INFO L290 TraceCheckUtils]: 287: Hoare triple {13756#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13756#false} is VALID [2022-04-27 10:18:13,642 INFO L290 TraceCheckUtils]: 288: Hoare triple {13756#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13756#false} is VALID [2022-04-27 10:18:13,642 INFO L290 TraceCheckUtils]: 289: Hoare triple {13756#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); {13756#false} is VALID [2022-04-27 10:18:13,642 INFO L290 TraceCheckUtils]: 290: Hoare triple {13756#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13756#false} is VALID [2022-04-27 10:18:13,642 INFO L290 TraceCheckUtils]: 291: Hoare triple {13756#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13756#false} is VALID [2022-04-27 10:18:13,642 INFO L290 TraceCheckUtils]: 292: Hoare triple {13756#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); {13756#false} is VALID [2022-04-27 10:18:13,642 INFO L290 TraceCheckUtils]: 293: Hoare triple {13756#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13756#false} is VALID [2022-04-27 10:18:13,642 INFO L290 TraceCheckUtils]: 294: Hoare triple {13756#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13756#false} is VALID [2022-04-27 10:18:13,642 INFO L290 TraceCheckUtils]: 295: Hoare triple {13756#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); {13756#false} is VALID [2022-04-27 10:18:13,643 INFO L290 TraceCheckUtils]: 296: Hoare triple {13756#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13756#false} is VALID [2022-04-27 10:18:13,643 INFO L290 TraceCheckUtils]: 297: Hoare triple {13756#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13756#false} is VALID [2022-04-27 10:18:13,643 INFO L290 TraceCheckUtils]: 298: Hoare triple {13756#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); {13756#false} is VALID [2022-04-27 10:18:13,643 INFO L290 TraceCheckUtils]: 299: Hoare triple {13756#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13756#false} is VALID [2022-04-27 10:18:13,643 INFO L290 TraceCheckUtils]: 300: Hoare triple {13756#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13756#false} is VALID [2022-04-27 10:18:13,643 INFO L290 TraceCheckUtils]: 301: Hoare triple {13756#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); {13756#false} is VALID [2022-04-27 10:18:13,643 INFO L290 TraceCheckUtils]: 302: Hoare triple {13756#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13756#false} is VALID [2022-04-27 10:18:13,643 INFO L290 TraceCheckUtils]: 303: Hoare triple {13756#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13756#false} is VALID [2022-04-27 10:18:13,643 INFO L290 TraceCheckUtils]: 304: Hoare triple {13756#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); {13756#false} is VALID [2022-04-27 10:18:13,643 INFO L290 TraceCheckUtils]: 305: Hoare triple {13756#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13756#false} is VALID [2022-04-27 10:18:13,643 INFO L290 TraceCheckUtils]: 306: Hoare triple {13756#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13756#false} is VALID [2022-04-27 10:18:13,643 INFO L290 TraceCheckUtils]: 307: Hoare triple {13756#false} assume !(~i~0 < ~edgecount~0); {13756#false} is VALID [2022-04-27 10:18:13,643 INFO L290 TraceCheckUtils]: 308: Hoare triple {13756#false} ~i~0 := 0; {13756#false} is VALID [2022-04-27 10:18:13,643 INFO L290 TraceCheckUtils]: 309: Hoare triple {13756#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13756#false} is VALID [2022-04-27 10:18:13,643 INFO L272 TraceCheckUtils]: 310: Hoare triple {13756#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {13756#false} is VALID [2022-04-27 10:18:13,643 INFO L290 TraceCheckUtils]: 311: Hoare triple {13756#false} ~cond := #in~cond; {13756#false} is VALID [2022-04-27 10:18:13,643 INFO L290 TraceCheckUtils]: 312: Hoare triple {13756#false} assume 0 == ~cond; {13756#false} is VALID [2022-04-27 10:18:13,643 INFO L290 TraceCheckUtils]: 313: Hoare triple {13756#false} assume !false; {13756#false} is VALID [2022-04-27 10:18:13,646 INFO L134 CoverageAnalysis]: Checked inductivity of 10002 backedges. 0 proven. 7462 refuted. 0 times theorem prover too weak. 2540 trivial. 0 not checked. [2022-04-27 10:18:13,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:18:14,583 INFO L290 TraceCheckUtils]: 313: Hoare triple {13756#false} assume !false; {13756#false} is VALID [2022-04-27 10:18:14,583 INFO L290 TraceCheckUtils]: 312: Hoare triple {13756#false} assume 0 == ~cond; {13756#false} is VALID [2022-04-27 10:18:14,583 INFO L290 TraceCheckUtils]: 311: Hoare triple {13756#false} ~cond := #in~cond; {13756#false} is VALID [2022-04-27 10:18:14,583 INFO L272 TraceCheckUtils]: 310: Hoare triple {13756#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {13756#false} is VALID [2022-04-27 10:18:14,583 INFO L290 TraceCheckUtils]: 309: Hoare triple {13756#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13756#false} is VALID [2022-04-27 10:18:14,583 INFO L290 TraceCheckUtils]: 308: Hoare triple {13756#false} ~i~0 := 0; {13756#false} is VALID [2022-04-27 10:18:14,583 INFO L290 TraceCheckUtils]: 307: Hoare triple {13756#false} assume !(~i~0 < ~edgecount~0); {13756#false} is VALID [2022-04-27 10:18:14,583 INFO L290 TraceCheckUtils]: 306: Hoare triple {13756#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13756#false} is VALID [2022-04-27 10:18:14,583 INFO L290 TraceCheckUtils]: 305: Hoare triple {13756#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13756#false} is VALID [2022-04-27 10:18:14,583 INFO L290 TraceCheckUtils]: 304: Hoare triple {13756#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); {13756#false} is VALID [2022-04-27 10:18:14,584 INFO L290 TraceCheckUtils]: 303: Hoare triple {13756#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13756#false} is VALID [2022-04-27 10:18:14,584 INFO L290 TraceCheckUtils]: 302: Hoare triple {13756#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13756#false} is VALID [2022-04-27 10:18:14,584 INFO L290 TraceCheckUtils]: 301: Hoare triple {13756#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); {13756#false} is VALID [2022-04-27 10:18:14,584 INFO L290 TraceCheckUtils]: 300: Hoare triple {13756#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13756#false} is VALID [2022-04-27 10:18:14,584 INFO L290 TraceCheckUtils]: 299: Hoare triple {13756#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13756#false} is VALID [2022-04-27 10:18:14,584 INFO L290 TraceCheckUtils]: 298: Hoare triple {13756#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); {13756#false} is VALID [2022-04-27 10:18:14,584 INFO L290 TraceCheckUtils]: 297: Hoare triple {13756#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13756#false} is VALID [2022-04-27 10:18:14,584 INFO L290 TraceCheckUtils]: 296: Hoare triple {13756#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13756#false} is VALID [2022-04-27 10:18:14,584 INFO L290 TraceCheckUtils]: 295: Hoare triple {13756#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); {13756#false} is VALID [2022-04-27 10:18:14,584 INFO L290 TraceCheckUtils]: 294: Hoare triple {13756#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13756#false} is VALID [2022-04-27 10:18:14,584 INFO L290 TraceCheckUtils]: 293: Hoare triple {13756#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13756#false} is VALID [2022-04-27 10:18:14,584 INFO L290 TraceCheckUtils]: 292: Hoare triple {13756#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); {13756#false} is VALID [2022-04-27 10:18:14,584 INFO L290 TraceCheckUtils]: 291: Hoare triple {13756#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13756#false} is VALID [2022-04-27 10:18:14,584 INFO L290 TraceCheckUtils]: 290: Hoare triple {13756#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13756#false} is VALID [2022-04-27 10:18:14,584 INFO L290 TraceCheckUtils]: 289: Hoare triple {13756#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); {13756#false} is VALID [2022-04-27 10:18:14,584 INFO L290 TraceCheckUtils]: 288: Hoare triple {13756#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13756#false} is VALID [2022-04-27 10:18:14,584 INFO L290 TraceCheckUtils]: 287: Hoare triple {13756#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13756#false} is VALID [2022-04-27 10:18:14,584 INFO L290 TraceCheckUtils]: 286: Hoare triple {13756#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); {13756#false} is VALID [2022-04-27 10:18:14,584 INFO L290 TraceCheckUtils]: 285: Hoare triple {13756#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13756#false} is VALID [2022-04-27 10:18:14,584 INFO L290 TraceCheckUtils]: 284: Hoare triple {13756#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13756#false} is VALID [2022-04-27 10:18:14,584 INFO L290 TraceCheckUtils]: 283: Hoare triple {13756#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); {13756#false} is VALID [2022-04-27 10:18:14,585 INFO L290 TraceCheckUtils]: 282: Hoare triple {13756#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13756#false} is VALID [2022-04-27 10:18:14,585 INFO L290 TraceCheckUtils]: 281: Hoare triple {13756#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13756#false} is VALID [2022-04-27 10:18:14,585 INFO L290 TraceCheckUtils]: 280: Hoare triple {13756#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); {13756#false} is VALID [2022-04-27 10:18:14,585 INFO L290 TraceCheckUtils]: 279: Hoare triple {13756#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13756#false} is VALID [2022-04-27 10:18:14,585 INFO L290 TraceCheckUtils]: 278: Hoare triple {13756#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13756#false} is VALID [2022-04-27 10:18:14,585 INFO L290 TraceCheckUtils]: 277: Hoare triple {13756#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); {13756#false} is VALID [2022-04-27 10:18:14,585 INFO L290 TraceCheckUtils]: 276: Hoare triple {13756#false} ~i~0 := 0; {13756#false} is VALID [2022-04-27 10:18:14,586 INFO L290 TraceCheckUtils]: 275: Hoare triple {14829#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {13756#false} is VALID [2022-04-27 10:18:14,587 INFO L290 TraceCheckUtils]: 274: Hoare triple {14833#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14829#(< main_~i~0 main_~nodecount~0)} is VALID [2022-04-27 10:18:14,587 INFO L290 TraceCheckUtils]: 273: Hoare triple {14833#(< (+ main_~i~0 1) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,587 INFO L290 TraceCheckUtils]: 272: Hoare triple {14833#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,588 INFO L290 TraceCheckUtils]: 271: Hoare triple {14833#(< (+ 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; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,588 INFO L290 TraceCheckUtils]: 270: Hoare triple {14833#(< (+ 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); {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,588 INFO L290 TraceCheckUtils]: 269: Hoare triple {14833#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,588 INFO L290 TraceCheckUtils]: 268: Hoare triple {14833#(< (+ 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; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,588 INFO L290 TraceCheckUtils]: 267: Hoare triple {14833#(< (+ 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); {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,589 INFO L290 TraceCheckUtils]: 266: Hoare triple {14833#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,589 INFO L290 TraceCheckUtils]: 265: Hoare triple {14833#(< (+ 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; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,589 INFO L290 TraceCheckUtils]: 264: Hoare triple {14833#(< (+ 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); {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,589 INFO L290 TraceCheckUtils]: 263: Hoare triple {14833#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,590 INFO L290 TraceCheckUtils]: 262: Hoare triple {14833#(< (+ 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; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,590 INFO L290 TraceCheckUtils]: 261: Hoare triple {14833#(< (+ 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); {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,590 INFO L290 TraceCheckUtils]: 260: Hoare triple {14833#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,590 INFO L290 TraceCheckUtils]: 259: Hoare triple {14833#(< (+ 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; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,591 INFO L290 TraceCheckUtils]: 258: Hoare triple {14833#(< (+ 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); {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,591 INFO L290 TraceCheckUtils]: 257: Hoare triple {14833#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,591 INFO L290 TraceCheckUtils]: 256: Hoare triple {14833#(< (+ 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; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,591 INFO L290 TraceCheckUtils]: 255: Hoare triple {14833#(< (+ 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); {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,591 INFO L290 TraceCheckUtils]: 254: Hoare triple {14833#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,592 INFO L290 TraceCheckUtils]: 253: Hoare triple {14833#(< (+ 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; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,592 INFO L290 TraceCheckUtils]: 252: Hoare triple {14833#(< (+ 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); {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,592 INFO L290 TraceCheckUtils]: 251: Hoare triple {14833#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,592 INFO L290 TraceCheckUtils]: 250: Hoare triple {14833#(< (+ 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; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,593 INFO L290 TraceCheckUtils]: 249: Hoare triple {14833#(< (+ 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); {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,593 INFO L290 TraceCheckUtils]: 248: Hoare triple {14833#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,593 INFO L290 TraceCheckUtils]: 247: Hoare triple {14833#(< (+ 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; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,593 INFO L290 TraceCheckUtils]: 246: Hoare triple {14833#(< (+ 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); {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,593 INFO L290 TraceCheckUtils]: 245: Hoare triple {14833#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,594 INFO L290 TraceCheckUtils]: 244: Hoare triple {14833#(< (+ 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; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,594 INFO L290 TraceCheckUtils]: 243: Hoare triple {14833#(< (+ 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); {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,594 INFO L290 TraceCheckUtils]: 242: Hoare triple {14833#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,594 INFO L290 TraceCheckUtils]: 241: Hoare triple {14833#(< (+ 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; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,595 INFO L290 TraceCheckUtils]: 240: Hoare triple {14833#(< (+ 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); {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,595 INFO L290 TraceCheckUtils]: 239: Hoare triple {14833#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,595 INFO L290 TraceCheckUtils]: 238: Hoare triple {14833#(< (+ 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; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,595 INFO L290 TraceCheckUtils]: 237: Hoare triple {14833#(< (+ 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); {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,596 INFO L290 TraceCheckUtils]: 236: Hoare triple {14833#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,596 INFO L290 TraceCheckUtils]: 235: Hoare triple {14833#(< (+ 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; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,596 INFO L290 TraceCheckUtils]: 234: Hoare triple {14833#(< (+ 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); {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,596 INFO L290 TraceCheckUtils]: 233: Hoare triple {14833#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,596 INFO L290 TraceCheckUtils]: 232: Hoare triple {14833#(< (+ 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; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,597 INFO L290 TraceCheckUtils]: 231: Hoare triple {14833#(< (+ 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); {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,597 INFO L290 TraceCheckUtils]: 230: Hoare triple {14833#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,597 INFO L290 TraceCheckUtils]: 229: Hoare triple {14833#(< (+ 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; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,597 INFO L290 TraceCheckUtils]: 228: Hoare triple {14833#(< (+ 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); {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,598 INFO L290 TraceCheckUtils]: 227: Hoare triple {14833#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,598 INFO L290 TraceCheckUtils]: 226: Hoare triple {14833#(< (+ 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; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,598 INFO L290 TraceCheckUtils]: 225: Hoare triple {14833#(< (+ 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); {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,598 INFO L290 TraceCheckUtils]: 224: Hoare triple {14833#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,598 INFO L290 TraceCheckUtils]: 223: Hoare triple {14833#(< (+ 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; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,599 INFO L290 TraceCheckUtils]: 222: Hoare triple {14833#(< (+ 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); {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,599 INFO L290 TraceCheckUtils]: 221: Hoare triple {14833#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,599 INFO L290 TraceCheckUtils]: 220: Hoare triple {14833#(< (+ 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; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,599 INFO L290 TraceCheckUtils]: 219: Hoare triple {14833#(< (+ 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); {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,600 INFO L290 TraceCheckUtils]: 218: Hoare triple {14833#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,600 INFO L290 TraceCheckUtils]: 217: Hoare triple {14833#(< (+ 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; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,600 INFO L290 TraceCheckUtils]: 216: Hoare triple {14833#(< (+ 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); {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,600 INFO L290 TraceCheckUtils]: 215: Hoare triple {14833#(< (+ main_~i~0 1) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,601 INFO L290 TraceCheckUtils]: 214: Hoare triple {14833#(< (+ 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; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,601 INFO L290 TraceCheckUtils]: 213: Hoare triple {14833#(< (+ 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); {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,601 INFO L290 TraceCheckUtils]: 212: Hoare triple {14833#(< (+ main_~i~0 1) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,601 INFO L290 TraceCheckUtils]: 211: Hoare triple {15023#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {14833#(< (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,602 INFO L290 TraceCheckUtils]: 210: Hoare triple {15023#(< (+ main_~i~0 2) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,602 INFO L290 TraceCheckUtils]: 209: Hoare triple {15023#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,602 INFO L290 TraceCheckUtils]: 208: Hoare triple {15023#(< (+ 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; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,602 INFO L290 TraceCheckUtils]: 207: Hoare triple {15023#(< (+ 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); {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,602 INFO L290 TraceCheckUtils]: 206: Hoare triple {15023#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,603 INFO L290 TraceCheckUtils]: 205: Hoare triple {15023#(< (+ 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; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,603 INFO L290 TraceCheckUtils]: 204: Hoare triple {15023#(< (+ 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); {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,603 INFO L290 TraceCheckUtils]: 203: Hoare triple {15023#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,603 INFO L290 TraceCheckUtils]: 202: Hoare triple {15023#(< (+ 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; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,604 INFO L290 TraceCheckUtils]: 201: Hoare triple {15023#(< (+ 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); {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,604 INFO L290 TraceCheckUtils]: 200: Hoare triple {15023#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,604 INFO L290 TraceCheckUtils]: 199: Hoare triple {15023#(< (+ 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; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,604 INFO L290 TraceCheckUtils]: 198: Hoare triple {15023#(< (+ 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); {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,605 INFO L290 TraceCheckUtils]: 197: Hoare triple {15023#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,605 INFO L290 TraceCheckUtils]: 196: Hoare triple {15023#(< (+ 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; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,605 INFO L290 TraceCheckUtils]: 195: Hoare triple {15023#(< (+ 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); {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,605 INFO L290 TraceCheckUtils]: 194: Hoare triple {15023#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,605 INFO L290 TraceCheckUtils]: 193: Hoare triple {15023#(< (+ 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; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,606 INFO L290 TraceCheckUtils]: 192: Hoare triple {15023#(< (+ 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); {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,606 INFO L290 TraceCheckUtils]: 191: Hoare triple {15023#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,606 INFO L290 TraceCheckUtils]: 190: Hoare triple {15023#(< (+ 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; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,606 INFO L290 TraceCheckUtils]: 189: Hoare triple {15023#(< (+ 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); {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,607 INFO L290 TraceCheckUtils]: 188: Hoare triple {15023#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,607 INFO L290 TraceCheckUtils]: 187: Hoare triple {15023#(< (+ 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; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,607 INFO L290 TraceCheckUtils]: 186: Hoare triple {15023#(< (+ 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); {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,607 INFO L290 TraceCheckUtils]: 185: Hoare triple {15023#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,607 INFO L290 TraceCheckUtils]: 184: Hoare triple {15023#(< (+ 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; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,608 INFO L290 TraceCheckUtils]: 183: Hoare triple {15023#(< (+ 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); {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,608 INFO L290 TraceCheckUtils]: 182: Hoare triple {15023#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,608 INFO L290 TraceCheckUtils]: 181: Hoare triple {15023#(< (+ 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; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,608 INFO L290 TraceCheckUtils]: 180: Hoare triple {15023#(< (+ 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); {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,609 INFO L290 TraceCheckUtils]: 179: Hoare triple {15023#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,609 INFO L290 TraceCheckUtils]: 178: Hoare triple {15023#(< (+ 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; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,609 INFO L290 TraceCheckUtils]: 177: Hoare triple {15023#(< (+ 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); {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,609 INFO L290 TraceCheckUtils]: 176: Hoare triple {15023#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,610 INFO L290 TraceCheckUtils]: 175: Hoare triple {15023#(< (+ 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; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,610 INFO L290 TraceCheckUtils]: 174: Hoare triple {15023#(< (+ 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); {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,610 INFO L290 TraceCheckUtils]: 173: Hoare triple {15023#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,610 INFO L290 TraceCheckUtils]: 172: Hoare triple {15023#(< (+ 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; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,610 INFO L290 TraceCheckUtils]: 171: Hoare triple {15023#(< (+ 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); {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,611 INFO L290 TraceCheckUtils]: 170: Hoare triple {15023#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,611 INFO L290 TraceCheckUtils]: 169: Hoare triple {15023#(< (+ 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; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,611 INFO L290 TraceCheckUtils]: 168: Hoare triple {15023#(< (+ 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); {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,611 INFO L290 TraceCheckUtils]: 167: Hoare triple {15023#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,612 INFO L290 TraceCheckUtils]: 166: Hoare triple {15023#(< (+ 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; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,612 INFO L290 TraceCheckUtils]: 165: Hoare triple {15023#(< (+ 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); {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,612 INFO L290 TraceCheckUtils]: 164: Hoare triple {15023#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,612 INFO L290 TraceCheckUtils]: 163: Hoare triple {15023#(< (+ 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; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,612 INFO L290 TraceCheckUtils]: 162: Hoare triple {15023#(< (+ 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); {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,613 INFO L290 TraceCheckUtils]: 161: Hoare triple {15023#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,613 INFO L290 TraceCheckUtils]: 160: Hoare triple {15023#(< (+ 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; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,613 INFO L290 TraceCheckUtils]: 159: Hoare triple {15023#(< (+ 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); {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,613 INFO L290 TraceCheckUtils]: 158: Hoare triple {15023#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,614 INFO L290 TraceCheckUtils]: 157: Hoare triple {15023#(< (+ 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; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,614 INFO L290 TraceCheckUtils]: 156: Hoare triple {15023#(< (+ 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); {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,614 INFO L290 TraceCheckUtils]: 155: Hoare triple {15023#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,614 INFO L290 TraceCheckUtils]: 154: Hoare triple {15023#(< (+ 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; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,614 INFO L290 TraceCheckUtils]: 153: Hoare triple {15023#(< (+ 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); {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,615 INFO L290 TraceCheckUtils]: 152: Hoare triple {15023#(< (+ main_~i~0 2) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,615 INFO L290 TraceCheckUtils]: 151: Hoare triple {15023#(< (+ 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; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,615 INFO L290 TraceCheckUtils]: 150: Hoare triple {15023#(< (+ 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); {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,615 INFO L290 TraceCheckUtils]: 149: Hoare triple {15023#(< (+ main_~i~0 2) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,616 INFO L290 TraceCheckUtils]: 148: Hoare triple {15213#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15023#(< (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,616 INFO L290 TraceCheckUtils]: 147: Hoare triple {15213#(< (+ main_~i~0 3) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,616 INFO L290 TraceCheckUtils]: 146: Hoare triple {15213#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,616 INFO L290 TraceCheckUtils]: 145: Hoare triple {15213#(< (+ 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; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,617 INFO L290 TraceCheckUtils]: 144: Hoare triple {15213#(< (+ 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); {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,617 INFO L290 TraceCheckUtils]: 143: Hoare triple {15213#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,623 INFO L290 TraceCheckUtils]: 142: Hoare triple {15213#(< (+ 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; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,624 INFO L290 TraceCheckUtils]: 141: Hoare triple {15213#(< (+ 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); {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,624 INFO L290 TraceCheckUtils]: 140: Hoare triple {15213#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,624 INFO L290 TraceCheckUtils]: 139: Hoare triple {15213#(< (+ 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; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,625 INFO L290 TraceCheckUtils]: 138: Hoare triple {15213#(< (+ 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); {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,625 INFO L290 TraceCheckUtils]: 137: Hoare triple {15213#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,625 INFO L290 TraceCheckUtils]: 136: Hoare triple {15213#(< (+ 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; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,625 INFO L290 TraceCheckUtils]: 135: Hoare triple {15213#(< (+ 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); {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,626 INFO L290 TraceCheckUtils]: 134: Hoare triple {15213#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,626 INFO L290 TraceCheckUtils]: 133: Hoare triple {15213#(< (+ 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; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,626 INFO L290 TraceCheckUtils]: 132: Hoare triple {15213#(< (+ 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); {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,626 INFO L290 TraceCheckUtils]: 131: Hoare triple {15213#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,627 INFO L290 TraceCheckUtils]: 130: Hoare triple {15213#(< (+ 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; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,627 INFO L290 TraceCheckUtils]: 129: Hoare triple {15213#(< (+ 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); {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,627 INFO L290 TraceCheckUtils]: 128: Hoare triple {15213#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,627 INFO L290 TraceCheckUtils]: 127: Hoare triple {15213#(< (+ 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; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,628 INFO L290 TraceCheckUtils]: 126: Hoare triple {15213#(< (+ 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); {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,628 INFO L290 TraceCheckUtils]: 125: Hoare triple {15213#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,628 INFO L290 TraceCheckUtils]: 124: Hoare triple {15213#(< (+ 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; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,628 INFO L290 TraceCheckUtils]: 123: Hoare triple {15213#(< (+ 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); {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,629 INFO L290 TraceCheckUtils]: 122: Hoare triple {15213#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,629 INFO L290 TraceCheckUtils]: 121: Hoare triple {15213#(< (+ 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; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,629 INFO L290 TraceCheckUtils]: 120: Hoare triple {15213#(< (+ 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); {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,629 INFO L290 TraceCheckUtils]: 119: Hoare triple {15213#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,630 INFO L290 TraceCheckUtils]: 118: Hoare triple {15213#(< (+ 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; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,630 INFO L290 TraceCheckUtils]: 117: Hoare triple {15213#(< (+ 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); {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,630 INFO L290 TraceCheckUtils]: 116: Hoare triple {15213#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,630 INFO L290 TraceCheckUtils]: 115: Hoare triple {15213#(< (+ 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; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,630 INFO L290 TraceCheckUtils]: 114: Hoare triple {15213#(< (+ 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); {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,631 INFO L290 TraceCheckUtils]: 113: Hoare triple {15213#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,631 INFO L290 TraceCheckUtils]: 112: Hoare triple {15213#(< (+ 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; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,631 INFO L290 TraceCheckUtils]: 111: Hoare triple {15213#(< (+ 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); {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,631 INFO L290 TraceCheckUtils]: 110: Hoare triple {15213#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,632 INFO L290 TraceCheckUtils]: 109: Hoare triple {15213#(< (+ 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; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,632 INFO L290 TraceCheckUtils]: 108: Hoare triple {15213#(< (+ 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); {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,632 INFO L290 TraceCheckUtils]: 107: Hoare triple {15213#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,632 INFO L290 TraceCheckUtils]: 106: Hoare triple {15213#(< (+ 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; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,633 INFO L290 TraceCheckUtils]: 105: Hoare triple {15213#(< (+ 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); {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,633 INFO L290 TraceCheckUtils]: 104: Hoare triple {15213#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,633 INFO L290 TraceCheckUtils]: 103: Hoare triple {15213#(< (+ 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; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,633 INFO L290 TraceCheckUtils]: 102: Hoare triple {15213#(< (+ 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); {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,634 INFO L290 TraceCheckUtils]: 101: Hoare triple {15213#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,634 INFO L290 TraceCheckUtils]: 100: Hoare triple {15213#(< (+ 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; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,634 INFO L290 TraceCheckUtils]: 99: Hoare triple {15213#(< (+ 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); {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,634 INFO L290 TraceCheckUtils]: 98: Hoare triple {15213#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,635 INFO L290 TraceCheckUtils]: 97: Hoare triple {15213#(< (+ 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; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,635 INFO L290 TraceCheckUtils]: 96: Hoare triple {15213#(< (+ 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); {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,635 INFO L290 TraceCheckUtils]: 95: Hoare triple {15213#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,635 INFO L290 TraceCheckUtils]: 94: Hoare triple {15213#(< (+ 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; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,636 INFO L290 TraceCheckUtils]: 93: Hoare triple {15213#(< (+ 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); {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,636 INFO L290 TraceCheckUtils]: 92: Hoare triple {15213#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,636 INFO L290 TraceCheckUtils]: 91: Hoare triple {15213#(< (+ 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; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,636 INFO L290 TraceCheckUtils]: 90: Hoare triple {15213#(< (+ 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); {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,637 INFO L290 TraceCheckUtils]: 89: Hoare triple {15213#(< (+ main_~i~0 3) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,637 INFO L290 TraceCheckUtils]: 88: Hoare triple {15213#(< (+ 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; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,637 INFO L290 TraceCheckUtils]: 87: Hoare triple {15213#(< (+ 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); {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,637 INFO L290 TraceCheckUtils]: 86: Hoare triple {15213#(< (+ main_~i~0 3) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,638 INFO L290 TraceCheckUtils]: 85: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {15213#(< (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,638 INFO L290 TraceCheckUtils]: 84: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,638 INFO L290 TraceCheckUtils]: 83: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,638 INFO L290 TraceCheckUtils]: 82: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,639 INFO L290 TraceCheckUtils]: 81: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,639 INFO L290 TraceCheckUtils]: 80: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,639 INFO L290 TraceCheckUtils]: 79: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,639 INFO L290 TraceCheckUtils]: 78: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,640 INFO L290 TraceCheckUtils]: 77: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,640 INFO L290 TraceCheckUtils]: 76: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,640 INFO L290 TraceCheckUtils]: 75: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,640 INFO L290 TraceCheckUtils]: 74: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,641 INFO L290 TraceCheckUtils]: 73: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,641 INFO L290 TraceCheckUtils]: 72: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,641 INFO L290 TraceCheckUtils]: 71: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,641 INFO L290 TraceCheckUtils]: 70: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,642 INFO L290 TraceCheckUtils]: 69: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,642 INFO L290 TraceCheckUtils]: 68: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,642 INFO L290 TraceCheckUtils]: 67: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,642 INFO L290 TraceCheckUtils]: 66: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,643 INFO L290 TraceCheckUtils]: 65: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,643 INFO L290 TraceCheckUtils]: 64: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,643 INFO L290 TraceCheckUtils]: 63: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,643 INFO L290 TraceCheckUtils]: 62: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,644 INFO L290 TraceCheckUtils]: 61: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,644 INFO L290 TraceCheckUtils]: 60: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,644 INFO L290 TraceCheckUtils]: 59: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,644 INFO L290 TraceCheckUtils]: 58: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,644 INFO L290 TraceCheckUtils]: 57: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,645 INFO L290 TraceCheckUtils]: 56: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,645 INFO L290 TraceCheckUtils]: 55: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,645 INFO L290 TraceCheckUtils]: 54: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,645 INFO L290 TraceCheckUtils]: 53: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,646 INFO L290 TraceCheckUtils]: 52: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,646 INFO L290 TraceCheckUtils]: 51: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,646 INFO L290 TraceCheckUtils]: 50: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,646 INFO L290 TraceCheckUtils]: 49: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,646 INFO L290 TraceCheckUtils]: 48: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,647 INFO L290 TraceCheckUtils]: 47: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,647 INFO L290 TraceCheckUtils]: 46: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,647 INFO L290 TraceCheckUtils]: 45: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,647 INFO L290 TraceCheckUtils]: 44: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,648 INFO L290 TraceCheckUtils]: 43: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,648 INFO L290 TraceCheckUtils]: 42: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,648 INFO L290 TraceCheckUtils]: 41: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,648 INFO L290 TraceCheckUtils]: 40: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,648 INFO L290 TraceCheckUtils]: 39: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,649 INFO L290 TraceCheckUtils]: 38: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,649 INFO L290 TraceCheckUtils]: 37: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,649 INFO L290 TraceCheckUtils]: 36: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,649 INFO L290 TraceCheckUtils]: 35: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,650 INFO L290 TraceCheckUtils]: 34: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,650 INFO L290 TraceCheckUtils]: 33: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,650 INFO L290 TraceCheckUtils]: 32: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,650 INFO L290 TraceCheckUtils]: 31: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,650 INFO L290 TraceCheckUtils]: 30: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,651 INFO L290 TraceCheckUtils]: 29: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,651 INFO L290 TraceCheckUtils]: 28: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,651 INFO L290 TraceCheckUtils]: 27: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,651 INFO L290 TraceCheckUtils]: 26: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,652 INFO L290 TraceCheckUtils]: 25: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,652 INFO L290 TraceCheckUtils]: 24: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,652 INFO L290 TraceCheckUtils]: 23: Hoare triple {15403#(< (+ main_~i~0 4) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {13785#(<= 5 main_~nodecount~0)} ~i~0 := 0; {15403#(< (+ main_~i~0 4) main_~nodecount~0)} is VALID [2022-04-27 10:18:14,653 INFO L290 TraceCheckUtils]: 21: Hoare triple {13785#(<= 5 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:14,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {13785#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:14,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {13785#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:14,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {13785#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:14,654 INFO L290 TraceCheckUtils]: 17: Hoare triple {13785#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:14,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {13785#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:14,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {13785#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:14,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {13785#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:14,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {13785#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:14,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {13785#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:14,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {13785#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:14,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {13785#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:14,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {13785#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:14,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {13785#(<= 5 main_~nodecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:14,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {13785#(<= 5 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:14,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {13785#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:14,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {13755#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {13785#(<= 5 main_~nodecount~0)} is VALID [2022-04-27 10:18:14,658 INFO L272 TraceCheckUtils]: 4: Hoare triple {13755#true} call #t~ret22 := main(); {13755#true} is VALID [2022-04-27 10:18:14,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13755#true} {13755#true} #107#return; {13755#true} is VALID [2022-04-27 10:18:14,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {13755#true} assume true; {13755#true} is VALID [2022-04-27 10:18:14,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {13755#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; {13755#true} is VALID [2022-04-27 10:18:14,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {13755#true} call ULTIMATE.init(); {13755#true} is VALID [2022-04-27 10:18:14,661 INFO L134 CoverageAnalysis]: Checked inductivity of 10002 backedges. 0 proven. 7462 refuted. 0 times theorem prover too weak. 2540 trivial. 0 not checked. [2022-04-27 10:18:14,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682014537] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:18:14,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:18:14,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2022-04-27 10:18:14,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222229223] [2022-04-27 10:18:14,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:18:14,662 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.15) internal successors, (103), 19 states have internal predecessors, (103), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 314 [2022-04-27 10:18:14,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:18:14,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 5.15) internal successors, (103), 19 states have internal predecessors, (103), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:14,726 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-27 10:18:14,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 10:18:14,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:18:14,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 10:18:14,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=252, Unknown=0, NotChecked=0, Total=380 [2022-04-27 10:18:14,727 INFO L87 Difference]: Start difference. First operand 319 states and 407 transitions. Second operand has 20 states, 20 states have (on average 5.15) internal successors, (103), 19 states have internal predecessors, (103), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:16,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:16,024 INFO L93 Difference]: Finished difference Result 442 states and 557 transitions. [2022-04-27 10:18:16,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:18:16,024 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.15) internal successors, (103), 19 states have internal predecessors, (103), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 314 [2022-04-27 10:18:16,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:18:16,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.15) internal successors, (103), 19 states have internal predecessors, (103), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:16,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 131 transitions. [2022-04-27 10:18:16,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.15) internal successors, (103), 19 states have internal predecessors, (103), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:16,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 131 transitions. [2022-04-27 10:18:16,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 131 transitions. [2022-04-27 10:18:16,127 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-27 10:18:16,134 INFO L225 Difference]: With dead ends: 442 [2022-04-27 10:18:16,135 INFO L226 Difference]: Without dead ends: 399 [2022-04-27 10:18:16,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 644 GetRequests, 619 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=218, Invalid=432, Unknown=0, NotChecked=0, Total=650 [2022-04-27 10:18:16,137 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 233 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:18:16,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 65 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 10:18:16,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-04-27 10:18:16,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 382. [2022-04-27 10:18:16,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:18:16,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 399 states. Second operand has 382 states, 376 states have (on average 1.2925531914893618) internal successors, (486), 376 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:18:16,747 INFO L74 IsIncluded]: Start isIncluded. First operand 399 states. Second operand has 382 states, 376 states have (on average 1.2925531914893618) internal successors, (486), 376 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:18:16,748 INFO L87 Difference]: Start difference. First operand 399 states. Second operand has 382 states, 376 states have (on average 1.2925531914893618) internal successors, (486), 376 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:18:16,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:16,755 INFO L93 Difference]: Finished difference Result 399 states and 512 transitions. [2022-04-27 10:18:16,755 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 512 transitions. [2022-04-27 10:18:16,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:16,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:16,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 382 states, 376 states have (on average 1.2925531914893618) internal successors, (486), 376 states have internal predecessors, (486), 3 states have call successors, (3), 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 399 states. [2022-04-27 10:18:16,757 INFO L87 Difference]: Start difference. First operand has 382 states, 376 states have (on average 1.2925531914893618) internal successors, (486), 376 states have internal predecessors, (486), 3 states have call successors, (3), 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 399 states. [2022-04-27 10:18:16,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:16,763 INFO L93 Difference]: Finished difference Result 399 states and 512 transitions. [2022-04-27 10:18:16,763 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 512 transitions. [2022-04-27 10:18:16,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:16,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:16,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:18:16,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:18:16,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 376 states have (on average 1.2925531914893618) internal successors, (486), 376 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:18:16,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 491 transitions. [2022-04-27 10:18:16,771 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 491 transitions. Word has length 314 [2022-04-27 10:18:16,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:18:16,771 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 491 transitions. [2022-04-27 10:18:16,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.15) internal successors, (103), 19 states have internal predecessors, (103), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:16,771 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 491 transitions. [2022-04-27 10:18:16,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2022-04-27 10:18:16,774 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:18:16,774 INFO L195 NwaCegarLoop]: trace histogram [100, 100, 100, 10, 10, 10, 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-27 10:18:16,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-27 10:18:16,987 WARN L477 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-27 10:18:16,987 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:18:16,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:18:16,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1961917126, now seen corresponding path program 9 times [2022-04-27 10:18:16,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:18:16,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508734333] [2022-04-27 10:18:16,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:18:16,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:18:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:17,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:18:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:17,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {17605#(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; {17588#true} is VALID [2022-04-27 10:18:17,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {17588#true} assume true; {17588#true} is VALID [2022-04-27 10:18:17,567 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17588#true} {17588#true} #107#return; {17588#true} is VALID [2022-04-27 10:18:17,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {17588#true} call ULTIMATE.init(); {17605#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:18:17,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {17605#(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; {17588#true} is VALID [2022-04-27 10:18:17,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {17588#true} assume true; {17588#true} is VALID [2022-04-27 10:18:17,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17588#true} {17588#true} #107#return; {17588#true} is VALID [2022-04-27 10:18:17,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {17588#true} call #t~ret22 := main(); {17588#true} is VALID [2022-04-27 10:18:17,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {17588#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,573 INFO L290 TraceCheckUtils]: 21: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,573 INFO L290 TraceCheckUtils]: 22: Hoare triple {17593#(<= 20 main_~edgecount~0)} ~i~0 := 0; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,574 INFO L290 TraceCheckUtils]: 25: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,574 INFO L290 TraceCheckUtils]: 26: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,574 INFO L290 TraceCheckUtils]: 27: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,575 INFO L290 TraceCheckUtils]: 28: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,575 INFO L290 TraceCheckUtils]: 29: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,575 INFO L290 TraceCheckUtils]: 30: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,575 INFO L290 TraceCheckUtils]: 31: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,576 INFO L290 TraceCheckUtils]: 32: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,576 INFO L290 TraceCheckUtils]: 33: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,576 INFO L290 TraceCheckUtils]: 34: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,576 INFO L290 TraceCheckUtils]: 35: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,577 INFO L290 TraceCheckUtils]: 36: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,577 INFO L290 TraceCheckUtils]: 37: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,577 INFO L290 TraceCheckUtils]: 38: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,577 INFO L290 TraceCheckUtils]: 39: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,578 INFO L290 TraceCheckUtils]: 40: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,578 INFO L290 TraceCheckUtils]: 41: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,578 INFO L290 TraceCheckUtils]: 42: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,578 INFO L290 TraceCheckUtils]: 43: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,579 INFO L290 TraceCheckUtils]: 44: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,579 INFO L290 TraceCheckUtils]: 45: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,579 INFO L290 TraceCheckUtils]: 46: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,579 INFO L290 TraceCheckUtils]: 47: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,579 INFO L290 TraceCheckUtils]: 48: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,580 INFO L290 TraceCheckUtils]: 49: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,580 INFO L290 TraceCheckUtils]: 50: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,580 INFO L290 TraceCheckUtils]: 51: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,580 INFO L290 TraceCheckUtils]: 52: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,581 INFO L290 TraceCheckUtils]: 53: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,581 INFO L290 TraceCheckUtils]: 54: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,581 INFO L290 TraceCheckUtils]: 55: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,581 INFO L290 TraceCheckUtils]: 56: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,582 INFO L290 TraceCheckUtils]: 57: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,582 INFO L290 TraceCheckUtils]: 58: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,582 INFO L290 TraceCheckUtils]: 59: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,582 INFO L290 TraceCheckUtils]: 60: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,582 INFO L290 TraceCheckUtils]: 61: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,583 INFO L290 TraceCheckUtils]: 62: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,583 INFO L290 TraceCheckUtils]: 63: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,583 INFO L290 TraceCheckUtils]: 64: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,583 INFO L290 TraceCheckUtils]: 65: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,583 INFO L290 TraceCheckUtils]: 66: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,584 INFO L290 TraceCheckUtils]: 67: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,584 INFO L290 TraceCheckUtils]: 68: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,584 INFO L290 TraceCheckUtils]: 69: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,584 INFO L290 TraceCheckUtils]: 70: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,584 INFO L290 TraceCheckUtils]: 71: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,585 INFO L290 TraceCheckUtils]: 72: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,585 INFO L290 TraceCheckUtils]: 73: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,585 INFO L290 TraceCheckUtils]: 74: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,585 INFO L290 TraceCheckUtils]: 75: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,586 INFO L290 TraceCheckUtils]: 76: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,586 INFO L290 TraceCheckUtils]: 77: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,586 INFO L290 TraceCheckUtils]: 78: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,586 INFO L290 TraceCheckUtils]: 79: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,586 INFO L290 TraceCheckUtils]: 80: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,587 INFO L290 TraceCheckUtils]: 81: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,587 INFO L290 TraceCheckUtils]: 82: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,587 INFO L290 TraceCheckUtils]: 83: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,587 INFO L290 TraceCheckUtils]: 84: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,587 INFO L290 TraceCheckUtils]: 85: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,588 INFO L290 TraceCheckUtils]: 86: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,588 INFO L290 TraceCheckUtils]: 87: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,588 INFO L290 TraceCheckUtils]: 88: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,588 INFO L290 TraceCheckUtils]: 89: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,589 INFO L290 TraceCheckUtils]: 90: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,589 INFO L290 TraceCheckUtils]: 91: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,589 INFO L290 TraceCheckUtils]: 92: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,589 INFO L290 TraceCheckUtils]: 93: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,589 INFO L290 TraceCheckUtils]: 94: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,590 INFO L290 TraceCheckUtils]: 95: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,590 INFO L290 TraceCheckUtils]: 96: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,590 INFO L290 TraceCheckUtils]: 97: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,590 INFO L290 TraceCheckUtils]: 98: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,590 INFO L290 TraceCheckUtils]: 99: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,591 INFO L290 TraceCheckUtils]: 100: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,591 INFO L290 TraceCheckUtils]: 101: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,591 INFO L290 TraceCheckUtils]: 102: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,591 INFO L290 TraceCheckUtils]: 103: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,591 INFO L290 TraceCheckUtils]: 104: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,592 INFO L290 TraceCheckUtils]: 105: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,592 INFO L290 TraceCheckUtils]: 106: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,592 INFO L290 TraceCheckUtils]: 107: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,592 INFO L290 TraceCheckUtils]: 108: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,593 INFO L290 TraceCheckUtils]: 109: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,593 INFO L290 TraceCheckUtils]: 110: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,593 INFO L290 TraceCheckUtils]: 111: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,593 INFO L290 TraceCheckUtils]: 112: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,593 INFO L290 TraceCheckUtils]: 113: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,594 INFO L290 TraceCheckUtils]: 114: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,594 INFO L290 TraceCheckUtils]: 115: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,594 INFO L290 TraceCheckUtils]: 116: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,594 INFO L290 TraceCheckUtils]: 117: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,594 INFO L290 TraceCheckUtils]: 118: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,595 INFO L290 TraceCheckUtils]: 119: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,595 INFO L290 TraceCheckUtils]: 120: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,595 INFO L290 TraceCheckUtils]: 121: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,595 INFO L290 TraceCheckUtils]: 122: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,595 INFO L290 TraceCheckUtils]: 123: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,596 INFO L290 TraceCheckUtils]: 124: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,596 INFO L290 TraceCheckUtils]: 125: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,596 INFO L290 TraceCheckUtils]: 126: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,596 INFO L290 TraceCheckUtils]: 127: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,597 INFO L290 TraceCheckUtils]: 128: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,597 INFO L290 TraceCheckUtils]: 129: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,597 INFO L290 TraceCheckUtils]: 130: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,597 INFO L290 TraceCheckUtils]: 131: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,597 INFO L290 TraceCheckUtils]: 132: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,598 INFO L290 TraceCheckUtils]: 133: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,598 INFO L290 TraceCheckUtils]: 134: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,598 INFO L290 TraceCheckUtils]: 135: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,598 INFO L290 TraceCheckUtils]: 136: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,598 INFO L290 TraceCheckUtils]: 137: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,599 INFO L290 TraceCheckUtils]: 138: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,599 INFO L290 TraceCheckUtils]: 139: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,599 INFO L290 TraceCheckUtils]: 140: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,599 INFO L290 TraceCheckUtils]: 141: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,599 INFO L290 TraceCheckUtils]: 142: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,600 INFO L290 TraceCheckUtils]: 143: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,600 INFO L290 TraceCheckUtils]: 144: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,600 INFO L290 TraceCheckUtils]: 145: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,600 INFO L290 TraceCheckUtils]: 146: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,600 INFO L290 TraceCheckUtils]: 147: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,601 INFO L290 TraceCheckUtils]: 148: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,601 INFO L290 TraceCheckUtils]: 149: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,601 INFO L290 TraceCheckUtils]: 150: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,601 INFO L290 TraceCheckUtils]: 151: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,601 INFO L290 TraceCheckUtils]: 152: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,602 INFO L290 TraceCheckUtils]: 153: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,602 INFO L290 TraceCheckUtils]: 154: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,602 INFO L290 TraceCheckUtils]: 155: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,602 INFO L290 TraceCheckUtils]: 156: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,602 INFO L290 TraceCheckUtils]: 157: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,603 INFO L290 TraceCheckUtils]: 158: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,603 INFO L290 TraceCheckUtils]: 159: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,603 INFO L290 TraceCheckUtils]: 160: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,603 INFO L290 TraceCheckUtils]: 161: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,603 INFO L290 TraceCheckUtils]: 162: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,604 INFO L290 TraceCheckUtils]: 163: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,604 INFO L290 TraceCheckUtils]: 164: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,604 INFO L290 TraceCheckUtils]: 165: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,604 INFO L290 TraceCheckUtils]: 166: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,604 INFO L290 TraceCheckUtils]: 167: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,605 INFO L290 TraceCheckUtils]: 168: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,605 INFO L290 TraceCheckUtils]: 169: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,605 INFO L290 TraceCheckUtils]: 170: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,605 INFO L290 TraceCheckUtils]: 171: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,605 INFO L290 TraceCheckUtils]: 172: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,606 INFO L290 TraceCheckUtils]: 173: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,606 INFO L290 TraceCheckUtils]: 174: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,606 INFO L290 TraceCheckUtils]: 175: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,606 INFO L290 TraceCheckUtils]: 176: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,606 INFO L290 TraceCheckUtils]: 177: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,607 INFO L290 TraceCheckUtils]: 178: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,607 INFO L290 TraceCheckUtils]: 179: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,607 INFO L290 TraceCheckUtils]: 180: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,607 INFO L290 TraceCheckUtils]: 181: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,607 INFO L290 TraceCheckUtils]: 182: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,608 INFO L290 TraceCheckUtils]: 183: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,608 INFO L290 TraceCheckUtils]: 184: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,608 INFO L290 TraceCheckUtils]: 185: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,608 INFO L290 TraceCheckUtils]: 186: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,608 INFO L290 TraceCheckUtils]: 187: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,609 INFO L290 TraceCheckUtils]: 188: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,609 INFO L290 TraceCheckUtils]: 189: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,609 INFO L290 TraceCheckUtils]: 190: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,609 INFO L290 TraceCheckUtils]: 191: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,609 INFO L290 TraceCheckUtils]: 192: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,610 INFO L290 TraceCheckUtils]: 193: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,610 INFO L290 TraceCheckUtils]: 194: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,610 INFO L290 TraceCheckUtils]: 195: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,610 INFO L290 TraceCheckUtils]: 196: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,610 INFO L290 TraceCheckUtils]: 197: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,611 INFO L290 TraceCheckUtils]: 198: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,611 INFO L290 TraceCheckUtils]: 199: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,611 INFO L290 TraceCheckUtils]: 200: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,611 INFO L290 TraceCheckUtils]: 201: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,611 INFO L290 TraceCheckUtils]: 202: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,612 INFO L290 TraceCheckUtils]: 203: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,612 INFO L290 TraceCheckUtils]: 204: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,612 INFO L290 TraceCheckUtils]: 205: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,612 INFO L290 TraceCheckUtils]: 206: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,612 INFO L290 TraceCheckUtils]: 207: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,613 INFO L290 TraceCheckUtils]: 208: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,613 INFO L290 TraceCheckUtils]: 209: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,613 INFO L290 TraceCheckUtils]: 210: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,613 INFO L290 TraceCheckUtils]: 211: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,613 INFO L290 TraceCheckUtils]: 212: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,614 INFO L290 TraceCheckUtils]: 213: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,614 INFO L290 TraceCheckUtils]: 214: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,614 INFO L290 TraceCheckUtils]: 215: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,614 INFO L290 TraceCheckUtils]: 216: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,614 INFO L290 TraceCheckUtils]: 217: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,615 INFO L290 TraceCheckUtils]: 218: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,615 INFO L290 TraceCheckUtils]: 219: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,615 INFO L290 TraceCheckUtils]: 220: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,615 INFO L290 TraceCheckUtils]: 221: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,615 INFO L290 TraceCheckUtils]: 222: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,615 INFO L290 TraceCheckUtils]: 223: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,616 INFO L290 TraceCheckUtils]: 224: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,616 INFO L290 TraceCheckUtils]: 225: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,616 INFO L290 TraceCheckUtils]: 226: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,616 INFO L290 TraceCheckUtils]: 227: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,616 INFO L290 TraceCheckUtils]: 228: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,617 INFO L290 TraceCheckUtils]: 229: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,617 INFO L290 TraceCheckUtils]: 230: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,617 INFO L290 TraceCheckUtils]: 231: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,617 INFO L290 TraceCheckUtils]: 232: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,617 INFO L290 TraceCheckUtils]: 233: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,618 INFO L290 TraceCheckUtils]: 234: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,618 INFO L290 TraceCheckUtils]: 235: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,618 INFO L290 TraceCheckUtils]: 236: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,618 INFO L290 TraceCheckUtils]: 237: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,618 INFO L290 TraceCheckUtils]: 238: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,619 INFO L290 TraceCheckUtils]: 239: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,619 INFO L290 TraceCheckUtils]: 240: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,619 INFO L290 TraceCheckUtils]: 241: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,619 INFO L290 TraceCheckUtils]: 242: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,619 INFO L290 TraceCheckUtils]: 243: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,620 INFO L290 TraceCheckUtils]: 244: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,620 INFO L290 TraceCheckUtils]: 245: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,620 INFO L290 TraceCheckUtils]: 246: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,620 INFO L290 TraceCheckUtils]: 247: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,620 INFO L290 TraceCheckUtils]: 248: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,621 INFO L290 TraceCheckUtils]: 249: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,621 INFO L290 TraceCheckUtils]: 250: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,621 INFO L290 TraceCheckUtils]: 251: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,621 INFO L290 TraceCheckUtils]: 252: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,621 INFO L290 TraceCheckUtils]: 253: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,622 INFO L290 TraceCheckUtils]: 254: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,622 INFO L290 TraceCheckUtils]: 255: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,622 INFO L290 TraceCheckUtils]: 256: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,622 INFO L290 TraceCheckUtils]: 257: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,622 INFO L290 TraceCheckUtils]: 258: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,623 INFO L290 TraceCheckUtils]: 259: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,623 INFO L290 TraceCheckUtils]: 260: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,623 INFO L290 TraceCheckUtils]: 261: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,623 INFO L290 TraceCheckUtils]: 262: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,623 INFO L290 TraceCheckUtils]: 263: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,624 INFO L290 TraceCheckUtils]: 264: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,624 INFO L290 TraceCheckUtils]: 265: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,624 INFO L290 TraceCheckUtils]: 266: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,624 INFO L290 TraceCheckUtils]: 267: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,624 INFO L290 TraceCheckUtils]: 268: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,625 INFO L290 TraceCheckUtils]: 269: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,625 INFO L290 TraceCheckUtils]: 270: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,625 INFO L290 TraceCheckUtils]: 271: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,625 INFO L290 TraceCheckUtils]: 272: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,625 INFO L290 TraceCheckUtils]: 273: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,626 INFO L290 TraceCheckUtils]: 274: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,626 INFO L290 TraceCheckUtils]: 275: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,626 INFO L290 TraceCheckUtils]: 276: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,626 INFO L290 TraceCheckUtils]: 277: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,626 INFO L290 TraceCheckUtils]: 278: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,627 INFO L290 TraceCheckUtils]: 279: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,627 INFO L290 TraceCheckUtils]: 280: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,627 INFO L290 TraceCheckUtils]: 281: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,627 INFO L290 TraceCheckUtils]: 282: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,627 INFO L290 TraceCheckUtils]: 283: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,628 INFO L290 TraceCheckUtils]: 284: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,628 INFO L290 TraceCheckUtils]: 285: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,628 INFO L290 TraceCheckUtils]: 286: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,628 INFO L290 TraceCheckUtils]: 287: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,628 INFO L290 TraceCheckUtils]: 288: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,629 INFO L290 TraceCheckUtils]: 289: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,629 INFO L290 TraceCheckUtils]: 290: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,629 INFO L290 TraceCheckUtils]: 291: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,629 INFO L290 TraceCheckUtils]: 292: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,629 INFO L290 TraceCheckUtils]: 293: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,630 INFO L290 TraceCheckUtils]: 294: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,630 INFO L290 TraceCheckUtils]: 295: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,630 INFO L290 TraceCheckUtils]: 296: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,630 INFO L290 TraceCheckUtils]: 297: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,630 INFO L290 TraceCheckUtils]: 298: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,631 INFO L290 TraceCheckUtils]: 299: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,631 INFO L290 TraceCheckUtils]: 300: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,631 INFO L290 TraceCheckUtils]: 301: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,631 INFO L290 TraceCheckUtils]: 302: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,631 INFO L290 TraceCheckUtils]: 303: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,632 INFO L290 TraceCheckUtils]: 304: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,632 INFO L290 TraceCheckUtils]: 305: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,632 INFO L290 TraceCheckUtils]: 306: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,632 INFO L290 TraceCheckUtils]: 307: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,632 INFO L290 TraceCheckUtils]: 308: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,633 INFO L290 TraceCheckUtils]: 309: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,633 INFO L290 TraceCheckUtils]: 310: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,633 INFO L290 TraceCheckUtils]: 311: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,633 INFO L290 TraceCheckUtils]: 312: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,633 INFO L290 TraceCheckUtils]: 313: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,634 INFO L290 TraceCheckUtils]: 314: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,634 INFO L290 TraceCheckUtils]: 315: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,634 INFO L290 TraceCheckUtils]: 316: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,634 INFO L290 TraceCheckUtils]: 317: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,634 INFO L290 TraceCheckUtils]: 318: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,635 INFO L290 TraceCheckUtils]: 319: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,635 INFO L290 TraceCheckUtils]: 320: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,635 INFO L290 TraceCheckUtils]: 321: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,635 INFO L290 TraceCheckUtils]: 322: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,635 INFO L290 TraceCheckUtils]: 323: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,636 INFO L290 TraceCheckUtils]: 324: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,636 INFO L290 TraceCheckUtils]: 325: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,636 INFO L290 TraceCheckUtils]: 326: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,636 INFO L290 TraceCheckUtils]: 327: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,636 INFO L290 TraceCheckUtils]: 328: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,637 INFO L290 TraceCheckUtils]: 329: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,637 INFO L290 TraceCheckUtils]: 330: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,637 INFO L290 TraceCheckUtils]: 331: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,637 INFO L290 TraceCheckUtils]: 332: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,637 INFO L290 TraceCheckUtils]: 333: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,638 INFO L290 TraceCheckUtils]: 334: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,638 INFO L290 TraceCheckUtils]: 335: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,638 INFO L290 TraceCheckUtils]: 336: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,638 INFO L290 TraceCheckUtils]: 337: Hoare triple {17593#(<= 20 main_~edgecount~0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,638 INFO L290 TraceCheckUtils]: 338: Hoare triple {17593#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {17593#(<= 20 main_~edgecount~0)} is VALID [2022-04-27 10:18:17,639 INFO L290 TraceCheckUtils]: 339: Hoare triple {17593#(<= 20 main_~edgecount~0)} ~i~0 := 0; {17594#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:17,639 INFO L290 TraceCheckUtils]: 340: Hoare triple {17594#(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); {17594#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:17,639 INFO L290 TraceCheckUtils]: 341: Hoare triple {17594#(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; {17594#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:17,640 INFO L290 TraceCheckUtils]: 342: Hoare triple {17594#(and (<= 20 main_~edgecount~0) (= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {17595#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-27 10:18:17,640 INFO L290 TraceCheckUtils]: 343: Hoare triple {17595#(<= (+ 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); {17595#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-27 10:18:17,640 INFO L290 TraceCheckUtils]: 344: Hoare triple {17595#(<= (+ 19 main_~i~0) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {17595#(<= (+ 19 main_~i~0) main_~edgecount~0)} is VALID [2022-04-27 10:18:17,641 INFO L290 TraceCheckUtils]: 345: Hoare triple {17595#(<= (+ 19 main_~i~0) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {17596#(<= (+ main_~i~0 18) main_~edgecount~0)} is VALID [2022-04-27 10:18:17,641 INFO L290 TraceCheckUtils]: 346: Hoare triple {17596#(<= (+ 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); {17596#(<= (+ main_~i~0 18) main_~edgecount~0)} is VALID [2022-04-27 10:18:17,641 INFO L290 TraceCheckUtils]: 347: Hoare triple {17596#(<= (+ main_~i~0 18) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {17596#(<= (+ main_~i~0 18) main_~edgecount~0)} is VALID [2022-04-27 10:18:17,641 INFO L290 TraceCheckUtils]: 348: Hoare triple {17596#(<= (+ main_~i~0 18) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {17597#(<= (+ main_~i~0 17) main_~edgecount~0)} is VALID [2022-04-27 10:18:17,642 INFO L290 TraceCheckUtils]: 349: Hoare triple {17597#(<= (+ 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); {17597#(<= (+ main_~i~0 17) main_~edgecount~0)} is VALID [2022-04-27 10:18:17,642 INFO L290 TraceCheckUtils]: 350: Hoare triple {17597#(<= (+ main_~i~0 17) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {17597#(<= (+ main_~i~0 17) main_~edgecount~0)} is VALID [2022-04-27 10:18:17,642 INFO L290 TraceCheckUtils]: 351: Hoare triple {17597#(<= (+ main_~i~0 17) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {17598#(<= (+ main_~i~0 16) main_~edgecount~0)} is VALID [2022-04-27 10:18:17,642 INFO L290 TraceCheckUtils]: 352: Hoare triple {17598#(<= (+ 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); {17598#(<= (+ main_~i~0 16) main_~edgecount~0)} is VALID [2022-04-27 10:18:17,643 INFO L290 TraceCheckUtils]: 353: Hoare triple {17598#(<= (+ main_~i~0 16) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {17598#(<= (+ main_~i~0 16) main_~edgecount~0)} is VALID [2022-04-27 10:18:17,643 INFO L290 TraceCheckUtils]: 354: Hoare triple {17598#(<= (+ main_~i~0 16) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {17599#(<= (+ main_~i~0 15) main_~edgecount~0)} is VALID [2022-04-27 10:18:17,643 INFO L290 TraceCheckUtils]: 355: Hoare triple {17599#(<= (+ 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); {17599#(<= (+ main_~i~0 15) main_~edgecount~0)} is VALID [2022-04-27 10:18:17,643 INFO L290 TraceCheckUtils]: 356: Hoare triple {17599#(<= (+ main_~i~0 15) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {17599#(<= (+ main_~i~0 15) main_~edgecount~0)} is VALID [2022-04-27 10:18:17,644 INFO L290 TraceCheckUtils]: 357: Hoare triple {17599#(<= (+ main_~i~0 15) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {17600#(<= (+ main_~i~0 14) main_~edgecount~0)} is VALID [2022-04-27 10:18:17,644 INFO L290 TraceCheckUtils]: 358: Hoare triple {17600#(<= (+ 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); {17600#(<= (+ main_~i~0 14) main_~edgecount~0)} is VALID [2022-04-27 10:18:17,644 INFO L290 TraceCheckUtils]: 359: Hoare triple {17600#(<= (+ main_~i~0 14) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {17600#(<= (+ main_~i~0 14) main_~edgecount~0)} is VALID [2022-04-27 10:18:17,644 INFO L290 TraceCheckUtils]: 360: Hoare triple {17600#(<= (+ main_~i~0 14) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {17601#(<= (+ main_~i~0 13) main_~edgecount~0)} is VALID [2022-04-27 10:18:17,645 INFO L290 TraceCheckUtils]: 361: Hoare triple {17601#(<= (+ main_~i~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); {17601#(<= (+ main_~i~0 13) main_~edgecount~0)} is VALID [2022-04-27 10:18:17,645 INFO L290 TraceCheckUtils]: 362: Hoare triple {17601#(<= (+ main_~i~0 13) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {17601#(<= (+ main_~i~0 13) main_~edgecount~0)} is VALID [2022-04-27 10:18:17,645 INFO L290 TraceCheckUtils]: 363: Hoare triple {17601#(<= (+ main_~i~0 13) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {17602#(<= (+ main_~i~0 12) main_~edgecount~0)} is VALID [2022-04-27 10:18:17,645 INFO L290 TraceCheckUtils]: 364: Hoare triple {17602#(<= (+ main_~i~0 12) 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); {17602#(<= (+ main_~i~0 12) main_~edgecount~0)} is VALID [2022-04-27 10:18:17,645 INFO L290 TraceCheckUtils]: 365: Hoare triple {17602#(<= (+ main_~i~0 12) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {17602#(<= (+ main_~i~0 12) main_~edgecount~0)} is VALID [2022-04-27 10:18:17,646 INFO L290 TraceCheckUtils]: 366: Hoare triple {17602#(<= (+ main_~i~0 12) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {17603#(<= (+ main_~i~0 11) main_~edgecount~0)} is VALID [2022-04-27 10:18:17,646 INFO L290 TraceCheckUtils]: 367: Hoare triple {17603#(<= (+ main_~i~0 11) 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); {17603#(<= (+ main_~i~0 11) main_~edgecount~0)} is VALID [2022-04-27 10:18:17,646 INFO L290 TraceCheckUtils]: 368: Hoare triple {17603#(<= (+ main_~i~0 11) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {17603#(<= (+ main_~i~0 11) main_~edgecount~0)} is VALID [2022-04-27 10:18:17,646 INFO L290 TraceCheckUtils]: 369: Hoare triple {17603#(<= (+ main_~i~0 11) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {17604#(<= (+ main_~i~0 10) main_~edgecount~0)} is VALID [2022-04-27 10:18:17,647 INFO L290 TraceCheckUtils]: 370: Hoare triple {17604#(<= (+ main_~i~0 10) main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {17589#false} is VALID [2022-04-27 10:18:17,647 INFO L290 TraceCheckUtils]: 371: Hoare triple {17589#false} ~i~0 := 0; {17589#false} is VALID [2022-04-27 10:18:17,647 INFO L290 TraceCheckUtils]: 372: Hoare triple {17589#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17589#false} is VALID [2022-04-27 10:18:17,647 INFO L272 TraceCheckUtils]: 373: Hoare triple {17589#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {17589#false} is VALID [2022-04-27 10:18:17,647 INFO L290 TraceCheckUtils]: 374: Hoare triple {17589#false} ~cond := #in~cond; {17589#false} is VALID [2022-04-27 10:18:17,647 INFO L290 TraceCheckUtils]: 375: Hoare triple {17589#false} assume 0 == ~cond; {17589#false} is VALID [2022-04-27 10:18:17,647 INFO L290 TraceCheckUtils]: 376: Hoare triple {17589#false} assume !false; {17589#false} is VALID [2022-04-27 10:18:17,653 INFO L134 CoverageAnalysis]: Checked inductivity of 15565 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2022-04-27 10:18:17,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:18:17,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508734333] [2022-04-27 10:18:17,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508734333] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:18:17,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401104347] [2022-04-27 10:18:17,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 10:18:17,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:18:17,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:18:17,654 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-27 10:18:17,655 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-27 10:18:18,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-04-27 10:18:18,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:18:18,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 62 conjunts are in the unsatisfiable core [2022-04-27 10:18:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:18,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:18:18,672 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-27 10:18:18,807 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-04-27 10:18:18,807 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 59 treesize of output 61 [2022-04-27 10:18:18,948 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-04-27 10:18:18,948 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 59 treesize of output 61 [2022-04-27 10:18:19,102 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-04-27 10:18:19,103 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 59 treesize of output 61 [2022-04-27 10:18:19,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:18:19,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:18:19,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:18:19,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:18:19,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:18:19,322 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-27 10:18:19,323 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-27 10:18:19,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:18:19,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:18:19,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:18:19,328 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-04-27 10:18:19,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 68 treesize of output 82 [2022-04-27 10:18:19,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:18:19,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:18:19,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:18:19,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:18:19,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:18:19,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-27 10:18:19,705 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-27 10:18:19,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:18:19,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:18:19,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:18:19,718 INFO L356 Elim1Store]: treesize reduction 64, result has 15.8 percent of original size [2022-04-27 10:18:19,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 13 case distinctions, treesize of input 80 treesize of output 97 [2022-04-27 10:18:21,267 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-27 10:18:21,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:18:21,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:18:21,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:18:21,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:18:21,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:18:21,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:18:21,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:18:21,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:18:21,279 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-27 10:18:21,280 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-27 10:18:21,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:18:21,299 INFO L356 Elim1Store]: treesize reduction 116, result has 17.1 percent of original size [2022-04-27 10:18:21,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 10 disjoint index pairs (out of 36 index pairs), introduced 8 new quantified variables, introduced 19 case distinctions, treesize of input 99 treesize of output 115 [2022-04-27 10:18:22,179 INFO L356 Elim1Store]: treesize reduction 73, result has 27.0 percent of original size [2022-04-27 10:18:22,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 9 disjoint index pairs (out of 45 index pairs), introduced 12 new quantified variables, introduced 18 case distinctions, treesize of input 100 treesize of output 71 [2022-04-27 10:18:23,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {17588#true} call ULTIMATE.init(); {17588#true} is VALID [2022-04-27 10:18:23,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {17588#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; {17588#true} is VALID [2022-04-27 10:18:23,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {17588#true} assume true; {17588#true} is VALID [2022-04-27 10:18:23,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17588#true} {17588#true} #107#return; {17588#true} is VALID [2022-04-27 10:18:23,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {17588#true} call #t~ret22 := main(); {17588#true} is VALID [2022-04-27 10:18:23,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {17588#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {17624#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |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-27 10:18:23,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {17624#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |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); {17624#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |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-27 10:18:23,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {17624#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |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); {17624#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |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-27 10:18:23,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {17624#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |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; {17624#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |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-27 10:18:23,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {17624#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |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); {17624#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |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-27 10:18:23,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {17624#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |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); {17624#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |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-27 10:18:23,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {17624#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |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; {17624#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |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-27 10:18:23,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {17624#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |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); {17624#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |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-27 10:18:23,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {17624#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |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); {17624#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |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-27 10:18:23,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {17624#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |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; {17624#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |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-27 10:18:23,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {17624#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |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); {17624#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |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-27 10:18:23,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {17624#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |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); {17658#(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|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |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-27 10:18:23,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {17658#(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|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |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; {17662#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (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) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |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-27 10:18:23,037 INFO L290 TraceCheckUtils]: 18: Hoare triple {17662#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (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) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |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); {17666#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (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) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |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-27 10:18:23,038 INFO L290 TraceCheckUtils]: 19: Hoare triple {17666#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (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) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |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); {17670#(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)))) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |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-27 10:18:23,041 INFO L290 TraceCheckUtils]: 20: Hoare triple {17670#(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)))) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |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; {17674#(and (exists ((v_main_~i~0_177 Int)) (and (<= main_~i~0 (+ v_main_~i~0_177 1)) (< v_main_~i~0_177 main_~nodecount~0) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_177))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_177)))))) (<= (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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |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-27 10:18:23,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {17674#(and (exists ((v_main_~i~0_177 Int)) (and (<= main_~i~0 (+ v_main_~i~0_177 1)) (< v_main_~i~0_177 main_~nodecount~0) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_177))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_177)))))) (<= (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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |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); {17678#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (exists ((v_main_~i~0_177 Int)) (and (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_177))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_177)))) (< v_main_~i~0_177 5) (<= 4 v_main_~i~0_177))) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |main_~#Weight~0.offset| 0) (= (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-27 10:18:23,043 INFO L290 TraceCheckUtils]: 22: Hoare triple {17678#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (exists ((v_main_~i~0_177 Int)) (and (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_177))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_177)))) (< v_main_~i~0_177 5) (<= 4 v_main_~i~0_177))) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |main_~#Weight~0.offset| 0) (= (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; {17678#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (exists ((v_main_~i~0_177 Int)) (and (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_177))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_177)))) (< v_main_~i~0_177 5) (<= 4 v_main_~i~0_177))) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |main_~#Weight~0.offset| 0) (= (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-27 10:18:23,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {17678#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (exists ((v_main_~i~0_177 Int)) (and (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_177))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_177)))) (< v_main_~i~0_177 5) (<= 4 v_main_~i~0_177))) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |main_~#Weight~0.offset| 0) (= (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; {17685#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (exists ((v_main_~i~0_177 Int)) (and (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_177))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_177)))) (< v_main_~i~0_177 5) (<= 4 v_main_~i~0_177))) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |main_~#Weight~0.offset| 0) (= (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-27 10:18:23,046 INFO L290 TraceCheckUtils]: 24: Hoare triple {17685#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (exists ((v_main_~i~0_177 Int)) (and (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_177))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_177)))) (< v_main_~i~0_177 5) (<= 4 v_main_~i~0_177))) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |main_~#Weight~0.offset| 0) (= (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); {17689#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (exists ((v_main_~i~0_177 Int)) (and (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_177))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_177)))) (< v_main_~i~0_177 5) (<= 4 v_main_~i~0_177))) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |main_~#Weight~0.offset| 0) (= (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-27 10:18:23,049 INFO L290 TraceCheckUtils]: 25: Hoare triple {17689#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (exists ((v_main_~i~0_177 Int)) (and (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_177))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_177)))) (< v_main_~i~0_177 5) (<= 4 v_main_~i~0_177))) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |main_~#Weight~0.offset| 0) (= (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; {17685#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (exists ((v_main_~i~0_177 Int)) (and (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_177))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_177)))) (< v_main_~i~0_177 5) (<= 4 v_main_~i~0_177))) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |main_~#Weight~0.offset| 0) (= (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-27 10:18:23,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {17685#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (exists ((v_main_~i~0_177 Int)) (and (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_177))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_177)))) (< v_main_~i~0_177 5) (<= 4 v_main_~i~0_177))) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |main_~#Weight~0.offset| 0) (= (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; {17696#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (= (+ (- 1) main_~j~0) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (exists ((v_main_~i~0_177 Int)) (and (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_177))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_177)))) (< v_main_~i~0_177 5) (<= 4 v_main_~i~0_177))) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |main_~#Weight~0.offset| 0) (= (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-27 10:18:23,051 INFO L290 TraceCheckUtils]: 27: Hoare triple {17696#(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_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ 32 |main_~#Source~0.offset|)) 4) (= (+ (- 1) main_~j~0) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (exists ((v_main_~i~0_177 Int)) (and (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* 4 v_main_~i~0_177))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_177)))) (< v_main_~i~0_177 5) (<= 4 v_main_~i~0_177))) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ 16 |main_~#Weight~0.offset|)) 4) (= |main_~#Weight~0.offset| 0) (= (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); {17700#(and (<= |main_#t~mem11| |main_#t~mem9|) (<= 1 |main_#t~mem10|))} is VALID [2022-04-27 10:18:23,052 INFO L290 TraceCheckUtils]: 28: Hoare triple {17700#(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; {17589#false} is VALID [2022-04-27 10:18:23,052 INFO L290 TraceCheckUtils]: 29: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,052 INFO L290 TraceCheckUtils]: 30: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,052 INFO L290 TraceCheckUtils]: 31: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,052 INFO L290 TraceCheckUtils]: 32: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,052 INFO L290 TraceCheckUtils]: 33: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,052 INFO L290 TraceCheckUtils]: 34: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,052 INFO L290 TraceCheckUtils]: 35: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,052 INFO L290 TraceCheckUtils]: 36: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,052 INFO L290 TraceCheckUtils]: 37: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,052 INFO L290 TraceCheckUtils]: 38: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,052 INFO L290 TraceCheckUtils]: 39: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,052 INFO L290 TraceCheckUtils]: 40: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,053 INFO L290 TraceCheckUtils]: 41: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,053 INFO L290 TraceCheckUtils]: 42: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,053 INFO L290 TraceCheckUtils]: 43: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,053 INFO L290 TraceCheckUtils]: 44: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,053 INFO L290 TraceCheckUtils]: 45: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,053 INFO L290 TraceCheckUtils]: 46: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,053 INFO L290 TraceCheckUtils]: 47: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,053 INFO L290 TraceCheckUtils]: 48: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,053 INFO L290 TraceCheckUtils]: 49: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,053 INFO L290 TraceCheckUtils]: 50: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,053 INFO L290 TraceCheckUtils]: 51: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,053 INFO L290 TraceCheckUtils]: 52: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,053 INFO L290 TraceCheckUtils]: 53: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,053 INFO L290 TraceCheckUtils]: 54: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,053 INFO L290 TraceCheckUtils]: 55: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,053 INFO L290 TraceCheckUtils]: 56: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,053 INFO L290 TraceCheckUtils]: 57: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,053 INFO L290 TraceCheckUtils]: 58: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,053 INFO L290 TraceCheckUtils]: 59: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,053 INFO L290 TraceCheckUtils]: 60: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,053 INFO L290 TraceCheckUtils]: 61: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,054 INFO L290 TraceCheckUtils]: 62: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,054 INFO L290 TraceCheckUtils]: 63: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,054 INFO L290 TraceCheckUtils]: 64: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,054 INFO L290 TraceCheckUtils]: 65: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,054 INFO L290 TraceCheckUtils]: 66: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,054 INFO L290 TraceCheckUtils]: 67: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,054 INFO L290 TraceCheckUtils]: 68: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,054 INFO L290 TraceCheckUtils]: 69: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,054 INFO L290 TraceCheckUtils]: 70: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,054 INFO L290 TraceCheckUtils]: 71: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,054 INFO L290 TraceCheckUtils]: 72: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,054 INFO L290 TraceCheckUtils]: 73: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,054 INFO L290 TraceCheckUtils]: 74: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,054 INFO L290 TraceCheckUtils]: 75: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,054 INFO L290 TraceCheckUtils]: 76: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,054 INFO L290 TraceCheckUtils]: 77: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,054 INFO L290 TraceCheckUtils]: 78: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,054 INFO L290 TraceCheckUtils]: 79: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,054 INFO L290 TraceCheckUtils]: 80: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,054 INFO L290 TraceCheckUtils]: 81: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,054 INFO L290 TraceCheckUtils]: 82: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,054 INFO L290 TraceCheckUtils]: 83: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,055 INFO L290 TraceCheckUtils]: 84: Hoare triple {17589#false} assume !(~j~0 < ~edgecount~0); {17589#false} is VALID [2022-04-27 10:18:23,055 INFO L290 TraceCheckUtils]: 85: Hoare triple {17589#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17589#false} is VALID [2022-04-27 10:18:23,055 INFO L290 TraceCheckUtils]: 86: Hoare triple {17589#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {17589#false} is VALID [2022-04-27 10:18:23,055 INFO L290 TraceCheckUtils]: 87: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,055 INFO L290 TraceCheckUtils]: 88: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,055 INFO L290 TraceCheckUtils]: 89: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,055 INFO L290 TraceCheckUtils]: 90: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,055 INFO L290 TraceCheckUtils]: 91: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,055 INFO L290 TraceCheckUtils]: 92: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,055 INFO L290 TraceCheckUtils]: 93: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,055 INFO L290 TraceCheckUtils]: 94: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,055 INFO L290 TraceCheckUtils]: 95: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,055 INFO L290 TraceCheckUtils]: 96: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,055 INFO L290 TraceCheckUtils]: 97: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,055 INFO L290 TraceCheckUtils]: 98: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,055 INFO L290 TraceCheckUtils]: 99: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,055 INFO L290 TraceCheckUtils]: 100: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,055 INFO L290 TraceCheckUtils]: 101: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,055 INFO L290 TraceCheckUtils]: 102: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,055 INFO L290 TraceCheckUtils]: 103: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,055 INFO L290 TraceCheckUtils]: 104: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,056 INFO L290 TraceCheckUtils]: 105: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,056 INFO L290 TraceCheckUtils]: 106: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,056 INFO L290 TraceCheckUtils]: 107: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,056 INFO L290 TraceCheckUtils]: 108: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,056 INFO L290 TraceCheckUtils]: 109: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,056 INFO L290 TraceCheckUtils]: 110: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,056 INFO L290 TraceCheckUtils]: 111: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,056 INFO L290 TraceCheckUtils]: 112: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,056 INFO L290 TraceCheckUtils]: 113: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,056 INFO L290 TraceCheckUtils]: 114: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,056 INFO L290 TraceCheckUtils]: 115: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,056 INFO L290 TraceCheckUtils]: 116: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,056 INFO L290 TraceCheckUtils]: 117: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,056 INFO L290 TraceCheckUtils]: 118: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,056 INFO L290 TraceCheckUtils]: 119: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,056 INFO L290 TraceCheckUtils]: 120: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,056 INFO L290 TraceCheckUtils]: 121: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,056 INFO L290 TraceCheckUtils]: 122: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,056 INFO L290 TraceCheckUtils]: 123: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,056 INFO L290 TraceCheckUtils]: 124: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,057 INFO L290 TraceCheckUtils]: 125: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,057 INFO L290 TraceCheckUtils]: 126: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,057 INFO L290 TraceCheckUtils]: 127: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,057 INFO L290 TraceCheckUtils]: 128: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,057 INFO L290 TraceCheckUtils]: 129: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,057 INFO L290 TraceCheckUtils]: 130: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,057 INFO L290 TraceCheckUtils]: 131: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,057 INFO L290 TraceCheckUtils]: 132: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,057 INFO L290 TraceCheckUtils]: 133: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,057 INFO L290 TraceCheckUtils]: 134: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,057 INFO L290 TraceCheckUtils]: 135: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,057 INFO L290 TraceCheckUtils]: 136: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,057 INFO L290 TraceCheckUtils]: 137: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,057 INFO L290 TraceCheckUtils]: 138: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,057 INFO L290 TraceCheckUtils]: 139: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,057 INFO L290 TraceCheckUtils]: 140: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,057 INFO L290 TraceCheckUtils]: 141: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,057 INFO L290 TraceCheckUtils]: 142: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,057 INFO L290 TraceCheckUtils]: 143: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,057 INFO L290 TraceCheckUtils]: 144: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,057 INFO L290 TraceCheckUtils]: 145: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,057 INFO L290 TraceCheckUtils]: 146: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,058 INFO L290 TraceCheckUtils]: 147: Hoare triple {17589#false} assume !(~j~0 < ~edgecount~0); {17589#false} is VALID [2022-04-27 10:18:23,058 INFO L290 TraceCheckUtils]: 148: Hoare triple {17589#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17589#false} is VALID [2022-04-27 10:18:23,058 INFO L290 TraceCheckUtils]: 149: Hoare triple {17589#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {17589#false} is VALID [2022-04-27 10:18:23,058 INFO L290 TraceCheckUtils]: 150: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,058 INFO L290 TraceCheckUtils]: 151: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,058 INFO L290 TraceCheckUtils]: 152: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,058 INFO L290 TraceCheckUtils]: 153: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,058 INFO L290 TraceCheckUtils]: 154: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,058 INFO L290 TraceCheckUtils]: 155: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,058 INFO L290 TraceCheckUtils]: 156: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,058 INFO L290 TraceCheckUtils]: 157: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,058 INFO L290 TraceCheckUtils]: 158: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,058 INFO L290 TraceCheckUtils]: 159: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,058 INFO L290 TraceCheckUtils]: 160: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,058 INFO L290 TraceCheckUtils]: 161: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,058 INFO L290 TraceCheckUtils]: 162: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,058 INFO L290 TraceCheckUtils]: 163: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,058 INFO L290 TraceCheckUtils]: 164: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,058 INFO L290 TraceCheckUtils]: 165: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,058 INFO L290 TraceCheckUtils]: 166: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,058 INFO L290 TraceCheckUtils]: 167: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,058 INFO L290 TraceCheckUtils]: 168: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,059 INFO L290 TraceCheckUtils]: 169: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,059 INFO L290 TraceCheckUtils]: 170: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,059 INFO L290 TraceCheckUtils]: 171: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,059 INFO L290 TraceCheckUtils]: 172: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,059 INFO L290 TraceCheckUtils]: 173: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,059 INFO L290 TraceCheckUtils]: 174: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,059 INFO L290 TraceCheckUtils]: 175: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,059 INFO L290 TraceCheckUtils]: 176: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,059 INFO L290 TraceCheckUtils]: 177: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,059 INFO L290 TraceCheckUtils]: 178: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,059 INFO L290 TraceCheckUtils]: 179: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,059 INFO L290 TraceCheckUtils]: 180: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,059 INFO L290 TraceCheckUtils]: 181: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,059 INFO L290 TraceCheckUtils]: 182: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,059 INFO L290 TraceCheckUtils]: 183: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,059 INFO L290 TraceCheckUtils]: 184: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,059 INFO L290 TraceCheckUtils]: 185: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,059 INFO L290 TraceCheckUtils]: 186: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,059 INFO L290 TraceCheckUtils]: 187: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,059 INFO L290 TraceCheckUtils]: 188: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,059 INFO L290 TraceCheckUtils]: 189: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,060 INFO L290 TraceCheckUtils]: 190: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,060 INFO L290 TraceCheckUtils]: 191: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,060 INFO L290 TraceCheckUtils]: 192: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,060 INFO L290 TraceCheckUtils]: 193: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,060 INFO L290 TraceCheckUtils]: 194: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,060 INFO L290 TraceCheckUtils]: 195: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,060 INFO L290 TraceCheckUtils]: 196: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,060 INFO L290 TraceCheckUtils]: 197: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,060 INFO L290 TraceCheckUtils]: 198: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,060 INFO L290 TraceCheckUtils]: 199: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,060 INFO L290 TraceCheckUtils]: 200: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,060 INFO L290 TraceCheckUtils]: 201: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,060 INFO L290 TraceCheckUtils]: 202: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,060 INFO L290 TraceCheckUtils]: 203: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,060 INFO L290 TraceCheckUtils]: 204: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,060 INFO L290 TraceCheckUtils]: 205: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,060 INFO L290 TraceCheckUtils]: 206: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,060 INFO L290 TraceCheckUtils]: 207: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,060 INFO L290 TraceCheckUtils]: 208: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,060 INFO L290 TraceCheckUtils]: 209: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,060 INFO L290 TraceCheckUtils]: 210: Hoare triple {17589#false} assume !(~j~0 < ~edgecount~0); {17589#false} is VALID [2022-04-27 10:18:23,060 INFO L290 TraceCheckUtils]: 211: Hoare triple {17589#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17589#false} is VALID [2022-04-27 10:18:23,061 INFO L290 TraceCheckUtils]: 212: Hoare triple {17589#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {17589#false} is VALID [2022-04-27 10:18:23,061 INFO L290 TraceCheckUtils]: 213: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,061 INFO L290 TraceCheckUtils]: 214: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,061 INFO L290 TraceCheckUtils]: 215: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,061 INFO L290 TraceCheckUtils]: 216: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,061 INFO L290 TraceCheckUtils]: 217: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,061 INFO L290 TraceCheckUtils]: 218: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,061 INFO L290 TraceCheckUtils]: 219: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,061 INFO L290 TraceCheckUtils]: 220: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,061 INFO L290 TraceCheckUtils]: 221: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,061 INFO L290 TraceCheckUtils]: 222: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,061 INFO L290 TraceCheckUtils]: 223: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,061 INFO L290 TraceCheckUtils]: 224: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,061 INFO L290 TraceCheckUtils]: 225: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,061 INFO L290 TraceCheckUtils]: 226: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,061 INFO L290 TraceCheckUtils]: 227: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,061 INFO L290 TraceCheckUtils]: 228: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,061 INFO L290 TraceCheckUtils]: 229: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,061 INFO L290 TraceCheckUtils]: 230: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,061 INFO L290 TraceCheckUtils]: 231: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,061 INFO L290 TraceCheckUtils]: 232: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,061 INFO L290 TraceCheckUtils]: 233: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,062 INFO L290 TraceCheckUtils]: 234: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,062 INFO L290 TraceCheckUtils]: 235: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,062 INFO L290 TraceCheckUtils]: 236: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,062 INFO L290 TraceCheckUtils]: 237: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,062 INFO L290 TraceCheckUtils]: 238: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,062 INFO L290 TraceCheckUtils]: 239: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,062 INFO L290 TraceCheckUtils]: 240: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,062 INFO L290 TraceCheckUtils]: 241: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,062 INFO L290 TraceCheckUtils]: 242: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,062 INFO L290 TraceCheckUtils]: 243: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,062 INFO L290 TraceCheckUtils]: 244: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,062 INFO L290 TraceCheckUtils]: 245: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,062 INFO L290 TraceCheckUtils]: 246: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,062 INFO L290 TraceCheckUtils]: 247: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,062 INFO L290 TraceCheckUtils]: 248: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,062 INFO L290 TraceCheckUtils]: 249: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,062 INFO L290 TraceCheckUtils]: 250: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,062 INFO L290 TraceCheckUtils]: 251: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,062 INFO L290 TraceCheckUtils]: 252: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,062 INFO L290 TraceCheckUtils]: 253: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,062 INFO L290 TraceCheckUtils]: 254: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,063 INFO L290 TraceCheckUtils]: 255: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,063 INFO L290 TraceCheckUtils]: 256: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,063 INFO L290 TraceCheckUtils]: 257: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,063 INFO L290 TraceCheckUtils]: 258: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,063 INFO L290 TraceCheckUtils]: 259: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,063 INFO L290 TraceCheckUtils]: 260: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,063 INFO L290 TraceCheckUtils]: 261: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,063 INFO L290 TraceCheckUtils]: 262: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,063 INFO L290 TraceCheckUtils]: 263: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,063 INFO L290 TraceCheckUtils]: 264: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,063 INFO L290 TraceCheckUtils]: 265: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,063 INFO L290 TraceCheckUtils]: 266: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,063 INFO L290 TraceCheckUtils]: 267: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,063 INFO L290 TraceCheckUtils]: 268: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,063 INFO L290 TraceCheckUtils]: 269: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,063 INFO L290 TraceCheckUtils]: 270: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,063 INFO L290 TraceCheckUtils]: 271: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,063 INFO L290 TraceCheckUtils]: 272: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,063 INFO L290 TraceCheckUtils]: 273: Hoare triple {17589#false} assume !(~j~0 < ~edgecount~0); {17589#false} is VALID [2022-04-27 10:18:23,063 INFO L290 TraceCheckUtils]: 274: Hoare triple {17589#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17589#false} is VALID [2022-04-27 10:18:23,063 INFO L290 TraceCheckUtils]: 275: Hoare triple {17589#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {17589#false} is VALID [2022-04-27 10:18:23,064 INFO L290 TraceCheckUtils]: 276: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,064 INFO L290 TraceCheckUtils]: 277: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,064 INFO L290 TraceCheckUtils]: 278: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,064 INFO L290 TraceCheckUtils]: 279: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,064 INFO L290 TraceCheckUtils]: 280: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,064 INFO L290 TraceCheckUtils]: 281: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,064 INFO L290 TraceCheckUtils]: 282: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,064 INFO L290 TraceCheckUtils]: 283: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,064 INFO L290 TraceCheckUtils]: 284: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,064 INFO L290 TraceCheckUtils]: 285: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,064 INFO L290 TraceCheckUtils]: 286: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,064 INFO L290 TraceCheckUtils]: 287: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,064 INFO L290 TraceCheckUtils]: 288: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,064 INFO L290 TraceCheckUtils]: 289: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,064 INFO L290 TraceCheckUtils]: 290: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,064 INFO L290 TraceCheckUtils]: 291: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,064 INFO L290 TraceCheckUtils]: 292: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,064 INFO L290 TraceCheckUtils]: 293: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,064 INFO L290 TraceCheckUtils]: 294: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,064 INFO L290 TraceCheckUtils]: 295: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,064 INFO L290 TraceCheckUtils]: 296: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,064 INFO L290 TraceCheckUtils]: 297: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,065 INFO L290 TraceCheckUtils]: 298: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,065 INFO L290 TraceCheckUtils]: 299: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,065 INFO L290 TraceCheckUtils]: 300: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,065 INFO L290 TraceCheckUtils]: 301: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,065 INFO L290 TraceCheckUtils]: 302: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,065 INFO L290 TraceCheckUtils]: 303: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,065 INFO L290 TraceCheckUtils]: 304: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,065 INFO L290 TraceCheckUtils]: 305: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,065 INFO L290 TraceCheckUtils]: 306: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,065 INFO L290 TraceCheckUtils]: 307: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,065 INFO L290 TraceCheckUtils]: 308: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,065 INFO L290 TraceCheckUtils]: 309: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,065 INFO L290 TraceCheckUtils]: 310: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,065 INFO L290 TraceCheckUtils]: 311: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,065 INFO L290 TraceCheckUtils]: 312: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,065 INFO L290 TraceCheckUtils]: 313: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,065 INFO L290 TraceCheckUtils]: 314: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,065 INFO L290 TraceCheckUtils]: 315: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,065 INFO L290 TraceCheckUtils]: 316: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,065 INFO L290 TraceCheckUtils]: 317: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,065 INFO L290 TraceCheckUtils]: 318: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,066 INFO L290 TraceCheckUtils]: 319: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,066 INFO L290 TraceCheckUtils]: 320: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,066 INFO L290 TraceCheckUtils]: 321: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,066 INFO L290 TraceCheckUtils]: 322: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,066 INFO L290 TraceCheckUtils]: 323: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,066 INFO L290 TraceCheckUtils]: 324: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,066 INFO L290 TraceCheckUtils]: 325: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,066 INFO L290 TraceCheckUtils]: 326: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,066 INFO L290 TraceCheckUtils]: 327: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,066 INFO L290 TraceCheckUtils]: 328: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,066 INFO L290 TraceCheckUtils]: 329: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,066 INFO L290 TraceCheckUtils]: 330: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,066 INFO L290 TraceCheckUtils]: 331: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,066 INFO L290 TraceCheckUtils]: 332: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,066 INFO L290 TraceCheckUtils]: 333: Hoare triple {17589#false} assume !!(~j~0 < ~edgecount~0);call #t~mem7 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem8;havoc #t~mem8;call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem9 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem10 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,066 INFO L290 TraceCheckUtils]: 334: Hoare triple {17589#false} assume #t~mem11 > #t~mem9 + #t~mem10;havoc #t~mem11;havoc #t~mem9;havoc #t~mem10;call #t~mem12 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem13 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem12 + #t~mem13, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem12;havoc #t~mem13; {17589#false} is VALID [2022-04-27 10:18:23,066 INFO L290 TraceCheckUtils]: 335: Hoare triple {17589#false} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {17589#false} is VALID [2022-04-27 10:18:23,066 INFO L290 TraceCheckUtils]: 336: Hoare triple {17589#false} assume !(~j~0 < ~edgecount~0); {17589#false} is VALID [2022-04-27 10:18:23,066 INFO L290 TraceCheckUtils]: 337: Hoare triple {17589#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {17589#false} is VALID [2022-04-27 10:18:23,066 INFO L290 TraceCheckUtils]: 338: Hoare triple {17589#false} assume !(~i~0 < ~nodecount~0); {17589#false} is VALID [2022-04-27 10:18:23,066 INFO L290 TraceCheckUtils]: 339: Hoare triple {17589#false} ~i~0 := 0; {17589#false} is VALID [2022-04-27 10:18:23,066 INFO L290 TraceCheckUtils]: 340: Hoare triple {17589#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); {17589#false} is VALID [2022-04-27 10:18:23,067 INFO L290 TraceCheckUtils]: 341: Hoare triple {17589#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {17589#false} is VALID [2022-04-27 10:18:23,067 INFO L290 TraceCheckUtils]: 342: Hoare triple {17589#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {17589#false} is VALID [2022-04-27 10:18:23,067 INFO L290 TraceCheckUtils]: 343: Hoare triple {17589#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); {17589#false} is VALID [2022-04-27 10:18:23,067 INFO L290 TraceCheckUtils]: 344: Hoare triple {17589#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {17589#false} is VALID [2022-04-27 10:18:23,067 INFO L290 TraceCheckUtils]: 345: Hoare triple {17589#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {17589#false} is VALID [2022-04-27 10:18:23,067 INFO L290 TraceCheckUtils]: 346: Hoare triple {17589#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); {17589#false} is VALID [2022-04-27 10:18:23,067 INFO L290 TraceCheckUtils]: 347: Hoare triple {17589#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {17589#false} is VALID [2022-04-27 10:18:23,067 INFO L290 TraceCheckUtils]: 348: Hoare triple {17589#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {17589#false} is VALID [2022-04-27 10:18:23,067 INFO L290 TraceCheckUtils]: 349: Hoare triple {17589#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); {17589#false} is VALID [2022-04-27 10:18:23,067 INFO L290 TraceCheckUtils]: 350: Hoare triple {17589#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {17589#false} is VALID [2022-04-27 10:18:23,067 INFO L290 TraceCheckUtils]: 351: Hoare triple {17589#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {17589#false} is VALID [2022-04-27 10:18:23,067 INFO L290 TraceCheckUtils]: 352: Hoare triple {17589#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); {17589#false} is VALID [2022-04-27 10:18:23,067 INFO L290 TraceCheckUtils]: 353: Hoare triple {17589#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {17589#false} is VALID [2022-04-27 10:18:23,067 INFO L290 TraceCheckUtils]: 354: Hoare triple {17589#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {17589#false} is VALID [2022-04-27 10:18:23,067 INFO L290 TraceCheckUtils]: 355: Hoare triple {17589#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); {17589#false} is VALID [2022-04-27 10:18:23,067 INFO L290 TraceCheckUtils]: 356: Hoare triple {17589#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {17589#false} is VALID [2022-04-27 10:18:23,067 INFO L290 TraceCheckUtils]: 357: Hoare triple {17589#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {17589#false} is VALID [2022-04-27 10:18:23,067 INFO L290 TraceCheckUtils]: 358: Hoare triple {17589#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); {17589#false} is VALID [2022-04-27 10:18:23,067 INFO L290 TraceCheckUtils]: 359: Hoare triple {17589#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {17589#false} is VALID [2022-04-27 10:18:23,067 INFO L290 TraceCheckUtils]: 360: Hoare triple {17589#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {17589#false} is VALID [2022-04-27 10:18:23,067 INFO L290 TraceCheckUtils]: 361: Hoare triple {17589#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); {17589#false} is VALID [2022-04-27 10:18:23,068 INFO L290 TraceCheckUtils]: 362: Hoare triple {17589#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {17589#false} is VALID [2022-04-27 10:18:23,068 INFO L290 TraceCheckUtils]: 363: Hoare triple {17589#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {17589#false} is VALID [2022-04-27 10:18:23,068 INFO L290 TraceCheckUtils]: 364: Hoare triple {17589#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); {17589#false} is VALID [2022-04-27 10:18:23,068 INFO L290 TraceCheckUtils]: 365: Hoare triple {17589#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {17589#false} is VALID [2022-04-27 10:18:23,068 INFO L290 TraceCheckUtils]: 366: Hoare triple {17589#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {17589#false} is VALID [2022-04-27 10:18:23,068 INFO L290 TraceCheckUtils]: 367: Hoare triple {17589#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); {17589#false} is VALID [2022-04-27 10:18:23,068 INFO L290 TraceCheckUtils]: 368: Hoare triple {17589#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {17589#false} is VALID [2022-04-27 10:18:23,068 INFO L290 TraceCheckUtils]: 369: Hoare triple {17589#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {17589#false} is VALID [2022-04-27 10:18:23,068 INFO L290 TraceCheckUtils]: 370: Hoare triple {17589#false} assume !(~i~0 < ~edgecount~0); {17589#false} is VALID [2022-04-27 10:18:23,068 INFO L290 TraceCheckUtils]: 371: Hoare triple {17589#false} ~i~0 := 0; {17589#false} is VALID [2022-04-27 10:18:23,068 INFO L290 TraceCheckUtils]: 372: Hoare triple {17589#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17589#false} is VALID [2022-04-27 10:18:23,068 INFO L272 TraceCheckUtils]: 373: Hoare triple {17589#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {17589#false} is VALID [2022-04-27 10:18:23,068 INFO L290 TraceCheckUtils]: 374: Hoare triple {17589#false} ~cond := #in~cond; {17589#false} is VALID [2022-04-27 10:18:23,068 INFO L290 TraceCheckUtils]: 375: Hoare triple {17589#false} assume 0 == ~cond; {17589#false} is VALID [2022-04-27 10:18:23,068 INFO L290 TraceCheckUtils]: 376: Hoare triple {17589#false} assume !false; {17589#false} is VALID [2022-04-27 10:18:23,070 INFO L134 CoverageAnalysis]: Checked inductivity of 15565 backedges. 524 proven. 4 refuted. 0 times theorem prover too weak. 15037 trivial. 0 not checked. [2022-04-27 10:18:23,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:18:26,884 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~x~0_358 Int)) (or (not (<= v_main_~x~0_358 (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)))) (forall ((v_ArrVal_1787 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_358 4) |c_main_~#distance~0.offset|) v_ArrVal_1787))) (let ((.cse1 (store |c_#memory_int| |c_main_~#distance~0.base| .cse0)) (.cse2 (* c_main_~j~0 4))) (<= (select .cse0 (+ (* (select (select .cse1 |c_main_~#Dest~0.base|) (+ .cse2 4 |c_main_~#Dest~0.offset|)) 4) |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-27 10:18:28,981 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~x~0_358 Int) (v_ArrVal_1787 Int)) (or (not (<= v_main_~x~0_358 (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|))) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_358 4) |c_main_~#distance~0.offset|) v_ArrVal_1787))) (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|)))))))) is different from false [2022-04-27 10:18:52,961 WARN L833 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int)) (or (forall ((v_main_~x~0_358 Int) (|main_~#distance~0.offset| Int) (v_ArrVal_1782 Int) (v_ArrVal_1784 Int) (v_ArrVal_1787 Int)) (let ((.cse2 (let ((.cse3 (* main_~i~0 4))) (store (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4 .cse3) v_ArrVal_1782) (+ |main_~#distance~0.offset| 8 .cse3) v_ArrVal_1784)))) (or (let ((.cse0 (store .cse2 (+ |main_~#distance~0.offset| (* v_main_~x~0_358 4)) v_ArrVal_1787))) (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) |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))) |main_~#distance~0.offset|)))))) (not (<= v_main_~x~0_358 (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse2) |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|))) (< v_ArrVal_1784 v_ArrVal_1782)))) (not (< (+ main_~i~0 2) c_main_~nodecount~0)) (< (+ main_~i~0 3) c_main_~nodecount~0))) is different from false [2022-04-27 10:18:54,045 INFO L356 Elim1Store]: treesize reduction 428, result has 24.0 percent of original size [2022-04-27 10:18:54,045 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 17439 treesize of output 7666