java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -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_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 23:57:50,780 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 23:57:50,782 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 23:57:50,797 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 23:57:50,797 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 23:57:50,798 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 23:57:50,799 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 23:57:50,802 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 23:57:50,807 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 23:57:50,813 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 23:57:50,814 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 23:57:50,814 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 23:57:50,815 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 23:57:50,819 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 23:57:50,821 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 23:57:50,821 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 23:57:50,825 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 23:57:50,827 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 23:57:50,831 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 23:57:50,833 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 23:57:50,836 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 23:57:50,839 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 23:57:50,842 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 23:57:50,844 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 23:57:50,844 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 23:57:50,845 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 23:57:50,847 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 23:57:50,847 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 23:57:50,848 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 23:57:50,849 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 23:57:50,850 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 23:57:50,850 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 23:57:50,850 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 23:57:50,852 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 23:57:50,853 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 23:57:50,854 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 23:57:50,854 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 23:57:50,869 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 23:57:50,869 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 23:57:50,870 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 23:57:50,870 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 23:57:50,871 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 23:57:50,871 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 23:57:50,871 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 23:57:50,872 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 23:57:50,872 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 23:57:50,872 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 23:57:50,872 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 23:57:50,872 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 23:57:50,873 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 23:57:50,873 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 23:57:50,873 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 23:57:50,873 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 23:57:50,873 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 23:57:50,873 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 23:57:50,874 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 23:57:50,874 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 23:57:50,874 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 23:57:50,874 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 23:57:50,874 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 23:57:50,875 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:57:50,875 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 23:57:50,875 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 23:57:50,875 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 23:57:50,875 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 23:57:50,876 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 23:57:50,876 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 23:57:50,876 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 23:57:50,923 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 23:57:50,936 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 23:57:50,941 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 23:57:50,943 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 23:57:50,943 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 23:57:50,944 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_01_true-unreach-call.i [2018-11-18 23:57:51,005 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07035dba1/0e98b8b3c06d48229cae842855897687/FLAG3a3d81917 [2018-11-18 23:57:51,431 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 23:57:51,432 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01_true-unreach-call.i [2018-11-18 23:57:51,439 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07035dba1/0e98b8b3c06d48229cae842855897687/FLAG3a3d81917 [2018-11-18 23:57:51,810 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07035dba1/0e98b8b3c06d48229cae842855897687 [2018-11-18 23:57:51,819 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 23:57:51,820 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 23:57:51,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 23:57:51,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 23:57:51,825 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 23:57:51,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:57:51" (1/1) ... [2018-11-18 23:57:51,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10e7872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:51, skipping insertion in model container [2018-11-18 23:57:51,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:57:51" (1/1) ... [2018-11-18 23:57:51,843 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 23:57:51,872 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 23:57:52,144 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:57:52,151 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 23:57:52,200 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:57:52,223 INFO L195 MainTranslator]: Completed translation [2018-11-18 23:57:52,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:52 WrapperNode [2018-11-18 23:57:52,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 23:57:52,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 23:57:52,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 23:57:52,225 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 23:57:52,241 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:52" (1/1) ... [2018-11-18 23:57:52,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:52" (1/1) ... [2018-11-18 23:57:52,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:52" (1/1) ... [2018-11-18 23:57:52,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:52" (1/1) ... [2018-11-18 23:57:52,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:52" (1/1) ... [2018-11-18 23:57:52,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:52" (1/1) ... [2018-11-18 23:57:52,346 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:52" (1/1) ... [2018-11-18 23:57:52,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 23:57:52,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 23:57:52,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 23:57:52,355 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 23:57:52,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:57:52,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 23:57:52,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 23:57:52,516 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 23:57:52,516 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 23:57:52,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 23:57:52,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 23:57:52,517 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 23:57:52,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 23:57:52,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 23:57:52,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 23:57:52,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 23:57:52,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 23:57:52,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 23:57:52,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 23:57:53,712 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 23:57:53,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:57:53 BoogieIcfgContainer [2018-11-18 23:57:53,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 23:57:53,714 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 23:57:53,714 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 23:57:53,718 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 23:57:53,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:57:51" (1/3) ... [2018-11-18 23:57:53,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d6a9a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:57:53, skipping insertion in model container [2018-11-18 23:57:53,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:52" (2/3) ... [2018-11-18 23:57:53,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d6a9a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:57:53, skipping insertion in model container [2018-11-18 23:57:53,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:57:53" (3/3) ... [2018-11-18 23:57:53,722 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_01_true-unreach-call.i [2018-11-18 23:57:53,732 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 23:57:53,742 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 23:57:53,759 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 23:57:53,792 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 23:57:53,793 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 23:57:53,793 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 23:57:53,793 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 23:57:53,793 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 23:57:53,793 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 23:57:53,794 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 23:57:53,794 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 23:57:53,794 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 23:57:53,814 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-11-18 23:57:53,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 23:57:53,821 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:57:53,822 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:57:53,825 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:57:53,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:57:53,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1090382313, now seen corresponding path program 1 times [2018-11-18 23:57:53,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:57:53,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:57:53,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:57:53,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:57:53,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:57:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:57:54,054 INFO L256 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {43#true} is VALID [2018-11-18 23:57:54,058 INFO L273 TraceCheckUtils]: 1: Hoare triple {43#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {43#true} is VALID [2018-11-18 23:57:54,059 INFO L273 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2018-11-18 23:57:54,060 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #108#return; {43#true} is VALID [2018-11-18 23:57:54,060 INFO L256 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret18 := main(); {43#true} is VALID [2018-11-18 23:57:54,060 INFO L273 TraceCheckUtils]: 5: Hoare triple {43#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {43#true} is VALID [2018-11-18 23:57:54,074 INFO L273 TraceCheckUtils]: 6: Hoare triple {43#true} assume !true; {44#false} is VALID [2018-11-18 23:57:54,075 INFO L273 TraceCheckUtils]: 7: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2018-11-18 23:57:54,075 INFO L273 TraceCheckUtils]: 8: Hoare triple {44#false} assume !true; {44#false} is VALID [2018-11-18 23:57:54,075 INFO L273 TraceCheckUtils]: 9: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2018-11-18 23:57:54,076 INFO L273 TraceCheckUtils]: 10: Hoare triple {44#false} assume !true; {44#false} is VALID [2018-11-18 23:57:54,076 INFO L273 TraceCheckUtils]: 11: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2018-11-18 23:57:54,076 INFO L273 TraceCheckUtils]: 12: Hoare triple {44#false} assume true; {44#false} is VALID [2018-11-18 23:57:54,077 INFO L273 TraceCheckUtils]: 13: Hoare triple {44#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {44#false} is VALID [2018-11-18 23:57:54,077 INFO L256 TraceCheckUtils]: 14: Hoare triple {44#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {44#false} is VALID [2018-11-18 23:57:54,078 INFO L273 TraceCheckUtils]: 15: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2018-11-18 23:57:54,078 INFO L273 TraceCheckUtils]: 16: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2018-11-18 23:57:54,078 INFO L273 TraceCheckUtils]: 17: Hoare triple {44#false} assume !false; {44#false} is VALID [2018-11-18 23:57:54,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:57:54,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:57:54,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 23:57:54,090 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-18 23:57:54,093 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:57:54,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 23:57:54,173 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:57:54,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 23:57:54,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 23:57:54,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:57:54,185 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-11-18 23:57:54,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:54,487 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2018-11-18 23:57:54,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 23:57:54,487 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-18 23:57:54,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:57:54,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:57:54,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 94 transitions. [2018-11-18 23:57:54,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:57:54,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 94 transitions. [2018-11-18 23:57:54,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 94 transitions. [2018-11-18 23:57:54,841 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:57:54,860 INFO L225 Difference]: With dead ends: 70 [2018-11-18 23:57:54,860 INFO L226 Difference]: Without dead ends: 35 [2018-11-18 23:57:54,866 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:57:54,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-18 23:57:55,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-18 23:57:55,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:57:55,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-18 23:57:55,046 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-18 23:57:55,047 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-18 23:57:55,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:55,059 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-18 23:57:55,059 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-18 23:57:55,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:57:55,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:57:55,062 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-18 23:57:55,062 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-18 23:57:55,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:55,071 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-18 23:57:55,072 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-18 23:57:55,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:57:55,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:57:55,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:57:55,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:57:55,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 23:57:55,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-11-18 23:57:55,081 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 18 [2018-11-18 23:57:55,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:57:55,082 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-18 23:57:55,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 23:57:55,082 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-18 23:57:55,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 23:57:55,083 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:57:55,084 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:57:55,085 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:57:55,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:57:55,085 INFO L82 PathProgramCache]: Analyzing trace with hash -448793496, now seen corresponding path program 1 times [2018-11-18 23:57:55,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:57:55,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:57:55,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:57:55,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:57:55,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:57:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:57:55,282 INFO L256 TraceCheckUtils]: 0: Hoare triple {250#true} call ULTIMATE.init(); {250#true} is VALID [2018-11-18 23:57:55,282 INFO L273 TraceCheckUtils]: 1: Hoare triple {250#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {250#true} is VALID [2018-11-18 23:57:55,283 INFO L273 TraceCheckUtils]: 2: Hoare triple {250#true} assume true; {250#true} is VALID [2018-11-18 23:57:55,283 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {250#true} {250#true} #108#return; {250#true} is VALID [2018-11-18 23:57:55,284 INFO L256 TraceCheckUtils]: 4: Hoare triple {250#true} call #t~ret18 := main(); {250#true} is VALID [2018-11-18 23:57:55,287 INFO L273 TraceCheckUtils]: 5: Hoare triple {250#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {252#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:57:55,289 INFO L273 TraceCheckUtils]: 6: Hoare triple {252#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume true; {252#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:57:55,291 INFO L273 TraceCheckUtils]: 7: Hoare triple {252#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume !(~i~0 < ~nodecount~0); {251#false} is VALID [2018-11-18 23:57:55,291 INFO L273 TraceCheckUtils]: 8: Hoare triple {251#false} ~i~0 := 0; {251#false} is VALID [2018-11-18 23:57:55,292 INFO L273 TraceCheckUtils]: 9: Hoare triple {251#false} assume true; {251#false} is VALID [2018-11-18 23:57:55,292 INFO L273 TraceCheckUtils]: 10: Hoare triple {251#false} assume !(~i~0 < ~nodecount~0); {251#false} is VALID [2018-11-18 23:57:55,293 INFO L273 TraceCheckUtils]: 11: Hoare triple {251#false} ~i~0 := 0; {251#false} is VALID [2018-11-18 23:57:55,294 INFO L273 TraceCheckUtils]: 12: Hoare triple {251#false} assume true; {251#false} is VALID [2018-11-18 23:57:55,294 INFO L273 TraceCheckUtils]: 13: Hoare triple {251#false} assume !(~i~0 < ~edgecount~0); {251#false} is VALID [2018-11-18 23:57:55,295 INFO L273 TraceCheckUtils]: 14: Hoare triple {251#false} ~i~0 := 0; {251#false} is VALID [2018-11-18 23:57:55,295 INFO L273 TraceCheckUtils]: 15: Hoare triple {251#false} assume true; {251#false} is VALID [2018-11-18 23:57:55,295 INFO L273 TraceCheckUtils]: 16: Hoare triple {251#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {251#false} is VALID [2018-11-18 23:57:55,296 INFO L256 TraceCheckUtils]: 17: Hoare triple {251#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {251#false} is VALID [2018-11-18 23:57:55,296 INFO L273 TraceCheckUtils]: 18: Hoare triple {251#false} ~cond := #in~cond; {251#false} is VALID [2018-11-18 23:57:55,296 INFO L273 TraceCheckUtils]: 19: Hoare triple {251#false} assume 0 == ~cond; {251#false} is VALID [2018-11-18 23:57:55,297 INFO L273 TraceCheckUtils]: 20: Hoare triple {251#false} assume !false; {251#false} is VALID [2018-11-18 23:57:55,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:57:55,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:57:55,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:57:55,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 23:57:55,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:57:55,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:57:55,409 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:57:55,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:57:55,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:57:55,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:57:55,410 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 3 states. [2018-11-18 23:57:55,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:55,922 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2018-11-18 23:57:55,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:57:55,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 23:57:55,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:57:55,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:57:55,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2018-11-18 23:57:55,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:57:55,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2018-11-18 23:57:55,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 76 transitions. [2018-11-18 23:57:56,048 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:57:56,051 INFO L225 Difference]: With dead ends: 64 [2018-11-18 23:57:56,051 INFO L226 Difference]: Without dead ends: 39 [2018-11-18 23:57:56,052 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:57:56,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-18 23:57:56,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-18 23:57:56,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:57:56,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2018-11-18 23:57:56,070 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2018-11-18 23:57:56,070 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2018-11-18 23:57:56,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:56,074 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-18 23:57:56,074 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-11-18 23:57:56,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:57:56,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:57:56,076 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2018-11-18 23:57:56,076 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2018-11-18 23:57:56,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:56,079 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-18 23:57:56,079 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-11-18 23:57:56,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:57:56,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:57:56,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:57:56,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:57:56,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 23:57:56,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2018-11-18 23:57:56,083 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 21 [2018-11-18 23:57:56,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:57:56,083 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-11-18 23:57:56,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:57:56,083 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2018-11-18 23:57:56,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 23:57:56,084 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:57:56,085 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:57:56,085 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:57:56,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:57:56,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1500559425, now seen corresponding path program 1 times [2018-11-18 23:57:56,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:57:56,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:57:56,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:57:56,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:57:56,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:57:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:57:56,293 INFO L256 TraceCheckUtils]: 0: Hoare triple {464#true} call ULTIMATE.init(); {464#true} is VALID [2018-11-18 23:57:56,294 INFO L273 TraceCheckUtils]: 1: Hoare triple {464#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {464#true} is VALID [2018-11-18 23:57:56,294 INFO L273 TraceCheckUtils]: 2: Hoare triple {464#true} assume true; {464#true} is VALID [2018-11-18 23:57:56,294 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {464#true} {464#true} #108#return; {464#true} is VALID [2018-11-18 23:57:56,294 INFO L256 TraceCheckUtils]: 4: Hoare triple {464#true} call #t~ret18 := main(); {464#true} is VALID [2018-11-18 23:57:56,297 INFO L273 TraceCheckUtils]: 5: Hoare triple {464#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {466#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:57:56,298 INFO L273 TraceCheckUtils]: 6: Hoare triple {466#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume true; {466#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:57:56,299 INFO L273 TraceCheckUtils]: 7: Hoare triple {466#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {466#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:57:56,300 INFO L273 TraceCheckUtils]: 8: Hoare triple {466#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {466#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:57:56,310 INFO L273 TraceCheckUtils]: 9: Hoare triple {466#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {467#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-18 23:57:56,310 INFO L273 TraceCheckUtils]: 10: Hoare triple {467#(<= (+ main_~i~0 4) main_~nodecount~0)} assume true; {467#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-18 23:57:56,311 INFO L273 TraceCheckUtils]: 11: Hoare triple {467#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {465#false} is VALID [2018-11-18 23:57:56,311 INFO L273 TraceCheckUtils]: 12: Hoare triple {465#false} ~i~0 := 0; {465#false} is VALID [2018-11-18 23:57:56,312 INFO L273 TraceCheckUtils]: 13: Hoare triple {465#false} assume true; {465#false} is VALID [2018-11-18 23:57:56,312 INFO L273 TraceCheckUtils]: 14: Hoare triple {465#false} assume !(~i~0 < ~nodecount~0); {465#false} is VALID [2018-11-18 23:57:56,312 INFO L273 TraceCheckUtils]: 15: Hoare triple {465#false} ~i~0 := 0; {465#false} is VALID [2018-11-18 23:57:56,313 INFO L273 TraceCheckUtils]: 16: Hoare triple {465#false} assume true; {465#false} is VALID [2018-11-18 23:57:56,313 INFO L273 TraceCheckUtils]: 17: Hoare triple {465#false} assume !(~i~0 < ~edgecount~0); {465#false} is VALID [2018-11-18 23:57:56,313 INFO L273 TraceCheckUtils]: 18: Hoare triple {465#false} ~i~0 := 0; {465#false} is VALID [2018-11-18 23:57:56,314 INFO L273 TraceCheckUtils]: 19: Hoare triple {465#false} assume true; {465#false} is VALID [2018-11-18 23:57:56,314 INFO L273 TraceCheckUtils]: 20: Hoare triple {465#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {465#false} is VALID [2018-11-18 23:57:56,314 INFO L256 TraceCheckUtils]: 21: Hoare triple {465#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {465#false} is VALID [2018-11-18 23:57:56,315 INFO L273 TraceCheckUtils]: 22: Hoare triple {465#false} ~cond := #in~cond; {465#false} is VALID [2018-11-18 23:57:56,315 INFO L273 TraceCheckUtils]: 23: Hoare triple {465#false} assume 0 == ~cond; {465#false} is VALID [2018-11-18 23:57:56,315 INFO L273 TraceCheckUtils]: 24: Hoare triple {465#false} assume !false; {465#false} is VALID [2018-11-18 23:57:56,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:57:56,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:57:56,318 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:57:56,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:57:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:57:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:57:56,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:57:56,668 INFO L256 TraceCheckUtils]: 0: Hoare triple {464#true} call ULTIMATE.init(); {464#true} is VALID [2018-11-18 23:57:56,668 INFO L273 TraceCheckUtils]: 1: Hoare triple {464#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {464#true} is VALID [2018-11-18 23:57:56,668 INFO L273 TraceCheckUtils]: 2: Hoare triple {464#true} assume true; {464#true} is VALID [2018-11-18 23:57:56,669 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {464#true} {464#true} #108#return; {464#true} is VALID [2018-11-18 23:57:56,669 INFO L256 TraceCheckUtils]: 4: Hoare triple {464#true} call #t~ret18 := main(); {464#true} is VALID [2018-11-18 23:57:56,676 INFO L273 TraceCheckUtils]: 5: Hoare triple {464#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {486#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-18 23:57:56,684 INFO L273 TraceCheckUtils]: 6: Hoare triple {486#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} assume true; {486#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-18 23:57:56,685 INFO L273 TraceCheckUtils]: 7: Hoare triple {486#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {486#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-18 23:57:56,686 INFO L273 TraceCheckUtils]: 8: Hoare triple {486#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {486#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-18 23:57:56,689 INFO L273 TraceCheckUtils]: 9: Hoare triple {486#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {499#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} is VALID [2018-11-18 23:57:56,689 INFO L273 TraceCheckUtils]: 10: Hoare triple {499#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} assume true; {499#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} is VALID [2018-11-18 23:57:56,691 INFO L273 TraceCheckUtils]: 11: Hoare triple {499#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} assume !(~i~0 < ~nodecount~0); {465#false} is VALID [2018-11-18 23:57:56,691 INFO L273 TraceCheckUtils]: 12: Hoare triple {465#false} ~i~0 := 0; {465#false} is VALID [2018-11-18 23:57:56,691 INFO L273 TraceCheckUtils]: 13: Hoare triple {465#false} assume true; {465#false} is VALID [2018-11-18 23:57:56,692 INFO L273 TraceCheckUtils]: 14: Hoare triple {465#false} assume !(~i~0 < ~nodecount~0); {465#false} is VALID [2018-11-18 23:57:56,692 INFO L273 TraceCheckUtils]: 15: Hoare triple {465#false} ~i~0 := 0; {465#false} is VALID [2018-11-18 23:57:56,692 INFO L273 TraceCheckUtils]: 16: Hoare triple {465#false} assume true; {465#false} is VALID [2018-11-18 23:57:56,693 INFO L273 TraceCheckUtils]: 17: Hoare triple {465#false} assume !(~i~0 < ~edgecount~0); {465#false} is VALID [2018-11-18 23:57:56,693 INFO L273 TraceCheckUtils]: 18: Hoare triple {465#false} ~i~0 := 0; {465#false} is VALID [2018-11-18 23:57:56,693 INFO L273 TraceCheckUtils]: 19: Hoare triple {465#false} assume true; {465#false} is VALID [2018-11-18 23:57:56,694 INFO L273 TraceCheckUtils]: 20: Hoare triple {465#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {465#false} is VALID [2018-11-18 23:57:56,694 INFO L256 TraceCheckUtils]: 21: Hoare triple {465#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {465#false} is VALID [2018-11-18 23:57:56,694 INFO L273 TraceCheckUtils]: 22: Hoare triple {465#false} ~cond := #in~cond; {465#false} is VALID [2018-11-18 23:57:56,695 INFO L273 TraceCheckUtils]: 23: Hoare triple {465#false} assume 0 == ~cond; {465#false} is VALID [2018-11-18 23:57:56,695 INFO L273 TraceCheckUtils]: 24: Hoare triple {465#false} assume !false; {465#false} is VALID [2018-11-18 23:57:56,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:57:56,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:57:56,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-18 23:57:56,720 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-18 23:57:56,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:57:56,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 23:57:56,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:57:56,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 23:57:56,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 23:57:56,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 23:57:56,850 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 6 states. [2018-11-18 23:57:57,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:57,295 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2018-11-18 23:57:57,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:57:57,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-18 23:57:57,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:57:57,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:57:57,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2018-11-18 23:57:57,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:57:57,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2018-11-18 23:57:57,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 81 transitions. [2018-11-18 23:57:57,403 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:57:57,405 INFO L225 Difference]: With dead ends: 68 [2018-11-18 23:57:57,405 INFO L226 Difference]: Without dead ends: 43 [2018-11-18 23:57:57,406 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 23:57:57,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-18 23:57:57,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-11-18 23:57:57,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:57:57,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 41 states. [2018-11-18 23:57:57,445 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 41 states. [2018-11-18 23:57:57,445 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 41 states. [2018-11-18 23:57:57,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:57,448 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-18 23:57:57,448 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-11-18 23:57:57,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:57:57,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:57:57,449 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 43 states. [2018-11-18 23:57:57,450 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 43 states. [2018-11-18 23:57:57,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:57,453 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-18 23:57:57,453 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-11-18 23:57:57,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:57:57,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:57:57,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:57:57,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:57:57,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 23:57:57,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2018-11-18 23:57:57,457 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 25 [2018-11-18 23:57:57,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:57:57,457 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2018-11-18 23:57:57,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 23:57:57,457 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2018-11-18 23:57:57,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 23:57:57,458 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:57:57,459 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:57:57,459 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:57:57,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:57:57,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1094248554, now seen corresponding path program 2 times [2018-11-18 23:57:57,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:57:57,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:57:57,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:57:57,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:57:57,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:57:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:57:57,740 INFO L256 TraceCheckUtils]: 0: Hoare triple {771#true} call ULTIMATE.init(); {771#true} is VALID [2018-11-18 23:57:57,740 INFO L273 TraceCheckUtils]: 1: Hoare triple {771#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {771#true} is VALID [2018-11-18 23:57:57,741 INFO L273 TraceCheckUtils]: 2: Hoare triple {771#true} assume true; {771#true} is VALID [2018-11-18 23:57:57,741 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {771#true} {771#true} #108#return; {771#true} is VALID [2018-11-18 23:57:57,742 INFO L256 TraceCheckUtils]: 4: Hoare triple {771#true} call #t~ret18 := main(); {771#true} is VALID [2018-11-18 23:57:57,745 INFO L273 TraceCheckUtils]: 5: Hoare triple {771#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {773#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-18 23:57:57,745 INFO L273 TraceCheckUtils]: 6: Hoare triple {773#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} assume true; {773#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-18 23:57:57,750 INFO L273 TraceCheckUtils]: 7: Hoare triple {773#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0); {773#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-18 23:57:57,751 INFO L273 TraceCheckUtils]: 8: Hoare triple {773#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {773#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-18 23:57:57,769 INFO L273 TraceCheckUtils]: 9: Hoare triple {773#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {774#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} is VALID [2018-11-18 23:57:57,775 INFO L273 TraceCheckUtils]: 10: Hoare triple {774#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} assume true; {774#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} is VALID [2018-11-18 23:57:57,776 INFO L273 TraceCheckUtils]: 11: Hoare triple {774#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} assume !!(~i~0 < ~nodecount~0); {774#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} is VALID [2018-11-18 23:57:57,777 INFO L273 TraceCheckUtils]: 12: Hoare triple {774#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {775#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:57:57,778 INFO L273 TraceCheckUtils]: 13: Hoare triple {775#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {776#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-18 23:57:57,778 INFO L273 TraceCheckUtils]: 14: Hoare triple {776#(<= (+ main_~i~0 4) main_~nodecount~0)} assume true; {776#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-18 23:57:57,779 INFO L273 TraceCheckUtils]: 15: Hoare triple {776#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {772#false} is VALID [2018-11-18 23:57:57,779 INFO L273 TraceCheckUtils]: 16: Hoare triple {772#false} ~i~0 := 0; {772#false} is VALID [2018-11-18 23:57:57,779 INFO L273 TraceCheckUtils]: 17: Hoare triple {772#false} assume true; {772#false} is VALID [2018-11-18 23:57:57,780 INFO L273 TraceCheckUtils]: 18: Hoare triple {772#false} assume !(~i~0 < ~nodecount~0); {772#false} is VALID [2018-11-18 23:57:57,780 INFO L273 TraceCheckUtils]: 19: Hoare triple {772#false} ~i~0 := 0; {772#false} is VALID [2018-11-18 23:57:57,781 INFO L273 TraceCheckUtils]: 20: Hoare triple {772#false} assume true; {772#false} is VALID [2018-11-18 23:57:57,781 INFO L273 TraceCheckUtils]: 21: Hoare triple {772#false} assume !(~i~0 < ~edgecount~0); {772#false} is VALID [2018-11-18 23:57:57,781 INFO L273 TraceCheckUtils]: 22: Hoare triple {772#false} ~i~0 := 0; {772#false} is VALID [2018-11-18 23:57:57,782 INFO L273 TraceCheckUtils]: 23: Hoare triple {772#false} assume true; {772#false} is VALID [2018-11-18 23:57:57,782 INFO L273 TraceCheckUtils]: 24: Hoare triple {772#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {772#false} is VALID [2018-11-18 23:57:57,782 INFO L256 TraceCheckUtils]: 25: Hoare triple {772#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {772#false} is VALID [2018-11-18 23:57:57,783 INFO L273 TraceCheckUtils]: 26: Hoare triple {772#false} ~cond := #in~cond; {772#false} is VALID [2018-11-18 23:57:57,783 INFO L273 TraceCheckUtils]: 27: Hoare triple {772#false} assume 0 == ~cond; {772#false} is VALID [2018-11-18 23:57:57,783 INFO L273 TraceCheckUtils]: 28: Hoare triple {772#false} assume !false; {772#false} is VALID [2018-11-18 23:57:57,786 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:57:57,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:57:57,786 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:57:57,806 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:57:57,839 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 23:57:57,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:57:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:57:57,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:57:58,158 INFO L256 TraceCheckUtils]: 0: Hoare triple {771#true} call ULTIMATE.init(); {771#true} is VALID [2018-11-18 23:57:58,159 INFO L273 TraceCheckUtils]: 1: Hoare triple {771#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {771#true} is VALID [2018-11-18 23:57:58,159 INFO L273 TraceCheckUtils]: 2: Hoare triple {771#true} assume true; {771#true} is VALID [2018-11-18 23:57:58,159 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {771#true} {771#true} #108#return; {771#true} is VALID [2018-11-18 23:57:58,160 INFO L256 TraceCheckUtils]: 4: Hoare triple {771#true} call #t~ret18 := main(); {771#true} is VALID [2018-11-18 23:57:58,174 INFO L273 TraceCheckUtils]: 5: Hoare triple {771#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {795#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:57:58,179 INFO L273 TraceCheckUtils]: 6: Hoare triple {795#(<= 5 main_~nodecount~0)} assume true; {795#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:57:58,180 INFO L273 TraceCheckUtils]: 7: Hoare triple {795#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {795#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:57:58,181 INFO L273 TraceCheckUtils]: 8: Hoare triple {795#(<= 5 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {795#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:57:58,182 INFO L273 TraceCheckUtils]: 9: Hoare triple {795#(<= 5 main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {795#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:57:58,186 INFO L273 TraceCheckUtils]: 10: Hoare triple {795#(<= 5 main_~nodecount~0)} assume true; {795#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:57:58,186 INFO L273 TraceCheckUtils]: 11: Hoare triple {795#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {795#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:57:58,187 INFO L273 TraceCheckUtils]: 12: Hoare triple {795#(<= 5 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {795#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:57:58,188 INFO L273 TraceCheckUtils]: 13: Hoare triple {795#(<= 5 main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {795#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:57:58,188 INFO L273 TraceCheckUtils]: 14: Hoare triple {795#(<= 5 main_~nodecount~0)} assume true; {795#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:57:58,191 INFO L273 TraceCheckUtils]: 15: Hoare triple {795#(<= 5 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {795#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:57:58,191 INFO L273 TraceCheckUtils]: 16: Hoare triple {795#(<= 5 main_~nodecount~0)} ~i~0 := 0; {829#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-18 23:57:58,192 INFO L273 TraceCheckUtils]: 17: Hoare triple {829#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} assume true; {829#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-18 23:57:58,192 INFO L273 TraceCheckUtils]: 18: Hoare triple {829#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} assume !(~i~0 < ~nodecount~0); {772#false} is VALID [2018-11-18 23:57:58,193 INFO L273 TraceCheckUtils]: 19: Hoare triple {772#false} ~i~0 := 0; {772#false} is VALID [2018-11-18 23:57:58,193 INFO L273 TraceCheckUtils]: 20: Hoare triple {772#false} assume true; {772#false} is VALID [2018-11-18 23:57:58,193 INFO L273 TraceCheckUtils]: 21: Hoare triple {772#false} assume !(~i~0 < ~edgecount~0); {772#false} is VALID [2018-11-18 23:57:58,193 INFO L273 TraceCheckUtils]: 22: Hoare triple {772#false} ~i~0 := 0; {772#false} is VALID [2018-11-18 23:57:58,193 INFO L273 TraceCheckUtils]: 23: Hoare triple {772#false} assume true; {772#false} is VALID [2018-11-18 23:57:58,194 INFO L273 TraceCheckUtils]: 24: Hoare triple {772#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {772#false} is VALID [2018-11-18 23:57:58,194 INFO L256 TraceCheckUtils]: 25: Hoare triple {772#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {772#false} is VALID [2018-11-18 23:57:58,194 INFO L273 TraceCheckUtils]: 26: Hoare triple {772#false} ~cond := #in~cond; {772#false} is VALID [2018-11-18 23:57:58,194 INFO L273 TraceCheckUtils]: 27: Hoare triple {772#false} assume 0 == ~cond; {772#false} is VALID [2018-11-18 23:57:58,195 INFO L273 TraceCheckUtils]: 28: Hoare triple {772#false} assume !false; {772#false} is VALID [2018-11-18 23:57:58,199 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 23:57:58,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:57:58,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-11-18 23:57:58,222 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-18 23:57:58,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:57:58,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 23:57:58,268 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:57:58,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 23:57:58,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 23:57:58,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-18 23:57:58,269 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 8 states. [2018-11-18 23:57:59,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:59,181 INFO L93 Difference]: Finished difference Result 112 states and 137 transitions. [2018-11-18 23:57:59,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 23:57:59,181 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-18 23:57:59,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:57:59,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 23:57:59,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2018-11-18 23:57:59,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 23:57:59,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2018-11-18 23:57:59,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 131 transitions. [2018-11-18 23:57:59,372 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:57:59,375 INFO L225 Difference]: With dead ends: 112 [2018-11-18 23:57:59,375 INFO L226 Difference]: Without dead ends: 80 [2018-11-18 23:57:59,376 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-11-18 23:57:59,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-18 23:57:59,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 50. [2018-11-18 23:57:59,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:57:59,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 50 states. [2018-11-18 23:57:59,445 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 50 states. [2018-11-18 23:57:59,445 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 50 states. [2018-11-18 23:57:59,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:59,451 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2018-11-18 23:57:59,451 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2018-11-18 23:57:59,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:57:59,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:57:59,453 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 80 states. [2018-11-18 23:57:59,453 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 80 states. [2018-11-18 23:57:59,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:59,458 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2018-11-18 23:57:59,458 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2018-11-18 23:57:59,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:57:59,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:57:59,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:57:59,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:57:59,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-18 23:57:59,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2018-11-18 23:57:59,462 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 29 [2018-11-18 23:57:59,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:57:59,463 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2018-11-18 23:57:59,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 23:57:59,463 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2018-11-18 23:57:59,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 23:57:59,464 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:57:59,464 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:57:59,465 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:57:59,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:57:59,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1263413224, now seen corresponding path program 1 times [2018-11-18 23:57:59,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:57:59,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:57:59,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:57:59,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:57:59,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:57:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:57:59,658 INFO L256 TraceCheckUtils]: 0: Hoare triple {1239#true} call ULTIMATE.init(); {1239#true} is VALID [2018-11-18 23:57:59,658 INFO L273 TraceCheckUtils]: 1: Hoare triple {1239#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {1239#true} is VALID [2018-11-18 23:57:59,658 INFO L273 TraceCheckUtils]: 2: Hoare triple {1239#true} assume true; {1239#true} is VALID [2018-11-18 23:57:59,659 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1239#true} {1239#true} #108#return; {1239#true} is VALID [2018-11-18 23:57:59,659 INFO L256 TraceCheckUtils]: 4: Hoare triple {1239#true} call #t~ret18 := main(); {1239#true} is VALID [2018-11-18 23:57:59,661 INFO L273 TraceCheckUtils]: 5: Hoare triple {1239#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1241#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:57:59,662 INFO L273 TraceCheckUtils]: 6: Hoare triple {1241#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume true; {1241#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:57:59,663 INFO L273 TraceCheckUtils]: 7: Hoare triple {1241#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {1241#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:57:59,664 INFO L273 TraceCheckUtils]: 8: Hoare triple {1241#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1241#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:57:59,665 INFO L273 TraceCheckUtils]: 9: Hoare triple {1241#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1242#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-18 23:57:59,665 INFO L273 TraceCheckUtils]: 10: Hoare triple {1242#(<= (+ main_~i~0 4) main_~nodecount~0)} assume true; {1242#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-18 23:57:59,666 INFO L273 TraceCheckUtils]: 11: Hoare triple {1242#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {1242#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-18 23:57:59,667 INFO L273 TraceCheckUtils]: 12: Hoare triple {1242#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1242#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-18 23:57:59,668 INFO L273 TraceCheckUtils]: 13: Hoare triple {1242#(<= (+ main_~i~0 4) main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1243#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-18 23:57:59,669 INFO L273 TraceCheckUtils]: 14: Hoare triple {1243#(<= (+ main_~i~0 3) main_~nodecount~0)} assume true; {1243#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-18 23:57:59,670 INFO L273 TraceCheckUtils]: 15: Hoare triple {1243#(<= (+ main_~i~0 3) main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {1240#false} is VALID [2018-11-18 23:57:59,670 INFO L273 TraceCheckUtils]: 16: Hoare triple {1240#false} ~i~0 := 0; {1240#false} is VALID [2018-11-18 23:57:59,670 INFO L273 TraceCheckUtils]: 17: Hoare triple {1240#false} assume true; {1240#false} is VALID [2018-11-18 23:57:59,671 INFO L273 TraceCheckUtils]: 18: Hoare triple {1240#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1240#false} is VALID [2018-11-18 23:57:59,671 INFO L273 TraceCheckUtils]: 19: Hoare triple {1240#false} assume true; {1240#false} is VALID [2018-11-18 23:57:59,671 INFO L273 TraceCheckUtils]: 20: Hoare triple {1240#false} assume !(~j~0 < ~edgecount~0); {1240#false} is VALID [2018-11-18 23:57:59,672 INFO L273 TraceCheckUtils]: 21: Hoare triple {1240#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1240#false} is VALID [2018-11-18 23:57:59,672 INFO L273 TraceCheckUtils]: 22: Hoare triple {1240#false} assume true; {1240#false} is VALID [2018-11-18 23:57:59,672 INFO L273 TraceCheckUtils]: 23: Hoare triple {1240#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1240#false} is VALID [2018-11-18 23:57:59,673 INFO L273 TraceCheckUtils]: 24: Hoare triple {1240#false} assume true; {1240#false} is VALID [2018-11-18 23:57:59,673 INFO L273 TraceCheckUtils]: 25: Hoare triple {1240#false} assume !(~j~0 < ~edgecount~0); {1240#false} is VALID [2018-11-18 23:57:59,673 INFO L273 TraceCheckUtils]: 26: Hoare triple {1240#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1240#false} is VALID [2018-11-18 23:57:59,674 INFO L273 TraceCheckUtils]: 27: Hoare triple {1240#false} assume true; {1240#false} is VALID [2018-11-18 23:57:59,674 INFO L273 TraceCheckUtils]: 28: Hoare triple {1240#false} assume !(~i~0 < ~nodecount~0); {1240#false} is VALID [2018-11-18 23:57:59,674 INFO L273 TraceCheckUtils]: 29: Hoare triple {1240#false} ~i~0 := 0; {1240#false} is VALID [2018-11-18 23:57:59,675 INFO L273 TraceCheckUtils]: 30: Hoare triple {1240#false} assume true; {1240#false} is VALID [2018-11-18 23:57:59,675 INFO L273 TraceCheckUtils]: 31: Hoare triple {1240#false} assume !(~i~0 < ~edgecount~0); {1240#false} is VALID [2018-11-18 23:57:59,675 INFO L273 TraceCheckUtils]: 32: Hoare triple {1240#false} ~i~0 := 0; {1240#false} is VALID [2018-11-18 23:57:59,675 INFO L273 TraceCheckUtils]: 33: Hoare triple {1240#false} assume true; {1240#false} is VALID [2018-11-18 23:57:59,675 INFO L273 TraceCheckUtils]: 34: Hoare triple {1240#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1240#false} is VALID [2018-11-18 23:57:59,676 INFO L256 TraceCheckUtils]: 35: Hoare triple {1240#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {1240#false} is VALID [2018-11-18 23:57:59,676 INFO L273 TraceCheckUtils]: 36: Hoare triple {1240#false} ~cond := #in~cond; {1240#false} is VALID [2018-11-18 23:57:59,676 INFO L273 TraceCheckUtils]: 37: Hoare triple {1240#false} assume 0 == ~cond; {1240#false} is VALID [2018-11-18 23:57:59,676 INFO L273 TraceCheckUtils]: 38: Hoare triple {1240#false} assume !false; {1240#false} is VALID [2018-11-18 23:57:59,679 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 23:57:59,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:57:59,680 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:57:59,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:57:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:57:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:57:59,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:57:59,875 INFO L256 TraceCheckUtils]: 0: Hoare triple {1239#true} call ULTIMATE.init(); {1239#true} is VALID [2018-11-18 23:57:59,876 INFO L273 TraceCheckUtils]: 1: Hoare triple {1239#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {1239#true} is VALID [2018-11-18 23:57:59,876 INFO L273 TraceCheckUtils]: 2: Hoare triple {1239#true} assume true; {1239#true} is VALID [2018-11-18 23:57:59,876 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1239#true} {1239#true} #108#return; {1239#true} is VALID [2018-11-18 23:57:59,877 INFO L256 TraceCheckUtils]: 4: Hoare triple {1239#true} call #t~ret18 := main(); {1239#true} is VALID [2018-11-18 23:57:59,879 INFO L273 TraceCheckUtils]: 5: Hoare triple {1239#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1262#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-18 23:57:59,880 INFO L273 TraceCheckUtils]: 6: Hoare triple {1262#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} assume true; {1262#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-18 23:57:59,881 INFO L273 TraceCheckUtils]: 7: Hoare triple {1262#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {1262#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-18 23:57:59,882 INFO L273 TraceCheckUtils]: 8: Hoare triple {1262#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1262#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-18 23:57:59,883 INFO L273 TraceCheckUtils]: 9: Hoare triple {1262#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1275#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} is VALID [2018-11-18 23:57:59,884 INFO L273 TraceCheckUtils]: 10: Hoare triple {1275#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} assume true; {1275#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} is VALID [2018-11-18 23:57:59,885 INFO L273 TraceCheckUtils]: 11: Hoare triple {1275#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} assume !!(~i~0 < ~nodecount~0); {1275#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} is VALID [2018-11-18 23:57:59,886 INFO L273 TraceCheckUtils]: 12: Hoare triple {1275#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1275#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} is VALID [2018-11-18 23:57:59,887 INFO L273 TraceCheckUtils]: 13: Hoare triple {1275#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1288#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2018-11-18 23:57:59,888 INFO L273 TraceCheckUtils]: 14: Hoare triple {1288#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume true; {1288#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2018-11-18 23:57:59,889 INFO L273 TraceCheckUtils]: 15: Hoare triple {1288#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !(~i~0 < ~nodecount~0); {1240#false} is VALID [2018-11-18 23:57:59,889 INFO L273 TraceCheckUtils]: 16: Hoare triple {1240#false} ~i~0 := 0; {1240#false} is VALID [2018-11-18 23:57:59,890 INFO L273 TraceCheckUtils]: 17: Hoare triple {1240#false} assume true; {1240#false} is VALID [2018-11-18 23:57:59,890 INFO L273 TraceCheckUtils]: 18: Hoare triple {1240#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1240#false} is VALID [2018-11-18 23:57:59,891 INFO L273 TraceCheckUtils]: 19: Hoare triple {1240#false} assume true; {1240#false} is VALID [2018-11-18 23:57:59,891 INFO L273 TraceCheckUtils]: 20: Hoare triple {1240#false} assume !(~j~0 < ~edgecount~0); {1240#false} is VALID [2018-11-18 23:57:59,892 INFO L273 TraceCheckUtils]: 21: Hoare triple {1240#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1240#false} is VALID [2018-11-18 23:57:59,892 INFO L273 TraceCheckUtils]: 22: Hoare triple {1240#false} assume true; {1240#false} is VALID [2018-11-18 23:57:59,892 INFO L273 TraceCheckUtils]: 23: Hoare triple {1240#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1240#false} is VALID [2018-11-18 23:57:59,892 INFO L273 TraceCheckUtils]: 24: Hoare triple {1240#false} assume true; {1240#false} is VALID [2018-11-18 23:57:59,893 INFO L273 TraceCheckUtils]: 25: Hoare triple {1240#false} assume !(~j~0 < ~edgecount~0); {1240#false} is VALID [2018-11-18 23:57:59,893 INFO L273 TraceCheckUtils]: 26: Hoare triple {1240#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1240#false} is VALID [2018-11-18 23:57:59,893 INFO L273 TraceCheckUtils]: 27: Hoare triple {1240#false} assume true; {1240#false} is VALID [2018-11-18 23:57:59,893 INFO L273 TraceCheckUtils]: 28: Hoare triple {1240#false} assume !(~i~0 < ~nodecount~0); {1240#false} is VALID [2018-11-18 23:57:59,894 INFO L273 TraceCheckUtils]: 29: Hoare triple {1240#false} ~i~0 := 0; {1240#false} is VALID [2018-11-18 23:57:59,894 INFO L273 TraceCheckUtils]: 30: Hoare triple {1240#false} assume true; {1240#false} is VALID [2018-11-18 23:57:59,894 INFO L273 TraceCheckUtils]: 31: Hoare triple {1240#false} assume !(~i~0 < ~edgecount~0); {1240#false} is VALID [2018-11-18 23:57:59,895 INFO L273 TraceCheckUtils]: 32: Hoare triple {1240#false} ~i~0 := 0; {1240#false} is VALID [2018-11-18 23:57:59,895 INFO L273 TraceCheckUtils]: 33: Hoare triple {1240#false} assume true; {1240#false} is VALID [2018-11-18 23:57:59,895 INFO L273 TraceCheckUtils]: 34: Hoare triple {1240#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1240#false} is VALID [2018-11-18 23:57:59,895 INFO L256 TraceCheckUtils]: 35: Hoare triple {1240#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {1240#false} is VALID [2018-11-18 23:57:59,896 INFO L273 TraceCheckUtils]: 36: Hoare triple {1240#false} ~cond := #in~cond; {1240#false} is VALID [2018-11-18 23:57:59,896 INFO L273 TraceCheckUtils]: 37: Hoare triple {1240#false} assume 0 == ~cond; {1240#false} is VALID [2018-11-18 23:57:59,896 INFO L273 TraceCheckUtils]: 38: Hoare triple {1240#false} assume !false; {1240#false} is VALID [2018-11-18 23:57:59,899 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 23:57:59,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:57:59,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-18 23:57:59,920 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-11-18 23:57:59,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:57:59,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 23:57:59,974 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:57:59,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 23:57:59,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 23:57:59,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-11-18 23:57:59,975 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand 8 states. [2018-11-18 23:58:00,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:00,275 INFO L93 Difference]: Finished difference Result 97 states and 114 transitions. [2018-11-18 23:58:00,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 23:58:00,276 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-11-18 23:58:00,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:58:00,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 23:58:00,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2018-11-18 23:58:00,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 23:58:00,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2018-11-18 23:58:00,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 85 transitions. [2018-11-18 23:58:00,522 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:00,525 INFO L225 Difference]: With dead ends: 97 [2018-11-18 23:58:00,525 INFO L226 Difference]: Without dead ends: 63 [2018-11-18 23:58:00,526 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-11-18 23:58:00,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-18 23:58:00,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2018-11-18 23:58:00,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:58:00,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 54 states. [2018-11-18 23:58:00,575 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 54 states. [2018-11-18 23:58:00,575 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 54 states. [2018-11-18 23:58:00,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:00,579 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2018-11-18 23:58:00,580 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2018-11-18 23:58:00,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:00,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:00,580 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 63 states. [2018-11-18 23:58:00,581 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 63 states. [2018-11-18 23:58:00,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:00,584 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2018-11-18 23:58:00,584 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2018-11-18 23:58:00,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:00,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:00,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:58:00,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:58:00,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-18 23:58:00,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-11-18 23:58:00,587 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 39 [2018-11-18 23:58:00,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:58:00,588 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-11-18 23:58:00,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 23:58:00,588 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-11-18 23:58:00,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 23:58:00,589 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:58:00,589 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:58:00,590 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:58:00,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:58:00,590 INFO L82 PathProgramCache]: Analyzing trace with hash -2099666001, now seen corresponding path program 2 times [2018-11-18 23:58:00,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:58:00,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:58:00,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:00,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:58:00,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:00,871 INFO L256 TraceCheckUtils]: 0: Hoare triple {1685#true} call ULTIMATE.init(); {1685#true} is VALID [2018-11-18 23:58:00,872 INFO L273 TraceCheckUtils]: 1: Hoare triple {1685#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {1685#true} is VALID [2018-11-18 23:58:00,872 INFO L273 TraceCheckUtils]: 2: Hoare triple {1685#true} assume true; {1685#true} is VALID [2018-11-18 23:58:00,872 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1685#true} {1685#true} #108#return; {1685#true} is VALID [2018-11-18 23:58:00,872 INFO L256 TraceCheckUtils]: 4: Hoare triple {1685#true} call #t~ret18 := main(); {1685#true} is VALID [2018-11-18 23:58:00,875 INFO L273 TraceCheckUtils]: 5: Hoare triple {1685#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1687#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-18 23:58:00,876 INFO L273 TraceCheckUtils]: 6: Hoare triple {1687#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} assume true; {1687#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-18 23:58:00,877 INFO L273 TraceCheckUtils]: 7: Hoare triple {1687#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0); {1687#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-18 23:58:00,878 INFO L273 TraceCheckUtils]: 8: Hoare triple {1687#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1687#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-18 23:58:00,879 INFO L273 TraceCheckUtils]: 9: Hoare triple {1687#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1688#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} is VALID [2018-11-18 23:58:00,886 INFO L273 TraceCheckUtils]: 10: Hoare triple {1688#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} assume true; {1688#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} is VALID [2018-11-18 23:58:00,887 INFO L273 TraceCheckUtils]: 11: Hoare triple {1688#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} assume !!(~i~0 < ~nodecount~0); {1688#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} is VALID [2018-11-18 23:58:00,888 INFO L273 TraceCheckUtils]: 12: Hoare triple {1688#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1689#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:58:00,888 INFO L273 TraceCheckUtils]: 13: Hoare triple {1689#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1690#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-18 23:58:00,889 INFO L273 TraceCheckUtils]: 14: Hoare triple {1690#(<= (+ main_~i~0 4) main_~nodecount~0)} assume true; {1690#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-18 23:58:00,889 INFO L273 TraceCheckUtils]: 15: Hoare triple {1690#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {1690#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-18 23:58:00,890 INFO L273 TraceCheckUtils]: 16: Hoare triple {1690#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1690#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-18 23:58:00,891 INFO L273 TraceCheckUtils]: 17: Hoare triple {1690#(<= (+ main_~i~0 4) main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1691#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-18 23:58:00,892 INFO L273 TraceCheckUtils]: 18: Hoare triple {1691#(<= (+ main_~i~0 3) main_~nodecount~0)} assume true; {1691#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-18 23:58:00,893 INFO L273 TraceCheckUtils]: 19: Hoare triple {1691#(<= (+ main_~i~0 3) main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {1686#false} is VALID [2018-11-18 23:58:00,893 INFO L273 TraceCheckUtils]: 20: Hoare triple {1686#false} ~i~0 := 0; {1686#false} is VALID [2018-11-18 23:58:00,893 INFO L273 TraceCheckUtils]: 21: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-18 23:58:00,894 INFO L273 TraceCheckUtils]: 22: Hoare triple {1686#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1686#false} is VALID [2018-11-18 23:58:00,894 INFO L273 TraceCheckUtils]: 23: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-18 23:58:00,894 INFO L273 TraceCheckUtils]: 24: Hoare triple {1686#false} assume !(~j~0 < ~edgecount~0); {1686#false} is VALID [2018-11-18 23:58:00,894 INFO L273 TraceCheckUtils]: 25: Hoare triple {1686#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1686#false} is VALID [2018-11-18 23:58:00,895 INFO L273 TraceCheckUtils]: 26: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-18 23:58:00,895 INFO L273 TraceCheckUtils]: 27: Hoare triple {1686#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1686#false} is VALID [2018-11-18 23:58:00,895 INFO L273 TraceCheckUtils]: 28: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-18 23:58:00,895 INFO L273 TraceCheckUtils]: 29: Hoare triple {1686#false} assume !(~j~0 < ~edgecount~0); {1686#false} is VALID [2018-11-18 23:58:00,896 INFO L273 TraceCheckUtils]: 30: Hoare triple {1686#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1686#false} is VALID [2018-11-18 23:58:00,896 INFO L273 TraceCheckUtils]: 31: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-18 23:58:00,896 INFO L273 TraceCheckUtils]: 32: Hoare triple {1686#false} assume !(~i~0 < ~nodecount~0); {1686#false} is VALID [2018-11-18 23:58:00,897 INFO L273 TraceCheckUtils]: 33: Hoare triple {1686#false} ~i~0 := 0; {1686#false} is VALID [2018-11-18 23:58:00,897 INFO L273 TraceCheckUtils]: 34: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-18 23:58:00,897 INFO L273 TraceCheckUtils]: 35: Hoare triple {1686#false} assume !(~i~0 < ~edgecount~0); {1686#false} is VALID [2018-11-18 23:58:00,897 INFO L273 TraceCheckUtils]: 36: Hoare triple {1686#false} ~i~0 := 0; {1686#false} is VALID [2018-11-18 23:58:00,898 INFO L273 TraceCheckUtils]: 37: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-18 23:58:00,898 INFO L273 TraceCheckUtils]: 38: Hoare triple {1686#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1686#false} is VALID [2018-11-18 23:58:00,898 INFO L256 TraceCheckUtils]: 39: Hoare triple {1686#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {1686#false} is VALID [2018-11-18 23:58:00,898 INFO L273 TraceCheckUtils]: 40: Hoare triple {1686#false} ~cond := #in~cond; {1686#false} is VALID [2018-11-18 23:58:00,899 INFO L273 TraceCheckUtils]: 41: Hoare triple {1686#false} assume 0 == ~cond; {1686#false} is VALID [2018-11-18 23:58:00,899 INFO L273 TraceCheckUtils]: 42: Hoare triple {1686#false} assume !false; {1686#false} is VALID [2018-11-18 23:58:00,903 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 23:58:00,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:58:00,903 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:58:00,924 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:58:00,952 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 23:58:00,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:58:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:00,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:58:01,159 INFO L256 TraceCheckUtils]: 0: Hoare triple {1685#true} call ULTIMATE.init(); {1685#true} is VALID [2018-11-18 23:58:01,160 INFO L273 TraceCheckUtils]: 1: Hoare triple {1685#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {1685#true} is VALID [2018-11-18 23:58:01,160 INFO L273 TraceCheckUtils]: 2: Hoare triple {1685#true} assume true; {1685#true} is VALID [2018-11-18 23:58:01,160 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1685#true} {1685#true} #108#return; {1685#true} is VALID [2018-11-18 23:58:01,161 INFO L256 TraceCheckUtils]: 4: Hoare triple {1685#true} call #t~ret18 := main(); {1685#true} is VALID [2018-11-18 23:58:01,163 INFO L273 TraceCheckUtils]: 5: Hoare triple {1685#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:01,163 INFO L273 TraceCheckUtils]: 6: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume true; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:01,164 INFO L273 TraceCheckUtils]: 7: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:01,164 INFO L273 TraceCheckUtils]: 8: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:01,165 INFO L273 TraceCheckUtils]: 9: Hoare triple {1710#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:01,166 INFO L273 TraceCheckUtils]: 10: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume true; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:01,166 INFO L273 TraceCheckUtils]: 11: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:01,167 INFO L273 TraceCheckUtils]: 12: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:01,168 INFO L273 TraceCheckUtils]: 13: Hoare triple {1710#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:01,168 INFO L273 TraceCheckUtils]: 14: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume true; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:01,169 INFO L273 TraceCheckUtils]: 15: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:01,170 INFO L273 TraceCheckUtils]: 16: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:01,171 INFO L273 TraceCheckUtils]: 17: Hoare triple {1710#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:01,171 INFO L273 TraceCheckUtils]: 18: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume true; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:01,172 INFO L273 TraceCheckUtils]: 19: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:01,173 INFO L273 TraceCheckUtils]: 20: Hoare triple {1710#(<= 20 main_~edgecount~0)} ~i~0 := 0; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:01,173 INFO L273 TraceCheckUtils]: 21: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume true; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:01,174 INFO L273 TraceCheckUtils]: 22: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:01,175 INFO L273 TraceCheckUtils]: 23: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume true; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:01,175 INFO L273 TraceCheckUtils]: 24: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:01,176 INFO L273 TraceCheckUtils]: 25: Hoare triple {1710#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:01,178 INFO L273 TraceCheckUtils]: 26: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume true; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:01,180 INFO L273 TraceCheckUtils]: 27: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:01,181 INFO L273 TraceCheckUtils]: 28: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume true; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:01,182 INFO L273 TraceCheckUtils]: 29: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:01,182 INFO L273 TraceCheckUtils]: 30: Hoare triple {1710#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:01,183 INFO L273 TraceCheckUtils]: 31: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume true; {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:01,184 INFO L273 TraceCheckUtils]: 32: Hoare triple {1710#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {1710#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:01,185 INFO L273 TraceCheckUtils]: 33: Hoare triple {1710#(<= 20 main_~edgecount~0)} ~i~0 := 0; {1795#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-18 23:58:01,186 INFO L273 TraceCheckUtils]: 34: Hoare triple {1795#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} assume true; {1795#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-18 23:58:01,186 INFO L273 TraceCheckUtils]: 35: Hoare triple {1795#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} assume !(~i~0 < ~edgecount~0); {1686#false} is VALID [2018-11-18 23:58:01,187 INFO L273 TraceCheckUtils]: 36: Hoare triple {1686#false} ~i~0 := 0; {1686#false} is VALID [2018-11-18 23:58:01,187 INFO L273 TraceCheckUtils]: 37: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-18 23:58:01,187 INFO L273 TraceCheckUtils]: 38: Hoare triple {1686#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1686#false} is VALID [2018-11-18 23:58:01,188 INFO L256 TraceCheckUtils]: 39: Hoare triple {1686#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {1686#false} is VALID [2018-11-18 23:58:01,188 INFO L273 TraceCheckUtils]: 40: Hoare triple {1686#false} ~cond := #in~cond; {1686#false} is VALID [2018-11-18 23:58:01,189 INFO L273 TraceCheckUtils]: 41: Hoare triple {1686#false} assume 0 == ~cond; {1686#false} is VALID [2018-11-18 23:58:01,189 INFO L273 TraceCheckUtils]: 42: Hoare triple {1686#false} assume !false; {1686#false} is VALID [2018-11-18 23:58:01,192 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-18 23:58:01,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:58:01,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-18 23:58:01,211 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-11-18 23:58:01,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:58:01,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 23:58:01,312 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:01,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 23:58:01,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 23:58:01,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 23:58:01,313 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 9 states. [2018-11-18 23:58:02,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:02,868 INFO L93 Difference]: Finished difference Result 138 states and 167 transitions. [2018-11-18 23:58:02,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 23:58:02,869 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-11-18 23:58:02,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:58:02,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 23:58:02,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2018-11-18 23:58:02,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 23:58:02,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2018-11-18 23:58:02,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 148 transitions. [2018-11-18 23:58:03,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:03,052 INFO L225 Difference]: With dead ends: 138 [2018-11-18 23:58:03,052 INFO L226 Difference]: Without dead ends: 104 [2018-11-18 23:58:03,053 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-18 23:58:03,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-18 23:58:03,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 63. [2018-11-18 23:58:03,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:58:03,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 63 states. [2018-11-18 23:58:03,120 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 63 states. [2018-11-18 23:58:03,120 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 63 states. [2018-11-18 23:58:03,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:03,124 INFO L93 Difference]: Finished difference Result 104 states and 124 transitions. [2018-11-18 23:58:03,124 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 124 transitions. [2018-11-18 23:58:03,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:03,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:03,125 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 104 states. [2018-11-18 23:58:03,125 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 104 states. [2018-11-18 23:58:03,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:03,129 INFO L93 Difference]: Finished difference Result 104 states and 124 transitions. [2018-11-18 23:58:03,130 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 124 transitions. [2018-11-18 23:58:03,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:03,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:03,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:58:03,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:58:03,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-18 23:58:03,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2018-11-18 23:58:03,133 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 43 [2018-11-18 23:58:03,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:58:03,133 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2018-11-18 23:58:03,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 23:58:03,134 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2018-11-18 23:58:03,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 23:58:03,135 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:58:03,135 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:58:03,135 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:58:03,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:58:03,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1052406892, now seen corresponding path program 1 times [2018-11-18 23:58:03,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:58:03,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:58:03,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:03,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:58:03,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:03,850 INFO L256 TraceCheckUtils]: 0: Hoare triple {2299#true} call ULTIMATE.init(); {2299#true} is VALID [2018-11-18 23:58:03,851 INFO L273 TraceCheckUtils]: 1: Hoare triple {2299#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {2299#true} is VALID [2018-11-18 23:58:03,851 INFO L273 TraceCheckUtils]: 2: Hoare triple {2299#true} assume true; {2299#true} is VALID [2018-11-18 23:58:03,851 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2299#true} {2299#true} #108#return; {2299#true} is VALID [2018-11-18 23:58:03,851 INFO L256 TraceCheckUtils]: 4: Hoare triple {2299#true} call #t~ret18 := main(); {2299#true} is VALID [2018-11-18 23:58:03,853 INFO L273 TraceCheckUtils]: 5: Hoare triple {2299#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2301#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:58:03,854 INFO L273 TraceCheckUtils]: 6: Hoare triple {2301#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume true; {2301#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:58:03,855 INFO L273 TraceCheckUtils]: 7: Hoare triple {2301#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {2301#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:58:03,856 INFO L273 TraceCheckUtils]: 8: Hoare triple {2301#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2301#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:58:03,857 INFO L273 TraceCheckUtils]: 9: Hoare triple {2301#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2302#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-18 23:58:03,857 INFO L273 TraceCheckUtils]: 10: Hoare triple {2302#(<= (+ main_~i~0 4) main_~nodecount~0)} assume true; {2302#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-18 23:58:03,858 INFO L273 TraceCheckUtils]: 11: Hoare triple {2302#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2302#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-18 23:58:03,858 INFO L273 TraceCheckUtils]: 12: Hoare triple {2302#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2302#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-18 23:58:03,859 INFO L273 TraceCheckUtils]: 13: Hoare triple {2302#(<= (+ main_~i~0 4) main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2303#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-18 23:58:03,860 INFO L273 TraceCheckUtils]: 14: Hoare triple {2303#(<= (+ main_~i~0 3) main_~nodecount~0)} assume true; {2303#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-18 23:58:03,861 INFO L273 TraceCheckUtils]: 15: Hoare triple {2303#(<= (+ main_~i~0 3) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2303#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-18 23:58:03,861 INFO L273 TraceCheckUtils]: 16: Hoare triple {2303#(<= (+ 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); {2303#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-18 23:58:03,862 INFO L273 TraceCheckUtils]: 17: Hoare triple {2303#(<= (+ main_~i~0 3) main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2304#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-18 23:58:03,863 INFO L273 TraceCheckUtils]: 18: Hoare triple {2304#(<= (+ main_~i~0 2) main_~nodecount~0)} assume true; {2304#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-18 23:58:03,864 INFO L273 TraceCheckUtils]: 19: Hoare triple {2304#(<= (+ main_~i~0 2) main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {2300#false} is VALID [2018-11-18 23:58:03,864 INFO L273 TraceCheckUtils]: 20: Hoare triple {2300#false} ~i~0 := 0; {2300#false} is VALID [2018-11-18 23:58:03,865 INFO L273 TraceCheckUtils]: 21: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-18 23:58:03,865 INFO L273 TraceCheckUtils]: 22: Hoare triple {2300#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2300#false} is VALID [2018-11-18 23:58:03,865 INFO L273 TraceCheckUtils]: 23: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-18 23:58:03,865 INFO L273 TraceCheckUtils]: 24: Hoare triple {2300#false} assume !(~j~0 < ~edgecount~0); {2300#false} is VALID [2018-11-18 23:58:03,866 INFO L273 TraceCheckUtils]: 25: Hoare triple {2300#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2300#false} is VALID [2018-11-18 23:58:03,866 INFO L273 TraceCheckUtils]: 26: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-18 23:58:03,866 INFO L273 TraceCheckUtils]: 27: Hoare triple {2300#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2300#false} is VALID [2018-11-18 23:58:03,867 INFO L273 TraceCheckUtils]: 28: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-18 23:58:03,867 INFO L273 TraceCheckUtils]: 29: Hoare triple {2300#false} assume !(~j~0 < ~edgecount~0); {2300#false} is VALID [2018-11-18 23:58:03,867 INFO L273 TraceCheckUtils]: 30: Hoare triple {2300#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2300#false} is VALID [2018-11-18 23:58:03,867 INFO L273 TraceCheckUtils]: 31: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-18 23:58:03,868 INFO L273 TraceCheckUtils]: 32: Hoare triple {2300#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2300#false} is VALID [2018-11-18 23:58:03,868 INFO L273 TraceCheckUtils]: 33: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-18 23:58:03,869 INFO L273 TraceCheckUtils]: 34: Hoare triple {2300#false} assume !(~j~0 < ~edgecount~0); {2300#false} is VALID [2018-11-18 23:58:03,869 INFO L273 TraceCheckUtils]: 35: Hoare triple {2300#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2300#false} is VALID [2018-11-18 23:58:03,869 INFO L273 TraceCheckUtils]: 36: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-18 23:58:03,869 INFO L273 TraceCheckUtils]: 37: Hoare triple {2300#false} assume !(~i~0 < ~nodecount~0); {2300#false} is VALID [2018-11-18 23:58:03,870 INFO L273 TraceCheckUtils]: 38: Hoare triple {2300#false} ~i~0 := 0; {2300#false} is VALID [2018-11-18 23:58:03,870 INFO L273 TraceCheckUtils]: 39: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-18 23:58:03,870 INFO L273 TraceCheckUtils]: 40: Hoare triple {2300#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {2300#false} is VALID [2018-11-18 23:58:03,870 INFO L273 TraceCheckUtils]: 41: Hoare triple {2300#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {2300#false} is VALID [2018-11-18 23:58:03,871 INFO L273 TraceCheckUtils]: 42: Hoare triple {2300#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2300#false} is VALID [2018-11-18 23:58:03,871 INFO L273 TraceCheckUtils]: 43: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-18 23:58:03,871 INFO L273 TraceCheckUtils]: 44: Hoare triple {2300#false} assume !(~i~0 < ~edgecount~0); {2300#false} is VALID [2018-11-18 23:58:03,871 INFO L273 TraceCheckUtils]: 45: Hoare triple {2300#false} ~i~0 := 0; {2300#false} is VALID [2018-11-18 23:58:03,871 INFO L273 TraceCheckUtils]: 46: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-18 23:58:03,872 INFO L273 TraceCheckUtils]: 47: Hoare triple {2300#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2300#false} is VALID [2018-11-18 23:58:03,872 INFO L256 TraceCheckUtils]: 48: Hoare triple {2300#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {2300#false} is VALID [2018-11-18 23:58:03,872 INFO L273 TraceCheckUtils]: 49: Hoare triple {2300#false} ~cond := #in~cond; {2300#false} is VALID [2018-11-18 23:58:03,872 INFO L273 TraceCheckUtils]: 50: Hoare triple {2300#false} assume 0 == ~cond; {2300#false} is VALID [2018-11-18 23:58:03,873 INFO L273 TraceCheckUtils]: 51: Hoare triple {2300#false} assume !false; {2300#false} is VALID [2018-11-18 23:58:03,875 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 23:58:03,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:58:03,875 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:58:03,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:58:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:03,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:58:04,293 INFO L256 TraceCheckUtils]: 0: Hoare triple {2299#true} call ULTIMATE.init(); {2299#true} is VALID [2018-11-18 23:58:04,293 INFO L273 TraceCheckUtils]: 1: Hoare triple {2299#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {2299#true} is VALID [2018-11-18 23:58:04,293 INFO L273 TraceCheckUtils]: 2: Hoare triple {2299#true} assume true; {2299#true} is VALID [2018-11-18 23:58:04,293 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2299#true} {2299#true} #108#return; {2299#true} is VALID [2018-11-18 23:58:04,293 INFO L256 TraceCheckUtils]: 4: Hoare triple {2299#true} call #t~ret18 := main(); {2299#true} is VALID [2018-11-18 23:58:04,295 INFO L273 TraceCheckUtils]: 5: Hoare triple {2299#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2323#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-18 23:58:04,296 INFO L273 TraceCheckUtils]: 6: Hoare triple {2323#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} assume true; {2323#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-18 23:58:04,296 INFO L273 TraceCheckUtils]: 7: Hoare triple {2323#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {2323#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-18 23:58:04,297 INFO L273 TraceCheckUtils]: 8: Hoare triple {2323#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2323#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-18 23:58:04,298 INFO L273 TraceCheckUtils]: 9: Hoare triple {2323#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2336#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} is VALID [2018-11-18 23:58:04,298 INFO L273 TraceCheckUtils]: 10: Hoare triple {2336#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} assume true; {2336#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} is VALID [2018-11-18 23:58:04,299 INFO L273 TraceCheckUtils]: 11: Hoare triple {2336#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} assume !!(~i~0 < ~nodecount~0); {2336#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} is VALID [2018-11-18 23:58:04,300 INFO L273 TraceCheckUtils]: 12: Hoare triple {2336#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2336#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} is VALID [2018-11-18 23:58:04,301 INFO L273 TraceCheckUtils]: 13: Hoare triple {2336#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2349#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2018-11-18 23:58:04,301 INFO L273 TraceCheckUtils]: 14: Hoare triple {2349#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume true; {2349#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2018-11-18 23:58:04,302 INFO L273 TraceCheckUtils]: 15: Hoare triple {2349#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0); {2349#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2018-11-18 23:58:04,304 INFO L273 TraceCheckUtils]: 16: Hoare triple {2349#(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); {2349#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2018-11-18 23:58:04,305 INFO L273 TraceCheckUtils]: 17: Hoare triple {2349#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2362#(and (<= main_~i~0 3) (<= 5 main_~nodecount~0))} is VALID [2018-11-18 23:58:04,306 INFO L273 TraceCheckUtils]: 18: Hoare triple {2362#(and (<= main_~i~0 3) (<= 5 main_~nodecount~0))} assume true; {2362#(and (<= main_~i~0 3) (<= 5 main_~nodecount~0))} is VALID [2018-11-18 23:58:04,307 INFO L273 TraceCheckUtils]: 19: Hoare triple {2362#(and (<= main_~i~0 3) (<= 5 main_~nodecount~0))} assume !(~i~0 < ~nodecount~0); {2300#false} is VALID [2018-11-18 23:58:04,307 INFO L273 TraceCheckUtils]: 20: Hoare triple {2300#false} ~i~0 := 0; {2300#false} is VALID [2018-11-18 23:58:04,307 INFO L273 TraceCheckUtils]: 21: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-18 23:58:04,307 INFO L273 TraceCheckUtils]: 22: Hoare triple {2300#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2300#false} is VALID [2018-11-18 23:58:04,307 INFO L273 TraceCheckUtils]: 23: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-18 23:58:04,307 INFO L273 TraceCheckUtils]: 24: Hoare triple {2300#false} assume !(~j~0 < ~edgecount~0); {2300#false} is VALID [2018-11-18 23:58:04,308 INFO L273 TraceCheckUtils]: 25: Hoare triple {2300#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2300#false} is VALID [2018-11-18 23:58:04,308 INFO L273 TraceCheckUtils]: 26: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-18 23:58:04,308 INFO L273 TraceCheckUtils]: 27: Hoare triple {2300#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2300#false} is VALID [2018-11-18 23:58:04,308 INFO L273 TraceCheckUtils]: 28: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-18 23:58:04,308 INFO L273 TraceCheckUtils]: 29: Hoare triple {2300#false} assume !(~j~0 < ~edgecount~0); {2300#false} is VALID [2018-11-18 23:58:04,308 INFO L273 TraceCheckUtils]: 30: Hoare triple {2300#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2300#false} is VALID [2018-11-18 23:58:04,308 INFO L273 TraceCheckUtils]: 31: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-18 23:58:04,309 INFO L273 TraceCheckUtils]: 32: Hoare triple {2300#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2300#false} is VALID [2018-11-18 23:58:04,309 INFO L273 TraceCheckUtils]: 33: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-18 23:58:04,309 INFO L273 TraceCheckUtils]: 34: Hoare triple {2300#false} assume !(~j~0 < ~edgecount~0); {2300#false} is VALID [2018-11-18 23:58:04,309 INFO L273 TraceCheckUtils]: 35: Hoare triple {2300#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2300#false} is VALID [2018-11-18 23:58:04,309 INFO L273 TraceCheckUtils]: 36: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-18 23:58:04,310 INFO L273 TraceCheckUtils]: 37: Hoare triple {2300#false} assume !(~i~0 < ~nodecount~0); {2300#false} is VALID [2018-11-18 23:58:04,310 INFO L273 TraceCheckUtils]: 38: Hoare triple {2300#false} ~i~0 := 0; {2300#false} is VALID [2018-11-18 23:58:04,310 INFO L273 TraceCheckUtils]: 39: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-18 23:58:04,310 INFO L273 TraceCheckUtils]: 40: Hoare triple {2300#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {2300#false} is VALID [2018-11-18 23:58:04,310 INFO L273 TraceCheckUtils]: 41: Hoare triple {2300#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {2300#false} is VALID [2018-11-18 23:58:04,311 INFO L273 TraceCheckUtils]: 42: Hoare triple {2300#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2300#false} is VALID [2018-11-18 23:58:04,311 INFO L273 TraceCheckUtils]: 43: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-18 23:58:04,311 INFO L273 TraceCheckUtils]: 44: Hoare triple {2300#false} assume !(~i~0 < ~edgecount~0); {2300#false} is VALID [2018-11-18 23:58:04,311 INFO L273 TraceCheckUtils]: 45: Hoare triple {2300#false} ~i~0 := 0; {2300#false} is VALID [2018-11-18 23:58:04,311 INFO L273 TraceCheckUtils]: 46: Hoare triple {2300#false} assume true; {2300#false} is VALID [2018-11-18 23:58:04,311 INFO L273 TraceCheckUtils]: 47: Hoare triple {2300#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2300#false} is VALID [2018-11-18 23:58:04,312 INFO L256 TraceCheckUtils]: 48: Hoare triple {2300#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {2300#false} is VALID [2018-11-18 23:58:04,312 INFO L273 TraceCheckUtils]: 49: Hoare triple {2300#false} ~cond := #in~cond; {2300#false} is VALID [2018-11-18 23:58:04,312 INFO L273 TraceCheckUtils]: 50: Hoare triple {2300#false} assume 0 == ~cond; {2300#false} is VALID [2018-11-18 23:58:04,312 INFO L273 TraceCheckUtils]: 51: Hoare triple {2300#false} assume !false; {2300#false} is VALID [2018-11-18 23:58:04,314 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 23:58:04,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:58:04,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-18 23:58:04,338 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-11-18 23:58:04,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:58:04,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-18 23:58:04,393 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:04,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 23:58:04,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 23:58:04,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=48, Unknown=0, NotChecked=0, Total=90 [2018-11-18 23:58:04,394 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand 10 states. [2018-11-18 23:58:04,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:04,673 INFO L93 Difference]: Finished difference Result 132 states and 157 transitions. [2018-11-18 23:58:04,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 23:58:04,673 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-11-18 23:58:04,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:58:04,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 23:58:04,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2018-11-18 23:58:04,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 23:58:04,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2018-11-18 23:58:04,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 90 transitions. [2018-11-18 23:58:04,821 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:04,824 INFO L225 Difference]: With dead ends: 132 [2018-11-18 23:58:04,824 INFO L226 Difference]: Without dead ends: 89 [2018-11-18 23:58:04,825 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=48, Unknown=0, NotChecked=0, Total=90 [2018-11-18 23:58:04,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-18 23:58:04,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2018-11-18 23:58:04,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:58:04,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 67 states. [2018-11-18 23:58:04,889 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 67 states. [2018-11-18 23:58:04,889 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 67 states. [2018-11-18 23:58:04,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:04,893 INFO L93 Difference]: Finished difference Result 89 states and 105 transitions. [2018-11-18 23:58:04,893 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2018-11-18 23:58:04,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:04,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:04,894 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 89 states. [2018-11-18 23:58:04,894 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 89 states. [2018-11-18 23:58:04,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:04,897 INFO L93 Difference]: Finished difference Result 89 states and 105 transitions. [2018-11-18 23:58:04,897 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2018-11-18 23:58:04,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:04,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:04,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:58:04,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:58:04,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-18 23:58:04,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2018-11-18 23:58:04,901 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 52 [2018-11-18 23:58:04,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:58:04,901 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2018-11-18 23:58:04,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 23:58:04,901 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2018-11-18 23:58:04,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 23:58:04,902 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:58:04,902 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:58:04,903 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:58:04,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:58:04,903 INFO L82 PathProgramCache]: Analyzing trace with hash 10909237, now seen corresponding path program 2 times [2018-11-18 23:58:04,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:58:04,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:58:04,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:04,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:58:04,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:05,130 INFO L256 TraceCheckUtils]: 0: Hoare triple {2900#true} call ULTIMATE.init(); {2900#true} is VALID [2018-11-18 23:58:05,130 INFO L273 TraceCheckUtils]: 1: Hoare triple {2900#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {2900#true} is VALID [2018-11-18 23:58:05,131 INFO L273 TraceCheckUtils]: 2: Hoare triple {2900#true} assume true; {2900#true} is VALID [2018-11-18 23:58:05,131 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2900#true} {2900#true} #108#return; {2900#true} is VALID [2018-11-18 23:58:05,131 INFO L256 TraceCheckUtils]: 4: Hoare triple {2900#true} call #t~ret18 := main(); {2900#true} is VALID [2018-11-18 23:58:05,134 INFO L273 TraceCheckUtils]: 5: Hoare triple {2900#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2902#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-18 23:58:05,134 INFO L273 TraceCheckUtils]: 6: Hoare triple {2902#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} assume true; {2902#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-18 23:58:05,135 INFO L273 TraceCheckUtils]: 7: Hoare triple {2902#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0); {2902#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-18 23:58:05,135 INFO L273 TraceCheckUtils]: 8: Hoare triple {2902#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2902#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-18 23:58:05,136 INFO L273 TraceCheckUtils]: 9: Hoare triple {2902#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2903#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} is VALID [2018-11-18 23:58:05,136 INFO L273 TraceCheckUtils]: 10: Hoare triple {2903#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} assume true; {2903#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} is VALID [2018-11-18 23:58:05,137 INFO L273 TraceCheckUtils]: 11: Hoare triple {2903#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} assume !!(~i~0 < ~nodecount~0); {2903#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} is VALID [2018-11-18 23:58:05,138 INFO L273 TraceCheckUtils]: 12: Hoare triple {2903#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2904#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:58:05,139 INFO L273 TraceCheckUtils]: 13: Hoare triple {2904#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2905#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-18 23:58:05,140 INFO L273 TraceCheckUtils]: 14: Hoare triple {2905#(<= (+ main_~i~0 4) main_~nodecount~0)} assume true; {2905#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-18 23:58:05,140 INFO L273 TraceCheckUtils]: 15: Hoare triple {2905#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2905#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-18 23:58:05,141 INFO L273 TraceCheckUtils]: 16: Hoare triple {2905#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2905#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-18 23:58:05,142 INFO L273 TraceCheckUtils]: 17: Hoare triple {2905#(<= (+ main_~i~0 4) main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2906#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-18 23:58:05,142 INFO L273 TraceCheckUtils]: 18: Hoare triple {2906#(<= (+ main_~i~0 3) main_~nodecount~0)} assume true; {2906#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-18 23:58:05,143 INFO L273 TraceCheckUtils]: 19: Hoare triple {2906#(<= (+ main_~i~0 3) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2906#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-18 23:58:05,160 INFO L273 TraceCheckUtils]: 20: Hoare triple {2906#(<= (+ 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); {2906#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-18 23:58:05,169 INFO L273 TraceCheckUtils]: 21: Hoare triple {2906#(<= (+ main_~i~0 3) main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2907#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-18 23:58:05,184 INFO L273 TraceCheckUtils]: 22: Hoare triple {2907#(<= (+ main_~i~0 2) main_~nodecount~0)} assume true; {2907#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-18 23:58:05,193 INFO L273 TraceCheckUtils]: 23: Hoare triple {2907#(<= (+ main_~i~0 2) main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {2901#false} is VALID [2018-11-18 23:58:05,193 INFO L273 TraceCheckUtils]: 24: Hoare triple {2901#false} ~i~0 := 0; {2901#false} is VALID [2018-11-18 23:58:05,193 INFO L273 TraceCheckUtils]: 25: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-18 23:58:05,193 INFO L273 TraceCheckUtils]: 26: Hoare triple {2901#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2901#false} is VALID [2018-11-18 23:58:05,194 INFO L273 TraceCheckUtils]: 27: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-18 23:58:05,194 INFO L273 TraceCheckUtils]: 28: Hoare triple {2901#false} assume !(~j~0 < ~edgecount~0); {2901#false} is VALID [2018-11-18 23:58:05,194 INFO L273 TraceCheckUtils]: 29: Hoare triple {2901#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2901#false} is VALID [2018-11-18 23:58:05,194 INFO L273 TraceCheckUtils]: 30: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-18 23:58:05,194 INFO L273 TraceCheckUtils]: 31: Hoare triple {2901#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2901#false} is VALID [2018-11-18 23:58:05,195 INFO L273 TraceCheckUtils]: 32: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-18 23:58:05,195 INFO L273 TraceCheckUtils]: 33: Hoare triple {2901#false} assume !(~j~0 < ~edgecount~0); {2901#false} is VALID [2018-11-18 23:58:05,195 INFO L273 TraceCheckUtils]: 34: Hoare triple {2901#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2901#false} is VALID [2018-11-18 23:58:05,195 INFO L273 TraceCheckUtils]: 35: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-18 23:58:05,195 INFO L273 TraceCheckUtils]: 36: Hoare triple {2901#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2901#false} is VALID [2018-11-18 23:58:05,196 INFO L273 TraceCheckUtils]: 37: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-18 23:58:05,196 INFO L273 TraceCheckUtils]: 38: Hoare triple {2901#false} assume !(~j~0 < ~edgecount~0); {2901#false} is VALID [2018-11-18 23:58:05,196 INFO L273 TraceCheckUtils]: 39: Hoare triple {2901#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2901#false} is VALID [2018-11-18 23:58:05,196 INFO L273 TraceCheckUtils]: 40: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-18 23:58:05,196 INFO L273 TraceCheckUtils]: 41: Hoare triple {2901#false} assume !(~i~0 < ~nodecount~0); {2901#false} is VALID [2018-11-18 23:58:05,197 INFO L273 TraceCheckUtils]: 42: Hoare triple {2901#false} ~i~0 := 0; {2901#false} is VALID [2018-11-18 23:58:05,197 INFO L273 TraceCheckUtils]: 43: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-18 23:58:05,197 INFO L273 TraceCheckUtils]: 44: Hoare triple {2901#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {2901#false} is VALID [2018-11-18 23:58:05,197 INFO L273 TraceCheckUtils]: 45: Hoare triple {2901#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {2901#false} is VALID [2018-11-18 23:58:05,197 INFO L273 TraceCheckUtils]: 46: Hoare triple {2901#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2901#false} is VALID [2018-11-18 23:58:05,198 INFO L273 TraceCheckUtils]: 47: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-18 23:58:05,198 INFO L273 TraceCheckUtils]: 48: Hoare triple {2901#false} assume !(~i~0 < ~edgecount~0); {2901#false} is VALID [2018-11-18 23:58:05,198 INFO L273 TraceCheckUtils]: 49: Hoare triple {2901#false} ~i~0 := 0; {2901#false} is VALID [2018-11-18 23:58:05,198 INFO L273 TraceCheckUtils]: 50: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-18 23:58:05,198 INFO L273 TraceCheckUtils]: 51: Hoare triple {2901#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2901#false} is VALID [2018-11-18 23:58:05,199 INFO L256 TraceCheckUtils]: 52: Hoare triple {2901#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {2901#false} is VALID [2018-11-18 23:58:05,199 INFO L273 TraceCheckUtils]: 53: Hoare triple {2901#false} ~cond := #in~cond; {2901#false} is VALID [2018-11-18 23:58:05,199 INFO L273 TraceCheckUtils]: 54: Hoare triple {2901#false} assume 0 == ~cond; {2901#false} is VALID [2018-11-18 23:58:05,199 INFO L273 TraceCheckUtils]: 55: Hoare triple {2901#false} assume !false; {2901#false} is VALID [2018-11-18 23:58:05,202 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 23:58:05,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:58:05,203 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:58:05,223 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:58:05,292 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 23:58:05,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:58:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:05,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:58:05,515 INFO L256 TraceCheckUtils]: 0: Hoare triple {2900#true} call ULTIMATE.init(); {2900#true} is VALID [2018-11-18 23:58:05,515 INFO L273 TraceCheckUtils]: 1: Hoare triple {2900#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {2900#true} is VALID [2018-11-18 23:58:05,515 INFO L273 TraceCheckUtils]: 2: Hoare triple {2900#true} assume true; {2900#true} is VALID [2018-11-18 23:58:05,516 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2900#true} {2900#true} #108#return; {2900#true} is VALID [2018-11-18 23:58:05,516 INFO L256 TraceCheckUtils]: 4: Hoare triple {2900#true} call #t~ret18 := main(); {2900#true} is VALID [2018-11-18 23:58:05,522 INFO L273 TraceCheckUtils]: 5: Hoare triple {2900#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2926#(and (<= main_~source~0 0) (<= 0 main_~i~0))} is VALID [2018-11-18 23:58:05,523 INFO L273 TraceCheckUtils]: 6: Hoare triple {2926#(and (<= main_~source~0 0) (<= 0 main_~i~0))} assume true; {2926#(and (<= main_~source~0 0) (<= 0 main_~i~0))} is VALID [2018-11-18 23:58:05,523 INFO L273 TraceCheckUtils]: 7: Hoare triple {2926#(and (<= main_~source~0 0) (<= 0 main_~i~0))} assume !!(~i~0 < ~nodecount~0); {2926#(and (<= main_~source~0 0) (<= 0 main_~i~0))} is VALID [2018-11-18 23:58:05,524 INFO L273 TraceCheckUtils]: 8: Hoare triple {2926#(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); {2926#(and (<= main_~source~0 0) (<= 0 main_~i~0))} is VALID [2018-11-18 23:58:05,524 INFO L273 TraceCheckUtils]: 9: Hoare triple {2926#(and (<= main_~source~0 0) (<= 0 main_~i~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2939#(and (<= main_~source~0 0) (<= 1 main_~i~0))} is VALID [2018-11-18 23:58:05,525 INFO L273 TraceCheckUtils]: 10: Hoare triple {2939#(and (<= main_~source~0 0) (<= 1 main_~i~0))} assume true; {2939#(and (<= main_~source~0 0) (<= 1 main_~i~0))} is VALID [2018-11-18 23:58:05,525 INFO L273 TraceCheckUtils]: 11: Hoare triple {2939#(and (<= main_~source~0 0) (<= 1 main_~i~0))} assume !!(~i~0 < ~nodecount~0); {2939#(and (<= main_~source~0 0) (<= 1 main_~i~0))} is VALID [2018-11-18 23:58:05,526 INFO L273 TraceCheckUtils]: 12: Hoare triple {2939#(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); {2901#false} is VALID [2018-11-18 23:58:05,526 INFO L273 TraceCheckUtils]: 13: Hoare triple {2901#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2901#false} is VALID [2018-11-18 23:58:05,526 INFO L273 TraceCheckUtils]: 14: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-18 23:58:05,526 INFO L273 TraceCheckUtils]: 15: Hoare triple {2901#false} assume !!(~i~0 < ~nodecount~0); {2901#false} is VALID [2018-11-18 23:58:05,526 INFO L273 TraceCheckUtils]: 16: Hoare triple {2901#false} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2901#false} is VALID [2018-11-18 23:58:05,526 INFO L273 TraceCheckUtils]: 17: Hoare triple {2901#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2901#false} is VALID [2018-11-18 23:58:05,526 INFO L273 TraceCheckUtils]: 18: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-18 23:58:05,527 INFO L273 TraceCheckUtils]: 19: Hoare triple {2901#false} assume !!(~i~0 < ~nodecount~0); {2901#false} is VALID [2018-11-18 23:58:05,527 INFO L273 TraceCheckUtils]: 20: Hoare triple {2901#false} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2901#false} is VALID [2018-11-18 23:58:05,527 INFO L273 TraceCheckUtils]: 21: Hoare triple {2901#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2901#false} is VALID [2018-11-18 23:58:05,527 INFO L273 TraceCheckUtils]: 22: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-18 23:58:05,527 INFO L273 TraceCheckUtils]: 23: Hoare triple {2901#false} assume !(~i~0 < ~nodecount~0); {2901#false} is VALID [2018-11-18 23:58:05,527 INFO L273 TraceCheckUtils]: 24: Hoare triple {2901#false} ~i~0 := 0; {2901#false} is VALID [2018-11-18 23:58:05,527 INFO L273 TraceCheckUtils]: 25: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-18 23:58:05,527 INFO L273 TraceCheckUtils]: 26: Hoare triple {2901#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2901#false} is VALID [2018-11-18 23:58:05,528 INFO L273 TraceCheckUtils]: 27: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-18 23:58:05,528 INFO L273 TraceCheckUtils]: 28: Hoare triple {2901#false} assume !(~j~0 < ~edgecount~0); {2901#false} is VALID [2018-11-18 23:58:05,528 INFO L273 TraceCheckUtils]: 29: Hoare triple {2901#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2901#false} is VALID [2018-11-18 23:58:05,528 INFO L273 TraceCheckUtils]: 30: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-18 23:58:05,528 INFO L273 TraceCheckUtils]: 31: Hoare triple {2901#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2901#false} is VALID [2018-11-18 23:58:05,528 INFO L273 TraceCheckUtils]: 32: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-18 23:58:05,529 INFO L273 TraceCheckUtils]: 33: Hoare triple {2901#false} assume !(~j~0 < ~edgecount~0); {2901#false} is VALID [2018-11-18 23:58:05,529 INFO L273 TraceCheckUtils]: 34: Hoare triple {2901#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2901#false} is VALID [2018-11-18 23:58:05,529 INFO L273 TraceCheckUtils]: 35: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-18 23:58:05,529 INFO L273 TraceCheckUtils]: 36: Hoare triple {2901#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2901#false} is VALID [2018-11-18 23:58:05,530 INFO L273 TraceCheckUtils]: 37: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-18 23:58:05,530 INFO L273 TraceCheckUtils]: 38: Hoare triple {2901#false} assume !(~j~0 < ~edgecount~0); {2901#false} is VALID [2018-11-18 23:58:05,530 INFO L273 TraceCheckUtils]: 39: Hoare triple {2901#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2901#false} is VALID [2018-11-18 23:58:05,530 INFO L273 TraceCheckUtils]: 40: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-18 23:58:05,531 INFO L273 TraceCheckUtils]: 41: Hoare triple {2901#false} assume !(~i~0 < ~nodecount~0); {2901#false} is VALID [2018-11-18 23:58:05,531 INFO L273 TraceCheckUtils]: 42: Hoare triple {2901#false} ~i~0 := 0; {2901#false} is VALID [2018-11-18 23:58:05,531 INFO L273 TraceCheckUtils]: 43: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-18 23:58:05,531 INFO L273 TraceCheckUtils]: 44: Hoare triple {2901#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {2901#false} is VALID [2018-11-18 23:58:05,532 INFO L273 TraceCheckUtils]: 45: Hoare triple {2901#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {2901#false} is VALID [2018-11-18 23:58:05,532 INFO L273 TraceCheckUtils]: 46: Hoare triple {2901#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2901#false} is VALID [2018-11-18 23:58:05,532 INFO L273 TraceCheckUtils]: 47: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-18 23:58:05,532 INFO L273 TraceCheckUtils]: 48: Hoare triple {2901#false} assume !(~i~0 < ~edgecount~0); {2901#false} is VALID [2018-11-18 23:58:05,532 INFO L273 TraceCheckUtils]: 49: Hoare triple {2901#false} ~i~0 := 0; {2901#false} is VALID [2018-11-18 23:58:05,532 INFO L273 TraceCheckUtils]: 50: Hoare triple {2901#false} assume true; {2901#false} is VALID [2018-11-18 23:58:05,533 INFO L273 TraceCheckUtils]: 51: Hoare triple {2901#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2901#false} is VALID [2018-11-18 23:58:05,533 INFO L256 TraceCheckUtils]: 52: Hoare triple {2901#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {2901#false} is VALID [2018-11-18 23:58:05,533 INFO L273 TraceCheckUtils]: 53: Hoare triple {2901#false} ~cond := #in~cond; {2901#false} is VALID [2018-11-18 23:58:05,533 INFO L273 TraceCheckUtils]: 54: Hoare triple {2901#false} assume 0 == ~cond; {2901#false} is VALID [2018-11-18 23:58:05,533 INFO L273 TraceCheckUtils]: 55: Hoare triple {2901#false} assume !false; {2901#false} is VALID [2018-11-18 23:58:05,536 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-18 23:58:05,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:58:05,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-11-18 23:58:05,561 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-11-18 23:58:05,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:58:05,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-18 23:58:05,620 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:05,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 23:58:05,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 23:58:05,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-18 23:58:05,621 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand 10 states. [2018-11-18 23:58:06,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:06,853 INFO L93 Difference]: Finished difference Result 172 states and 208 transitions. [2018-11-18 23:58:06,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 23:58:06,853 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-11-18 23:58:06,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:58:06,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 23:58:06,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2018-11-18 23:58:06,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 23:58:06,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2018-11-18 23:58:06,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 178 transitions. [2018-11-18 23:58:07,104 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:07,107 INFO L225 Difference]: With dead ends: 172 [2018-11-18 23:58:07,107 INFO L226 Difference]: Without dead ends: 118 [2018-11-18 23:58:07,108 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2018-11-18 23:58:07,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-18 23:58:07,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 74. [2018-11-18 23:58:07,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:58:07,308 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 74 states. [2018-11-18 23:58:07,309 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 74 states. [2018-11-18 23:58:07,309 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 74 states. [2018-11-18 23:58:07,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:07,313 INFO L93 Difference]: Finished difference Result 118 states and 138 transitions. [2018-11-18 23:58:07,314 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 138 transitions. [2018-11-18 23:58:07,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:07,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:07,314 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 118 states. [2018-11-18 23:58:07,314 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 118 states. [2018-11-18 23:58:07,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:07,317 INFO L93 Difference]: Finished difference Result 118 states and 138 transitions. [2018-11-18 23:58:07,318 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 138 transitions. [2018-11-18 23:58:07,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:07,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:07,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:58:07,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:58:07,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-18 23:58:07,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2018-11-18 23:58:07,321 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 56 [2018-11-18 23:58:07,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:58:07,321 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2018-11-18 23:58:07,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 23:58:07,322 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2018-11-18 23:58:07,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-18 23:58:07,322 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:58:07,322 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:58:07,323 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:58:07,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:58:07,323 INFO L82 PathProgramCache]: Analyzing trace with hash -724642237, now seen corresponding path program 3 times [2018-11-18 23:58:07,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:58:07,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:58:07,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:07,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:58:07,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:07,482 INFO L256 TraceCheckUtils]: 0: Hoare triple {3642#true} call ULTIMATE.init(); {3642#true} is VALID [2018-11-18 23:58:07,482 INFO L273 TraceCheckUtils]: 1: Hoare triple {3642#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {3642#true} is VALID [2018-11-18 23:58:07,483 INFO L273 TraceCheckUtils]: 2: Hoare triple {3642#true} assume true; {3642#true} is VALID [2018-11-18 23:58:07,483 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3642#true} {3642#true} #108#return; {3642#true} is VALID [2018-11-18 23:58:07,483 INFO L256 TraceCheckUtils]: 4: Hoare triple {3642#true} call #t~ret18 := main(); {3642#true} is VALID [2018-11-18 23:58:07,486 INFO L273 TraceCheckUtils]: 5: Hoare triple {3642#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {3644#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:58:07,487 INFO L273 TraceCheckUtils]: 6: Hoare triple {3644#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume true; {3644#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:58:07,487 INFO L273 TraceCheckUtils]: 7: Hoare triple {3644#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {3644#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:58:07,489 INFO L273 TraceCheckUtils]: 8: Hoare triple {3644#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3644#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:58:07,490 INFO L273 TraceCheckUtils]: 9: Hoare triple {3644#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3645#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-18 23:58:07,491 INFO L273 TraceCheckUtils]: 10: Hoare triple {3645#(<= (+ main_~i~0 4) main_~nodecount~0)} assume true; {3645#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-18 23:58:07,491 INFO L273 TraceCheckUtils]: 11: Hoare triple {3645#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3645#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-18 23:58:07,491 INFO L273 TraceCheckUtils]: 12: Hoare triple {3645#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3645#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-18 23:58:07,492 INFO L273 TraceCheckUtils]: 13: Hoare triple {3645#(<= (+ main_~i~0 4) main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3646#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-18 23:58:07,493 INFO L273 TraceCheckUtils]: 14: Hoare triple {3646#(<= (+ main_~i~0 3) main_~nodecount~0)} assume true; {3646#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-18 23:58:07,493 INFO L273 TraceCheckUtils]: 15: Hoare triple {3646#(<= (+ main_~i~0 3) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3646#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-18 23:58:07,494 INFO L273 TraceCheckUtils]: 16: Hoare triple {3646#(<= (+ 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); {3646#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-18 23:58:07,495 INFO L273 TraceCheckUtils]: 17: Hoare triple {3646#(<= (+ main_~i~0 3) main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3647#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-18 23:58:07,495 INFO L273 TraceCheckUtils]: 18: Hoare triple {3647#(<= (+ main_~i~0 2) main_~nodecount~0)} assume true; {3647#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-18 23:58:07,496 INFO L273 TraceCheckUtils]: 19: Hoare triple {3647#(<= (+ main_~i~0 2) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3647#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-18 23:58:07,496 INFO L273 TraceCheckUtils]: 20: Hoare triple {3647#(<= (+ 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); {3647#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-18 23:58:07,497 INFO L273 TraceCheckUtils]: 21: Hoare triple {3647#(<= (+ main_~i~0 2) main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3648#(<= (+ main_~i~0 1) main_~nodecount~0)} is VALID [2018-11-18 23:58:07,498 INFO L273 TraceCheckUtils]: 22: Hoare triple {3648#(<= (+ main_~i~0 1) main_~nodecount~0)} assume true; {3648#(<= (+ main_~i~0 1) main_~nodecount~0)} is VALID [2018-11-18 23:58:07,498 INFO L273 TraceCheckUtils]: 23: Hoare triple {3648#(<= (+ main_~i~0 1) main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {3643#false} is VALID [2018-11-18 23:58:07,499 INFO L273 TraceCheckUtils]: 24: Hoare triple {3643#false} ~i~0 := 0; {3643#false} is VALID [2018-11-18 23:58:07,499 INFO L273 TraceCheckUtils]: 25: Hoare triple {3643#false} assume true; {3643#false} is VALID [2018-11-18 23:58:07,499 INFO L273 TraceCheckUtils]: 26: Hoare triple {3643#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3643#false} is VALID [2018-11-18 23:58:07,499 INFO L273 TraceCheckUtils]: 27: Hoare triple {3643#false} assume true; {3643#false} is VALID [2018-11-18 23:58:07,499 INFO L273 TraceCheckUtils]: 28: Hoare triple {3643#false} assume !(~j~0 < ~edgecount~0); {3643#false} is VALID [2018-11-18 23:58:07,500 INFO L273 TraceCheckUtils]: 29: Hoare triple {3643#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3643#false} is VALID [2018-11-18 23:58:07,500 INFO L273 TraceCheckUtils]: 30: Hoare triple {3643#false} assume true; {3643#false} is VALID [2018-11-18 23:58:07,500 INFO L273 TraceCheckUtils]: 31: Hoare triple {3643#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3643#false} is VALID [2018-11-18 23:58:07,500 INFO L273 TraceCheckUtils]: 32: Hoare triple {3643#false} assume true; {3643#false} is VALID [2018-11-18 23:58:07,501 INFO L273 TraceCheckUtils]: 33: Hoare triple {3643#false} assume !(~j~0 < ~edgecount~0); {3643#false} is VALID [2018-11-18 23:58:07,501 INFO L273 TraceCheckUtils]: 34: Hoare triple {3643#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3643#false} is VALID [2018-11-18 23:58:07,501 INFO L273 TraceCheckUtils]: 35: Hoare triple {3643#false} assume true; {3643#false} is VALID [2018-11-18 23:58:07,501 INFO L273 TraceCheckUtils]: 36: Hoare triple {3643#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3643#false} is VALID [2018-11-18 23:58:07,501 INFO L273 TraceCheckUtils]: 37: Hoare triple {3643#false} assume true; {3643#false} is VALID [2018-11-18 23:58:07,502 INFO L273 TraceCheckUtils]: 38: Hoare triple {3643#false} assume !(~j~0 < ~edgecount~0); {3643#false} is VALID [2018-11-18 23:58:07,502 INFO L273 TraceCheckUtils]: 39: Hoare triple {3643#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3643#false} is VALID [2018-11-18 23:58:07,502 INFO L273 TraceCheckUtils]: 40: Hoare triple {3643#false} assume true; {3643#false} is VALID [2018-11-18 23:58:07,502 INFO L273 TraceCheckUtils]: 41: Hoare triple {3643#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3643#false} is VALID [2018-11-18 23:58:07,502 INFO L273 TraceCheckUtils]: 42: Hoare triple {3643#false} assume true; {3643#false} is VALID [2018-11-18 23:58:07,503 INFO L273 TraceCheckUtils]: 43: Hoare triple {3643#false} assume !(~j~0 < ~edgecount~0); {3643#false} is VALID [2018-11-18 23:58:07,503 INFO L273 TraceCheckUtils]: 44: Hoare triple {3643#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3643#false} is VALID [2018-11-18 23:58:07,503 INFO L273 TraceCheckUtils]: 45: Hoare triple {3643#false} assume true; {3643#false} is VALID [2018-11-18 23:58:07,503 INFO L273 TraceCheckUtils]: 46: Hoare triple {3643#false} assume !(~i~0 < ~nodecount~0); {3643#false} is VALID [2018-11-18 23:58:07,504 INFO L273 TraceCheckUtils]: 47: Hoare triple {3643#false} ~i~0 := 0; {3643#false} is VALID [2018-11-18 23:58:07,504 INFO L273 TraceCheckUtils]: 48: Hoare triple {3643#false} assume true; {3643#false} is VALID [2018-11-18 23:58:07,504 INFO L273 TraceCheckUtils]: 49: Hoare triple {3643#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {3643#false} is VALID [2018-11-18 23:58:07,504 INFO L273 TraceCheckUtils]: 50: Hoare triple {3643#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {3643#false} is VALID [2018-11-18 23:58:07,504 INFO L273 TraceCheckUtils]: 51: Hoare triple {3643#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3643#false} is VALID [2018-11-18 23:58:07,504 INFO L273 TraceCheckUtils]: 52: Hoare triple {3643#false} assume true; {3643#false} is VALID [2018-11-18 23:58:07,504 INFO L273 TraceCheckUtils]: 53: Hoare triple {3643#false} assume !(~i~0 < ~edgecount~0); {3643#false} is VALID [2018-11-18 23:58:07,505 INFO L273 TraceCheckUtils]: 54: Hoare triple {3643#false} ~i~0 := 0; {3643#false} is VALID [2018-11-18 23:58:07,505 INFO L273 TraceCheckUtils]: 55: Hoare triple {3643#false} assume true; {3643#false} is VALID [2018-11-18 23:58:07,505 INFO L273 TraceCheckUtils]: 56: Hoare triple {3643#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3643#false} is VALID [2018-11-18 23:58:07,505 INFO L256 TraceCheckUtils]: 57: Hoare triple {3643#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {3643#false} is VALID [2018-11-18 23:58:07,505 INFO L273 TraceCheckUtils]: 58: Hoare triple {3643#false} ~cond := #in~cond; {3643#false} is VALID [2018-11-18 23:58:07,505 INFO L273 TraceCheckUtils]: 59: Hoare triple {3643#false} assume 0 == ~cond; {3643#false} is VALID [2018-11-18 23:58:07,505 INFO L273 TraceCheckUtils]: 60: Hoare triple {3643#false} assume !false; {3643#false} is VALID [2018-11-18 23:58:07,509 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 23:58:07,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:58:07,510 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:58:07,520 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 23:58:07,558 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-18 23:58:07,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:58:07,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:07,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:58:07,719 INFO L256 TraceCheckUtils]: 0: Hoare triple {3642#true} call ULTIMATE.init(); {3642#true} is VALID [2018-11-18 23:58:07,719 INFO L273 TraceCheckUtils]: 1: Hoare triple {3642#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {3642#true} is VALID [2018-11-18 23:58:07,720 INFO L273 TraceCheckUtils]: 2: Hoare triple {3642#true} assume true; {3642#true} is VALID [2018-11-18 23:58:07,720 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3642#true} {3642#true} #108#return; {3642#true} is VALID [2018-11-18 23:58:07,720 INFO L256 TraceCheckUtils]: 4: Hoare triple {3642#true} call #t~ret18 := main(); {3642#true} is VALID [2018-11-18 23:58:07,722 INFO L273 TraceCheckUtils]: 5: Hoare triple {3642#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,723 INFO L273 TraceCheckUtils]: 6: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume true; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,723 INFO L273 TraceCheckUtils]: 7: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,723 INFO L273 TraceCheckUtils]: 8: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,724 INFO L273 TraceCheckUtils]: 9: Hoare triple {3667#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,724 INFO L273 TraceCheckUtils]: 10: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume true; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,724 INFO L273 TraceCheckUtils]: 11: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,725 INFO L273 TraceCheckUtils]: 12: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,725 INFO L273 TraceCheckUtils]: 13: Hoare triple {3667#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,726 INFO L273 TraceCheckUtils]: 14: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume true; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,726 INFO L273 TraceCheckUtils]: 15: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,727 INFO L273 TraceCheckUtils]: 16: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,727 INFO L273 TraceCheckUtils]: 17: Hoare triple {3667#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,728 INFO L273 TraceCheckUtils]: 18: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume true; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,728 INFO L273 TraceCheckUtils]: 19: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,729 INFO L273 TraceCheckUtils]: 20: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,730 INFO L273 TraceCheckUtils]: 21: Hoare triple {3667#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,730 INFO L273 TraceCheckUtils]: 22: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume true; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,731 INFO L273 TraceCheckUtils]: 23: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,731 INFO L273 TraceCheckUtils]: 24: Hoare triple {3667#(<= 20 main_~edgecount~0)} ~i~0 := 0; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,732 INFO L273 TraceCheckUtils]: 25: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume true; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,732 INFO L273 TraceCheckUtils]: 26: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,733 INFO L273 TraceCheckUtils]: 27: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume true; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,733 INFO L273 TraceCheckUtils]: 28: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,734 INFO L273 TraceCheckUtils]: 29: Hoare triple {3667#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,734 INFO L273 TraceCheckUtils]: 30: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume true; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,735 INFO L273 TraceCheckUtils]: 31: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,735 INFO L273 TraceCheckUtils]: 32: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume true; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,736 INFO L273 TraceCheckUtils]: 33: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,737 INFO L273 TraceCheckUtils]: 34: Hoare triple {3667#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,737 INFO L273 TraceCheckUtils]: 35: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume true; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,738 INFO L273 TraceCheckUtils]: 36: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,738 INFO L273 TraceCheckUtils]: 37: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume true; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,739 INFO L273 TraceCheckUtils]: 38: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,739 INFO L273 TraceCheckUtils]: 39: Hoare triple {3667#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,740 INFO L273 TraceCheckUtils]: 40: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume true; {3667#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:07,740 INFO L273 TraceCheckUtils]: 41: Hoare triple {3667#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3776#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:07,741 INFO L273 TraceCheckUtils]: 42: Hoare triple {3776#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume true; {3776#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:07,742 INFO L273 TraceCheckUtils]: 43: Hoare triple {3776#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !(~j~0 < ~edgecount~0); {3643#false} is VALID [2018-11-18 23:58:07,742 INFO L273 TraceCheckUtils]: 44: Hoare triple {3643#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3643#false} is VALID [2018-11-18 23:58:07,742 INFO L273 TraceCheckUtils]: 45: Hoare triple {3643#false} assume true; {3643#false} is VALID [2018-11-18 23:58:07,743 INFO L273 TraceCheckUtils]: 46: Hoare triple {3643#false} assume !(~i~0 < ~nodecount~0); {3643#false} is VALID [2018-11-18 23:58:07,743 INFO L273 TraceCheckUtils]: 47: Hoare triple {3643#false} ~i~0 := 0; {3643#false} is VALID [2018-11-18 23:58:07,743 INFO L273 TraceCheckUtils]: 48: Hoare triple {3643#false} assume true; {3643#false} is VALID [2018-11-18 23:58:07,744 INFO L273 TraceCheckUtils]: 49: Hoare triple {3643#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {3643#false} is VALID [2018-11-18 23:58:07,744 INFO L273 TraceCheckUtils]: 50: Hoare triple {3643#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {3643#false} is VALID [2018-11-18 23:58:07,744 INFO L273 TraceCheckUtils]: 51: Hoare triple {3643#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3643#false} is VALID [2018-11-18 23:58:07,745 INFO L273 TraceCheckUtils]: 52: Hoare triple {3643#false} assume true; {3643#false} is VALID [2018-11-18 23:58:07,745 INFO L273 TraceCheckUtils]: 53: Hoare triple {3643#false} assume !(~i~0 < ~edgecount~0); {3643#false} is VALID [2018-11-18 23:58:07,745 INFO L273 TraceCheckUtils]: 54: Hoare triple {3643#false} ~i~0 := 0; {3643#false} is VALID [2018-11-18 23:58:07,746 INFO L273 TraceCheckUtils]: 55: Hoare triple {3643#false} assume true; {3643#false} is VALID [2018-11-18 23:58:07,746 INFO L273 TraceCheckUtils]: 56: Hoare triple {3643#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3643#false} is VALID [2018-11-18 23:58:07,746 INFO L256 TraceCheckUtils]: 57: Hoare triple {3643#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {3643#false} is VALID [2018-11-18 23:58:07,747 INFO L273 TraceCheckUtils]: 58: Hoare triple {3643#false} ~cond := #in~cond; {3643#false} is VALID [2018-11-18 23:58:07,747 INFO L273 TraceCheckUtils]: 59: Hoare triple {3643#false} assume 0 == ~cond; {3643#false} is VALID [2018-11-18 23:58:07,747 INFO L273 TraceCheckUtils]: 60: Hoare triple {3643#false} assume !false; {3643#false} is VALID [2018-11-18 23:58:07,752 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-18 23:58:07,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:58:07,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-18 23:58:07,775 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-11-18 23:58:07,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:58:07,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 23:58:07,838 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:07,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 23:58:07,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 23:58:07,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-18 23:58:07,839 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand 9 states. [2018-11-18 23:58:08,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:08,438 INFO L93 Difference]: Finished difference Result 144 states and 174 transitions. [2018-11-18 23:58:08,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 23:58:08,438 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-11-18 23:58:08,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:58:08,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 23:58:08,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2018-11-18 23:58:08,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 23:58:08,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2018-11-18 23:58:08,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 94 transitions. [2018-11-18 23:58:09,068 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:09,071 INFO L225 Difference]: With dead ends: 144 [2018-11-18 23:58:09,071 INFO L226 Difference]: Without dead ends: 94 [2018-11-18 23:58:09,071 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-11-18 23:58:09,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-18 23:58:09,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 86. [2018-11-18 23:58:09,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:58:09,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 86 states. [2018-11-18 23:58:09,211 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 86 states. [2018-11-18 23:58:09,211 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 86 states. [2018-11-18 23:58:09,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:09,214 INFO L93 Difference]: Finished difference Result 94 states and 109 transitions. [2018-11-18 23:58:09,215 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 109 transitions. [2018-11-18 23:58:09,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:09,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:09,215 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 94 states. [2018-11-18 23:58:09,216 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 94 states. [2018-11-18 23:58:09,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:09,219 INFO L93 Difference]: Finished difference Result 94 states and 109 transitions. [2018-11-18 23:58:09,219 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 109 transitions. [2018-11-18 23:58:09,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:09,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:09,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:58:09,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:58:09,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-18 23:58:09,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2018-11-18 23:58:09,223 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 61 [2018-11-18 23:58:09,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:58:09,223 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2018-11-18 23:58:09,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 23:58:09,224 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2018-11-18 23:58:09,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 23:58:09,225 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:58:09,225 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:58:09,225 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:58:09,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:58:09,226 INFO L82 PathProgramCache]: Analyzing trace with hash 373856220, now seen corresponding path program 1 times [2018-11-18 23:58:09,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:58:09,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:58:09,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:09,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:58:09,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:09,836 INFO L256 TraceCheckUtils]: 0: Hoare triple {4333#true} call ULTIMATE.init(); {4333#true} is VALID [2018-11-18 23:58:09,836 INFO L273 TraceCheckUtils]: 1: Hoare triple {4333#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {4333#true} is VALID [2018-11-18 23:58:09,837 INFO L273 TraceCheckUtils]: 2: Hoare triple {4333#true} assume true; {4333#true} is VALID [2018-11-18 23:58:09,837 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4333#true} {4333#true} #108#return; {4333#true} is VALID [2018-11-18 23:58:09,837 INFO L256 TraceCheckUtils]: 4: Hoare triple {4333#true} call #t~ret18 := main(); {4333#true} is VALID [2018-11-18 23:58:09,839 INFO L273 TraceCheckUtils]: 5: Hoare triple {4333#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:58:09,840 INFO L273 TraceCheckUtils]: 6: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume true; {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:58:09,840 INFO L273 TraceCheckUtils]: 7: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:58:09,841 INFO L273 TraceCheckUtils]: 8: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:58:09,841 INFO L273 TraceCheckUtils]: 9: Hoare triple {4335#(<= 5 main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:58:09,842 INFO L273 TraceCheckUtils]: 10: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume true; {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:58:09,842 INFO L273 TraceCheckUtils]: 11: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:58:09,843 INFO L273 TraceCheckUtils]: 12: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:58:09,843 INFO L273 TraceCheckUtils]: 13: Hoare triple {4335#(<= 5 main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:58:09,861 INFO L273 TraceCheckUtils]: 14: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume true; {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:58:09,868 INFO L273 TraceCheckUtils]: 15: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:58:09,868 INFO L273 TraceCheckUtils]: 16: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:58:09,869 INFO L273 TraceCheckUtils]: 17: Hoare triple {4335#(<= 5 main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:58:09,869 INFO L273 TraceCheckUtils]: 18: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume true; {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:58:09,869 INFO L273 TraceCheckUtils]: 19: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:58:09,869 INFO L273 TraceCheckUtils]: 20: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:58:09,870 INFO L273 TraceCheckUtils]: 21: Hoare triple {4335#(<= 5 main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:58:09,870 INFO L273 TraceCheckUtils]: 22: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume true; {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:58:09,870 INFO L273 TraceCheckUtils]: 23: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:58:09,871 INFO L273 TraceCheckUtils]: 24: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:58:09,871 INFO L273 TraceCheckUtils]: 25: Hoare triple {4335#(<= 5 main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:58:09,872 INFO L273 TraceCheckUtils]: 26: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume true; {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:58:09,872 INFO L273 TraceCheckUtils]: 27: Hoare triple {4335#(<= 5 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {4335#(<= 5 main_~nodecount~0)} is VALID [2018-11-18 23:58:09,873 INFO L273 TraceCheckUtils]: 28: Hoare triple {4335#(<= 5 main_~nodecount~0)} ~i~0 := 0; {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:58:09,873 INFO L273 TraceCheckUtils]: 29: Hoare triple {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume true; {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:58:09,874 INFO L273 TraceCheckUtils]: 30: Hoare triple {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:58:09,875 INFO L273 TraceCheckUtils]: 31: Hoare triple {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume true; {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:58:09,876 INFO L273 TraceCheckUtils]: 32: Hoare triple {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:58:09,877 INFO L273 TraceCheckUtils]: 33: Hoare triple {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:58:09,877 INFO L273 TraceCheckUtils]: 34: Hoare triple {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:58:09,878 INFO L273 TraceCheckUtils]: 35: Hoare triple {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume true; {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:58:09,879 INFO L273 TraceCheckUtils]: 36: Hoare triple {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume !(~j~0 < ~edgecount~0); {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:58:09,880 INFO L273 TraceCheckUtils]: 37: Hoare triple {4336#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-18 23:58:09,880 INFO L273 TraceCheckUtils]: 38: Hoare triple {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} assume true; {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-18 23:58:09,881 INFO L273 TraceCheckUtils]: 39: Hoare triple {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-18 23:58:09,881 INFO L273 TraceCheckUtils]: 40: Hoare triple {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} assume true; {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-18 23:58:09,882 INFO L273 TraceCheckUtils]: 41: Hoare triple {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-18 23:58:09,882 INFO L273 TraceCheckUtils]: 42: Hoare triple {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-18 23:58:09,883 INFO L273 TraceCheckUtils]: 43: Hoare triple {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-18 23:58:09,884 INFO L273 TraceCheckUtils]: 44: Hoare triple {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} assume true; {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-18 23:58:09,884 INFO L273 TraceCheckUtils]: 45: Hoare triple {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-18 23:58:09,885 INFO L273 TraceCheckUtils]: 46: Hoare triple {4337#(<= (+ main_~i~0 4) main_~nodecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-18 23:58:09,885 INFO L273 TraceCheckUtils]: 47: Hoare triple {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} assume true; {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-18 23:58:09,886 INFO L273 TraceCheckUtils]: 48: Hoare triple {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-18 23:58:09,887 INFO L273 TraceCheckUtils]: 49: Hoare triple {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} assume true; {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-18 23:58:09,887 INFO L273 TraceCheckUtils]: 50: Hoare triple {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-18 23:58:09,888 INFO L273 TraceCheckUtils]: 51: Hoare triple {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-18 23:58:09,888 INFO L273 TraceCheckUtils]: 52: Hoare triple {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-18 23:58:09,889 INFO L273 TraceCheckUtils]: 53: Hoare triple {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} assume true; {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-18 23:58:09,889 INFO L273 TraceCheckUtils]: 54: Hoare triple {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-18 23:58:09,890 INFO L273 TraceCheckUtils]: 55: Hoare triple {4338#(<= (+ main_~i~0 3) main_~nodecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-18 23:58:09,891 INFO L273 TraceCheckUtils]: 56: Hoare triple {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} assume true; {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-18 23:58:09,891 INFO L273 TraceCheckUtils]: 57: Hoare triple {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-18 23:58:09,892 INFO L273 TraceCheckUtils]: 58: Hoare triple {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} assume true; {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-18 23:58:09,892 INFO L273 TraceCheckUtils]: 59: Hoare triple {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-18 23:58:09,893 INFO L273 TraceCheckUtils]: 60: Hoare triple {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-18 23:58:09,894 INFO L273 TraceCheckUtils]: 61: Hoare triple {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-18 23:58:09,895 INFO L273 TraceCheckUtils]: 62: Hoare triple {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} assume true; {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-18 23:58:09,895 INFO L273 TraceCheckUtils]: 63: Hoare triple {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-18 23:58:09,896 INFO L273 TraceCheckUtils]: 64: Hoare triple {4339#(<= (+ main_~i~0 2) main_~nodecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4340#(<= (+ main_~i~0 1) main_~nodecount~0)} is VALID [2018-11-18 23:58:09,897 INFO L273 TraceCheckUtils]: 65: Hoare triple {4340#(<= (+ main_~i~0 1) main_~nodecount~0)} assume true; {4340#(<= (+ main_~i~0 1) main_~nodecount~0)} is VALID [2018-11-18 23:58:09,897 INFO L273 TraceCheckUtils]: 66: Hoare triple {4340#(<= (+ main_~i~0 1) main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {4334#false} is VALID [2018-11-18 23:58:09,898 INFO L273 TraceCheckUtils]: 67: Hoare triple {4334#false} ~i~0 := 0; {4334#false} is VALID [2018-11-18 23:58:09,898 INFO L273 TraceCheckUtils]: 68: Hoare triple {4334#false} assume true; {4334#false} is VALID [2018-11-18 23:58:09,898 INFO L273 TraceCheckUtils]: 69: Hoare triple {4334#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {4334#false} is VALID [2018-11-18 23:58:09,898 INFO L273 TraceCheckUtils]: 70: Hoare triple {4334#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {4334#false} is VALID [2018-11-18 23:58:09,899 INFO L273 TraceCheckUtils]: 71: Hoare triple {4334#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4334#false} is VALID [2018-11-18 23:58:09,899 INFO L273 TraceCheckUtils]: 72: Hoare triple {4334#false} assume true; {4334#false} is VALID [2018-11-18 23:58:09,899 INFO L273 TraceCheckUtils]: 73: Hoare triple {4334#false} assume !(~i~0 < ~edgecount~0); {4334#false} is VALID [2018-11-18 23:58:09,899 INFO L273 TraceCheckUtils]: 74: Hoare triple {4334#false} ~i~0 := 0; {4334#false} is VALID [2018-11-18 23:58:09,899 INFO L273 TraceCheckUtils]: 75: Hoare triple {4334#false} assume true; {4334#false} is VALID [2018-11-18 23:58:09,900 INFO L273 TraceCheckUtils]: 76: Hoare triple {4334#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4334#false} is VALID [2018-11-18 23:58:09,900 INFO L256 TraceCheckUtils]: 77: Hoare triple {4334#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {4334#false} is VALID [2018-11-18 23:58:09,900 INFO L273 TraceCheckUtils]: 78: Hoare triple {4334#false} ~cond := #in~cond; {4334#false} is VALID [2018-11-18 23:58:09,900 INFO L273 TraceCheckUtils]: 79: Hoare triple {4334#false} assume 0 == ~cond; {4334#false} is VALID [2018-11-18 23:58:09,900 INFO L273 TraceCheckUtils]: 80: Hoare triple {4334#false} assume !false; {4334#false} is VALID [2018-11-18 23:58:09,906 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-18 23:58:09,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:58:09,906 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:58:09,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:58:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:09,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:58:10,086 INFO L256 TraceCheckUtils]: 0: Hoare triple {4333#true} call ULTIMATE.init(); {4333#true} is VALID [2018-11-18 23:58:10,087 INFO L273 TraceCheckUtils]: 1: Hoare triple {4333#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {4333#true} is VALID [2018-11-18 23:58:10,087 INFO L273 TraceCheckUtils]: 2: Hoare triple {4333#true} assume true; {4333#true} is VALID [2018-11-18 23:58:10,087 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4333#true} {4333#true} #108#return; {4333#true} is VALID [2018-11-18 23:58:10,088 INFO L256 TraceCheckUtils]: 4: Hoare triple {4333#true} call #t~ret18 := main(); {4333#true} is VALID [2018-11-18 23:58:10,090 INFO L273 TraceCheckUtils]: 5: Hoare triple {4333#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:10,091 INFO L273 TraceCheckUtils]: 6: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume true; {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:10,091 INFO L273 TraceCheckUtils]: 7: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:10,091 INFO L273 TraceCheckUtils]: 8: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:10,092 INFO L273 TraceCheckUtils]: 9: Hoare triple {4359#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:10,092 INFO L273 TraceCheckUtils]: 10: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume true; {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:10,092 INFO L273 TraceCheckUtils]: 11: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:10,093 INFO L273 TraceCheckUtils]: 12: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:10,093 INFO L273 TraceCheckUtils]: 13: Hoare triple {4359#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:10,093 INFO L273 TraceCheckUtils]: 14: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume true; {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:10,094 INFO L273 TraceCheckUtils]: 15: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:10,094 INFO L273 TraceCheckUtils]: 16: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:10,095 INFO L273 TraceCheckUtils]: 17: Hoare triple {4359#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:10,095 INFO L273 TraceCheckUtils]: 18: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume true; {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:10,096 INFO L273 TraceCheckUtils]: 19: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:10,096 INFO L273 TraceCheckUtils]: 20: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:10,097 INFO L273 TraceCheckUtils]: 21: Hoare triple {4359#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:10,097 INFO L273 TraceCheckUtils]: 22: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume true; {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:10,098 INFO L273 TraceCheckUtils]: 23: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:10,098 INFO L273 TraceCheckUtils]: 24: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:10,100 INFO L273 TraceCheckUtils]: 25: Hoare triple {4359#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:10,100 INFO L273 TraceCheckUtils]: 26: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume true; {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:10,101 INFO L273 TraceCheckUtils]: 27: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:10,101 INFO L273 TraceCheckUtils]: 28: Hoare triple {4359#(<= 20 main_~edgecount~0)} ~i~0 := 0; {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:10,102 INFO L273 TraceCheckUtils]: 29: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume true; {4359#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:10,103 INFO L273 TraceCheckUtils]: 30: Hoare triple {4359#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4435#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:10,103 INFO L273 TraceCheckUtils]: 31: Hoare triple {4435#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume true; {4435#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:10,104 INFO L273 TraceCheckUtils]: 32: Hoare triple {4435#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4435#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:10,105 INFO L273 TraceCheckUtils]: 33: Hoare triple {4435#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {4435#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:10,106 INFO L273 TraceCheckUtils]: 34: Hoare triple {4435#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {4448#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:58:10,110 INFO L273 TraceCheckUtils]: 35: Hoare triple {4448#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume true; {4448#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:58:10,113 INFO L273 TraceCheckUtils]: 36: Hoare triple {4448#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !(~j~0 < ~edgecount~0); {4334#false} is VALID [2018-11-18 23:58:10,113 INFO L273 TraceCheckUtils]: 37: Hoare triple {4334#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4334#false} is VALID [2018-11-18 23:58:10,113 INFO L273 TraceCheckUtils]: 38: Hoare triple {4334#false} assume true; {4334#false} is VALID [2018-11-18 23:58:10,113 INFO L273 TraceCheckUtils]: 39: Hoare triple {4334#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4334#false} is VALID [2018-11-18 23:58:10,113 INFO L273 TraceCheckUtils]: 40: Hoare triple {4334#false} assume true; {4334#false} is VALID [2018-11-18 23:58:10,113 INFO L273 TraceCheckUtils]: 41: Hoare triple {4334#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4334#false} is VALID [2018-11-18 23:58:10,113 INFO L273 TraceCheckUtils]: 42: Hoare triple {4334#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {4334#false} is VALID [2018-11-18 23:58:10,114 INFO L273 TraceCheckUtils]: 43: Hoare triple {4334#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {4334#false} is VALID [2018-11-18 23:58:10,114 INFO L273 TraceCheckUtils]: 44: Hoare triple {4334#false} assume true; {4334#false} is VALID [2018-11-18 23:58:10,114 INFO L273 TraceCheckUtils]: 45: Hoare triple {4334#false} assume !(~j~0 < ~edgecount~0); {4334#false} is VALID [2018-11-18 23:58:10,114 INFO L273 TraceCheckUtils]: 46: Hoare triple {4334#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4334#false} is VALID [2018-11-18 23:58:10,114 INFO L273 TraceCheckUtils]: 47: Hoare triple {4334#false} assume true; {4334#false} is VALID [2018-11-18 23:58:10,114 INFO L273 TraceCheckUtils]: 48: Hoare triple {4334#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4334#false} is VALID [2018-11-18 23:58:10,114 INFO L273 TraceCheckUtils]: 49: Hoare triple {4334#false} assume true; {4334#false} is VALID [2018-11-18 23:58:10,115 INFO L273 TraceCheckUtils]: 50: Hoare triple {4334#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4334#false} is VALID [2018-11-18 23:58:10,115 INFO L273 TraceCheckUtils]: 51: Hoare triple {4334#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {4334#false} is VALID [2018-11-18 23:58:10,115 INFO L273 TraceCheckUtils]: 52: Hoare triple {4334#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {4334#false} is VALID [2018-11-18 23:58:10,115 INFO L273 TraceCheckUtils]: 53: Hoare triple {4334#false} assume true; {4334#false} is VALID [2018-11-18 23:58:10,115 INFO L273 TraceCheckUtils]: 54: Hoare triple {4334#false} assume !(~j~0 < ~edgecount~0); {4334#false} is VALID [2018-11-18 23:58:10,115 INFO L273 TraceCheckUtils]: 55: Hoare triple {4334#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4334#false} is VALID [2018-11-18 23:58:10,116 INFO L273 TraceCheckUtils]: 56: Hoare triple {4334#false} assume true; {4334#false} is VALID [2018-11-18 23:58:10,116 INFO L273 TraceCheckUtils]: 57: Hoare triple {4334#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4334#false} is VALID [2018-11-18 23:58:10,116 INFO L273 TraceCheckUtils]: 58: Hoare triple {4334#false} assume true; {4334#false} is VALID [2018-11-18 23:58:10,116 INFO L273 TraceCheckUtils]: 59: Hoare triple {4334#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {4334#false} is VALID [2018-11-18 23:58:10,116 INFO L273 TraceCheckUtils]: 60: Hoare triple {4334#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {4334#false} is VALID [2018-11-18 23:58:10,117 INFO L273 TraceCheckUtils]: 61: Hoare triple {4334#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {4334#false} is VALID [2018-11-18 23:58:10,117 INFO L273 TraceCheckUtils]: 62: Hoare triple {4334#false} assume true; {4334#false} is VALID [2018-11-18 23:58:10,117 INFO L273 TraceCheckUtils]: 63: Hoare triple {4334#false} assume !(~j~0 < ~edgecount~0); {4334#false} is VALID [2018-11-18 23:58:10,117 INFO L273 TraceCheckUtils]: 64: Hoare triple {4334#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4334#false} is VALID [2018-11-18 23:58:10,117 INFO L273 TraceCheckUtils]: 65: Hoare triple {4334#false} assume true; {4334#false} is VALID [2018-11-18 23:58:10,117 INFO L273 TraceCheckUtils]: 66: Hoare triple {4334#false} assume !(~i~0 < ~nodecount~0); {4334#false} is VALID [2018-11-18 23:58:10,118 INFO L273 TraceCheckUtils]: 67: Hoare triple {4334#false} ~i~0 := 0; {4334#false} is VALID [2018-11-18 23:58:10,118 INFO L273 TraceCheckUtils]: 68: Hoare triple {4334#false} assume true; {4334#false} is VALID [2018-11-18 23:58:10,118 INFO L273 TraceCheckUtils]: 69: Hoare triple {4334#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {4334#false} is VALID [2018-11-18 23:58:10,118 INFO L273 TraceCheckUtils]: 70: Hoare triple {4334#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {4334#false} is VALID [2018-11-18 23:58:10,118 INFO L273 TraceCheckUtils]: 71: Hoare triple {4334#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4334#false} is VALID [2018-11-18 23:58:10,119 INFO L273 TraceCheckUtils]: 72: Hoare triple {4334#false} assume true; {4334#false} is VALID [2018-11-18 23:58:10,119 INFO L273 TraceCheckUtils]: 73: Hoare triple {4334#false} assume !(~i~0 < ~edgecount~0); {4334#false} is VALID [2018-11-18 23:58:10,119 INFO L273 TraceCheckUtils]: 74: Hoare triple {4334#false} ~i~0 := 0; {4334#false} is VALID [2018-11-18 23:58:10,119 INFO L273 TraceCheckUtils]: 75: Hoare triple {4334#false} assume true; {4334#false} is VALID [2018-11-18 23:58:10,119 INFO L273 TraceCheckUtils]: 76: Hoare triple {4334#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4334#false} is VALID [2018-11-18 23:58:10,120 INFO L256 TraceCheckUtils]: 77: Hoare triple {4334#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {4334#false} is VALID [2018-11-18 23:58:10,120 INFO L273 TraceCheckUtils]: 78: Hoare triple {4334#false} ~cond := #in~cond; {4334#false} is VALID [2018-11-18 23:58:10,120 INFO L273 TraceCheckUtils]: 79: Hoare triple {4334#false} assume 0 == ~cond; {4334#false} is VALID [2018-11-18 23:58:10,120 INFO L273 TraceCheckUtils]: 80: Hoare triple {4334#false} assume !false; {4334#false} is VALID [2018-11-18 23:58:10,125 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 38 proven. 2 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-11-18 23:58:10,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:58:10,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-18 23:58:10,155 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 81 [2018-11-18 23:58:10,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:58:10,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 23:58:10,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:10,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 23:58:10,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 23:58:10,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-18 23:58:10,306 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand 11 states. [2018-11-18 23:58:12,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:12,329 INFO L93 Difference]: Finished difference Result 218 states and 263 transitions. [2018-11-18 23:58:12,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 23:58:12,329 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 81 [2018-11-18 23:58:12,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:58:12,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 23:58:12,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 234 transitions. [2018-11-18 23:58:12,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 23:58:12,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 234 transitions. [2018-11-18 23:58:12,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 234 transitions. [2018-11-18 23:58:12,632 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:12,636 INFO L225 Difference]: With dead ends: 218 [2018-11-18 23:58:12,636 INFO L226 Difference]: Without dead ends: 169 [2018-11-18 23:58:12,637 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=247, Invalid=455, Unknown=0, NotChecked=0, Total=702 [2018-11-18 23:58:12,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-18 23:58:12,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 115. [2018-11-18 23:58:12,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:58:12,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand 115 states. [2018-11-18 23:58:12,995 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand 115 states. [2018-11-18 23:58:12,995 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 115 states. [2018-11-18 23:58:13,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:13,001 INFO L93 Difference]: Finished difference Result 169 states and 200 transitions. [2018-11-18 23:58:13,001 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 200 transitions. [2018-11-18 23:58:13,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:13,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:13,002 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 169 states. [2018-11-18 23:58:13,002 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 169 states. [2018-11-18 23:58:13,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:13,006 INFO L93 Difference]: Finished difference Result 169 states and 200 transitions. [2018-11-18 23:58:13,006 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 200 transitions. [2018-11-18 23:58:13,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:13,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:13,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:58:13,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:58:13,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-18 23:58:13,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 133 transitions. [2018-11-18 23:58:13,010 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 133 transitions. Word has length 81 [2018-11-18 23:58:13,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:58:13,010 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 133 transitions. [2018-11-18 23:58:13,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 23:58:13,011 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 133 transitions. [2018-11-18 23:58:13,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-18 23:58:13,012 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:58:13,012 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:58:13,012 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:58:13,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:58:13,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1759457428, now seen corresponding path program 2 times [2018-11-18 23:58:13,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:58:13,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:58:13,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:13,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:58:13,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:13,197 INFO L256 TraceCheckUtils]: 0: Hoare triple {5389#true} call ULTIMATE.init(); {5389#true} is VALID [2018-11-18 23:58:13,197 INFO L273 TraceCheckUtils]: 1: Hoare triple {5389#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {5389#true} is VALID [2018-11-18 23:58:13,197 INFO L273 TraceCheckUtils]: 2: Hoare triple {5389#true} assume true; {5389#true} is VALID [2018-11-18 23:58:13,198 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5389#true} {5389#true} #108#return; {5389#true} is VALID [2018-11-18 23:58:13,198 INFO L256 TraceCheckUtils]: 4: Hoare triple {5389#true} call #t~ret18 := main(); {5389#true} is VALID [2018-11-18 23:58:13,198 INFO L273 TraceCheckUtils]: 5: Hoare triple {5389#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {5389#true} is VALID [2018-11-18 23:58:13,198 INFO L273 TraceCheckUtils]: 6: Hoare triple {5389#true} assume true; {5389#true} is VALID [2018-11-18 23:58:13,199 INFO L273 TraceCheckUtils]: 7: Hoare triple {5389#true} assume !!(~i~0 < ~nodecount~0); {5389#true} is VALID [2018-11-18 23:58:13,199 INFO L273 TraceCheckUtils]: 8: Hoare triple {5389#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5389#true} is VALID [2018-11-18 23:58:13,199 INFO L273 TraceCheckUtils]: 9: Hoare triple {5389#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5389#true} is VALID [2018-11-18 23:58:13,199 INFO L273 TraceCheckUtils]: 10: Hoare triple {5389#true} assume true; {5389#true} is VALID [2018-11-18 23:58:13,199 INFO L273 TraceCheckUtils]: 11: Hoare triple {5389#true} assume !!(~i~0 < ~nodecount~0); {5389#true} is VALID [2018-11-18 23:58:13,200 INFO L273 TraceCheckUtils]: 12: Hoare triple {5389#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5389#true} is VALID [2018-11-18 23:58:13,200 INFO L273 TraceCheckUtils]: 13: Hoare triple {5389#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5389#true} is VALID [2018-11-18 23:58:13,200 INFO L273 TraceCheckUtils]: 14: Hoare triple {5389#true} assume true; {5389#true} is VALID [2018-11-18 23:58:13,200 INFO L273 TraceCheckUtils]: 15: Hoare triple {5389#true} assume !!(~i~0 < ~nodecount~0); {5389#true} is VALID [2018-11-18 23:58:13,200 INFO L273 TraceCheckUtils]: 16: Hoare triple {5389#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5389#true} is VALID [2018-11-18 23:58:13,200 INFO L273 TraceCheckUtils]: 17: Hoare triple {5389#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5389#true} is VALID [2018-11-18 23:58:13,200 INFO L273 TraceCheckUtils]: 18: Hoare triple {5389#true} assume true; {5389#true} is VALID [2018-11-18 23:58:13,200 INFO L273 TraceCheckUtils]: 19: Hoare triple {5389#true} assume !!(~i~0 < ~nodecount~0); {5389#true} is VALID [2018-11-18 23:58:13,201 INFO L273 TraceCheckUtils]: 20: Hoare triple {5389#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5389#true} is VALID [2018-11-18 23:58:13,201 INFO L273 TraceCheckUtils]: 21: Hoare triple {5389#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5389#true} is VALID [2018-11-18 23:58:13,201 INFO L273 TraceCheckUtils]: 22: Hoare triple {5389#true} assume true; {5389#true} is VALID [2018-11-18 23:58:13,201 INFO L273 TraceCheckUtils]: 23: Hoare triple {5389#true} assume !!(~i~0 < ~nodecount~0); {5389#true} is VALID [2018-11-18 23:58:13,201 INFO L273 TraceCheckUtils]: 24: Hoare triple {5389#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5389#true} is VALID [2018-11-18 23:58:13,201 INFO L273 TraceCheckUtils]: 25: Hoare triple {5389#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5389#true} is VALID [2018-11-18 23:58:13,201 INFO L273 TraceCheckUtils]: 26: Hoare triple {5389#true} assume true; {5389#true} is VALID [2018-11-18 23:58:13,201 INFO L273 TraceCheckUtils]: 27: Hoare triple {5389#true} assume !(~i~0 < ~nodecount~0); {5389#true} is VALID [2018-11-18 23:58:13,202 INFO L273 TraceCheckUtils]: 28: Hoare triple {5389#true} ~i~0 := 0; {5389#true} is VALID [2018-11-18 23:58:13,202 INFO L273 TraceCheckUtils]: 29: Hoare triple {5389#true} assume true; {5389#true} is VALID [2018-11-18 23:58:13,202 INFO L273 TraceCheckUtils]: 30: Hoare triple {5389#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5389#true} is VALID [2018-11-18 23:58:13,202 INFO L273 TraceCheckUtils]: 31: Hoare triple {5389#true} assume true; {5389#true} is VALID [2018-11-18 23:58:13,202 INFO L273 TraceCheckUtils]: 32: Hoare triple {5389#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5389#true} is VALID [2018-11-18 23:58:13,202 INFO L273 TraceCheckUtils]: 33: Hoare triple {5389#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {5389#true} is VALID [2018-11-18 23:58:13,202 INFO L273 TraceCheckUtils]: 34: Hoare triple {5389#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5389#true} is VALID [2018-11-18 23:58:13,202 INFO L273 TraceCheckUtils]: 35: Hoare triple {5389#true} assume true; {5389#true} is VALID [2018-11-18 23:58:13,203 INFO L273 TraceCheckUtils]: 36: Hoare triple {5389#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5389#true} is VALID [2018-11-18 23:58:13,203 INFO L273 TraceCheckUtils]: 37: Hoare triple {5389#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {5389#true} is VALID [2018-11-18 23:58:13,203 INFO L273 TraceCheckUtils]: 38: Hoare triple {5389#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5389#true} is VALID [2018-11-18 23:58:13,203 INFO L273 TraceCheckUtils]: 39: Hoare triple {5389#true} assume true; {5389#true} is VALID [2018-11-18 23:58:13,203 INFO L273 TraceCheckUtils]: 40: Hoare triple {5389#true} assume !(~j~0 < ~edgecount~0); {5389#true} is VALID [2018-11-18 23:58:13,203 INFO L273 TraceCheckUtils]: 41: Hoare triple {5389#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5389#true} is VALID [2018-11-18 23:58:13,203 INFO L273 TraceCheckUtils]: 42: Hoare triple {5389#true} assume true; {5389#true} is VALID [2018-11-18 23:58:13,204 INFO L273 TraceCheckUtils]: 43: Hoare triple {5389#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5391#(= main_~j~0 0)} is VALID [2018-11-18 23:58:13,204 INFO L273 TraceCheckUtils]: 44: Hoare triple {5391#(= main_~j~0 0)} assume true; {5391#(= main_~j~0 0)} is VALID [2018-11-18 23:58:13,204 INFO L273 TraceCheckUtils]: 45: Hoare triple {5391#(= main_~j~0 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5391#(= main_~j~0 0)} is VALID [2018-11-18 23:58:13,205 INFO L273 TraceCheckUtils]: 46: Hoare triple {5391#(= main_~j~0 0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {5391#(= main_~j~0 0)} is VALID [2018-11-18 23:58:13,205 INFO L273 TraceCheckUtils]: 47: Hoare triple {5391#(= main_~j~0 0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5392#(<= 1 main_~j~0)} is VALID [2018-11-18 23:58:13,205 INFO L273 TraceCheckUtils]: 48: Hoare triple {5392#(<= 1 main_~j~0)} assume true; {5392#(<= 1 main_~j~0)} is VALID [2018-11-18 23:58:13,206 INFO L273 TraceCheckUtils]: 49: Hoare triple {5392#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,206 INFO L273 TraceCheckUtils]: 50: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,207 INFO L273 TraceCheckUtils]: 51: Hoare triple {5393#(<= 2 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,207 INFO L273 TraceCheckUtils]: 52: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume true; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,207 INFO L273 TraceCheckUtils]: 53: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,208 INFO L273 TraceCheckUtils]: 54: Hoare triple {5393#(<= 2 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,208 INFO L273 TraceCheckUtils]: 55: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume true; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,209 INFO L273 TraceCheckUtils]: 56: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,209 INFO L273 TraceCheckUtils]: 57: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume true; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,210 INFO L273 TraceCheckUtils]: 58: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,211 INFO L273 TraceCheckUtils]: 59: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,211 INFO L273 TraceCheckUtils]: 60: Hoare triple {5393#(<= 2 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,212 INFO L273 TraceCheckUtils]: 61: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume true; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,212 INFO L273 TraceCheckUtils]: 62: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,213 INFO L273 TraceCheckUtils]: 63: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,213 INFO L273 TraceCheckUtils]: 64: Hoare triple {5393#(<= 2 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,214 INFO L273 TraceCheckUtils]: 65: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume true; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,214 INFO L273 TraceCheckUtils]: 66: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,215 INFO L273 TraceCheckUtils]: 67: Hoare triple {5393#(<= 2 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,215 INFO L273 TraceCheckUtils]: 68: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume true; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,216 INFO L273 TraceCheckUtils]: 69: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,216 INFO L273 TraceCheckUtils]: 70: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume true; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,217 INFO L273 TraceCheckUtils]: 71: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,217 INFO L273 TraceCheckUtils]: 72: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,218 INFO L273 TraceCheckUtils]: 73: Hoare triple {5393#(<= 2 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,219 INFO L273 TraceCheckUtils]: 74: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume true; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,219 INFO L273 TraceCheckUtils]: 75: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,220 INFO L273 TraceCheckUtils]: 76: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,220 INFO L273 TraceCheckUtils]: 77: Hoare triple {5393#(<= 2 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,221 INFO L273 TraceCheckUtils]: 78: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume true; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,221 INFO L273 TraceCheckUtils]: 79: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,222 INFO L273 TraceCheckUtils]: 80: Hoare triple {5393#(<= 2 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,222 INFO L273 TraceCheckUtils]: 81: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume true; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,223 INFO L273 TraceCheckUtils]: 82: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,223 INFO L273 TraceCheckUtils]: 83: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume true; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,224 INFO L273 TraceCheckUtils]: 84: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,224 INFO L273 TraceCheckUtils]: 85: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,225 INFO L273 TraceCheckUtils]: 86: Hoare triple {5393#(<= 2 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,225 INFO L273 TraceCheckUtils]: 87: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume true; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,226 INFO L273 TraceCheckUtils]: 88: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,227 INFO L273 TraceCheckUtils]: 89: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,227 INFO L273 TraceCheckUtils]: 90: Hoare triple {5393#(<= 2 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,228 INFO L273 TraceCheckUtils]: 91: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume true; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,228 INFO L273 TraceCheckUtils]: 92: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,229 INFO L273 TraceCheckUtils]: 93: Hoare triple {5393#(<= 2 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,229 INFO L273 TraceCheckUtils]: 94: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume true; {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,230 INFO L273 TraceCheckUtils]: 95: Hoare triple {5393#(<= 2 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {5393#(<= 2 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,230 INFO L273 TraceCheckUtils]: 96: Hoare triple {5393#(<= 2 main_~edgecount~0)} ~i~0 := 0; {5394#(and (<= 2 main_~edgecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:58:13,231 INFO L273 TraceCheckUtils]: 97: Hoare triple {5394#(and (<= 2 main_~edgecount~0) (= main_~i~0 0))} assume true; {5394#(and (<= 2 main_~edgecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:58:13,232 INFO L273 TraceCheckUtils]: 98: Hoare triple {5394#(and (<= 2 main_~edgecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {5394#(and (<= 2 main_~edgecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:58:13,233 INFO L273 TraceCheckUtils]: 99: Hoare triple {5394#(and (<= 2 main_~edgecount~0) (= main_~i~0 0))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {5394#(and (<= 2 main_~edgecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:58:13,234 INFO L273 TraceCheckUtils]: 100: Hoare triple {5394#(and (<= 2 main_~edgecount~0) (= main_~i~0 0))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5395#(<= (+ main_~i~0 1) main_~edgecount~0)} is VALID [2018-11-18 23:58:13,234 INFO L273 TraceCheckUtils]: 101: Hoare triple {5395#(<= (+ main_~i~0 1) main_~edgecount~0)} assume true; {5395#(<= (+ main_~i~0 1) main_~edgecount~0)} is VALID [2018-11-18 23:58:13,235 INFO L273 TraceCheckUtils]: 102: Hoare triple {5395#(<= (+ main_~i~0 1) main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {5390#false} is VALID [2018-11-18 23:58:13,235 INFO L273 TraceCheckUtils]: 103: Hoare triple {5390#false} ~i~0 := 0; {5390#false} is VALID [2018-11-18 23:58:13,235 INFO L273 TraceCheckUtils]: 104: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-18 23:58:13,236 INFO L273 TraceCheckUtils]: 105: Hoare triple {5390#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5390#false} is VALID [2018-11-18 23:58:13,236 INFO L256 TraceCheckUtils]: 106: Hoare triple {5390#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {5390#false} is VALID [2018-11-18 23:58:13,236 INFO L273 TraceCheckUtils]: 107: Hoare triple {5390#false} ~cond := #in~cond; {5390#false} is VALID [2018-11-18 23:58:13,236 INFO L273 TraceCheckUtils]: 108: Hoare triple {5390#false} assume 0 == ~cond; {5390#false} is VALID [2018-11-18 23:58:13,237 INFO L273 TraceCheckUtils]: 109: Hoare triple {5390#false} assume !false; {5390#false} is VALID [2018-11-18 23:58:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 124 proven. 58 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-18 23:58:13,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:58:13,246 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:58:13,258 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:58:13,327 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 23:58:13,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:58:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:13,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:58:13,517 INFO L256 TraceCheckUtils]: 0: Hoare triple {5389#true} call ULTIMATE.init(); {5389#true} is VALID [2018-11-18 23:58:13,518 INFO L273 TraceCheckUtils]: 1: Hoare triple {5389#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {5389#true} is VALID [2018-11-18 23:58:13,518 INFO L273 TraceCheckUtils]: 2: Hoare triple {5389#true} assume true; {5389#true} is VALID [2018-11-18 23:58:13,518 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5389#true} {5389#true} #108#return; {5389#true} is VALID [2018-11-18 23:58:13,518 INFO L256 TraceCheckUtils]: 4: Hoare triple {5389#true} call #t~ret18 := main(); {5389#true} is VALID [2018-11-18 23:58:13,521 INFO L273 TraceCheckUtils]: 5: Hoare triple {5389#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,522 INFO L273 TraceCheckUtils]: 6: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume true; {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,522 INFO L273 TraceCheckUtils]: 7: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,523 INFO L273 TraceCheckUtils]: 8: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,523 INFO L273 TraceCheckUtils]: 9: Hoare triple {5414#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,524 INFO L273 TraceCheckUtils]: 10: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume true; {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,524 INFO L273 TraceCheckUtils]: 11: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,525 INFO L273 TraceCheckUtils]: 12: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,525 INFO L273 TraceCheckUtils]: 13: Hoare triple {5414#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,526 INFO L273 TraceCheckUtils]: 14: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume true; {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,526 INFO L273 TraceCheckUtils]: 15: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,527 INFO L273 TraceCheckUtils]: 16: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,528 INFO L273 TraceCheckUtils]: 17: Hoare triple {5414#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,528 INFO L273 TraceCheckUtils]: 18: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume true; {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,529 INFO L273 TraceCheckUtils]: 19: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,529 INFO L273 TraceCheckUtils]: 20: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,530 INFO L273 TraceCheckUtils]: 21: Hoare triple {5414#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,530 INFO L273 TraceCheckUtils]: 22: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume true; {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,531 INFO L273 TraceCheckUtils]: 23: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,531 INFO L273 TraceCheckUtils]: 24: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,532 INFO L273 TraceCheckUtils]: 25: Hoare triple {5414#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,532 INFO L273 TraceCheckUtils]: 26: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume true; {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,533 INFO L273 TraceCheckUtils]: 27: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,533 INFO L273 TraceCheckUtils]: 28: Hoare triple {5414#(<= 20 main_~edgecount~0)} ~i~0 := 0; {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,534 INFO L273 TraceCheckUtils]: 29: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume true; {5414#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:13,535 INFO L273 TraceCheckUtils]: 30: Hoare triple {5414#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5490#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:13,535 INFO L273 TraceCheckUtils]: 31: Hoare triple {5490#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume true; {5490#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:13,536 INFO L273 TraceCheckUtils]: 32: Hoare triple {5490#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5490#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:13,537 INFO L273 TraceCheckUtils]: 33: Hoare triple {5490#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {5490#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:13,538 INFO L273 TraceCheckUtils]: 34: Hoare triple {5490#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5503#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:58:13,539 INFO L273 TraceCheckUtils]: 35: Hoare triple {5503#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume true; {5503#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:58:13,540 INFO L273 TraceCheckUtils]: 36: Hoare triple {5503#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5503#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:58:13,540 INFO L273 TraceCheckUtils]: 37: Hoare triple {5503#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {5503#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:58:13,541 INFO L273 TraceCheckUtils]: 38: Hoare triple {5503#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5516#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:58:13,542 INFO L273 TraceCheckUtils]: 39: Hoare triple {5516#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} assume true; {5516#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:58:13,542 INFO L273 TraceCheckUtils]: 40: Hoare triple {5516#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} assume !(~j~0 < ~edgecount~0); {5390#false} is VALID [2018-11-18 23:58:13,543 INFO L273 TraceCheckUtils]: 41: Hoare triple {5390#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5390#false} is VALID [2018-11-18 23:58:13,543 INFO L273 TraceCheckUtils]: 42: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-18 23:58:13,543 INFO L273 TraceCheckUtils]: 43: Hoare triple {5390#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5390#false} is VALID [2018-11-18 23:58:13,543 INFO L273 TraceCheckUtils]: 44: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-18 23:58:13,544 INFO L273 TraceCheckUtils]: 45: Hoare triple {5390#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5390#false} is VALID [2018-11-18 23:58:13,544 INFO L273 TraceCheckUtils]: 46: Hoare triple {5390#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {5390#false} is VALID [2018-11-18 23:58:13,544 INFO L273 TraceCheckUtils]: 47: Hoare triple {5390#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5390#false} is VALID [2018-11-18 23:58:13,545 INFO L273 TraceCheckUtils]: 48: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-18 23:58:13,545 INFO L273 TraceCheckUtils]: 49: Hoare triple {5390#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5390#false} is VALID [2018-11-18 23:58:13,545 INFO L273 TraceCheckUtils]: 50: Hoare triple {5390#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {5390#false} is VALID [2018-11-18 23:58:13,545 INFO L273 TraceCheckUtils]: 51: Hoare triple {5390#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5390#false} is VALID [2018-11-18 23:58:13,545 INFO L273 TraceCheckUtils]: 52: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-18 23:58:13,546 INFO L273 TraceCheckUtils]: 53: Hoare triple {5390#false} assume !(~j~0 < ~edgecount~0); {5390#false} is VALID [2018-11-18 23:58:13,546 INFO L273 TraceCheckUtils]: 54: Hoare triple {5390#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5390#false} is VALID [2018-11-18 23:58:13,546 INFO L273 TraceCheckUtils]: 55: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-18 23:58:13,546 INFO L273 TraceCheckUtils]: 56: Hoare triple {5390#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5390#false} is VALID [2018-11-18 23:58:13,546 INFO L273 TraceCheckUtils]: 57: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-18 23:58:13,547 INFO L273 TraceCheckUtils]: 58: Hoare triple {5390#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5390#false} is VALID [2018-11-18 23:58:13,547 INFO L273 TraceCheckUtils]: 59: Hoare triple {5390#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {5390#false} is VALID [2018-11-18 23:58:13,547 INFO L273 TraceCheckUtils]: 60: Hoare triple {5390#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5390#false} is VALID [2018-11-18 23:58:13,547 INFO L273 TraceCheckUtils]: 61: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-18 23:58:13,547 INFO L273 TraceCheckUtils]: 62: Hoare triple {5390#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5390#false} is VALID [2018-11-18 23:58:13,547 INFO L273 TraceCheckUtils]: 63: Hoare triple {5390#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {5390#false} is VALID [2018-11-18 23:58:13,548 INFO L273 TraceCheckUtils]: 64: Hoare triple {5390#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5390#false} is VALID [2018-11-18 23:58:13,548 INFO L273 TraceCheckUtils]: 65: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-18 23:58:13,548 INFO L273 TraceCheckUtils]: 66: Hoare triple {5390#false} assume !(~j~0 < ~edgecount~0); {5390#false} is VALID [2018-11-18 23:58:13,548 INFO L273 TraceCheckUtils]: 67: Hoare triple {5390#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5390#false} is VALID [2018-11-18 23:58:13,548 INFO L273 TraceCheckUtils]: 68: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-18 23:58:13,548 INFO L273 TraceCheckUtils]: 69: Hoare triple {5390#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5390#false} is VALID [2018-11-18 23:58:13,548 INFO L273 TraceCheckUtils]: 70: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-18 23:58:13,548 INFO L273 TraceCheckUtils]: 71: Hoare triple {5390#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5390#false} is VALID [2018-11-18 23:58:13,549 INFO L273 TraceCheckUtils]: 72: Hoare triple {5390#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {5390#false} is VALID [2018-11-18 23:58:13,549 INFO L273 TraceCheckUtils]: 73: Hoare triple {5390#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5390#false} is VALID [2018-11-18 23:58:13,549 INFO L273 TraceCheckUtils]: 74: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-18 23:58:13,549 INFO L273 TraceCheckUtils]: 75: Hoare triple {5390#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5390#false} is VALID [2018-11-18 23:58:13,549 INFO L273 TraceCheckUtils]: 76: Hoare triple {5390#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {5390#false} is VALID [2018-11-18 23:58:13,549 INFO L273 TraceCheckUtils]: 77: Hoare triple {5390#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5390#false} is VALID [2018-11-18 23:58:13,549 INFO L273 TraceCheckUtils]: 78: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-18 23:58:13,549 INFO L273 TraceCheckUtils]: 79: Hoare triple {5390#false} assume !(~j~0 < ~edgecount~0); {5390#false} is VALID [2018-11-18 23:58:13,550 INFO L273 TraceCheckUtils]: 80: Hoare triple {5390#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5390#false} is VALID [2018-11-18 23:58:13,550 INFO L273 TraceCheckUtils]: 81: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-18 23:58:13,550 INFO L273 TraceCheckUtils]: 82: Hoare triple {5390#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5390#false} is VALID [2018-11-18 23:58:13,550 INFO L273 TraceCheckUtils]: 83: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-18 23:58:13,550 INFO L273 TraceCheckUtils]: 84: Hoare triple {5390#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5390#false} is VALID [2018-11-18 23:58:13,550 INFO L273 TraceCheckUtils]: 85: Hoare triple {5390#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {5390#false} is VALID [2018-11-18 23:58:13,550 INFO L273 TraceCheckUtils]: 86: Hoare triple {5390#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5390#false} is VALID [2018-11-18 23:58:13,550 INFO L273 TraceCheckUtils]: 87: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-18 23:58:13,551 INFO L273 TraceCheckUtils]: 88: Hoare triple {5390#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5390#false} is VALID [2018-11-18 23:58:13,551 INFO L273 TraceCheckUtils]: 89: Hoare triple {5390#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {5390#false} is VALID [2018-11-18 23:58:13,551 INFO L273 TraceCheckUtils]: 90: Hoare triple {5390#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5390#false} is VALID [2018-11-18 23:58:13,551 INFO L273 TraceCheckUtils]: 91: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-18 23:58:13,551 INFO L273 TraceCheckUtils]: 92: Hoare triple {5390#false} assume !(~j~0 < ~edgecount~0); {5390#false} is VALID [2018-11-18 23:58:13,551 INFO L273 TraceCheckUtils]: 93: Hoare triple {5390#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5390#false} is VALID [2018-11-18 23:58:13,551 INFO L273 TraceCheckUtils]: 94: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-18 23:58:13,551 INFO L273 TraceCheckUtils]: 95: Hoare triple {5390#false} assume !(~i~0 < ~nodecount~0); {5390#false} is VALID [2018-11-18 23:58:13,551 INFO L273 TraceCheckUtils]: 96: Hoare triple {5390#false} ~i~0 := 0; {5390#false} is VALID [2018-11-18 23:58:13,552 INFO L273 TraceCheckUtils]: 97: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-18 23:58:13,552 INFO L273 TraceCheckUtils]: 98: Hoare triple {5390#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {5390#false} is VALID [2018-11-18 23:58:13,552 INFO L273 TraceCheckUtils]: 99: Hoare triple {5390#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {5390#false} is VALID [2018-11-18 23:58:13,552 INFO L273 TraceCheckUtils]: 100: Hoare triple {5390#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5390#false} is VALID [2018-11-18 23:58:13,552 INFO L273 TraceCheckUtils]: 101: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-18 23:58:13,552 INFO L273 TraceCheckUtils]: 102: Hoare triple {5390#false} assume !(~i~0 < ~edgecount~0); {5390#false} is VALID [2018-11-18 23:58:13,552 INFO L273 TraceCheckUtils]: 103: Hoare triple {5390#false} ~i~0 := 0; {5390#false} is VALID [2018-11-18 23:58:13,552 INFO L273 TraceCheckUtils]: 104: Hoare triple {5390#false} assume true; {5390#false} is VALID [2018-11-18 23:58:13,553 INFO L273 TraceCheckUtils]: 105: Hoare triple {5390#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5390#false} is VALID [2018-11-18 23:58:13,553 INFO L256 TraceCheckUtils]: 106: Hoare triple {5390#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {5390#false} is VALID [2018-11-18 23:58:13,553 INFO L273 TraceCheckUtils]: 107: Hoare triple {5390#false} ~cond := #in~cond; {5390#false} is VALID [2018-11-18 23:58:13,553 INFO L273 TraceCheckUtils]: 108: Hoare triple {5390#false} assume 0 == ~cond; {5390#false} is VALID [2018-11-18 23:58:13,553 INFO L273 TraceCheckUtils]: 109: Hoare triple {5390#false} assume !false; {5390#false} is VALID [2018-11-18 23:58:13,562 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 114 proven. 8 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-11-18 23:58:13,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:58:13,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-11-18 23:58:13,584 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 110 [2018-11-18 23:58:13,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:58:13,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 23:58:13,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:13,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 23:58:13,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 23:58:13,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-18 23:58:13,671 INFO L87 Difference]: Start difference. First operand 115 states and 133 transitions. Second operand 11 states. [2018-11-18 23:58:14,967 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-18 23:58:15,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:15,787 INFO L93 Difference]: Finished difference Result 233 states and 283 transitions. [2018-11-18 23:58:15,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 23:58:15,787 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 110 [2018-11-18 23:58:15,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:58:15,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 23:58:15,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 161 transitions. [2018-11-18 23:58:15,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 23:58:15,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 161 transitions. [2018-11-18 23:58:15,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 161 transitions. [2018-11-18 23:58:16,057 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:16,061 INFO L225 Difference]: With dead ends: 233 [2018-11-18 23:58:16,062 INFO L226 Difference]: Without dead ends: 159 [2018-11-18 23:58:16,063 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=175, Invalid=425, Unknown=0, NotChecked=0, Total=600 [2018-11-18 23:58:16,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-18 23:58:16,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 139. [2018-11-18 23:58:16,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:58:16,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand 139 states. [2018-11-18 23:58:16,340 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 139 states. [2018-11-18 23:58:16,340 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 139 states. [2018-11-18 23:58:16,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:16,344 INFO L93 Difference]: Finished difference Result 159 states and 189 transitions. [2018-11-18 23:58:16,344 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 189 transitions. [2018-11-18 23:58:16,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:16,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:16,345 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 159 states. [2018-11-18 23:58:16,346 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 159 states. [2018-11-18 23:58:16,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:16,350 INFO L93 Difference]: Finished difference Result 159 states and 189 transitions. [2018-11-18 23:58:16,350 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 189 transitions. [2018-11-18 23:58:16,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:16,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:16,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:58:16,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:58:16,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-18 23:58:16,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 162 transitions. [2018-11-18 23:58:16,355 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 162 transitions. Word has length 110 [2018-11-18 23:58:16,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:58:16,355 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 162 transitions. [2018-11-18 23:58:16,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 23:58:16,355 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 162 transitions. [2018-11-18 23:58:16,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-18 23:58:16,357 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:58:16,357 INFO L375 BasicCegarLoop]: trace histogram [20, 15, 15, 15, 6, 6, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:58:16,358 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:58:16,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:58:16,358 INFO L82 PathProgramCache]: Analyzing trace with hash 415627454, now seen corresponding path program 3 times [2018-11-18 23:58:16,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:58:16,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:58:16,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:16,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:58:16,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:16,942 INFO L256 TraceCheckUtils]: 0: Hoare triple {6569#true} call ULTIMATE.init(); {6569#true} is VALID [2018-11-18 23:58:16,942 INFO L273 TraceCheckUtils]: 1: Hoare triple {6569#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {6569#true} is VALID [2018-11-18 23:58:16,943 INFO L273 TraceCheckUtils]: 2: Hoare triple {6569#true} assume true; {6569#true} is VALID [2018-11-18 23:58:16,943 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6569#true} {6569#true} #108#return; {6569#true} is VALID [2018-11-18 23:58:16,943 INFO L256 TraceCheckUtils]: 4: Hoare triple {6569#true} call #t~ret18 := main(); {6569#true} is VALID [2018-11-18 23:58:16,944 INFO L273 TraceCheckUtils]: 5: Hoare triple {6569#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,944 INFO L273 TraceCheckUtils]: 6: Hoare triple {6571#(= main_~edgecount~0 20)} assume true; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,946 INFO L273 TraceCheckUtils]: 7: Hoare triple {6571#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,946 INFO L273 TraceCheckUtils]: 8: Hoare triple {6571#(= main_~edgecount~0 20)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,948 INFO L273 TraceCheckUtils]: 9: Hoare triple {6571#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,948 INFO L273 TraceCheckUtils]: 10: Hoare triple {6571#(= main_~edgecount~0 20)} assume true; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,951 INFO L273 TraceCheckUtils]: 11: Hoare triple {6571#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,951 INFO L273 TraceCheckUtils]: 12: Hoare triple {6571#(= main_~edgecount~0 20)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,954 INFO L273 TraceCheckUtils]: 13: Hoare triple {6571#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,954 INFO L273 TraceCheckUtils]: 14: Hoare triple {6571#(= main_~edgecount~0 20)} assume true; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,957 INFO L273 TraceCheckUtils]: 15: Hoare triple {6571#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,957 INFO L273 TraceCheckUtils]: 16: Hoare triple {6571#(= main_~edgecount~0 20)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,959 INFO L273 TraceCheckUtils]: 17: Hoare triple {6571#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,959 INFO L273 TraceCheckUtils]: 18: Hoare triple {6571#(= main_~edgecount~0 20)} assume true; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,961 INFO L273 TraceCheckUtils]: 19: Hoare triple {6571#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,961 INFO L273 TraceCheckUtils]: 20: Hoare triple {6571#(= main_~edgecount~0 20)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,963 INFO L273 TraceCheckUtils]: 21: Hoare triple {6571#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,963 INFO L273 TraceCheckUtils]: 22: Hoare triple {6571#(= main_~edgecount~0 20)} assume true; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,966 INFO L273 TraceCheckUtils]: 23: Hoare triple {6571#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,966 INFO L273 TraceCheckUtils]: 24: Hoare triple {6571#(= main_~edgecount~0 20)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,968 INFO L273 TraceCheckUtils]: 25: Hoare triple {6571#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,968 INFO L273 TraceCheckUtils]: 26: Hoare triple {6571#(= main_~edgecount~0 20)} assume true; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,970 INFO L273 TraceCheckUtils]: 27: Hoare triple {6571#(= main_~edgecount~0 20)} assume !(~i~0 < ~nodecount~0); {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,970 INFO L273 TraceCheckUtils]: 28: Hoare triple {6571#(= main_~edgecount~0 20)} ~i~0 := 0; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,972 INFO L273 TraceCheckUtils]: 29: Hoare triple {6571#(= main_~edgecount~0 20)} assume true; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,972 INFO L273 TraceCheckUtils]: 30: Hoare triple {6571#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,974 INFO L273 TraceCheckUtils]: 31: Hoare triple {6571#(= main_~edgecount~0 20)} assume true; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,974 INFO L273 TraceCheckUtils]: 32: Hoare triple {6571#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,977 INFO L273 TraceCheckUtils]: 33: Hoare triple {6571#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,977 INFO L273 TraceCheckUtils]: 34: Hoare triple {6571#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,980 INFO L273 TraceCheckUtils]: 35: Hoare triple {6571#(= main_~edgecount~0 20)} assume true; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,980 INFO L273 TraceCheckUtils]: 36: Hoare triple {6571#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,983 INFO L273 TraceCheckUtils]: 37: Hoare triple {6571#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,983 INFO L273 TraceCheckUtils]: 38: Hoare triple {6571#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,985 INFO L273 TraceCheckUtils]: 39: Hoare triple {6571#(= main_~edgecount~0 20)} assume true; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,985 INFO L273 TraceCheckUtils]: 40: Hoare triple {6571#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,988 INFO L273 TraceCheckUtils]: 41: Hoare triple {6571#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,988 INFO L273 TraceCheckUtils]: 42: Hoare triple {6571#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,991 INFO L273 TraceCheckUtils]: 43: Hoare triple {6571#(= main_~edgecount~0 20)} assume true; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,991 INFO L273 TraceCheckUtils]: 44: Hoare triple {6571#(= main_~edgecount~0 20)} assume !(~j~0 < ~edgecount~0); {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,994 INFO L273 TraceCheckUtils]: 45: Hoare triple {6571#(= main_~edgecount~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,994 INFO L273 TraceCheckUtils]: 46: Hoare triple {6571#(= main_~edgecount~0 20)} assume true; {6571#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:16,997 INFO L273 TraceCheckUtils]: 47: Hoare triple {6571#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6572#(and (= main_~j~0 0) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:16,997 INFO L273 TraceCheckUtils]: 48: Hoare triple {6572#(and (= main_~j~0 0) (= main_~edgecount~0 20))} assume true; {6572#(and (= main_~j~0 0) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:16,999 INFO L273 TraceCheckUtils]: 49: Hoare triple {6572#(and (= main_~j~0 0) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6572#(and (= main_~j~0 0) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:16,999 INFO L273 TraceCheckUtils]: 50: Hoare triple {6572#(and (= main_~j~0 0) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {6572#(and (= main_~j~0 0) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:17,002 INFO L273 TraceCheckUtils]: 51: Hoare triple {6572#(and (= main_~j~0 0) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6573#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:17,002 INFO L273 TraceCheckUtils]: 52: Hoare triple {6573#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} assume true; {6573#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:17,004 INFO L273 TraceCheckUtils]: 53: Hoare triple {6573#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6573#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:17,004 INFO L273 TraceCheckUtils]: 54: Hoare triple {6573#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {6573#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:17,006 INFO L273 TraceCheckUtils]: 55: Hoare triple {6573#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6574#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:17,006 INFO L273 TraceCheckUtils]: 56: Hoare triple {6574#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} assume true; {6574#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:17,008 INFO L273 TraceCheckUtils]: 57: Hoare triple {6574#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6574#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:17,008 INFO L273 TraceCheckUtils]: 58: Hoare triple {6574#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {6574#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:17,010 INFO L273 TraceCheckUtils]: 59: Hoare triple {6574#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6575#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:17,011 INFO L273 TraceCheckUtils]: 60: Hoare triple {6575#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} assume true; {6575#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:17,012 INFO L273 TraceCheckUtils]: 61: Hoare triple {6575#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} assume !(~j~0 < ~edgecount~0); {6570#false} is VALID [2018-11-18 23:58:17,012 INFO L273 TraceCheckUtils]: 62: Hoare triple {6570#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6570#false} is VALID [2018-11-18 23:58:17,012 INFO L273 TraceCheckUtils]: 63: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-18 23:58:17,012 INFO L273 TraceCheckUtils]: 64: Hoare triple {6570#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6570#false} is VALID [2018-11-18 23:58:17,012 INFO L273 TraceCheckUtils]: 65: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-18 23:58:17,013 INFO L273 TraceCheckUtils]: 66: Hoare triple {6570#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6570#false} is VALID [2018-11-18 23:58:17,013 INFO L273 TraceCheckUtils]: 67: Hoare triple {6570#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {6570#false} is VALID [2018-11-18 23:58:17,013 INFO L273 TraceCheckUtils]: 68: Hoare triple {6570#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6570#false} is VALID [2018-11-18 23:58:17,013 INFO L273 TraceCheckUtils]: 69: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-18 23:58:17,013 INFO L273 TraceCheckUtils]: 70: Hoare triple {6570#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6570#false} is VALID [2018-11-18 23:58:17,013 INFO L273 TraceCheckUtils]: 71: Hoare triple {6570#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {6570#false} is VALID [2018-11-18 23:58:17,013 INFO L273 TraceCheckUtils]: 72: Hoare triple {6570#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6570#false} is VALID [2018-11-18 23:58:17,014 INFO L273 TraceCheckUtils]: 73: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-18 23:58:17,014 INFO L273 TraceCheckUtils]: 74: Hoare triple {6570#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6570#false} is VALID [2018-11-18 23:58:17,014 INFO L273 TraceCheckUtils]: 75: Hoare triple {6570#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {6570#false} is VALID [2018-11-18 23:58:17,014 INFO L273 TraceCheckUtils]: 76: Hoare triple {6570#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6570#false} is VALID [2018-11-18 23:58:17,014 INFO L273 TraceCheckUtils]: 77: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-18 23:58:17,014 INFO L273 TraceCheckUtils]: 78: Hoare triple {6570#false} assume !(~j~0 < ~edgecount~0); {6570#false} is VALID [2018-11-18 23:58:17,015 INFO L273 TraceCheckUtils]: 79: Hoare triple {6570#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6570#false} is VALID [2018-11-18 23:58:17,015 INFO L273 TraceCheckUtils]: 80: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-18 23:58:17,015 INFO L273 TraceCheckUtils]: 81: Hoare triple {6570#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6570#false} is VALID [2018-11-18 23:58:17,015 INFO L273 TraceCheckUtils]: 82: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-18 23:58:17,015 INFO L273 TraceCheckUtils]: 83: Hoare triple {6570#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6570#false} is VALID [2018-11-18 23:58:17,015 INFO L273 TraceCheckUtils]: 84: Hoare triple {6570#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {6570#false} is VALID [2018-11-18 23:58:17,016 INFO L273 TraceCheckUtils]: 85: Hoare triple {6570#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6570#false} is VALID [2018-11-18 23:58:17,016 INFO L273 TraceCheckUtils]: 86: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-18 23:58:17,016 INFO L273 TraceCheckUtils]: 87: Hoare triple {6570#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6570#false} is VALID [2018-11-18 23:58:17,016 INFO L273 TraceCheckUtils]: 88: Hoare triple {6570#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {6570#false} is VALID [2018-11-18 23:58:17,016 INFO L273 TraceCheckUtils]: 89: Hoare triple {6570#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6570#false} is VALID [2018-11-18 23:58:17,016 INFO L273 TraceCheckUtils]: 90: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-18 23:58:17,016 INFO L273 TraceCheckUtils]: 91: Hoare triple {6570#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6570#false} is VALID [2018-11-18 23:58:17,017 INFO L273 TraceCheckUtils]: 92: Hoare triple {6570#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {6570#false} is VALID [2018-11-18 23:58:17,017 INFO L273 TraceCheckUtils]: 93: Hoare triple {6570#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6570#false} is VALID [2018-11-18 23:58:17,017 INFO L273 TraceCheckUtils]: 94: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-18 23:58:17,017 INFO L273 TraceCheckUtils]: 95: Hoare triple {6570#false} assume !(~j~0 < ~edgecount~0); {6570#false} is VALID [2018-11-18 23:58:17,017 INFO L273 TraceCheckUtils]: 96: Hoare triple {6570#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6570#false} is VALID [2018-11-18 23:58:17,017 INFO L273 TraceCheckUtils]: 97: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-18 23:58:17,018 INFO L273 TraceCheckUtils]: 98: Hoare triple {6570#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6570#false} is VALID [2018-11-18 23:58:17,018 INFO L273 TraceCheckUtils]: 99: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-18 23:58:17,018 INFO L273 TraceCheckUtils]: 100: Hoare triple {6570#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6570#false} is VALID [2018-11-18 23:58:17,018 INFO L273 TraceCheckUtils]: 101: Hoare triple {6570#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {6570#false} is VALID [2018-11-18 23:58:17,018 INFO L273 TraceCheckUtils]: 102: Hoare triple {6570#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6570#false} is VALID [2018-11-18 23:58:17,018 INFO L273 TraceCheckUtils]: 103: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-18 23:58:17,019 INFO L273 TraceCheckUtils]: 104: Hoare triple {6570#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6570#false} is VALID [2018-11-18 23:58:17,019 INFO L273 TraceCheckUtils]: 105: Hoare triple {6570#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {6570#false} is VALID [2018-11-18 23:58:17,019 INFO L273 TraceCheckUtils]: 106: Hoare triple {6570#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6570#false} is VALID [2018-11-18 23:58:17,019 INFO L273 TraceCheckUtils]: 107: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-18 23:58:17,019 INFO L273 TraceCheckUtils]: 108: Hoare triple {6570#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6570#false} is VALID [2018-11-18 23:58:17,019 INFO L273 TraceCheckUtils]: 109: Hoare triple {6570#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {6570#false} is VALID [2018-11-18 23:58:17,020 INFO L273 TraceCheckUtils]: 110: Hoare triple {6570#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6570#false} is VALID [2018-11-18 23:58:17,020 INFO L273 TraceCheckUtils]: 111: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-18 23:58:17,020 INFO L273 TraceCheckUtils]: 112: Hoare triple {6570#false} assume !(~j~0 < ~edgecount~0); {6570#false} is VALID [2018-11-18 23:58:17,020 INFO L273 TraceCheckUtils]: 113: Hoare triple {6570#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6570#false} is VALID [2018-11-18 23:58:17,020 INFO L273 TraceCheckUtils]: 114: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-18 23:58:17,020 INFO L273 TraceCheckUtils]: 115: Hoare triple {6570#false} assume !(~i~0 < ~nodecount~0); {6570#false} is VALID [2018-11-18 23:58:17,020 INFO L273 TraceCheckUtils]: 116: Hoare triple {6570#false} ~i~0 := 0; {6570#false} is VALID [2018-11-18 23:58:17,021 INFO L273 TraceCheckUtils]: 117: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-18 23:58:17,021 INFO L273 TraceCheckUtils]: 118: Hoare triple {6570#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {6570#false} is VALID [2018-11-18 23:58:17,021 INFO L273 TraceCheckUtils]: 119: Hoare triple {6570#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {6570#false} is VALID [2018-11-18 23:58:17,021 INFO L273 TraceCheckUtils]: 120: Hoare triple {6570#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6570#false} is VALID [2018-11-18 23:58:17,021 INFO L273 TraceCheckUtils]: 121: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-18 23:58:17,021 INFO L273 TraceCheckUtils]: 122: Hoare triple {6570#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {6570#false} is VALID [2018-11-18 23:58:17,022 INFO L273 TraceCheckUtils]: 123: Hoare triple {6570#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {6570#false} is VALID [2018-11-18 23:58:17,022 INFO L273 TraceCheckUtils]: 124: Hoare triple {6570#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6570#false} is VALID [2018-11-18 23:58:17,022 INFO L273 TraceCheckUtils]: 125: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-18 23:58:17,022 INFO L273 TraceCheckUtils]: 126: Hoare triple {6570#false} assume !(~i~0 < ~edgecount~0); {6570#false} is VALID [2018-11-18 23:58:17,022 INFO L273 TraceCheckUtils]: 127: Hoare triple {6570#false} ~i~0 := 0; {6570#false} is VALID [2018-11-18 23:58:17,022 INFO L273 TraceCheckUtils]: 128: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-18 23:58:17,023 INFO L273 TraceCheckUtils]: 129: Hoare triple {6570#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6570#false} is VALID [2018-11-18 23:58:17,023 INFO L256 TraceCheckUtils]: 130: Hoare triple {6570#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {6570#false} is VALID [2018-11-18 23:58:17,023 INFO L273 TraceCheckUtils]: 131: Hoare triple {6570#false} ~cond := #in~cond; {6570#false} is VALID [2018-11-18 23:58:17,023 INFO L273 TraceCheckUtils]: 132: Hoare triple {6570#false} assume 0 == ~cond; {6570#false} is VALID [2018-11-18 23:58:17,023 INFO L273 TraceCheckUtils]: 133: Hoare triple {6570#false} assume !false; {6570#false} is VALID [2018-11-18 23:58:17,048 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 370 proven. 18 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-11-18 23:58:17,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:58:17,048 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:58:17,058 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 23:58:17,162 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-18 23:58:17,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:58:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:17,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:58:17,412 INFO L256 TraceCheckUtils]: 0: Hoare triple {6569#true} call ULTIMATE.init(); {6569#true} is VALID [2018-11-18 23:58:17,413 INFO L273 TraceCheckUtils]: 1: Hoare triple {6569#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {6569#true} is VALID [2018-11-18 23:58:17,413 INFO L273 TraceCheckUtils]: 2: Hoare triple {6569#true} assume true; {6569#true} is VALID [2018-11-18 23:58:17,413 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6569#true} {6569#true} #108#return; {6569#true} is VALID [2018-11-18 23:58:17,413 INFO L256 TraceCheckUtils]: 4: Hoare triple {6569#true} call #t~ret18 := main(); {6569#true} is VALID [2018-11-18 23:58:17,416 INFO L273 TraceCheckUtils]: 5: Hoare triple {6569#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,416 INFO L273 TraceCheckUtils]: 6: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,416 INFO L273 TraceCheckUtils]: 7: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,417 INFO L273 TraceCheckUtils]: 8: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,417 INFO L273 TraceCheckUtils]: 9: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,417 INFO L273 TraceCheckUtils]: 10: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,417 INFO L273 TraceCheckUtils]: 11: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,418 INFO L273 TraceCheckUtils]: 12: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,418 INFO L273 TraceCheckUtils]: 13: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,419 INFO L273 TraceCheckUtils]: 14: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,419 INFO L273 TraceCheckUtils]: 15: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,420 INFO L273 TraceCheckUtils]: 16: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,420 INFO L273 TraceCheckUtils]: 17: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,421 INFO L273 TraceCheckUtils]: 18: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,421 INFO L273 TraceCheckUtils]: 19: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,422 INFO L273 TraceCheckUtils]: 20: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,422 INFO L273 TraceCheckUtils]: 21: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,423 INFO L273 TraceCheckUtils]: 22: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,423 INFO L273 TraceCheckUtils]: 23: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,424 INFO L273 TraceCheckUtils]: 24: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,424 INFO L273 TraceCheckUtils]: 25: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,425 INFO L273 TraceCheckUtils]: 26: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,426 INFO L273 TraceCheckUtils]: 27: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,426 INFO L273 TraceCheckUtils]: 28: Hoare triple {6594#(<= 20 main_~edgecount~0)} ~i~0 := 0; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,427 INFO L273 TraceCheckUtils]: 29: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,427 INFO L273 TraceCheckUtils]: 30: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,428 INFO L273 TraceCheckUtils]: 31: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,428 INFO L273 TraceCheckUtils]: 32: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,429 INFO L273 TraceCheckUtils]: 33: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,429 INFO L273 TraceCheckUtils]: 34: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,430 INFO L273 TraceCheckUtils]: 35: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,430 INFO L273 TraceCheckUtils]: 36: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,431 INFO L273 TraceCheckUtils]: 37: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,431 INFO L273 TraceCheckUtils]: 38: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,432 INFO L273 TraceCheckUtils]: 39: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,432 INFO L273 TraceCheckUtils]: 40: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,433 INFO L273 TraceCheckUtils]: 41: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,433 INFO L273 TraceCheckUtils]: 42: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,434 INFO L273 TraceCheckUtils]: 43: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,434 INFO L273 TraceCheckUtils]: 44: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,435 INFO L273 TraceCheckUtils]: 45: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,435 INFO L273 TraceCheckUtils]: 46: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,436 INFO L273 TraceCheckUtils]: 47: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,436 INFO L273 TraceCheckUtils]: 48: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,437 INFO L273 TraceCheckUtils]: 49: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,437 INFO L273 TraceCheckUtils]: 50: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,438 INFO L273 TraceCheckUtils]: 51: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,438 INFO L273 TraceCheckUtils]: 52: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,439 INFO L273 TraceCheckUtils]: 53: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,439 INFO L273 TraceCheckUtils]: 54: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,440 INFO L273 TraceCheckUtils]: 55: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,440 INFO L273 TraceCheckUtils]: 56: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,441 INFO L273 TraceCheckUtils]: 57: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,441 INFO L273 TraceCheckUtils]: 58: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,442 INFO L273 TraceCheckUtils]: 59: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,442 INFO L273 TraceCheckUtils]: 60: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,443 INFO L273 TraceCheckUtils]: 61: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,444 INFO L273 TraceCheckUtils]: 62: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,444 INFO L273 TraceCheckUtils]: 63: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,445 INFO L273 TraceCheckUtils]: 64: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,445 INFO L273 TraceCheckUtils]: 65: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,446 INFO L273 TraceCheckUtils]: 66: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,446 INFO L273 TraceCheckUtils]: 67: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,447 INFO L273 TraceCheckUtils]: 68: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,447 INFO L273 TraceCheckUtils]: 69: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,448 INFO L273 TraceCheckUtils]: 70: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,448 INFO L273 TraceCheckUtils]: 71: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,449 INFO L273 TraceCheckUtils]: 72: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,449 INFO L273 TraceCheckUtils]: 73: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,450 INFO L273 TraceCheckUtils]: 74: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,450 INFO L273 TraceCheckUtils]: 75: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,451 INFO L273 TraceCheckUtils]: 76: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,451 INFO L273 TraceCheckUtils]: 77: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,452 INFO L273 TraceCheckUtils]: 78: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,452 INFO L273 TraceCheckUtils]: 79: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,453 INFO L273 TraceCheckUtils]: 80: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,453 INFO L273 TraceCheckUtils]: 81: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,453 INFO L273 TraceCheckUtils]: 82: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,454 INFO L273 TraceCheckUtils]: 83: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,454 INFO L273 TraceCheckUtils]: 84: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,455 INFO L273 TraceCheckUtils]: 85: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,455 INFO L273 TraceCheckUtils]: 86: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,456 INFO L273 TraceCheckUtils]: 87: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,456 INFO L273 TraceCheckUtils]: 88: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,457 INFO L273 TraceCheckUtils]: 89: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,457 INFO L273 TraceCheckUtils]: 90: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,458 INFO L273 TraceCheckUtils]: 91: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,458 INFO L273 TraceCheckUtils]: 92: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,459 INFO L273 TraceCheckUtils]: 93: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,459 INFO L273 TraceCheckUtils]: 94: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,460 INFO L273 TraceCheckUtils]: 95: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,460 INFO L273 TraceCheckUtils]: 96: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,461 INFO L273 TraceCheckUtils]: 97: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,473 INFO L273 TraceCheckUtils]: 98: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,475 INFO L273 TraceCheckUtils]: 99: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,475 INFO L273 TraceCheckUtils]: 100: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,477 INFO L273 TraceCheckUtils]: 101: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,477 INFO L273 TraceCheckUtils]: 102: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,477 INFO L273 TraceCheckUtils]: 103: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,478 INFO L273 TraceCheckUtils]: 104: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,479 INFO L273 TraceCheckUtils]: 105: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,479 INFO L273 TraceCheckUtils]: 106: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,479 INFO L273 TraceCheckUtils]: 107: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,480 INFO L273 TraceCheckUtils]: 108: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,480 INFO L273 TraceCheckUtils]: 109: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,480 INFO L273 TraceCheckUtils]: 110: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,480 INFO L273 TraceCheckUtils]: 111: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,481 INFO L273 TraceCheckUtils]: 112: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,481 INFO L273 TraceCheckUtils]: 113: Hoare triple {6594#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,481 INFO L273 TraceCheckUtils]: 114: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume true; {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,482 INFO L273 TraceCheckUtils]: 115: Hoare triple {6594#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {6594#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:17,483 INFO L273 TraceCheckUtils]: 116: Hoare triple {6594#(<= 20 main_~edgecount~0)} ~i~0 := 0; {6928#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-18 23:58:17,483 INFO L273 TraceCheckUtils]: 117: Hoare triple {6928#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} assume true; {6928#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-18 23:58:17,484 INFO L273 TraceCheckUtils]: 118: Hoare triple {6928#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {6928#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-18 23:58:17,485 INFO L273 TraceCheckUtils]: 119: Hoare triple {6928#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {6928#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-18 23:58:17,486 INFO L273 TraceCheckUtils]: 120: Hoare triple {6928#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6941#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-18 23:58:17,486 INFO L273 TraceCheckUtils]: 121: Hoare triple {6941#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} assume true; {6941#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-18 23:58:17,487 INFO L273 TraceCheckUtils]: 122: Hoare triple {6941#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {6941#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-18 23:58:17,489 INFO L273 TraceCheckUtils]: 123: Hoare triple {6941#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {6941#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-18 23:58:17,489 INFO L273 TraceCheckUtils]: 124: Hoare triple {6941#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6954#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2018-11-18 23:58:17,490 INFO L273 TraceCheckUtils]: 125: Hoare triple {6954#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} assume true; {6954#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2018-11-18 23:58:17,491 INFO L273 TraceCheckUtils]: 126: Hoare triple {6954#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} assume !(~i~0 < ~edgecount~0); {6570#false} is VALID [2018-11-18 23:58:17,491 INFO L273 TraceCheckUtils]: 127: Hoare triple {6570#false} ~i~0 := 0; {6570#false} is VALID [2018-11-18 23:58:17,491 INFO L273 TraceCheckUtils]: 128: Hoare triple {6570#false} assume true; {6570#false} is VALID [2018-11-18 23:58:17,491 INFO L273 TraceCheckUtils]: 129: Hoare triple {6570#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6570#false} is VALID [2018-11-18 23:58:17,492 INFO L256 TraceCheckUtils]: 130: Hoare triple {6570#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {6570#false} is VALID [2018-11-18 23:58:17,492 INFO L273 TraceCheckUtils]: 131: Hoare triple {6570#false} ~cond := #in~cond; {6570#false} is VALID [2018-11-18 23:58:17,492 INFO L273 TraceCheckUtils]: 132: Hoare triple {6570#false} assume 0 == ~cond; {6570#false} is VALID [2018-11-18 23:58:17,492 INFO L273 TraceCheckUtils]: 133: Hoare triple {6570#false} assume !false; {6570#false} is VALID [2018-11-18 23:58:17,505 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2018-11-18 23:58:17,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:58:17,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-11-18 23:58:17,526 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 134 [2018-11-18 23:58:17,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:58:17,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 23:58:17,607 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:17,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 23:58:17,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 23:58:17,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-18 23:58:17,609 INFO L87 Difference]: Start difference. First operand 139 states and 162 transitions. Second operand 11 states. [2018-11-18 23:58:18,218 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-11-18 23:58:19,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:19,413 INFO L93 Difference]: Finished difference Result 284 states and 344 transitions. [2018-11-18 23:58:19,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-18 23:58:19,413 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 134 [2018-11-18 23:58:19,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:58:19,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 23:58:19,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 222 transitions. [2018-11-18 23:58:19,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 23:58:19,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 222 transitions. [2018-11-18 23:58:19,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 222 transitions. [2018-11-18 23:58:20,110 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:20,114 INFO L225 Difference]: With dead ends: 284 [2018-11-18 23:58:20,114 INFO L226 Difference]: Without dead ends: 190 [2018-11-18 23:58:20,115 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=235, Invalid=415, Unknown=0, NotChecked=0, Total=650 [2018-11-18 23:58:20,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-18 23:58:20,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 163. [2018-11-18 23:58:20,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:58:20,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 190 states. Second operand 163 states. [2018-11-18 23:58:20,399 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand 163 states. [2018-11-18 23:58:20,399 INFO L87 Difference]: Start difference. First operand 190 states. Second operand 163 states. [2018-11-18 23:58:20,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:20,405 INFO L93 Difference]: Finished difference Result 190 states and 226 transitions. [2018-11-18 23:58:20,405 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 226 transitions. [2018-11-18 23:58:20,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:20,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:20,406 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand 190 states. [2018-11-18 23:58:20,407 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 190 states. [2018-11-18 23:58:20,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:20,411 INFO L93 Difference]: Finished difference Result 190 states and 226 transitions. [2018-11-18 23:58:20,412 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 226 transitions. [2018-11-18 23:58:20,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:20,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:20,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:58:20,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:58:20,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-18 23:58:20,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 191 transitions. [2018-11-18 23:58:20,416 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 191 transitions. Word has length 134 [2018-11-18 23:58:20,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:58:20,417 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 191 transitions. [2018-11-18 23:58:20,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 23:58:20,417 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 191 transitions. [2018-11-18 23:58:20,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-18 23:58:20,419 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:58:20,419 INFO L375 BasicCegarLoop]: trace histogram [25, 20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:58:20,419 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:58:20,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:58:20,420 INFO L82 PathProgramCache]: Analyzing trace with hash -539808240, now seen corresponding path program 4 times [2018-11-18 23:58:20,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:58:20,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:58:20,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:20,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:58:20,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:21,103 INFO L256 TraceCheckUtils]: 0: Hoare triple {7967#true} call ULTIMATE.init(); {7967#true} is VALID [2018-11-18 23:58:21,104 INFO L273 TraceCheckUtils]: 1: Hoare triple {7967#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {7967#true} is VALID [2018-11-18 23:58:21,104 INFO L273 TraceCheckUtils]: 2: Hoare triple {7967#true} assume true; {7967#true} is VALID [2018-11-18 23:58:21,104 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7967#true} {7967#true} #108#return; {7967#true} is VALID [2018-11-18 23:58:21,105 INFO L256 TraceCheckUtils]: 4: Hoare triple {7967#true} call #t~ret18 := main(); {7967#true} is VALID [2018-11-18 23:58:21,105 INFO L273 TraceCheckUtils]: 5: Hoare triple {7967#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,106 INFO L273 TraceCheckUtils]: 6: Hoare triple {7969#(= main_~edgecount~0 20)} assume true; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,106 INFO L273 TraceCheckUtils]: 7: Hoare triple {7969#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,106 INFO L273 TraceCheckUtils]: 8: Hoare triple {7969#(= main_~edgecount~0 20)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,106 INFO L273 TraceCheckUtils]: 9: Hoare triple {7969#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,107 INFO L273 TraceCheckUtils]: 10: Hoare triple {7969#(= main_~edgecount~0 20)} assume true; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,107 INFO L273 TraceCheckUtils]: 11: Hoare triple {7969#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,107 INFO L273 TraceCheckUtils]: 12: Hoare triple {7969#(= main_~edgecount~0 20)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,108 INFO L273 TraceCheckUtils]: 13: Hoare triple {7969#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,108 INFO L273 TraceCheckUtils]: 14: Hoare triple {7969#(= main_~edgecount~0 20)} assume true; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,108 INFO L273 TraceCheckUtils]: 15: Hoare triple {7969#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,109 INFO L273 TraceCheckUtils]: 16: Hoare triple {7969#(= main_~edgecount~0 20)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,109 INFO L273 TraceCheckUtils]: 17: Hoare triple {7969#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,110 INFO L273 TraceCheckUtils]: 18: Hoare triple {7969#(= main_~edgecount~0 20)} assume true; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,110 INFO L273 TraceCheckUtils]: 19: Hoare triple {7969#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,111 INFO L273 TraceCheckUtils]: 20: Hoare triple {7969#(= main_~edgecount~0 20)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,111 INFO L273 TraceCheckUtils]: 21: Hoare triple {7969#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,112 INFO L273 TraceCheckUtils]: 22: Hoare triple {7969#(= main_~edgecount~0 20)} assume true; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,112 INFO L273 TraceCheckUtils]: 23: Hoare triple {7969#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,113 INFO L273 TraceCheckUtils]: 24: Hoare triple {7969#(= main_~edgecount~0 20)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,113 INFO L273 TraceCheckUtils]: 25: Hoare triple {7969#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,114 INFO L273 TraceCheckUtils]: 26: Hoare triple {7969#(= main_~edgecount~0 20)} assume true; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,114 INFO L273 TraceCheckUtils]: 27: Hoare triple {7969#(= main_~edgecount~0 20)} assume !(~i~0 < ~nodecount~0); {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,115 INFO L273 TraceCheckUtils]: 28: Hoare triple {7969#(= main_~edgecount~0 20)} ~i~0 := 0; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,115 INFO L273 TraceCheckUtils]: 29: Hoare triple {7969#(= main_~edgecount~0 20)} assume true; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,116 INFO L273 TraceCheckUtils]: 30: Hoare triple {7969#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,116 INFO L273 TraceCheckUtils]: 31: Hoare triple {7969#(= main_~edgecount~0 20)} assume true; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,117 INFO L273 TraceCheckUtils]: 32: Hoare triple {7969#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,117 INFO L273 TraceCheckUtils]: 33: Hoare triple {7969#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,118 INFO L273 TraceCheckUtils]: 34: Hoare triple {7969#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,118 INFO L273 TraceCheckUtils]: 35: Hoare triple {7969#(= main_~edgecount~0 20)} assume true; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,119 INFO L273 TraceCheckUtils]: 36: Hoare triple {7969#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,119 INFO L273 TraceCheckUtils]: 37: Hoare triple {7969#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,120 INFO L273 TraceCheckUtils]: 38: Hoare triple {7969#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,120 INFO L273 TraceCheckUtils]: 39: Hoare triple {7969#(= main_~edgecount~0 20)} assume true; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,121 INFO L273 TraceCheckUtils]: 40: Hoare triple {7969#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,121 INFO L273 TraceCheckUtils]: 41: Hoare triple {7969#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,122 INFO L273 TraceCheckUtils]: 42: Hoare triple {7969#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,122 INFO L273 TraceCheckUtils]: 43: Hoare triple {7969#(= main_~edgecount~0 20)} assume true; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,123 INFO L273 TraceCheckUtils]: 44: Hoare triple {7969#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,142 INFO L273 TraceCheckUtils]: 45: Hoare triple {7969#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,142 INFO L273 TraceCheckUtils]: 46: Hoare triple {7969#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,143 INFO L273 TraceCheckUtils]: 47: Hoare triple {7969#(= main_~edgecount~0 20)} assume true; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,143 INFO L273 TraceCheckUtils]: 48: Hoare triple {7969#(= main_~edgecount~0 20)} assume !(~j~0 < ~edgecount~0); {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,143 INFO L273 TraceCheckUtils]: 49: Hoare triple {7969#(= main_~edgecount~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,143 INFO L273 TraceCheckUtils]: 50: Hoare triple {7969#(= main_~edgecount~0 20)} assume true; {7969#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:21,144 INFO L273 TraceCheckUtils]: 51: Hoare triple {7969#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7970#(and (= main_~j~0 0) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:21,144 INFO L273 TraceCheckUtils]: 52: Hoare triple {7970#(and (= main_~j~0 0) (= main_~edgecount~0 20))} assume true; {7970#(and (= main_~j~0 0) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:21,145 INFO L273 TraceCheckUtils]: 53: Hoare triple {7970#(and (= main_~j~0 0) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7970#(and (= main_~j~0 0) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:21,145 INFO L273 TraceCheckUtils]: 54: Hoare triple {7970#(and (= main_~j~0 0) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {7970#(and (= main_~j~0 0) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:21,146 INFO L273 TraceCheckUtils]: 55: Hoare triple {7970#(and (= main_~j~0 0) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7971#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:21,146 INFO L273 TraceCheckUtils]: 56: Hoare triple {7971#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} assume true; {7971#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:21,147 INFO L273 TraceCheckUtils]: 57: Hoare triple {7971#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7971#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:21,147 INFO L273 TraceCheckUtils]: 58: Hoare triple {7971#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {7971#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:21,148 INFO L273 TraceCheckUtils]: 59: Hoare triple {7971#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7972#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:21,149 INFO L273 TraceCheckUtils]: 60: Hoare triple {7972#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} assume true; {7972#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:21,150 INFO L273 TraceCheckUtils]: 61: Hoare triple {7972#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7972#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:21,150 INFO L273 TraceCheckUtils]: 62: Hoare triple {7972#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {7972#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:21,151 INFO L273 TraceCheckUtils]: 63: Hoare triple {7972#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7973#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:21,152 INFO L273 TraceCheckUtils]: 64: Hoare triple {7973#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} assume true; {7973#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:21,153 INFO L273 TraceCheckUtils]: 65: Hoare triple {7973#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7973#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:21,153 INFO L273 TraceCheckUtils]: 66: Hoare triple {7973#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {7973#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:21,154 INFO L273 TraceCheckUtils]: 67: Hoare triple {7973#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7974#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:21,155 INFO L273 TraceCheckUtils]: 68: Hoare triple {7974#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} assume true; {7974#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:21,156 INFO L273 TraceCheckUtils]: 69: Hoare triple {7974#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} assume !(~j~0 < ~edgecount~0); {7968#false} is VALID [2018-11-18 23:58:21,156 INFO L273 TraceCheckUtils]: 70: Hoare triple {7968#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7968#false} is VALID [2018-11-18 23:58:21,156 INFO L273 TraceCheckUtils]: 71: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-18 23:58:21,156 INFO L273 TraceCheckUtils]: 72: Hoare triple {7968#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7968#false} is VALID [2018-11-18 23:58:21,157 INFO L273 TraceCheckUtils]: 73: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-18 23:58:21,157 INFO L273 TraceCheckUtils]: 74: Hoare triple {7968#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7968#false} is VALID [2018-11-18 23:58:21,157 INFO L273 TraceCheckUtils]: 75: Hoare triple {7968#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {7968#false} is VALID [2018-11-18 23:58:21,157 INFO L273 TraceCheckUtils]: 76: Hoare triple {7968#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7968#false} is VALID [2018-11-18 23:58:21,157 INFO L273 TraceCheckUtils]: 77: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-18 23:58:21,158 INFO L273 TraceCheckUtils]: 78: Hoare triple {7968#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7968#false} is VALID [2018-11-18 23:58:21,158 INFO L273 TraceCheckUtils]: 79: Hoare triple {7968#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {7968#false} is VALID [2018-11-18 23:58:21,158 INFO L273 TraceCheckUtils]: 80: Hoare triple {7968#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7968#false} is VALID [2018-11-18 23:58:21,158 INFO L273 TraceCheckUtils]: 81: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-18 23:58:21,158 INFO L273 TraceCheckUtils]: 82: Hoare triple {7968#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7968#false} is VALID [2018-11-18 23:58:21,159 INFO L273 TraceCheckUtils]: 83: Hoare triple {7968#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {7968#false} is VALID [2018-11-18 23:58:21,159 INFO L273 TraceCheckUtils]: 84: Hoare triple {7968#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7968#false} is VALID [2018-11-18 23:58:21,159 INFO L273 TraceCheckUtils]: 85: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-18 23:58:21,159 INFO L273 TraceCheckUtils]: 86: Hoare triple {7968#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7968#false} is VALID [2018-11-18 23:58:21,159 INFO L273 TraceCheckUtils]: 87: Hoare triple {7968#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {7968#false} is VALID [2018-11-18 23:58:21,159 INFO L273 TraceCheckUtils]: 88: Hoare triple {7968#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7968#false} is VALID [2018-11-18 23:58:21,159 INFO L273 TraceCheckUtils]: 89: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-18 23:58:21,159 INFO L273 TraceCheckUtils]: 90: Hoare triple {7968#false} assume !(~j~0 < ~edgecount~0); {7968#false} is VALID [2018-11-18 23:58:21,160 INFO L273 TraceCheckUtils]: 91: Hoare triple {7968#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7968#false} is VALID [2018-11-18 23:58:21,160 INFO L273 TraceCheckUtils]: 92: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-18 23:58:21,160 INFO L273 TraceCheckUtils]: 93: Hoare triple {7968#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7968#false} is VALID [2018-11-18 23:58:21,160 INFO L273 TraceCheckUtils]: 94: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-18 23:58:21,160 INFO L273 TraceCheckUtils]: 95: Hoare triple {7968#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7968#false} is VALID [2018-11-18 23:58:21,160 INFO L273 TraceCheckUtils]: 96: Hoare triple {7968#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {7968#false} is VALID [2018-11-18 23:58:21,160 INFO L273 TraceCheckUtils]: 97: Hoare triple {7968#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7968#false} is VALID [2018-11-18 23:58:21,160 INFO L273 TraceCheckUtils]: 98: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-18 23:58:21,160 INFO L273 TraceCheckUtils]: 99: Hoare triple {7968#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7968#false} is VALID [2018-11-18 23:58:21,161 INFO L273 TraceCheckUtils]: 100: Hoare triple {7968#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {7968#false} is VALID [2018-11-18 23:58:21,161 INFO L273 TraceCheckUtils]: 101: Hoare triple {7968#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7968#false} is VALID [2018-11-18 23:58:21,161 INFO L273 TraceCheckUtils]: 102: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-18 23:58:21,161 INFO L273 TraceCheckUtils]: 103: Hoare triple {7968#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7968#false} is VALID [2018-11-18 23:58:21,161 INFO L273 TraceCheckUtils]: 104: Hoare triple {7968#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {7968#false} is VALID [2018-11-18 23:58:21,161 INFO L273 TraceCheckUtils]: 105: Hoare triple {7968#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7968#false} is VALID [2018-11-18 23:58:21,161 INFO L273 TraceCheckUtils]: 106: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-18 23:58:21,161 INFO L273 TraceCheckUtils]: 107: Hoare triple {7968#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7968#false} is VALID [2018-11-18 23:58:21,162 INFO L273 TraceCheckUtils]: 108: Hoare triple {7968#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {7968#false} is VALID [2018-11-18 23:58:21,162 INFO L273 TraceCheckUtils]: 109: Hoare triple {7968#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7968#false} is VALID [2018-11-18 23:58:21,162 INFO L273 TraceCheckUtils]: 110: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-18 23:58:21,162 INFO L273 TraceCheckUtils]: 111: Hoare triple {7968#false} assume !(~j~0 < ~edgecount~0); {7968#false} is VALID [2018-11-18 23:58:21,162 INFO L273 TraceCheckUtils]: 112: Hoare triple {7968#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7968#false} is VALID [2018-11-18 23:58:21,162 INFO L273 TraceCheckUtils]: 113: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-18 23:58:21,162 INFO L273 TraceCheckUtils]: 114: Hoare triple {7968#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7968#false} is VALID [2018-11-18 23:58:21,162 INFO L273 TraceCheckUtils]: 115: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-18 23:58:21,163 INFO L273 TraceCheckUtils]: 116: Hoare triple {7968#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7968#false} is VALID [2018-11-18 23:58:21,163 INFO L273 TraceCheckUtils]: 117: Hoare triple {7968#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {7968#false} is VALID [2018-11-18 23:58:21,163 INFO L273 TraceCheckUtils]: 118: Hoare triple {7968#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7968#false} is VALID [2018-11-18 23:58:21,163 INFO L273 TraceCheckUtils]: 119: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-18 23:58:21,163 INFO L273 TraceCheckUtils]: 120: Hoare triple {7968#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7968#false} is VALID [2018-11-18 23:58:21,163 INFO L273 TraceCheckUtils]: 121: Hoare triple {7968#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {7968#false} is VALID [2018-11-18 23:58:21,163 INFO L273 TraceCheckUtils]: 122: Hoare triple {7968#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7968#false} is VALID [2018-11-18 23:58:21,163 INFO L273 TraceCheckUtils]: 123: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-18 23:58:21,164 INFO L273 TraceCheckUtils]: 124: Hoare triple {7968#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7968#false} is VALID [2018-11-18 23:58:21,164 INFO L273 TraceCheckUtils]: 125: Hoare triple {7968#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {7968#false} is VALID [2018-11-18 23:58:21,164 INFO L273 TraceCheckUtils]: 126: Hoare triple {7968#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7968#false} is VALID [2018-11-18 23:58:21,164 INFO L273 TraceCheckUtils]: 127: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-18 23:58:21,164 INFO L273 TraceCheckUtils]: 128: Hoare triple {7968#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7968#false} is VALID [2018-11-18 23:58:21,164 INFO L273 TraceCheckUtils]: 129: Hoare triple {7968#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {7968#false} is VALID [2018-11-18 23:58:21,165 INFO L273 TraceCheckUtils]: 130: Hoare triple {7968#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7968#false} is VALID [2018-11-18 23:58:21,165 INFO L273 TraceCheckUtils]: 131: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-18 23:58:21,165 INFO L273 TraceCheckUtils]: 132: Hoare triple {7968#false} assume !(~j~0 < ~edgecount~0); {7968#false} is VALID [2018-11-18 23:58:21,165 INFO L273 TraceCheckUtils]: 133: Hoare triple {7968#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7968#false} is VALID [2018-11-18 23:58:21,165 INFO L273 TraceCheckUtils]: 134: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-18 23:58:21,165 INFO L273 TraceCheckUtils]: 135: Hoare triple {7968#false} assume !(~i~0 < ~nodecount~0); {7968#false} is VALID [2018-11-18 23:58:21,166 INFO L273 TraceCheckUtils]: 136: Hoare triple {7968#false} ~i~0 := 0; {7968#false} is VALID [2018-11-18 23:58:21,166 INFO L273 TraceCheckUtils]: 137: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-18 23:58:21,166 INFO L273 TraceCheckUtils]: 138: Hoare triple {7968#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {7968#false} is VALID [2018-11-18 23:58:21,166 INFO L273 TraceCheckUtils]: 139: Hoare triple {7968#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {7968#false} is VALID [2018-11-18 23:58:21,166 INFO L273 TraceCheckUtils]: 140: Hoare triple {7968#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7968#false} is VALID [2018-11-18 23:58:21,167 INFO L273 TraceCheckUtils]: 141: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-18 23:58:21,167 INFO L273 TraceCheckUtils]: 142: Hoare triple {7968#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {7968#false} is VALID [2018-11-18 23:58:21,167 INFO L273 TraceCheckUtils]: 143: Hoare triple {7968#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {7968#false} is VALID [2018-11-18 23:58:21,167 INFO L273 TraceCheckUtils]: 144: Hoare triple {7968#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7968#false} is VALID [2018-11-18 23:58:21,167 INFO L273 TraceCheckUtils]: 145: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-18 23:58:21,167 INFO L273 TraceCheckUtils]: 146: Hoare triple {7968#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {7968#false} is VALID [2018-11-18 23:58:21,168 INFO L273 TraceCheckUtils]: 147: Hoare triple {7968#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {7968#false} is VALID [2018-11-18 23:58:21,168 INFO L273 TraceCheckUtils]: 148: Hoare triple {7968#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7968#false} is VALID [2018-11-18 23:58:21,168 INFO L273 TraceCheckUtils]: 149: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-18 23:58:21,168 INFO L273 TraceCheckUtils]: 150: Hoare triple {7968#false} assume !(~i~0 < ~edgecount~0); {7968#false} is VALID [2018-11-18 23:58:21,168 INFO L273 TraceCheckUtils]: 151: Hoare triple {7968#false} ~i~0 := 0; {7968#false} is VALID [2018-11-18 23:58:21,168 INFO L273 TraceCheckUtils]: 152: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-18 23:58:21,169 INFO L273 TraceCheckUtils]: 153: Hoare triple {7968#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7968#false} is VALID [2018-11-18 23:58:21,169 INFO L256 TraceCheckUtils]: 154: Hoare triple {7968#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {7968#false} is VALID [2018-11-18 23:58:21,169 INFO L273 TraceCheckUtils]: 155: Hoare triple {7968#false} ~cond := #in~cond; {7968#false} is VALID [2018-11-18 23:58:21,169 INFO L273 TraceCheckUtils]: 156: Hoare triple {7968#false} assume 0 == ~cond; {7968#false} is VALID [2018-11-18 23:58:21,169 INFO L273 TraceCheckUtils]: 157: Hoare triple {7968#false} assume !false; {7968#false} is VALID [2018-11-18 23:58:21,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 594 proven. 32 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2018-11-18 23:58:21,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:58:21,188 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:58:21,196 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 23:58:21,275 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 23:58:21,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:58:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:21,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:58:21,623 INFO L256 TraceCheckUtils]: 0: Hoare triple {7967#true} call ULTIMATE.init(); {7967#true} is VALID [2018-11-18 23:58:21,624 INFO L273 TraceCheckUtils]: 1: Hoare triple {7967#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {7967#true} is VALID [2018-11-18 23:58:21,624 INFO L273 TraceCheckUtils]: 2: Hoare triple {7967#true} assume true; {7967#true} is VALID [2018-11-18 23:58:21,624 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7967#true} {7967#true} #108#return; {7967#true} is VALID [2018-11-18 23:58:21,624 INFO L256 TraceCheckUtils]: 4: Hoare triple {7967#true} call #t~ret18 := main(); {7967#true} is VALID [2018-11-18 23:58:21,625 INFO L273 TraceCheckUtils]: 5: Hoare triple {7967#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {7967#true} is VALID [2018-11-18 23:58:21,625 INFO L273 TraceCheckUtils]: 6: Hoare triple {7967#true} assume true; {7967#true} is VALID [2018-11-18 23:58:21,625 INFO L273 TraceCheckUtils]: 7: Hoare triple {7967#true} assume !!(~i~0 < ~nodecount~0); {7967#true} is VALID [2018-11-18 23:58:21,625 INFO L273 TraceCheckUtils]: 8: Hoare triple {7967#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7967#true} is VALID [2018-11-18 23:58:21,625 INFO L273 TraceCheckUtils]: 9: Hoare triple {7967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7967#true} is VALID [2018-11-18 23:58:21,626 INFO L273 TraceCheckUtils]: 10: Hoare triple {7967#true} assume true; {7967#true} is VALID [2018-11-18 23:58:21,626 INFO L273 TraceCheckUtils]: 11: Hoare triple {7967#true} assume !!(~i~0 < ~nodecount~0); {7967#true} is VALID [2018-11-18 23:58:21,626 INFO L273 TraceCheckUtils]: 12: Hoare triple {7967#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7967#true} is VALID [2018-11-18 23:58:21,626 INFO L273 TraceCheckUtils]: 13: Hoare triple {7967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7967#true} is VALID [2018-11-18 23:58:21,626 INFO L273 TraceCheckUtils]: 14: Hoare triple {7967#true} assume true; {7967#true} is VALID [2018-11-18 23:58:21,626 INFO L273 TraceCheckUtils]: 15: Hoare triple {7967#true} assume !!(~i~0 < ~nodecount~0); {7967#true} is VALID [2018-11-18 23:58:21,626 INFO L273 TraceCheckUtils]: 16: Hoare triple {7967#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7967#true} is VALID [2018-11-18 23:58:21,626 INFO L273 TraceCheckUtils]: 17: Hoare triple {7967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7967#true} is VALID [2018-11-18 23:58:21,627 INFO L273 TraceCheckUtils]: 18: Hoare triple {7967#true} assume true; {7967#true} is VALID [2018-11-18 23:58:21,627 INFO L273 TraceCheckUtils]: 19: Hoare triple {7967#true} assume !!(~i~0 < ~nodecount~0); {7967#true} is VALID [2018-11-18 23:58:21,627 INFO L273 TraceCheckUtils]: 20: Hoare triple {7967#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7967#true} is VALID [2018-11-18 23:58:21,627 INFO L273 TraceCheckUtils]: 21: Hoare triple {7967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7967#true} is VALID [2018-11-18 23:58:21,627 INFO L273 TraceCheckUtils]: 22: Hoare triple {7967#true} assume true; {7967#true} is VALID [2018-11-18 23:58:21,627 INFO L273 TraceCheckUtils]: 23: Hoare triple {7967#true} assume !!(~i~0 < ~nodecount~0); {7967#true} is VALID [2018-11-18 23:58:21,627 INFO L273 TraceCheckUtils]: 24: Hoare triple {7967#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7967#true} is VALID [2018-11-18 23:58:21,627 INFO L273 TraceCheckUtils]: 25: Hoare triple {7967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7967#true} is VALID [2018-11-18 23:58:21,627 INFO L273 TraceCheckUtils]: 26: Hoare triple {7967#true} assume true; {7967#true} is VALID [2018-11-18 23:58:21,628 INFO L273 TraceCheckUtils]: 27: Hoare triple {7967#true} assume !(~i~0 < ~nodecount~0); {7967#true} is VALID [2018-11-18 23:58:21,628 INFO L273 TraceCheckUtils]: 28: Hoare triple {7967#true} ~i~0 := 0; {7967#true} is VALID [2018-11-18 23:58:21,628 INFO L273 TraceCheckUtils]: 29: Hoare triple {7967#true} assume true; {7967#true} is VALID [2018-11-18 23:58:21,628 INFO L273 TraceCheckUtils]: 30: Hoare triple {7967#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {8068#(<= 0 main_~j~0)} is VALID [2018-11-18 23:58:21,629 INFO L273 TraceCheckUtils]: 31: Hoare triple {8068#(<= 0 main_~j~0)} assume true; {8068#(<= 0 main_~j~0)} is VALID [2018-11-18 23:58:21,629 INFO L273 TraceCheckUtils]: 32: Hoare triple {8068#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8068#(<= 0 main_~j~0)} is VALID [2018-11-18 23:58:21,629 INFO L273 TraceCheckUtils]: 33: Hoare triple {8068#(<= 0 main_~j~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {8068#(<= 0 main_~j~0)} is VALID [2018-11-18 23:58:21,630 INFO L273 TraceCheckUtils]: 34: Hoare triple {8068#(<= 0 main_~j~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8081#(<= 1 main_~j~0)} is VALID [2018-11-18 23:58:21,630 INFO L273 TraceCheckUtils]: 35: Hoare triple {8081#(<= 1 main_~j~0)} assume true; {8081#(<= 1 main_~j~0)} is VALID [2018-11-18 23:58:21,631 INFO L273 TraceCheckUtils]: 36: Hoare triple {8081#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8081#(<= 1 main_~j~0)} is VALID [2018-11-18 23:58:21,631 INFO L273 TraceCheckUtils]: 37: Hoare triple {8081#(<= 1 main_~j~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {8081#(<= 1 main_~j~0)} is VALID [2018-11-18 23:58:21,632 INFO L273 TraceCheckUtils]: 38: Hoare triple {8081#(<= 1 main_~j~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8094#(<= 2 main_~j~0)} is VALID [2018-11-18 23:58:21,632 INFO L273 TraceCheckUtils]: 39: Hoare triple {8094#(<= 2 main_~j~0)} assume true; {8094#(<= 2 main_~j~0)} is VALID [2018-11-18 23:58:21,633 INFO L273 TraceCheckUtils]: 40: Hoare triple {8094#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8094#(<= 2 main_~j~0)} is VALID [2018-11-18 23:58:21,633 INFO L273 TraceCheckUtils]: 41: Hoare triple {8094#(<= 2 main_~j~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {8094#(<= 2 main_~j~0)} is VALID [2018-11-18 23:58:21,634 INFO L273 TraceCheckUtils]: 42: Hoare triple {8094#(<= 2 main_~j~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8107#(<= 3 main_~j~0)} is VALID [2018-11-18 23:58:21,635 INFO L273 TraceCheckUtils]: 43: Hoare triple {8107#(<= 3 main_~j~0)} assume true; {8107#(<= 3 main_~j~0)} is VALID [2018-11-18 23:58:21,636 INFO L273 TraceCheckUtils]: 44: Hoare triple {8107#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,636 INFO L273 TraceCheckUtils]: 45: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,637 INFO L273 TraceCheckUtils]: 46: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,637 INFO L273 TraceCheckUtils]: 47: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,638 INFO L273 TraceCheckUtils]: 48: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,639 INFO L273 TraceCheckUtils]: 49: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,639 INFO L273 TraceCheckUtils]: 50: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,640 INFO L273 TraceCheckUtils]: 51: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,640 INFO L273 TraceCheckUtils]: 52: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,641 INFO L273 TraceCheckUtils]: 53: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,641 INFO L273 TraceCheckUtils]: 54: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,642 INFO L273 TraceCheckUtils]: 55: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,642 INFO L273 TraceCheckUtils]: 56: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,643 INFO L273 TraceCheckUtils]: 57: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,643 INFO L273 TraceCheckUtils]: 58: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,644 INFO L273 TraceCheckUtils]: 59: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,644 INFO L273 TraceCheckUtils]: 60: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,645 INFO L273 TraceCheckUtils]: 61: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,645 INFO L273 TraceCheckUtils]: 62: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,646 INFO L273 TraceCheckUtils]: 63: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,646 INFO L273 TraceCheckUtils]: 64: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,647 INFO L273 TraceCheckUtils]: 65: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,647 INFO L273 TraceCheckUtils]: 66: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,648 INFO L273 TraceCheckUtils]: 67: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,648 INFO L273 TraceCheckUtils]: 68: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,649 INFO L273 TraceCheckUtils]: 69: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,649 INFO L273 TraceCheckUtils]: 70: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,650 INFO L273 TraceCheckUtils]: 71: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,650 INFO L273 TraceCheckUtils]: 72: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,651 INFO L273 TraceCheckUtils]: 73: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,651 INFO L273 TraceCheckUtils]: 74: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,652 INFO L273 TraceCheckUtils]: 75: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,652 INFO L273 TraceCheckUtils]: 76: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,653 INFO L273 TraceCheckUtils]: 77: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,653 INFO L273 TraceCheckUtils]: 78: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,654 INFO L273 TraceCheckUtils]: 79: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,654 INFO L273 TraceCheckUtils]: 80: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,655 INFO L273 TraceCheckUtils]: 81: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,656 INFO L273 TraceCheckUtils]: 82: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,656 INFO L273 TraceCheckUtils]: 83: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,657 INFO L273 TraceCheckUtils]: 84: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,657 INFO L273 TraceCheckUtils]: 85: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,658 INFO L273 TraceCheckUtils]: 86: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,658 INFO L273 TraceCheckUtils]: 87: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,659 INFO L273 TraceCheckUtils]: 88: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,659 INFO L273 TraceCheckUtils]: 89: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,660 INFO L273 TraceCheckUtils]: 90: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,660 INFO L273 TraceCheckUtils]: 91: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,661 INFO L273 TraceCheckUtils]: 92: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,661 INFO L273 TraceCheckUtils]: 93: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,662 INFO L273 TraceCheckUtils]: 94: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,662 INFO L273 TraceCheckUtils]: 95: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,663 INFO L273 TraceCheckUtils]: 96: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,663 INFO L273 TraceCheckUtils]: 97: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,664 INFO L273 TraceCheckUtils]: 98: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,664 INFO L273 TraceCheckUtils]: 99: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,665 INFO L273 TraceCheckUtils]: 100: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,665 INFO L273 TraceCheckUtils]: 101: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,666 INFO L273 TraceCheckUtils]: 102: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,666 INFO L273 TraceCheckUtils]: 103: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,667 INFO L273 TraceCheckUtils]: 104: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,667 INFO L273 TraceCheckUtils]: 105: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,668 INFO L273 TraceCheckUtils]: 106: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,668 INFO L273 TraceCheckUtils]: 107: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,669 INFO L273 TraceCheckUtils]: 108: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,669 INFO L273 TraceCheckUtils]: 109: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,670 INFO L273 TraceCheckUtils]: 110: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,670 INFO L273 TraceCheckUtils]: 111: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,671 INFO L273 TraceCheckUtils]: 112: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,671 INFO L273 TraceCheckUtils]: 113: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,672 INFO L273 TraceCheckUtils]: 114: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,672 INFO L273 TraceCheckUtils]: 115: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,673 INFO L273 TraceCheckUtils]: 116: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,673 INFO L273 TraceCheckUtils]: 117: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,674 INFO L273 TraceCheckUtils]: 118: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,674 INFO L273 TraceCheckUtils]: 119: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,675 INFO L273 TraceCheckUtils]: 120: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,675 INFO L273 TraceCheckUtils]: 121: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,676 INFO L273 TraceCheckUtils]: 122: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,677 INFO L273 TraceCheckUtils]: 123: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,677 INFO L273 TraceCheckUtils]: 124: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,678 INFO L273 TraceCheckUtils]: 125: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,678 INFO L273 TraceCheckUtils]: 126: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,679 INFO L273 TraceCheckUtils]: 127: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,679 INFO L273 TraceCheckUtils]: 128: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,680 INFO L273 TraceCheckUtils]: 129: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,680 INFO L273 TraceCheckUtils]: 130: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,681 INFO L273 TraceCheckUtils]: 131: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,681 INFO L273 TraceCheckUtils]: 132: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,682 INFO L273 TraceCheckUtils]: 133: Hoare triple {8114#(<= 4 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,682 INFO L273 TraceCheckUtils]: 134: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume true; {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,683 INFO L273 TraceCheckUtils]: 135: Hoare triple {8114#(<= 4 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {8114#(<= 4 main_~edgecount~0)} is VALID [2018-11-18 23:58:21,683 INFO L273 TraceCheckUtils]: 136: Hoare triple {8114#(<= 4 main_~edgecount~0)} ~i~0 := 0; {8391#(and (<= 4 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-18 23:58:21,684 INFO L273 TraceCheckUtils]: 137: Hoare triple {8391#(and (<= 4 main_~edgecount~0) (<= main_~i~0 0))} assume true; {8391#(and (<= 4 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-18 23:58:21,685 INFO L273 TraceCheckUtils]: 138: Hoare triple {8391#(and (<= 4 main_~edgecount~0) (<= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {8391#(and (<= 4 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-18 23:58:21,686 INFO L273 TraceCheckUtils]: 139: Hoare triple {8391#(and (<= 4 main_~edgecount~0) (<= main_~i~0 0))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {8391#(and (<= 4 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-18 23:58:21,687 INFO L273 TraceCheckUtils]: 140: Hoare triple {8391#(and (<= 4 main_~edgecount~0) (<= main_~i~0 0))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8404#(and (<= 4 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-18 23:58:21,687 INFO L273 TraceCheckUtils]: 141: Hoare triple {8404#(and (<= 4 main_~edgecount~0) (<= main_~i~0 1))} assume true; {8404#(and (<= 4 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-18 23:58:21,688 INFO L273 TraceCheckUtils]: 142: Hoare triple {8404#(and (<= 4 main_~edgecount~0) (<= main_~i~0 1))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {8404#(and (<= 4 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-18 23:58:21,689 INFO L273 TraceCheckUtils]: 143: Hoare triple {8404#(and (<= 4 main_~edgecount~0) (<= main_~i~0 1))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {8404#(and (<= 4 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-18 23:58:21,690 INFO L273 TraceCheckUtils]: 144: Hoare triple {8404#(and (<= 4 main_~edgecount~0) (<= main_~i~0 1))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8417#(and (<= main_~i~0 2) (<= 4 main_~edgecount~0))} is VALID [2018-11-18 23:58:21,690 INFO L273 TraceCheckUtils]: 145: Hoare triple {8417#(and (<= main_~i~0 2) (<= 4 main_~edgecount~0))} assume true; {8417#(and (<= main_~i~0 2) (<= 4 main_~edgecount~0))} is VALID [2018-11-18 23:58:21,691 INFO L273 TraceCheckUtils]: 146: Hoare triple {8417#(and (<= main_~i~0 2) (<= 4 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {8417#(and (<= main_~i~0 2) (<= 4 main_~edgecount~0))} is VALID [2018-11-18 23:58:21,692 INFO L273 TraceCheckUtils]: 147: Hoare triple {8417#(and (<= main_~i~0 2) (<= 4 main_~edgecount~0))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {8417#(and (<= main_~i~0 2) (<= 4 main_~edgecount~0))} is VALID [2018-11-18 23:58:21,693 INFO L273 TraceCheckUtils]: 148: Hoare triple {8417#(and (<= main_~i~0 2) (<= 4 main_~edgecount~0))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8430#(and (<= main_~i~0 3) (<= 4 main_~edgecount~0))} is VALID [2018-11-18 23:58:21,694 INFO L273 TraceCheckUtils]: 149: Hoare triple {8430#(and (<= main_~i~0 3) (<= 4 main_~edgecount~0))} assume true; {8430#(and (<= main_~i~0 3) (<= 4 main_~edgecount~0))} is VALID [2018-11-18 23:58:21,694 INFO L273 TraceCheckUtils]: 150: Hoare triple {8430#(and (<= main_~i~0 3) (<= 4 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {7968#false} is VALID [2018-11-18 23:58:21,694 INFO L273 TraceCheckUtils]: 151: Hoare triple {7968#false} ~i~0 := 0; {7968#false} is VALID [2018-11-18 23:58:21,695 INFO L273 TraceCheckUtils]: 152: Hoare triple {7968#false} assume true; {7968#false} is VALID [2018-11-18 23:58:21,695 INFO L273 TraceCheckUtils]: 153: Hoare triple {7968#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7968#false} is VALID [2018-11-18 23:58:21,695 INFO L256 TraceCheckUtils]: 154: Hoare triple {7968#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {7968#false} is VALID [2018-11-18 23:58:21,695 INFO L273 TraceCheckUtils]: 155: Hoare triple {7968#false} ~cond := #in~cond; {7968#false} is VALID [2018-11-18 23:58:21,695 INFO L273 TraceCheckUtils]: 156: Hoare triple {7968#false} assume 0 == ~cond; {7968#false} is VALID [2018-11-18 23:58:21,696 INFO L273 TraceCheckUtils]: 157: Hoare triple {7968#false} assume !false; {7968#false} is VALID [2018-11-18 23:58:21,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 28 proven. 288 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2018-11-18 23:58:21,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:58:21,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2018-11-18 23:58:21,732 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 158 [2018-11-18 23:58:21,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:58:21,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-18 23:58:21,857 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:21,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 23:58:21,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 23:58:21,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-11-18 23:58:21,858 INFO L87 Difference]: Start difference. First operand 163 states and 191 transitions. Second operand 17 states. [2018-11-18 23:58:25,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:25,738 INFO L93 Difference]: Finished difference Result 333 states and 403 transitions. [2018-11-18 23:58:25,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-18 23:58:25,738 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 158 [2018-11-18 23:58:25,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:58:25,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 23:58:25,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 291 transitions. [2018-11-18 23:58:25,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 23:58:25,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 291 transitions. [2018-11-18 23:58:25,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 291 transitions. [2018-11-18 23:58:26,257 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 291 edges. 291 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:26,262 INFO L225 Difference]: With dead ends: 333 [2018-11-18 23:58:26,263 INFO L226 Difference]: Without dead ends: 219 [2018-11-18 23:58:26,264 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=597, Invalid=1853, Unknown=0, NotChecked=0, Total=2450 [2018-11-18 23:58:26,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-11-18 23:58:26,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 187. [2018-11-18 23:58:26,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:58:26,875 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand 187 states. [2018-11-18 23:58:26,875 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand 187 states. [2018-11-18 23:58:26,876 INFO L87 Difference]: Start difference. First operand 219 states. Second operand 187 states. [2018-11-18 23:58:26,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:26,881 INFO L93 Difference]: Finished difference Result 219 states and 261 transitions. [2018-11-18 23:58:26,881 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 261 transitions. [2018-11-18 23:58:26,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:26,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:26,882 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand 219 states. [2018-11-18 23:58:26,882 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 219 states. [2018-11-18 23:58:26,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:26,888 INFO L93 Difference]: Finished difference Result 219 states and 261 transitions. [2018-11-18 23:58:26,888 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 261 transitions. [2018-11-18 23:58:26,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:26,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:26,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:58:26,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:58:26,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-11-18 23:58:26,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 220 transitions. [2018-11-18 23:58:26,893 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 220 transitions. Word has length 158 [2018-11-18 23:58:26,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:58:26,894 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 220 transitions. [2018-11-18 23:58:26,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 23:58:26,894 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 220 transitions. [2018-11-18 23:58:26,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-18 23:58:26,896 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:58:26,896 INFO L375 BasicCegarLoop]: trace histogram [30, 25, 25, 25, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:58:26,896 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:58:26,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:58:26,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1971220322, now seen corresponding path program 5 times [2018-11-18 23:58:26,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:58:26,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:58:26,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:26,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:58:26,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:27,934 INFO L256 TraceCheckUtils]: 0: Hoare triple {9633#true} call ULTIMATE.init(); {9633#true} is VALID [2018-11-18 23:58:27,934 INFO L273 TraceCheckUtils]: 1: Hoare triple {9633#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {9633#true} is VALID [2018-11-18 23:58:27,934 INFO L273 TraceCheckUtils]: 2: Hoare triple {9633#true} assume true; {9633#true} is VALID [2018-11-18 23:58:27,935 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9633#true} {9633#true} #108#return; {9633#true} is VALID [2018-11-18 23:58:27,935 INFO L256 TraceCheckUtils]: 4: Hoare triple {9633#true} call #t~ret18 := main(); {9633#true} is VALID [2018-11-18 23:58:27,935 INFO L273 TraceCheckUtils]: 5: Hoare triple {9633#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,937 INFO L273 TraceCheckUtils]: 6: Hoare triple {9635#(= main_~edgecount~0 20)} assume true; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,937 INFO L273 TraceCheckUtils]: 7: Hoare triple {9635#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,939 INFO L273 TraceCheckUtils]: 8: Hoare triple {9635#(= main_~edgecount~0 20)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,939 INFO L273 TraceCheckUtils]: 9: Hoare triple {9635#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,942 INFO L273 TraceCheckUtils]: 10: Hoare triple {9635#(= main_~edgecount~0 20)} assume true; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,942 INFO L273 TraceCheckUtils]: 11: Hoare triple {9635#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,944 INFO L273 TraceCheckUtils]: 12: Hoare triple {9635#(= main_~edgecount~0 20)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,944 INFO L273 TraceCheckUtils]: 13: Hoare triple {9635#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,947 INFO L273 TraceCheckUtils]: 14: Hoare triple {9635#(= main_~edgecount~0 20)} assume true; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,947 INFO L273 TraceCheckUtils]: 15: Hoare triple {9635#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,949 INFO L273 TraceCheckUtils]: 16: Hoare triple {9635#(= main_~edgecount~0 20)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,949 INFO L273 TraceCheckUtils]: 17: Hoare triple {9635#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,952 INFO L273 TraceCheckUtils]: 18: Hoare triple {9635#(= main_~edgecount~0 20)} assume true; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,952 INFO L273 TraceCheckUtils]: 19: Hoare triple {9635#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,954 INFO L273 TraceCheckUtils]: 20: Hoare triple {9635#(= main_~edgecount~0 20)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,954 INFO L273 TraceCheckUtils]: 21: Hoare triple {9635#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,956 INFO L273 TraceCheckUtils]: 22: Hoare triple {9635#(= main_~edgecount~0 20)} assume true; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,956 INFO L273 TraceCheckUtils]: 23: Hoare triple {9635#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,959 INFO L273 TraceCheckUtils]: 24: Hoare triple {9635#(= main_~edgecount~0 20)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,959 INFO L273 TraceCheckUtils]: 25: Hoare triple {9635#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,959 INFO L273 TraceCheckUtils]: 26: Hoare triple {9635#(= main_~edgecount~0 20)} assume true; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,960 INFO L273 TraceCheckUtils]: 27: Hoare triple {9635#(= main_~edgecount~0 20)} assume !(~i~0 < ~nodecount~0); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,960 INFO L273 TraceCheckUtils]: 28: Hoare triple {9635#(= main_~edgecount~0 20)} ~i~0 := 0; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,960 INFO L273 TraceCheckUtils]: 29: Hoare triple {9635#(= main_~edgecount~0 20)} assume true; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,960 INFO L273 TraceCheckUtils]: 30: Hoare triple {9635#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,961 INFO L273 TraceCheckUtils]: 31: Hoare triple {9635#(= main_~edgecount~0 20)} assume true; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,961 INFO L273 TraceCheckUtils]: 32: Hoare triple {9635#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,961 INFO L273 TraceCheckUtils]: 33: Hoare triple {9635#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,962 INFO L273 TraceCheckUtils]: 34: Hoare triple {9635#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,962 INFO L273 TraceCheckUtils]: 35: Hoare triple {9635#(= main_~edgecount~0 20)} assume true; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,962 INFO L273 TraceCheckUtils]: 36: Hoare triple {9635#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,963 INFO L273 TraceCheckUtils]: 37: Hoare triple {9635#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,963 INFO L273 TraceCheckUtils]: 38: Hoare triple {9635#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,963 INFO L273 TraceCheckUtils]: 39: Hoare triple {9635#(= main_~edgecount~0 20)} assume true; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,964 INFO L273 TraceCheckUtils]: 40: Hoare triple {9635#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,981 INFO L273 TraceCheckUtils]: 41: Hoare triple {9635#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:27,989 INFO L273 TraceCheckUtils]: 42: Hoare triple {9635#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:28,002 INFO L273 TraceCheckUtils]: 43: Hoare triple {9635#(= main_~edgecount~0 20)} assume true; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:28,015 INFO L273 TraceCheckUtils]: 44: Hoare triple {9635#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:28,019 INFO L273 TraceCheckUtils]: 45: Hoare triple {9635#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:28,021 INFO L273 TraceCheckUtils]: 46: Hoare triple {9635#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:28,021 INFO L273 TraceCheckUtils]: 47: Hoare triple {9635#(= main_~edgecount~0 20)} assume true; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:28,023 INFO L273 TraceCheckUtils]: 48: Hoare triple {9635#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:28,023 INFO L273 TraceCheckUtils]: 49: Hoare triple {9635#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:28,025 INFO L273 TraceCheckUtils]: 50: Hoare triple {9635#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:28,025 INFO L273 TraceCheckUtils]: 51: Hoare triple {9635#(= main_~edgecount~0 20)} assume true; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:28,027 INFO L273 TraceCheckUtils]: 52: Hoare triple {9635#(= main_~edgecount~0 20)} assume !(~j~0 < ~edgecount~0); {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:28,027 INFO L273 TraceCheckUtils]: 53: Hoare triple {9635#(= main_~edgecount~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:28,027 INFO L273 TraceCheckUtils]: 54: Hoare triple {9635#(= main_~edgecount~0 20)} assume true; {9635#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:28,028 INFO L273 TraceCheckUtils]: 55: Hoare triple {9635#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9636#(and (= main_~j~0 0) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:28,028 INFO L273 TraceCheckUtils]: 56: Hoare triple {9636#(and (= main_~j~0 0) (= main_~edgecount~0 20))} assume true; {9636#(and (= main_~j~0 0) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:28,029 INFO L273 TraceCheckUtils]: 57: Hoare triple {9636#(and (= main_~j~0 0) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9636#(and (= main_~j~0 0) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:28,029 INFO L273 TraceCheckUtils]: 58: Hoare triple {9636#(and (= main_~j~0 0) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9636#(and (= main_~j~0 0) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:28,029 INFO L273 TraceCheckUtils]: 59: Hoare triple {9636#(and (= main_~j~0 0) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9637#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:28,030 INFO L273 TraceCheckUtils]: 60: Hoare triple {9637#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} assume true; {9637#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:28,031 INFO L273 TraceCheckUtils]: 61: Hoare triple {9637#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9637#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:28,032 INFO L273 TraceCheckUtils]: 62: Hoare triple {9637#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9637#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:28,032 INFO L273 TraceCheckUtils]: 63: Hoare triple {9637#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9638#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:28,033 INFO L273 TraceCheckUtils]: 64: Hoare triple {9638#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} assume true; {9638#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:28,034 INFO L273 TraceCheckUtils]: 65: Hoare triple {9638#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9638#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:28,035 INFO L273 TraceCheckUtils]: 66: Hoare triple {9638#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9638#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:28,035 INFO L273 TraceCheckUtils]: 67: Hoare triple {9638#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9639#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:28,036 INFO L273 TraceCheckUtils]: 68: Hoare triple {9639#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} assume true; {9639#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:28,037 INFO L273 TraceCheckUtils]: 69: Hoare triple {9639#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9639#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:28,038 INFO L273 TraceCheckUtils]: 70: Hoare triple {9639#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9639#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:28,038 INFO L273 TraceCheckUtils]: 71: Hoare triple {9639#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9640#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:28,039 INFO L273 TraceCheckUtils]: 72: Hoare triple {9640#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} assume true; {9640#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:28,040 INFO L273 TraceCheckUtils]: 73: Hoare triple {9640#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9640#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:28,041 INFO L273 TraceCheckUtils]: 74: Hoare triple {9640#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9640#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:28,041 INFO L273 TraceCheckUtils]: 75: Hoare triple {9640#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9641#(and (<= main_~j~0 5) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:28,042 INFO L273 TraceCheckUtils]: 76: Hoare triple {9641#(and (<= main_~j~0 5) (= main_~edgecount~0 20))} assume true; {9641#(and (<= main_~j~0 5) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:28,043 INFO L273 TraceCheckUtils]: 77: Hoare triple {9641#(and (<= main_~j~0 5) (= main_~edgecount~0 20))} assume !(~j~0 < ~edgecount~0); {9634#false} is VALID [2018-11-18 23:58:28,043 INFO L273 TraceCheckUtils]: 78: Hoare triple {9634#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9634#false} is VALID [2018-11-18 23:58:28,043 INFO L273 TraceCheckUtils]: 79: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:28,043 INFO L273 TraceCheckUtils]: 80: Hoare triple {9634#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9634#false} is VALID [2018-11-18 23:58:28,043 INFO L273 TraceCheckUtils]: 81: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:28,044 INFO L273 TraceCheckUtils]: 82: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9634#false} is VALID [2018-11-18 23:58:28,044 INFO L273 TraceCheckUtils]: 83: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9634#false} is VALID [2018-11-18 23:58:28,044 INFO L273 TraceCheckUtils]: 84: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9634#false} is VALID [2018-11-18 23:58:28,044 INFO L273 TraceCheckUtils]: 85: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:28,044 INFO L273 TraceCheckUtils]: 86: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9634#false} is VALID [2018-11-18 23:58:28,045 INFO L273 TraceCheckUtils]: 87: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9634#false} is VALID [2018-11-18 23:58:28,045 INFO L273 TraceCheckUtils]: 88: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9634#false} is VALID [2018-11-18 23:58:28,045 INFO L273 TraceCheckUtils]: 89: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:28,045 INFO L273 TraceCheckUtils]: 90: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9634#false} is VALID [2018-11-18 23:58:28,045 INFO L273 TraceCheckUtils]: 91: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9634#false} is VALID [2018-11-18 23:58:28,045 INFO L273 TraceCheckUtils]: 92: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9634#false} is VALID [2018-11-18 23:58:28,045 INFO L273 TraceCheckUtils]: 93: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:28,045 INFO L273 TraceCheckUtils]: 94: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9634#false} is VALID [2018-11-18 23:58:28,045 INFO L273 TraceCheckUtils]: 95: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9634#false} is VALID [2018-11-18 23:58:28,046 INFO L273 TraceCheckUtils]: 96: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9634#false} is VALID [2018-11-18 23:58:28,046 INFO L273 TraceCheckUtils]: 97: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:28,046 INFO L273 TraceCheckUtils]: 98: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9634#false} is VALID [2018-11-18 23:58:28,046 INFO L273 TraceCheckUtils]: 99: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9634#false} is VALID [2018-11-18 23:58:28,046 INFO L273 TraceCheckUtils]: 100: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9634#false} is VALID [2018-11-18 23:58:28,046 INFO L273 TraceCheckUtils]: 101: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:28,047 INFO L273 TraceCheckUtils]: 102: Hoare triple {9634#false} assume !(~j~0 < ~edgecount~0); {9634#false} is VALID [2018-11-18 23:58:28,047 INFO L273 TraceCheckUtils]: 103: Hoare triple {9634#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9634#false} is VALID [2018-11-18 23:58:28,047 INFO L273 TraceCheckUtils]: 104: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:28,047 INFO L273 TraceCheckUtils]: 105: Hoare triple {9634#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9634#false} is VALID [2018-11-18 23:58:28,047 INFO L273 TraceCheckUtils]: 106: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:28,047 INFO L273 TraceCheckUtils]: 107: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9634#false} is VALID [2018-11-18 23:58:28,048 INFO L273 TraceCheckUtils]: 108: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9634#false} is VALID [2018-11-18 23:58:28,048 INFO L273 TraceCheckUtils]: 109: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9634#false} is VALID [2018-11-18 23:58:28,048 INFO L273 TraceCheckUtils]: 110: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:28,048 INFO L273 TraceCheckUtils]: 111: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9634#false} is VALID [2018-11-18 23:58:28,048 INFO L273 TraceCheckUtils]: 112: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9634#false} is VALID [2018-11-18 23:58:28,048 INFO L273 TraceCheckUtils]: 113: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9634#false} is VALID [2018-11-18 23:58:28,049 INFO L273 TraceCheckUtils]: 114: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:28,049 INFO L273 TraceCheckUtils]: 115: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9634#false} is VALID [2018-11-18 23:58:28,049 INFO L273 TraceCheckUtils]: 116: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9634#false} is VALID [2018-11-18 23:58:28,049 INFO L273 TraceCheckUtils]: 117: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9634#false} is VALID [2018-11-18 23:58:28,049 INFO L273 TraceCheckUtils]: 118: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:28,049 INFO L273 TraceCheckUtils]: 119: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9634#false} is VALID [2018-11-18 23:58:28,050 INFO L273 TraceCheckUtils]: 120: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9634#false} is VALID [2018-11-18 23:58:28,050 INFO L273 TraceCheckUtils]: 121: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9634#false} is VALID [2018-11-18 23:58:28,050 INFO L273 TraceCheckUtils]: 122: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:28,050 INFO L273 TraceCheckUtils]: 123: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9634#false} is VALID [2018-11-18 23:58:28,050 INFO L273 TraceCheckUtils]: 124: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9634#false} is VALID [2018-11-18 23:58:28,050 INFO L273 TraceCheckUtils]: 125: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9634#false} is VALID [2018-11-18 23:58:28,050 INFO L273 TraceCheckUtils]: 126: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:28,051 INFO L273 TraceCheckUtils]: 127: Hoare triple {9634#false} assume !(~j~0 < ~edgecount~0); {9634#false} is VALID [2018-11-18 23:58:28,051 INFO L273 TraceCheckUtils]: 128: Hoare triple {9634#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9634#false} is VALID [2018-11-18 23:58:28,051 INFO L273 TraceCheckUtils]: 129: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:28,051 INFO L273 TraceCheckUtils]: 130: Hoare triple {9634#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9634#false} is VALID [2018-11-18 23:58:28,051 INFO L273 TraceCheckUtils]: 131: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:28,051 INFO L273 TraceCheckUtils]: 132: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9634#false} is VALID [2018-11-18 23:58:28,052 INFO L273 TraceCheckUtils]: 133: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9634#false} is VALID [2018-11-18 23:58:28,052 INFO L273 TraceCheckUtils]: 134: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9634#false} is VALID [2018-11-18 23:58:28,052 INFO L273 TraceCheckUtils]: 135: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:28,052 INFO L273 TraceCheckUtils]: 136: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9634#false} is VALID [2018-11-18 23:58:28,052 INFO L273 TraceCheckUtils]: 137: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9634#false} is VALID [2018-11-18 23:58:28,052 INFO L273 TraceCheckUtils]: 138: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9634#false} is VALID [2018-11-18 23:58:28,053 INFO L273 TraceCheckUtils]: 139: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:28,053 INFO L273 TraceCheckUtils]: 140: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9634#false} is VALID [2018-11-18 23:58:28,053 INFO L273 TraceCheckUtils]: 141: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9634#false} is VALID [2018-11-18 23:58:28,053 INFO L273 TraceCheckUtils]: 142: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9634#false} is VALID [2018-11-18 23:58:28,053 INFO L273 TraceCheckUtils]: 143: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:28,053 INFO L273 TraceCheckUtils]: 144: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9634#false} is VALID [2018-11-18 23:58:28,053 INFO L273 TraceCheckUtils]: 145: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9634#false} is VALID [2018-11-18 23:58:28,054 INFO L273 TraceCheckUtils]: 146: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9634#false} is VALID [2018-11-18 23:58:28,054 INFO L273 TraceCheckUtils]: 147: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:28,054 INFO L273 TraceCheckUtils]: 148: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9634#false} is VALID [2018-11-18 23:58:28,054 INFO L273 TraceCheckUtils]: 149: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9634#false} is VALID [2018-11-18 23:58:28,054 INFO L273 TraceCheckUtils]: 150: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9634#false} is VALID [2018-11-18 23:58:28,054 INFO L273 TraceCheckUtils]: 151: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:28,055 INFO L273 TraceCheckUtils]: 152: Hoare triple {9634#false} assume !(~j~0 < ~edgecount~0); {9634#false} is VALID [2018-11-18 23:58:28,055 INFO L273 TraceCheckUtils]: 153: Hoare triple {9634#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9634#false} is VALID [2018-11-18 23:58:28,055 INFO L273 TraceCheckUtils]: 154: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:28,055 INFO L273 TraceCheckUtils]: 155: Hoare triple {9634#false} assume !(~i~0 < ~nodecount~0); {9634#false} is VALID [2018-11-18 23:58:28,055 INFO L273 TraceCheckUtils]: 156: Hoare triple {9634#false} ~i~0 := 0; {9634#false} is VALID [2018-11-18 23:58:28,055 INFO L273 TraceCheckUtils]: 157: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:28,056 INFO L273 TraceCheckUtils]: 158: Hoare triple {9634#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {9634#false} is VALID [2018-11-18 23:58:28,056 INFO L273 TraceCheckUtils]: 159: Hoare triple {9634#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {9634#false} is VALID [2018-11-18 23:58:28,056 INFO L273 TraceCheckUtils]: 160: Hoare triple {9634#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9634#false} is VALID [2018-11-18 23:58:28,056 INFO L273 TraceCheckUtils]: 161: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:28,056 INFO L273 TraceCheckUtils]: 162: Hoare triple {9634#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {9634#false} is VALID [2018-11-18 23:58:28,056 INFO L273 TraceCheckUtils]: 163: Hoare triple {9634#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {9634#false} is VALID [2018-11-18 23:58:28,057 INFO L273 TraceCheckUtils]: 164: Hoare triple {9634#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9634#false} is VALID [2018-11-18 23:58:28,057 INFO L273 TraceCheckUtils]: 165: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:28,057 INFO L273 TraceCheckUtils]: 166: Hoare triple {9634#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {9634#false} is VALID [2018-11-18 23:58:28,057 INFO L273 TraceCheckUtils]: 167: Hoare triple {9634#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {9634#false} is VALID [2018-11-18 23:58:28,057 INFO L273 TraceCheckUtils]: 168: Hoare triple {9634#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9634#false} is VALID [2018-11-18 23:58:28,057 INFO L273 TraceCheckUtils]: 169: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:28,057 INFO L273 TraceCheckUtils]: 170: Hoare triple {9634#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {9634#false} is VALID [2018-11-18 23:58:28,058 INFO L273 TraceCheckUtils]: 171: Hoare triple {9634#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {9634#false} is VALID [2018-11-18 23:58:28,058 INFO L273 TraceCheckUtils]: 172: Hoare triple {9634#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9634#false} is VALID [2018-11-18 23:58:28,058 INFO L273 TraceCheckUtils]: 173: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:28,058 INFO L273 TraceCheckUtils]: 174: Hoare triple {9634#false} assume !(~i~0 < ~edgecount~0); {9634#false} is VALID [2018-11-18 23:58:28,058 INFO L273 TraceCheckUtils]: 175: Hoare triple {9634#false} ~i~0 := 0; {9634#false} is VALID [2018-11-18 23:58:28,058 INFO L273 TraceCheckUtils]: 176: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:28,058 INFO L273 TraceCheckUtils]: 177: Hoare triple {9634#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9634#false} is VALID [2018-11-18 23:58:28,059 INFO L256 TraceCheckUtils]: 178: Hoare triple {9634#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {9634#false} is VALID [2018-11-18 23:58:28,059 INFO L273 TraceCheckUtils]: 179: Hoare triple {9634#false} ~cond := #in~cond; {9634#false} is VALID [2018-11-18 23:58:28,059 INFO L273 TraceCheckUtils]: 180: Hoare triple {9634#false} assume 0 == ~cond; {9634#false} is VALID [2018-11-18 23:58:28,059 INFO L273 TraceCheckUtils]: 181: Hoare triple {9634#false} assume !false; {9634#false} is VALID [2018-11-18 23:58:28,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1592 backedges. 874 proven. 50 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2018-11-18 23:58:28,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:58:28,077 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:58:28,086 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 23:58:34,630 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-18 23:58:34,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:58:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:34,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:58:34,991 INFO L256 TraceCheckUtils]: 0: Hoare triple {9633#true} call ULTIMATE.init(); {9633#true} is VALID [2018-11-18 23:58:34,992 INFO L273 TraceCheckUtils]: 1: Hoare triple {9633#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {9633#true} is VALID [2018-11-18 23:58:34,992 INFO L273 TraceCheckUtils]: 2: Hoare triple {9633#true} assume true; {9633#true} is VALID [2018-11-18 23:58:34,992 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9633#true} {9633#true} #108#return; {9633#true} is VALID [2018-11-18 23:58:34,992 INFO L256 TraceCheckUtils]: 4: Hoare triple {9633#true} call #t~ret18 := main(); {9633#true} is VALID [2018-11-18 23:58:34,995 INFO L273 TraceCheckUtils]: 5: Hoare triple {9633#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:34,996 INFO L273 TraceCheckUtils]: 6: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume true; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:34,996 INFO L273 TraceCheckUtils]: 7: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:34,997 INFO L273 TraceCheckUtils]: 8: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:34,997 INFO L273 TraceCheckUtils]: 9: Hoare triple {9660#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:34,998 INFO L273 TraceCheckUtils]: 10: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume true; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:34,998 INFO L273 TraceCheckUtils]: 11: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:34,999 INFO L273 TraceCheckUtils]: 12: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:34,999 INFO L273 TraceCheckUtils]: 13: Hoare triple {9660#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,000 INFO L273 TraceCheckUtils]: 14: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume true; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,001 INFO L273 TraceCheckUtils]: 15: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,001 INFO L273 TraceCheckUtils]: 16: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,002 INFO L273 TraceCheckUtils]: 17: Hoare triple {9660#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,002 INFO L273 TraceCheckUtils]: 18: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume true; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,003 INFO L273 TraceCheckUtils]: 19: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,003 INFO L273 TraceCheckUtils]: 20: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,004 INFO L273 TraceCheckUtils]: 21: Hoare triple {9660#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,004 INFO L273 TraceCheckUtils]: 22: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume true; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,005 INFO L273 TraceCheckUtils]: 23: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,005 INFO L273 TraceCheckUtils]: 24: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,006 INFO L273 TraceCheckUtils]: 25: Hoare triple {9660#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,006 INFO L273 TraceCheckUtils]: 26: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume true; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,007 INFO L273 TraceCheckUtils]: 27: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,007 INFO L273 TraceCheckUtils]: 28: Hoare triple {9660#(<= 20 main_~edgecount~0)} ~i~0 := 0; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,008 INFO L273 TraceCheckUtils]: 29: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume true; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,008 INFO L273 TraceCheckUtils]: 30: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,009 INFO L273 TraceCheckUtils]: 31: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume true; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,009 INFO L273 TraceCheckUtils]: 32: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,010 INFO L273 TraceCheckUtils]: 33: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,010 INFO L273 TraceCheckUtils]: 34: Hoare triple {9660#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,011 INFO L273 TraceCheckUtils]: 35: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume true; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,011 INFO L273 TraceCheckUtils]: 36: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,012 INFO L273 TraceCheckUtils]: 37: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,012 INFO L273 TraceCheckUtils]: 38: Hoare triple {9660#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,013 INFO L273 TraceCheckUtils]: 39: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume true; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,013 INFO L273 TraceCheckUtils]: 40: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,014 INFO L273 TraceCheckUtils]: 41: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,014 INFO L273 TraceCheckUtils]: 42: Hoare triple {9660#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,015 INFO L273 TraceCheckUtils]: 43: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume true; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,015 INFO L273 TraceCheckUtils]: 44: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,016 INFO L273 TraceCheckUtils]: 45: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,016 INFO L273 TraceCheckUtils]: 46: Hoare triple {9660#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,017 INFO L273 TraceCheckUtils]: 47: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume true; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,018 INFO L273 TraceCheckUtils]: 48: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9790#(and (<= 20 main_~edgecount~0) (< main_~j~0 main_~edgecount~0))} is VALID [2018-11-18 23:58:35,019 INFO L273 TraceCheckUtils]: 49: Hoare triple {9790#(and (<= 20 main_~edgecount~0) (< main_~j~0 main_~edgecount~0))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9790#(and (<= 20 main_~edgecount~0) (< main_~j~0 main_~edgecount~0))} is VALID [2018-11-18 23:58:35,020 INFO L273 TraceCheckUtils]: 50: Hoare triple {9790#(and (<= 20 main_~edgecount~0) (< main_~j~0 main_~edgecount~0))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9797#(and (<= 20 main_~edgecount~0) (<= main_~j~0 main_~edgecount~0))} is VALID [2018-11-18 23:58:35,021 INFO L273 TraceCheckUtils]: 51: Hoare triple {9797#(and (<= 20 main_~edgecount~0) (<= main_~j~0 main_~edgecount~0))} assume true; {9797#(and (<= 20 main_~edgecount~0) (<= main_~j~0 main_~edgecount~0))} is VALID [2018-11-18 23:58:35,021 INFO L273 TraceCheckUtils]: 52: Hoare triple {9797#(and (<= 20 main_~edgecount~0) (<= main_~j~0 main_~edgecount~0))} assume !(~j~0 < ~edgecount~0); {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,022 INFO L273 TraceCheckUtils]: 53: Hoare triple {9660#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,022 INFO L273 TraceCheckUtils]: 54: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume true; {9660#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:35,023 INFO L273 TraceCheckUtils]: 55: Hoare triple {9660#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9813#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:35,023 INFO L273 TraceCheckUtils]: 56: Hoare triple {9813#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume true; {9813#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:35,024 INFO L273 TraceCheckUtils]: 57: Hoare triple {9813#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9813#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:35,025 INFO L273 TraceCheckUtils]: 58: Hoare triple {9813#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9813#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:35,026 INFO L273 TraceCheckUtils]: 59: Hoare triple {9813#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9826#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:58:35,027 INFO L273 TraceCheckUtils]: 60: Hoare triple {9826#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume true; {9826#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:58:35,028 INFO L273 TraceCheckUtils]: 61: Hoare triple {9826#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9826#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:58:35,028 INFO L273 TraceCheckUtils]: 62: Hoare triple {9826#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9826#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:58:35,029 INFO L273 TraceCheckUtils]: 63: Hoare triple {9826#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9839#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:58:35,030 INFO L273 TraceCheckUtils]: 64: Hoare triple {9839#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} assume true; {9839#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:58:35,031 INFO L273 TraceCheckUtils]: 65: Hoare triple {9839#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9839#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:58:35,032 INFO L273 TraceCheckUtils]: 66: Hoare triple {9839#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9839#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:58:35,033 INFO L273 TraceCheckUtils]: 67: Hoare triple {9839#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9852#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:58:35,033 INFO L273 TraceCheckUtils]: 68: Hoare triple {9852#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume true; {9852#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:58:35,034 INFO L273 TraceCheckUtils]: 69: Hoare triple {9852#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9852#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:58:35,035 INFO L273 TraceCheckUtils]: 70: Hoare triple {9852#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9852#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:58:35,036 INFO L273 TraceCheckUtils]: 71: Hoare triple {9852#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9865#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-18 23:58:35,036 INFO L273 TraceCheckUtils]: 72: Hoare triple {9865#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume true; {9865#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-18 23:58:35,038 INFO L273 TraceCheckUtils]: 73: Hoare triple {9865#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9865#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-18 23:58:35,038 INFO L273 TraceCheckUtils]: 74: Hoare triple {9865#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9865#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-18 23:58:35,039 INFO L273 TraceCheckUtils]: 75: Hoare triple {9865#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9878#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2018-11-18 23:58:35,040 INFO L273 TraceCheckUtils]: 76: Hoare triple {9878#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume true; {9878#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2018-11-18 23:58:35,041 INFO L273 TraceCheckUtils]: 77: Hoare triple {9878#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume !(~j~0 < ~edgecount~0); {9634#false} is VALID [2018-11-18 23:58:35,041 INFO L273 TraceCheckUtils]: 78: Hoare triple {9634#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9634#false} is VALID [2018-11-18 23:58:35,041 INFO L273 TraceCheckUtils]: 79: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:35,041 INFO L273 TraceCheckUtils]: 80: Hoare triple {9634#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9634#false} is VALID [2018-11-18 23:58:35,041 INFO L273 TraceCheckUtils]: 81: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:35,042 INFO L273 TraceCheckUtils]: 82: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9634#false} is VALID [2018-11-18 23:58:35,042 INFO L273 TraceCheckUtils]: 83: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9634#false} is VALID [2018-11-18 23:58:35,042 INFO L273 TraceCheckUtils]: 84: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9634#false} is VALID [2018-11-18 23:58:35,042 INFO L273 TraceCheckUtils]: 85: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:35,042 INFO L273 TraceCheckUtils]: 86: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9634#false} is VALID [2018-11-18 23:58:35,043 INFO L273 TraceCheckUtils]: 87: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9634#false} is VALID [2018-11-18 23:58:35,043 INFO L273 TraceCheckUtils]: 88: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9634#false} is VALID [2018-11-18 23:58:35,043 INFO L273 TraceCheckUtils]: 89: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:35,043 INFO L273 TraceCheckUtils]: 90: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9634#false} is VALID [2018-11-18 23:58:35,043 INFO L273 TraceCheckUtils]: 91: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9634#false} is VALID [2018-11-18 23:58:35,043 INFO L273 TraceCheckUtils]: 92: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9634#false} is VALID [2018-11-18 23:58:35,043 INFO L273 TraceCheckUtils]: 93: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:35,043 INFO L273 TraceCheckUtils]: 94: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9634#false} is VALID [2018-11-18 23:58:35,044 INFO L273 TraceCheckUtils]: 95: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9634#false} is VALID [2018-11-18 23:58:35,044 INFO L273 TraceCheckUtils]: 96: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9634#false} is VALID [2018-11-18 23:58:35,044 INFO L273 TraceCheckUtils]: 97: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:35,044 INFO L273 TraceCheckUtils]: 98: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9634#false} is VALID [2018-11-18 23:58:35,044 INFO L273 TraceCheckUtils]: 99: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9634#false} is VALID [2018-11-18 23:58:35,044 INFO L273 TraceCheckUtils]: 100: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9634#false} is VALID [2018-11-18 23:58:35,044 INFO L273 TraceCheckUtils]: 101: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:35,044 INFO L273 TraceCheckUtils]: 102: Hoare triple {9634#false} assume !(~j~0 < ~edgecount~0); {9634#false} is VALID [2018-11-18 23:58:35,044 INFO L273 TraceCheckUtils]: 103: Hoare triple {9634#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9634#false} is VALID [2018-11-18 23:58:35,045 INFO L273 TraceCheckUtils]: 104: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:35,045 INFO L273 TraceCheckUtils]: 105: Hoare triple {9634#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9634#false} is VALID [2018-11-18 23:58:35,045 INFO L273 TraceCheckUtils]: 106: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:35,045 INFO L273 TraceCheckUtils]: 107: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9634#false} is VALID [2018-11-18 23:58:35,045 INFO L273 TraceCheckUtils]: 108: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9634#false} is VALID [2018-11-18 23:58:35,045 INFO L273 TraceCheckUtils]: 109: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9634#false} is VALID [2018-11-18 23:58:35,045 INFO L273 TraceCheckUtils]: 110: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:35,045 INFO L273 TraceCheckUtils]: 111: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9634#false} is VALID [2018-11-18 23:58:35,046 INFO L273 TraceCheckUtils]: 112: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9634#false} is VALID [2018-11-18 23:58:35,046 INFO L273 TraceCheckUtils]: 113: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9634#false} is VALID [2018-11-18 23:58:35,046 INFO L273 TraceCheckUtils]: 114: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:35,046 INFO L273 TraceCheckUtils]: 115: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9634#false} is VALID [2018-11-18 23:58:35,046 INFO L273 TraceCheckUtils]: 116: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9634#false} is VALID [2018-11-18 23:58:35,046 INFO L273 TraceCheckUtils]: 117: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9634#false} is VALID [2018-11-18 23:58:35,046 INFO L273 TraceCheckUtils]: 118: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:35,046 INFO L273 TraceCheckUtils]: 119: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9634#false} is VALID [2018-11-18 23:58:35,046 INFO L273 TraceCheckUtils]: 120: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9634#false} is VALID [2018-11-18 23:58:35,047 INFO L273 TraceCheckUtils]: 121: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9634#false} is VALID [2018-11-18 23:58:35,047 INFO L273 TraceCheckUtils]: 122: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:35,047 INFO L273 TraceCheckUtils]: 123: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9634#false} is VALID [2018-11-18 23:58:35,047 INFO L273 TraceCheckUtils]: 124: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9634#false} is VALID [2018-11-18 23:58:35,047 INFO L273 TraceCheckUtils]: 125: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9634#false} is VALID [2018-11-18 23:58:35,047 INFO L273 TraceCheckUtils]: 126: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:35,047 INFO L273 TraceCheckUtils]: 127: Hoare triple {9634#false} assume !(~j~0 < ~edgecount~0); {9634#false} is VALID [2018-11-18 23:58:35,047 INFO L273 TraceCheckUtils]: 128: Hoare triple {9634#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9634#false} is VALID [2018-11-18 23:58:35,047 INFO L273 TraceCheckUtils]: 129: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:35,048 INFO L273 TraceCheckUtils]: 130: Hoare triple {9634#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9634#false} is VALID [2018-11-18 23:58:35,048 INFO L273 TraceCheckUtils]: 131: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:35,048 INFO L273 TraceCheckUtils]: 132: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9634#false} is VALID [2018-11-18 23:58:35,048 INFO L273 TraceCheckUtils]: 133: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9634#false} is VALID [2018-11-18 23:58:35,048 INFO L273 TraceCheckUtils]: 134: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9634#false} is VALID [2018-11-18 23:58:35,048 INFO L273 TraceCheckUtils]: 135: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:35,048 INFO L273 TraceCheckUtils]: 136: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9634#false} is VALID [2018-11-18 23:58:35,048 INFO L273 TraceCheckUtils]: 137: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9634#false} is VALID [2018-11-18 23:58:35,048 INFO L273 TraceCheckUtils]: 138: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9634#false} is VALID [2018-11-18 23:58:35,049 INFO L273 TraceCheckUtils]: 139: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:35,049 INFO L273 TraceCheckUtils]: 140: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9634#false} is VALID [2018-11-18 23:58:35,049 INFO L273 TraceCheckUtils]: 141: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9634#false} is VALID [2018-11-18 23:58:35,049 INFO L273 TraceCheckUtils]: 142: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9634#false} is VALID [2018-11-18 23:58:35,049 INFO L273 TraceCheckUtils]: 143: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:35,049 INFO L273 TraceCheckUtils]: 144: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9634#false} is VALID [2018-11-18 23:58:35,049 INFO L273 TraceCheckUtils]: 145: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9634#false} is VALID [2018-11-18 23:58:35,049 INFO L273 TraceCheckUtils]: 146: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9634#false} is VALID [2018-11-18 23:58:35,049 INFO L273 TraceCheckUtils]: 147: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:35,050 INFO L273 TraceCheckUtils]: 148: Hoare triple {9634#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9634#false} is VALID [2018-11-18 23:58:35,050 INFO L273 TraceCheckUtils]: 149: Hoare triple {9634#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {9634#false} is VALID [2018-11-18 23:58:35,050 INFO L273 TraceCheckUtils]: 150: Hoare triple {9634#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9634#false} is VALID [2018-11-18 23:58:35,050 INFO L273 TraceCheckUtils]: 151: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:35,050 INFO L273 TraceCheckUtils]: 152: Hoare triple {9634#false} assume !(~j~0 < ~edgecount~0); {9634#false} is VALID [2018-11-18 23:58:35,050 INFO L273 TraceCheckUtils]: 153: Hoare triple {9634#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9634#false} is VALID [2018-11-18 23:58:35,050 INFO L273 TraceCheckUtils]: 154: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:35,050 INFO L273 TraceCheckUtils]: 155: Hoare triple {9634#false} assume !(~i~0 < ~nodecount~0); {9634#false} is VALID [2018-11-18 23:58:35,051 INFO L273 TraceCheckUtils]: 156: Hoare triple {9634#false} ~i~0 := 0; {9634#false} is VALID [2018-11-18 23:58:35,051 INFO L273 TraceCheckUtils]: 157: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:35,051 INFO L273 TraceCheckUtils]: 158: Hoare triple {9634#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {9634#false} is VALID [2018-11-18 23:58:35,051 INFO L273 TraceCheckUtils]: 159: Hoare triple {9634#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {9634#false} is VALID [2018-11-18 23:58:35,051 INFO L273 TraceCheckUtils]: 160: Hoare triple {9634#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9634#false} is VALID [2018-11-18 23:58:35,051 INFO L273 TraceCheckUtils]: 161: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:35,051 INFO L273 TraceCheckUtils]: 162: Hoare triple {9634#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {9634#false} is VALID [2018-11-18 23:58:35,051 INFO L273 TraceCheckUtils]: 163: Hoare triple {9634#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {9634#false} is VALID [2018-11-18 23:58:35,051 INFO L273 TraceCheckUtils]: 164: Hoare triple {9634#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9634#false} is VALID [2018-11-18 23:58:35,052 INFO L273 TraceCheckUtils]: 165: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:35,052 INFO L273 TraceCheckUtils]: 166: Hoare triple {9634#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {9634#false} is VALID [2018-11-18 23:58:35,052 INFO L273 TraceCheckUtils]: 167: Hoare triple {9634#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {9634#false} is VALID [2018-11-18 23:58:35,052 INFO L273 TraceCheckUtils]: 168: Hoare triple {9634#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9634#false} is VALID [2018-11-18 23:58:35,052 INFO L273 TraceCheckUtils]: 169: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:35,052 INFO L273 TraceCheckUtils]: 170: Hoare triple {9634#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {9634#false} is VALID [2018-11-18 23:58:35,052 INFO L273 TraceCheckUtils]: 171: Hoare triple {9634#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {9634#false} is VALID [2018-11-18 23:58:35,052 INFO L273 TraceCheckUtils]: 172: Hoare triple {9634#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9634#false} is VALID [2018-11-18 23:58:35,052 INFO L273 TraceCheckUtils]: 173: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:35,053 INFO L273 TraceCheckUtils]: 174: Hoare triple {9634#false} assume !(~i~0 < ~edgecount~0); {9634#false} is VALID [2018-11-18 23:58:35,053 INFO L273 TraceCheckUtils]: 175: Hoare triple {9634#false} ~i~0 := 0; {9634#false} is VALID [2018-11-18 23:58:35,053 INFO L273 TraceCheckUtils]: 176: Hoare triple {9634#false} assume true; {9634#false} is VALID [2018-11-18 23:58:35,053 INFO L273 TraceCheckUtils]: 177: Hoare triple {9634#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9634#false} is VALID [2018-11-18 23:58:35,053 INFO L256 TraceCheckUtils]: 178: Hoare triple {9634#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {9634#false} is VALID [2018-11-18 23:58:35,053 INFO L273 TraceCheckUtils]: 179: Hoare triple {9634#false} ~cond := #in~cond; {9634#false} is VALID [2018-11-18 23:58:35,053 INFO L273 TraceCheckUtils]: 180: Hoare triple {9634#false} assume 0 == ~cond; {9634#false} is VALID [2018-11-18 23:58:35,053 INFO L273 TraceCheckUtils]: 181: Hoare triple {9634#false} assume !false; {9634#false} is VALID [2018-11-18 23:58:35,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1592 backedges. 892 proven. 50 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-11-18 23:58:35,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:58:35,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2018-11-18 23:58:35,095 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 182 [2018-11-18 23:58:35,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:58:35,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-18 23:58:35,281 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:35,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 23:58:35,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 23:58:35,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=176, Unknown=0, NotChecked=0, Total=306 [2018-11-18 23:58:35,282 INFO L87 Difference]: Start difference. First operand 187 states and 220 transitions. Second operand 18 states. [2018-11-18 23:58:36,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:36,507 INFO L93 Difference]: Finished difference Result 361 states and 440 transitions. [2018-11-18 23:58:36,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 23:58:36,507 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 182 [2018-11-18 23:58:36,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:58:36,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 23:58:36,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 105 transitions. [2018-11-18 23:58:36,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 23:58:36,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 105 transitions. [2018-11-18 23:58:36,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 105 transitions. [2018-11-18 23:58:36,765 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:36,769 INFO L225 Difference]: With dead ends: 361 [2018-11-18 23:58:36,769 INFO L226 Difference]: Without dead ends: 227 [2018-11-18 23:58:36,770 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-11-18 23:58:36,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-11-18 23:58:37,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-11-18 23:58:37,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:58:37,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 227 states. Second operand 227 states. [2018-11-18 23:58:37,416 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand 227 states. [2018-11-18 23:58:37,416 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 227 states. [2018-11-18 23:58:37,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:37,421 INFO L93 Difference]: Finished difference Result 227 states and 270 transitions. [2018-11-18 23:58:37,421 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 270 transitions. [2018-11-18 23:58:37,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:37,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:37,422 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand 227 states. [2018-11-18 23:58:37,422 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 227 states. [2018-11-18 23:58:37,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:37,427 INFO L93 Difference]: Finished difference Result 227 states and 270 transitions. [2018-11-18 23:58:37,427 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 270 transitions. [2018-11-18 23:58:37,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:37,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:37,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:58:37,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:58:37,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-11-18 23:58:37,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 270 transitions. [2018-11-18 23:58:37,433 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 270 transitions. Word has length 182 [2018-11-18 23:58:37,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:58:37,434 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 270 transitions. [2018-11-18 23:58:37,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 23:58:37,434 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 270 transitions. [2018-11-18 23:58:37,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-11-18 23:58:37,436 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:58:37,437 INFO L375 BasicCegarLoop]: trace histogram [40, 35, 35, 35, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:58:37,437 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:58:37,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:58:37,437 INFO L82 PathProgramCache]: Analyzing trace with hash -464172140, now seen corresponding path program 6 times [2018-11-18 23:58:37,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:58:37,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:58:37,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:37,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:58:37,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:37,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:38,715 INFO L256 TraceCheckUtils]: 0: Hoare triple {11407#true} call ULTIMATE.init(); {11407#true} is VALID [2018-11-18 23:58:38,716 INFO L273 TraceCheckUtils]: 1: Hoare triple {11407#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {11407#true} is VALID [2018-11-18 23:58:38,716 INFO L273 TraceCheckUtils]: 2: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,716 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11407#true} {11407#true} #108#return; {11407#true} is VALID [2018-11-18 23:58:38,716 INFO L256 TraceCheckUtils]: 4: Hoare triple {11407#true} call #t~ret18 := main(); {11407#true} is VALID [2018-11-18 23:58:38,717 INFO L273 TraceCheckUtils]: 5: Hoare triple {11407#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {11407#true} is VALID [2018-11-18 23:58:38,717 INFO L273 TraceCheckUtils]: 6: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,718 INFO L273 TraceCheckUtils]: 7: Hoare triple {11407#true} assume !!(~i~0 < ~nodecount~0); {11407#true} is VALID [2018-11-18 23:58:38,718 INFO L273 TraceCheckUtils]: 8: Hoare triple {11407#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11407#true} is VALID [2018-11-18 23:58:38,718 INFO L273 TraceCheckUtils]: 9: Hoare triple {11407#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11407#true} is VALID [2018-11-18 23:58:38,718 INFO L273 TraceCheckUtils]: 10: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,718 INFO L273 TraceCheckUtils]: 11: Hoare triple {11407#true} assume !!(~i~0 < ~nodecount~0); {11407#true} is VALID [2018-11-18 23:58:38,718 INFO L273 TraceCheckUtils]: 12: Hoare triple {11407#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11407#true} is VALID [2018-11-18 23:58:38,718 INFO L273 TraceCheckUtils]: 13: Hoare triple {11407#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11407#true} is VALID [2018-11-18 23:58:38,718 INFO L273 TraceCheckUtils]: 14: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,719 INFO L273 TraceCheckUtils]: 15: Hoare triple {11407#true} assume !!(~i~0 < ~nodecount~0); {11407#true} is VALID [2018-11-18 23:58:38,719 INFO L273 TraceCheckUtils]: 16: Hoare triple {11407#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11407#true} is VALID [2018-11-18 23:58:38,719 INFO L273 TraceCheckUtils]: 17: Hoare triple {11407#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11407#true} is VALID [2018-11-18 23:58:38,719 INFO L273 TraceCheckUtils]: 18: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,719 INFO L273 TraceCheckUtils]: 19: Hoare triple {11407#true} assume !!(~i~0 < ~nodecount~0); {11407#true} is VALID [2018-11-18 23:58:38,719 INFO L273 TraceCheckUtils]: 20: Hoare triple {11407#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11407#true} is VALID [2018-11-18 23:58:38,719 INFO L273 TraceCheckUtils]: 21: Hoare triple {11407#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11407#true} is VALID [2018-11-18 23:58:38,719 INFO L273 TraceCheckUtils]: 22: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,719 INFO L273 TraceCheckUtils]: 23: Hoare triple {11407#true} assume !!(~i~0 < ~nodecount~0); {11407#true} is VALID [2018-11-18 23:58:38,720 INFO L273 TraceCheckUtils]: 24: Hoare triple {11407#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11407#true} is VALID [2018-11-18 23:58:38,720 INFO L273 TraceCheckUtils]: 25: Hoare triple {11407#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11407#true} is VALID [2018-11-18 23:58:38,720 INFO L273 TraceCheckUtils]: 26: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,720 INFO L273 TraceCheckUtils]: 27: Hoare triple {11407#true} assume !(~i~0 < ~nodecount~0); {11407#true} is VALID [2018-11-18 23:58:38,720 INFO L273 TraceCheckUtils]: 28: Hoare triple {11407#true} ~i~0 := 0; {11407#true} is VALID [2018-11-18 23:58:38,720 INFO L273 TraceCheckUtils]: 29: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,720 INFO L273 TraceCheckUtils]: 30: Hoare triple {11407#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11407#true} is VALID [2018-11-18 23:58:38,720 INFO L273 TraceCheckUtils]: 31: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,721 INFO L273 TraceCheckUtils]: 32: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11407#true} is VALID [2018-11-18 23:58:38,721 INFO L273 TraceCheckUtils]: 33: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11407#true} is VALID [2018-11-18 23:58:38,721 INFO L273 TraceCheckUtils]: 34: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11407#true} is VALID [2018-11-18 23:58:38,721 INFO L273 TraceCheckUtils]: 35: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,721 INFO L273 TraceCheckUtils]: 36: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11407#true} is VALID [2018-11-18 23:58:38,721 INFO L273 TraceCheckUtils]: 37: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11407#true} is VALID [2018-11-18 23:58:38,721 INFO L273 TraceCheckUtils]: 38: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11407#true} is VALID [2018-11-18 23:58:38,721 INFO L273 TraceCheckUtils]: 39: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,721 INFO L273 TraceCheckUtils]: 40: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11407#true} is VALID [2018-11-18 23:58:38,722 INFO L273 TraceCheckUtils]: 41: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11407#true} is VALID [2018-11-18 23:58:38,722 INFO L273 TraceCheckUtils]: 42: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11407#true} is VALID [2018-11-18 23:58:38,722 INFO L273 TraceCheckUtils]: 43: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,722 INFO L273 TraceCheckUtils]: 44: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11407#true} is VALID [2018-11-18 23:58:38,722 INFO L273 TraceCheckUtils]: 45: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11407#true} is VALID [2018-11-18 23:58:38,722 INFO L273 TraceCheckUtils]: 46: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11407#true} is VALID [2018-11-18 23:58:38,722 INFO L273 TraceCheckUtils]: 47: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,722 INFO L273 TraceCheckUtils]: 48: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11407#true} is VALID [2018-11-18 23:58:38,722 INFO L273 TraceCheckUtils]: 49: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11407#true} is VALID [2018-11-18 23:58:38,723 INFO L273 TraceCheckUtils]: 50: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11407#true} is VALID [2018-11-18 23:58:38,723 INFO L273 TraceCheckUtils]: 51: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,723 INFO L273 TraceCheckUtils]: 52: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11407#true} is VALID [2018-11-18 23:58:38,723 INFO L273 TraceCheckUtils]: 53: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11407#true} is VALID [2018-11-18 23:58:38,723 INFO L273 TraceCheckUtils]: 54: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11407#true} is VALID [2018-11-18 23:58:38,723 INFO L273 TraceCheckUtils]: 55: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,723 INFO L273 TraceCheckUtils]: 56: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11407#true} is VALID [2018-11-18 23:58:38,723 INFO L273 TraceCheckUtils]: 57: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11407#true} is VALID [2018-11-18 23:58:38,724 INFO L273 TraceCheckUtils]: 58: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11407#true} is VALID [2018-11-18 23:58:38,724 INFO L273 TraceCheckUtils]: 59: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,724 INFO L273 TraceCheckUtils]: 60: Hoare triple {11407#true} assume !(~j~0 < ~edgecount~0); {11407#true} is VALID [2018-11-18 23:58:38,724 INFO L273 TraceCheckUtils]: 61: Hoare triple {11407#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11407#true} is VALID [2018-11-18 23:58:38,724 INFO L273 TraceCheckUtils]: 62: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,724 INFO L273 TraceCheckUtils]: 63: Hoare triple {11407#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11407#true} is VALID [2018-11-18 23:58:38,724 INFO L273 TraceCheckUtils]: 64: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,724 INFO L273 TraceCheckUtils]: 65: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11407#true} is VALID [2018-11-18 23:58:38,724 INFO L273 TraceCheckUtils]: 66: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11407#true} is VALID [2018-11-18 23:58:38,725 INFO L273 TraceCheckUtils]: 67: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11407#true} is VALID [2018-11-18 23:58:38,725 INFO L273 TraceCheckUtils]: 68: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,725 INFO L273 TraceCheckUtils]: 69: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11407#true} is VALID [2018-11-18 23:58:38,725 INFO L273 TraceCheckUtils]: 70: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11407#true} is VALID [2018-11-18 23:58:38,725 INFO L273 TraceCheckUtils]: 71: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11407#true} is VALID [2018-11-18 23:58:38,725 INFO L273 TraceCheckUtils]: 72: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,725 INFO L273 TraceCheckUtils]: 73: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11407#true} is VALID [2018-11-18 23:58:38,725 INFO L273 TraceCheckUtils]: 74: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11407#true} is VALID [2018-11-18 23:58:38,726 INFO L273 TraceCheckUtils]: 75: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11407#true} is VALID [2018-11-18 23:58:38,726 INFO L273 TraceCheckUtils]: 76: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,726 INFO L273 TraceCheckUtils]: 77: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11407#true} is VALID [2018-11-18 23:58:38,726 INFO L273 TraceCheckUtils]: 78: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11407#true} is VALID [2018-11-18 23:58:38,726 INFO L273 TraceCheckUtils]: 79: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11407#true} is VALID [2018-11-18 23:58:38,726 INFO L273 TraceCheckUtils]: 80: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,726 INFO L273 TraceCheckUtils]: 81: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11407#true} is VALID [2018-11-18 23:58:38,726 INFO L273 TraceCheckUtils]: 82: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11407#true} is VALID [2018-11-18 23:58:38,726 INFO L273 TraceCheckUtils]: 83: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11407#true} is VALID [2018-11-18 23:58:38,727 INFO L273 TraceCheckUtils]: 84: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,727 INFO L273 TraceCheckUtils]: 85: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11407#true} is VALID [2018-11-18 23:58:38,727 INFO L273 TraceCheckUtils]: 86: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11407#true} is VALID [2018-11-18 23:58:38,727 INFO L273 TraceCheckUtils]: 87: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11407#true} is VALID [2018-11-18 23:58:38,727 INFO L273 TraceCheckUtils]: 88: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,727 INFO L273 TraceCheckUtils]: 89: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11407#true} is VALID [2018-11-18 23:58:38,727 INFO L273 TraceCheckUtils]: 90: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11407#true} is VALID [2018-11-18 23:58:38,727 INFO L273 TraceCheckUtils]: 91: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11407#true} is VALID [2018-11-18 23:58:38,727 INFO L273 TraceCheckUtils]: 92: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,728 INFO L273 TraceCheckUtils]: 93: Hoare triple {11407#true} assume !(~j~0 < ~edgecount~0); {11407#true} is VALID [2018-11-18 23:58:38,728 INFO L273 TraceCheckUtils]: 94: Hoare triple {11407#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11407#true} is VALID [2018-11-18 23:58:38,728 INFO L273 TraceCheckUtils]: 95: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,728 INFO L273 TraceCheckUtils]: 96: Hoare triple {11407#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11407#true} is VALID [2018-11-18 23:58:38,728 INFO L273 TraceCheckUtils]: 97: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,728 INFO L273 TraceCheckUtils]: 98: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11407#true} is VALID [2018-11-18 23:58:38,728 INFO L273 TraceCheckUtils]: 99: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11407#true} is VALID [2018-11-18 23:58:38,728 INFO L273 TraceCheckUtils]: 100: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11407#true} is VALID [2018-11-18 23:58:38,729 INFO L273 TraceCheckUtils]: 101: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,729 INFO L273 TraceCheckUtils]: 102: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11407#true} is VALID [2018-11-18 23:58:38,729 INFO L273 TraceCheckUtils]: 103: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11407#true} is VALID [2018-11-18 23:58:38,729 INFO L273 TraceCheckUtils]: 104: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11407#true} is VALID [2018-11-18 23:58:38,729 INFO L273 TraceCheckUtils]: 105: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,729 INFO L273 TraceCheckUtils]: 106: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11407#true} is VALID [2018-11-18 23:58:38,729 INFO L273 TraceCheckUtils]: 107: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11407#true} is VALID [2018-11-18 23:58:38,729 INFO L273 TraceCheckUtils]: 108: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11407#true} is VALID [2018-11-18 23:58:38,729 INFO L273 TraceCheckUtils]: 109: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,730 INFO L273 TraceCheckUtils]: 110: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11407#true} is VALID [2018-11-18 23:58:38,730 INFO L273 TraceCheckUtils]: 111: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11407#true} is VALID [2018-11-18 23:58:38,730 INFO L273 TraceCheckUtils]: 112: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11407#true} is VALID [2018-11-18 23:58:38,730 INFO L273 TraceCheckUtils]: 113: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,730 INFO L273 TraceCheckUtils]: 114: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11407#true} is VALID [2018-11-18 23:58:38,730 INFO L273 TraceCheckUtils]: 115: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11407#true} is VALID [2018-11-18 23:58:38,730 INFO L273 TraceCheckUtils]: 116: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11407#true} is VALID [2018-11-18 23:58:38,730 INFO L273 TraceCheckUtils]: 117: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,731 INFO L273 TraceCheckUtils]: 118: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11407#true} is VALID [2018-11-18 23:58:38,731 INFO L273 TraceCheckUtils]: 119: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11407#true} is VALID [2018-11-18 23:58:38,731 INFO L273 TraceCheckUtils]: 120: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11407#true} is VALID [2018-11-18 23:58:38,731 INFO L273 TraceCheckUtils]: 121: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,731 INFO L273 TraceCheckUtils]: 122: Hoare triple {11407#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11407#true} is VALID [2018-11-18 23:58:38,731 INFO L273 TraceCheckUtils]: 123: Hoare triple {11407#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11407#true} is VALID [2018-11-18 23:58:38,731 INFO L273 TraceCheckUtils]: 124: Hoare triple {11407#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11407#true} is VALID [2018-11-18 23:58:38,731 INFO L273 TraceCheckUtils]: 125: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,731 INFO L273 TraceCheckUtils]: 126: Hoare triple {11407#true} assume !(~j~0 < ~edgecount~0); {11407#true} is VALID [2018-11-18 23:58:38,732 INFO L273 TraceCheckUtils]: 127: Hoare triple {11407#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11407#true} is VALID [2018-11-18 23:58:38,732 INFO L273 TraceCheckUtils]: 128: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:38,732 INFO L273 TraceCheckUtils]: 129: Hoare triple {11407#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11409#(= main_~j~0 0)} is VALID [2018-11-18 23:58:38,732 INFO L273 TraceCheckUtils]: 130: Hoare triple {11409#(= main_~j~0 0)} assume true; {11409#(= main_~j~0 0)} is VALID [2018-11-18 23:58:38,733 INFO L273 TraceCheckUtils]: 131: Hoare triple {11409#(= main_~j~0 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11409#(= main_~j~0 0)} is VALID [2018-11-18 23:58:38,733 INFO L273 TraceCheckUtils]: 132: Hoare triple {11409#(= main_~j~0 0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11409#(= main_~j~0 0)} is VALID [2018-11-18 23:58:38,734 INFO L273 TraceCheckUtils]: 133: Hoare triple {11409#(= main_~j~0 0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11410#(<= 1 main_~j~0)} is VALID [2018-11-18 23:58:38,734 INFO L273 TraceCheckUtils]: 134: Hoare triple {11410#(<= 1 main_~j~0)} assume true; {11410#(<= 1 main_~j~0)} is VALID [2018-11-18 23:58:38,734 INFO L273 TraceCheckUtils]: 135: Hoare triple {11410#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11410#(<= 1 main_~j~0)} is VALID [2018-11-18 23:58:38,734 INFO L273 TraceCheckUtils]: 136: Hoare triple {11410#(<= 1 main_~j~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11410#(<= 1 main_~j~0)} is VALID [2018-11-18 23:58:38,735 INFO L273 TraceCheckUtils]: 137: Hoare triple {11410#(<= 1 main_~j~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11411#(<= 2 main_~j~0)} is VALID [2018-11-18 23:58:38,736 INFO L273 TraceCheckUtils]: 138: Hoare triple {11411#(<= 2 main_~j~0)} assume true; {11411#(<= 2 main_~j~0)} is VALID [2018-11-18 23:58:38,736 INFO L273 TraceCheckUtils]: 139: Hoare triple {11411#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11411#(<= 2 main_~j~0)} is VALID [2018-11-18 23:58:38,737 INFO L273 TraceCheckUtils]: 140: Hoare triple {11411#(<= 2 main_~j~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11411#(<= 2 main_~j~0)} is VALID [2018-11-18 23:58:38,738 INFO L273 TraceCheckUtils]: 141: Hoare triple {11411#(<= 2 main_~j~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11412#(<= 3 main_~j~0)} is VALID [2018-11-18 23:58:38,738 INFO L273 TraceCheckUtils]: 142: Hoare triple {11412#(<= 3 main_~j~0)} assume true; {11412#(<= 3 main_~j~0)} is VALID [2018-11-18 23:58:38,739 INFO L273 TraceCheckUtils]: 143: Hoare triple {11412#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11412#(<= 3 main_~j~0)} is VALID [2018-11-18 23:58:38,739 INFO L273 TraceCheckUtils]: 144: Hoare triple {11412#(<= 3 main_~j~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11412#(<= 3 main_~j~0)} is VALID [2018-11-18 23:58:38,740 INFO L273 TraceCheckUtils]: 145: Hoare triple {11412#(<= 3 main_~j~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11413#(<= 4 main_~j~0)} is VALID [2018-11-18 23:58:38,740 INFO L273 TraceCheckUtils]: 146: Hoare triple {11413#(<= 4 main_~j~0)} assume true; {11413#(<= 4 main_~j~0)} is VALID [2018-11-18 23:58:38,741 INFO L273 TraceCheckUtils]: 147: Hoare triple {11413#(<= 4 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11413#(<= 4 main_~j~0)} is VALID [2018-11-18 23:58:38,742 INFO L273 TraceCheckUtils]: 148: Hoare triple {11413#(<= 4 main_~j~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11413#(<= 4 main_~j~0)} is VALID [2018-11-18 23:58:38,742 INFO L273 TraceCheckUtils]: 149: Hoare triple {11413#(<= 4 main_~j~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11414#(<= 5 main_~j~0)} is VALID [2018-11-18 23:58:38,743 INFO L273 TraceCheckUtils]: 150: Hoare triple {11414#(<= 5 main_~j~0)} assume true; {11414#(<= 5 main_~j~0)} is VALID [2018-11-18 23:58:38,743 INFO L273 TraceCheckUtils]: 151: Hoare triple {11414#(<= 5 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11414#(<= 5 main_~j~0)} is VALID [2018-11-18 23:58:38,744 INFO L273 TraceCheckUtils]: 152: Hoare triple {11414#(<= 5 main_~j~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11414#(<= 5 main_~j~0)} is VALID [2018-11-18 23:58:38,745 INFO L273 TraceCheckUtils]: 153: Hoare triple {11414#(<= 5 main_~j~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11415#(<= 6 main_~j~0)} is VALID [2018-11-18 23:58:38,745 INFO L273 TraceCheckUtils]: 154: Hoare triple {11415#(<= 6 main_~j~0)} assume true; {11415#(<= 6 main_~j~0)} is VALID [2018-11-18 23:58:38,747 INFO L273 TraceCheckUtils]: 155: Hoare triple {11415#(<= 6 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,747 INFO L273 TraceCheckUtils]: 156: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,748 INFO L273 TraceCheckUtils]: 157: Hoare triple {11416#(<= 7 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,748 INFO L273 TraceCheckUtils]: 158: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume true; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,749 INFO L273 TraceCheckUtils]: 159: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,749 INFO L273 TraceCheckUtils]: 160: Hoare triple {11416#(<= 7 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,750 INFO L273 TraceCheckUtils]: 161: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume true; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,750 INFO L273 TraceCheckUtils]: 162: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,751 INFO L273 TraceCheckUtils]: 163: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume true; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,752 INFO L273 TraceCheckUtils]: 164: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,752 INFO L273 TraceCheckUtils]: 165: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,753 INFO L273 TraceCheckUtils]: 166: Hoare triple {11416#(<= 7 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,753 INFO L273 TraceCheckUtils]: 167: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume true; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,754 INFO L273 TraceCheckUtils]: 168: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,755 INFO L273 TraceCheckUtils]: 169: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,755 INFO L273 TraceCheckUtils]: 170: Hoare triple {11416#(<= 7 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,756 INFO L273 TraceCheckUtils]: 171: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume true; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,757 INFO L273 TraceCheckUtils]: 172: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,757 INFO L273 TraceCheckUtils]: 173: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,758 INFO L273 TraceCheckUtils]: 174: Hoare triple {11416#(<= 7 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,758 INFO L273 TraceCheckUtils]: 175: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume true; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,759 INFO L273 TraceCheckUtils]: 176: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,760 INFO L273 TraceCheckUtils]: 177: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,760 INFO L273 TraceCheckUtils]: 178: Hoare triple {11416#(<= 7 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,761 INFO L273 TraceCheckUtils]: 179: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume true; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,761 INFO L273 TraceCheckUtils]: 180: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,762 INFO L273 TraceCheckUtils]: 181: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,763 INFO L273 TraceCheckUtils]: 182: Hoare triple {11416#(<= 7 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,763 INFO L273 TraceCheckUtils]: 183: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume true; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,764 INFO L273 TraceCheckUtils]: 184: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,765 INFO L273 TraceCheckUtils]: 185: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,765 INFO L273 TraceCheckUtils]: 186: Hoare triple {11416#(<= 7 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,766 INFO L273 TraceCheckUtils]: 187: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume true; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,766 INFO L273 TraceCheckUtils]: 188: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,767 INFO L273 TraceCheckUtils]: 189: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,768 INFO L273 TraceCheckUtils]: 190: Hoare triple {11416#(<= 7 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,768 INFO L273 TraceCheckUtils]: 191: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume true; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,769 INFO L273 TraceCheckUtils]: 192: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,770 INFO L273 TraceCheckUtils]: 193: Hoare triple {11416#(<= 7 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,770 INFO L273 TraceCheckUtils]: 194: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume true; {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,771 INFO L273 TraceCheckUtils]: 195: Hoare triple {11416#(<= 7 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {11416#(<= 7 main_~edgecount~0)} is VALID [2018-11-18 23:58:38,772 INFO L273 TraceCheckUtils]: 196: Hoare triple {11416#(<= 7 main_~edgecount~0)} ~i~0 := 0; {11417#(and (<= 7 main_~edgecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:58:38,772 INFO L273 TraceCheckUtils]: 197: Hoare triple {11417#(and (<= 7 main_~edgecount~0) (= main_~i~0 0))} assume true; {11417#(and (<= 7 main_~edgecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:58:38,774 INFO L273 TraceCheckUtils]: 198: Hoare triple {11417#(and (<= 7 main_~edgecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {11417#(and (<= 7 main_~edgecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:58:38,774 INFO L273 TraceCheckUtils]: 199: Hoare triple {11417#(and (<= 7 main_~edgecount~0) (= main_~i~0 0))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {11417#(and (<= 7 main_~edgecount~0) (= main_~i~0 0))} is VALID [2018-11-18 23:58:38,775 INFO L273 TraceCheckUtils]: 200: Hoare triple {11417#(and (<= 7 main_~edgecount~0) (= main_~i~0 0))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11418#(<= (+ main_~i~0 6) main_~edgecount~0)} is VALID [2018-11-18 23:58:38,776 INFO L273 TraceCheckUtils]: 201: Hoare triple {11418#(<= (+ main_~i~0 6) main_~edgecount~0)} assume true; {11418#(<= (+ main_~i~0 6) main_~edgecount~0)} is VALID [2018-11-18 23:58:38,776 INFO L273 TraceCheckUtils]: 202: Hoare triple {11418#(<= (+ main_~i~0 6) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {11418#(<= (+ main_~i~0 6) main_~edgecount~0)} is VALID [2018-11-18 23:58:38,777 INFO L273 TraceCheckUtils]: 203: Hoare triple {11418#(<= (+ main_~i~0 6) main_~edgecount~0)} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {11418#(<= (+ main_~i~0 6) main_~edgecount~0)} is VALID [2018-11-18 23:58:38,778 INFO L273 TraceCheckUtils]: 204: Hoare triple {11418#(<= (+ main_~i~0 6) main_~edgecount~0)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11419#(<= (+ main_~i~0 5) main_~edgecount~0)} is VALID [2018-11-18 23:58:38,778 INFO L273 TraceCheckUtils]: 205: Hoare triple {11419#(<= (+ main_~i~0 5) main_~edgecount~0)} assume true; {11419#(<= (+ main_~i~0 5) main_~edgecount~0)} is VALID [2018-11-18 23:58:38,779 INFO L273 TraceCheckUtils]: 206: Hoare triple {11419#(<= (+ main_~i~0 5) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {11419#(<= (+ main_~i~0 5) main_~edgecount~0)} is VALID [2018-11-18 23:58:38,779 INFO L273 TraceCheckUtils]: 207: Hoare triple {11419#(<= (+ main_~i~0 5) main_~edgecount~0)} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {11419#(<= (+ main_~i~0 5) main_~edgecount~0)} is VALID [2018-11-18 23:58:38,780 INFO L273 TraceCheckUtils]: 208: Hoare triple {11419#(<= (+ main_~i~0 5) main_~edgecount~0)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11420#(<= (+ main_~i~0 4) main_~edgecount~0)} is VALID [2018-11-18 23:58:38,781 INFO L273 TraceCheckUtils]: 209: Hoare triple {11420#(<= (+ main_~i~0 4) main_~edgecount~0)} assume true; {11420#(<= (+ main_~i~0 4) main_~edgecount~0)} is VALID [2018-11-18 23:58:38,781 INFO L273 TraceCheckUtils]: 210: Hoare triple {11420#(<= (+ main_~i~0 4) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {11420#(<= (+ main_~i~0 4) main_~edgecount~0)} is VALID [2018-11-18 23:58:38,782 INFO L273 TraceCheckUtils]: 211: Hoare triple {11420#(<= (+ main_~i~0 4) main_~edgecount~0)} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {11420#(<= (+ main_~i~0 4) main_~edgecount~0)} is VALID [2018-11-18 23:58:38,783 INFO L273 TraceCheckUtils]: 212: Hoare triple {11420#(<= (+ main_~i~0 4) main_~edgecount~0)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11421#(<= (+ main_~i~0 3) main_~edgecount~0)} is VALID [2018-11-18 23:58:38,783 INFO L273 TraceCheckUtils]: 213: Hoare triple {11421#(<= (+ main_~i~0 3) main_~edgecount~0)} assume true; {11421#(<= (+ main_~i~0 3) main_~edgecount~0)} is VALID [2018-11-18 23:58:38,784 INFO L273 TraceCheckUtils]: 214: Hoare triple {11421#(<= (+ main_~i~0 3) main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {11408#false} is VALID [2018-11-18 23:58:38,784 INFO L273 TraceCheckUtils]: 215: Hoare triple {11408#false} ~i~0 := 0; {11408#false} is VALID [2018-11-18 23:58:38,785 INFO L273 TraceCheckUtils]: 216: Hoare triple {11408#false} assume true; {11408#false} is VALID [2018-11-18 23:58:38,785 INFO L273 TraceCheckUtils]: 217: Hoare triple {11408#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11408#false} is VALID [2018-11-18 23:58:38,785 INFO L256 TraceCheckUtils]: 218: Hoare triple {11408#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {11408#false} is VALID [2018-11-18 23:58:38,785 INFO L273 TraceCheckUtils]: 219: Hoare triple {11408#false} ~cond := #in~cond; {11408#false} is VALID [2018-11-18 23:58:38,785 INFO L273 TraceCheckUtils]: 220: Hoare triple {11408#false} assume 0 == ~cond; {11408#false} is VALID [2018-11-18 23:58:38,786 INFO L273 TraceCheckUtils]: 221: Hoare triple {11408#false} assume !false; {11408#false} is VALID [2018-11-18 23:58:38,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2872 backedges. 1428 proven. 276 refuted. 0 times theorem prover too weak. 1168 trivial. 0 not checked. [2018-11-18 23:58:38,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:58:38,835 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:58:38,845 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 23:58:39,347 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-18 23:58:39,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:58:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:39,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:58:39,904 INFO L256 TraceCheckUtils]: 0: Hoare triple {11407#true} call ULTIMATE.init(); {11407#true} is VALID [2018-11-18 23:58:39,904 INFO L273 TraceCheckUtils]: 1: Hoare triple {11407#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {11407#true} is VALID [2018-11-18 23:58:39,905 INFO L273 TraceCheckUtils]: 2: Hoare triple {11407#true} assume true; {11407#true} is VALID [2018-11-18 23:58:39,905 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11407#true} {11407#true} #108#return; {11407#true} is VALID [2018-11-18 23:58:39,905 INFO L256 TraceCheckUtils]: 4: Hoare triple {11407#true} call #t~ret18 := main(); {11407#true} is VALID [2018-11-18 23:58:39,907 INFO L273 TraceCheckUtils]: 5: Hoare triple {11407#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,907 INFO L273 TraceCheckUtils]: 6: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,908 INFO L273 TraceCheckUtils]: 7: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,908 INFO L273 TraceCheckUtils]: 8: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,909 INFO L273 TraceCheckUtils]: 9: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,909 INFO L273 TraceCheckUtils]: 10: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,910 INFO L273 TraceCheckUtils]: 11: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,910 INFO L273 TraceCheckUtils]: 12: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,911 INFO L273 TraceCheckUtils]: 13: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,911 INFO L273 TraceCheckUtils]: 14: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,912 INFO L273 TraceCheckUtils]: 15: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,912 INFO L273 TraceCheckUtils]: 16: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,913 INFO L273 TraceCheckUtils]: 17: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,913 INFO L273 TraceCheckUtils]: 18: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,914 INFO L273 TraceCheckUtils]: 19: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,914 INFO L273 TraceCheckUtils]: 20: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,915 INFO L273 TraceCheckUtils]: 21: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,915 INFO L273 TraceCheckUtils]: 22: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,916 INFO L273 TraceCheckUtils]: 23: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,916 INFO L273 TraceCheckUtils]: 24: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,917 INFO L273 TraceCheckUtils]: 25: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,917 INFO L273 TraceCheckUtils]: 26: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,918 INFO L273 TraceCheckUtils]: 27: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,918 INFO L273 TraceCheckUtils]: 28: Hoare triple {11440#(<= 20 main_~edgecount~0)} ~i~0 := 0; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,919 INFO L273 TraceCheckUtils]: 29: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,919 INFO L273 TraceCheckUtils]: 30: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,920 INFO L273 TraceCheckUtils]: 31: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,920 INFO L273 TraceCheckUtils]: 32: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,921 INFO L273 TraceCheckUtils]: 33: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,921 INFO L273 TraceCheckUtils]: 34: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,922 INFO L273 TraceCheckUtils]: 35: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,922 INFO L273 TraceCheckUtils]: 36: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,923 INFO L273 TraceCheckUtils]: 37: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,924 INFO L273 TraceCheckUtils]: 38: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,924 INFO L273 TraceCheckUtils]: 39: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,925 INFO L273 TraceCheckUtils]: 40: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,925 INFO L273 TraceCheckUtils]: 41: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,926 INFO L273 TraceCheckUtils]: 42: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,926 INFO L273 TraceCheckUtils]: 43: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,927 INFO L273 TraceCheckUtils]: 44: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,927 INFO L273 TraceCheckUtils]: 45: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,928 INFO L273 TraceCheckUtils]: 46: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,928 INFO L273 TraceCheckUtils]: 47: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,929 INFO L273 TraceCheckUtils]: 48: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,929 INFO L273 TraceCheckUtils]: 49: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,930 INFO L273 TraceCheckUtils]: 50: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,930 INFO L273 TraceCheckUtils]: 51: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,931 INFO L273 TraceCheckUtils]: 52: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,931 INFO L273 TraceCheckUtils]: 53: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,932 INFO L273 TraceCheckUtils]: 54: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,932 INFO L273 TraceCheckUtils]: 55: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,933 INFO L273 TraceCheckUtils]: 56: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,933 INFO L273 TraceCheckUtils]: 57: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,934 INFO L273 TraceCheckUtils]: 58: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,934 INFO L273 TraceCheckUtils]: 59: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,935 INFO L273 TraceCheckUtils]: 60: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,935 INFO L273 TraceCheckUtils]: 61: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,936 INFO L273 TraceCheckUtils]: 62: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,936 INFO L273 TraceCheckUtils]: 63: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,937 INFO L273 TraceCheckUtils]: 64: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,937 INFO L273 TraceCheckUtils]: 65: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,938 INFO L273 TraceCheckUtils]: 66: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,938 INFO L273 TraceCheckUtils]: 67: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,939 INFO L273 TraceCheckUtils]: 68: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,939 INFO L273 TraceCheckUtils]: 69: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,940 INFO L273 TraceCheckUtils]: 70: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,940 INFO L273 TraceCheckUtils]: 71: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,941 INFO L273 TraceCheckUtils]: 72: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,941 INFO L273 TraceCheckUtils]: 73: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,942 INFO L273 TraceCheckUtils]: 74: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,942 INFO L273 TraceCheckUtils]: 75: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,943 INFO L273 TraceCheckUtils]: 76: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,943 INFO L273 TraceCheckUtils]: 77: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,944 INFO L273 TraceCheckUtils]: 78: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,944 INFO L273 TraceCheckUtils]: 79: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,945 INFO L273 TraceCheckUtils]: 80: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,945 INFO L273 TraceCheckUtils]: 81: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,946 INFO L273 TraceCheckUtils]: 82: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,946 INFO L273 TraceCheckUtils]: 83: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,946 INFO L273 TraceCheckUtils]: 84: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,947 INFO L273 TraceCheckUtils]: 85: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,948 INFO L273 TraceCheckUtils]: 86: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,948 INFO L273 TraceCheckUtils]: 87: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,949 INFO L273 TraceCheckUtils]: 88: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,950 INFO L273 TraceCheckUtils]: 89: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,950 INFO L273 TraceCheckUtils]: 90: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,951 INFO L273 TraceCheckUtils]: 91: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,951 INFO L273 TraceCheckUtils]: 92: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,952 INFO L273 TraceCheckUtils]: 93: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,952 INFO L273 TraceCheckUtils]: 94: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,953 INFO L273 TraceCheckUtils]: 95: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,953 INFO L273 TraceCheckUtils]: 96: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,954 INFO L273 TraceCheckUtils]: 97: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,954 INFO L273 TraceCheckUtils]: 98: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,955 INFO L273 TraceCheckUtils]: 99: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,955 INFO L273 TraceCheckUtils]: 100: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,956 INFO L273 TraceCheckUtils]: 101: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,956 INFO L273 TraceCheckUtils]: 102: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,957 INFO L273 TraceCheckUtils]: 103: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,957 INFO L273 TraceCheckUtils]: 104: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,958 INFO L273 TraceCheckUtils]: 105: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,958 INFO L273 TraceCheckUtils]: 106: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,959 INFO L273 TraceCheckUtils]: 107: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,959 INFO L273 TraceCheckUtils]: 108: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,960 INFO L273 TraceCheckUtils]: 109: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,960 INFO L273 TraceCheckUtils]: 110: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,961 INFO L273 TraceCheckUtils]: 111: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,961 INFO L273 TraceCheckUtils]: 112: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,962 INFO L273 TraceCheckUtils]: 113: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,962 INFO L273 TraceCheckUtils]: 114: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,963 INFO L273 TraceCheckUtils]: 115: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,963 INFO L273 TraceCheckUtils]: 116: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,964 INFO L273 TraceCheckUtils]: 117: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,964 INFO L273 TraceCheckUtils]: 118: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,965 INFO L273 TraceCheckUtils]: 119: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,965 INFO L273 TraceCheckUtils]: 120: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,966 INFO L273 TraceCheckUtils]: 121: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,966 INFO L273 TraceCheckUtils]: 122: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,967 INFO L273 TraceCheckUtils]: 123: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,967 INFO L273 TraceCheckUtils]: 124: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,968 INFO L273 TraceCheckUtils]: 125: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,968 INFO L273 TraceCheckUtils]: 126: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,969 INFO L273 TraceCheckUtils]: 127: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,969 INFO L273 TraceCheckUtils]: 128: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,970 INFO L273 TraceCheckUtils]: 129: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,970 INFO L273 TraceCheckUtils]: 130: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,971 INFO L273 TraceCheckUtils]: 131: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,971 INFO L273 TraceCheckUtils]: 132: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,972 INFO L273 TraceCheckUtils]: 133: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,972 INFO L273 TraceCheckUtils]: 134: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,973 INFO L273 TraceCheckUtils]: 135: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,973 INFO L273 TraceCheckUtils]: 136: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,974 INFO L273 TraceCheckUtils]: 137: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,975 INFO L273 TraceCheckUtils]: 138: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,975 INFO L273 TraceCheckUtils]: 139: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,976 INFO L273 TraceCheckUtils]: 140: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,976 INFO L273 TraceCheckUtils]: 141: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,977 INFO L273 TraceCheckUtils]: 142: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,977 INFO L273 TraceCheckUtils]: 143: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,978 INFO L273 TraceCheckUtils]: 144: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,978 INFO L273 TraceCheckUtils]: 145: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,979 INFO L273 TraceCheckUtils]: 146: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,979 INFO L273 TraceCheckUtils]: 147: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,980 INFO L273 TraceCheckUtils]: 148: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,980 INFO L273 TraceCheckUtils]: 149: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,981 INFO L273 TraceCheckUtils]: 150: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,981 INFO L273 TraceCheckUtils]: 151: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,982 INFO L273 TraceCheckUtils]: 152: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,982 INFO L273 TraceCheckUtils]: 153: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,983 INFO L273 TraceCheckUtils]: 154: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,983 INFO L273 TraceCheckUtils]: 155: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,984 INFO L273 TraceCheckUtils]: 156: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,984 INFO L273 TraceCheckUtils]: 157: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,985 INFO L273 TraceCheckUtils]: 158: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,985 INFO L273 TraceCheckUtils]: 159: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,986 INFO L273 TraceCheckUtils]: 160: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,986 INFO L273 TraceCheckUtils]: 161: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,987 INFO L273 TraceCheckUtils]: 162: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,987 INFO L273 TraceCheckUtils]: 163: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,988 INFO L273 TraceCheckUtils]: 164: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,988 INFO L273 TraceCheckUtils]: 165: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,989 INFO L273 TraceCheckUtils]: 166: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,989 INFO L273 TraceCheckUtils]: 167: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,990 INFO L273 TraceCheckUtils]: 168: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,990 INFO L273 TraceCheckUtils]: 169: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,991 INFO L273 TraceCheckUtils]: 170: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,991 INFO L273 TraceCheckUtils]: 171: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,992 INFO L273 TraceCheckUtils]: 172: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,992 INFO L273 TraceCheckUtils]: 173: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,993 INFO L273 TraceCheckUtils]: 174: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,993 INFO L273 TraceCheckUtils]: 175: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,994 INFO L273 TraceCheckUtils]: 176: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,994 INFO L273 TraceCheckUtils]: 177: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,995 INFO L273 TraceCheckUtils]: 178: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,995 INFO L273 TraceCheckUtils]: 179: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,996 INFO L273 TraceCheckUtils]: 180: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,996 INFO L273 TraceCheckUtils]: 181: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,997 INFO L273 TraceCheckUtils]: 182: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,997 INFO L273 TraceCheckUtils]: 183: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,998 INFO L273 TraceCheckUtils]: 184: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,998 INFO L273 TraceCheckUtils]: 185: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,999 INFO L273 TraceCheckUtils]: 186: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:39,999 INFO L273 TraceCheckUtils]: 187: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:40,000 INFO L273 TraceCheckUtils]: 188: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:40,000 INFO L273 TraceCheckUtils]: 189: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:40,001 INFO L273 TraceCheckUtils]: 190: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:40,001 INFO L273 TraceCheckUtils]: 191: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:40,002 INFO L273 TraceCheckUtils]: 192: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:40,002 INFO L273 TraceCheckUtils]: 193: Hoare triple {11440#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:40,003 INFO L273 TraceCheckUtils]: 194: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume true; {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:40,003 INFO L273 TraceCheckUtils]: 195: Hoare triple {11440#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {11440#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:40,004 INFO L273 TraceCheckUtils]: 196: Hoare triple {11440#(<= 20 main_~edgecount~0)} ~i~0 := 0; {12014#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-18 23:58:40,005 INFO L273 TraceCheckUtils]: 197: Hoare triple {12014#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} assume true; {12014#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-18 23:58:40,006 INFO L273 TraceCheckUtils]: 198: Hoare triple {12014#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {12014#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-18 23:58:40,006 INFO L273 TraceCheckUtils]: 199: Hoare triple {12014#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {12014#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-18 23:58:40,007 INFO L273 TraceCheckUtils]: 200: Hoare triple {12014#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {12027#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-18 23:58:40,008 INFO L273 TraceCheckUtils]: 201: Hoare triple {12027#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} assume true; {12027#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-18 23:58:40,009 INFO L273 TraceCheckUtils]: 202: Hoare triple {12027#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {12027#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-18 23:58:40,010 INFO L273 TraceCheckUtils]: 203: Hoare triple {12027#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {12027#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-18 23:58:40,010 INFO L273 TraceCheckUtils]: 204: Hoare triple {12027#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {12040#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2018-11-18 23:58:40,011 INFO L273 TraceCheckUtils]: 205: Hoare triple {12040#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} assume true; {12040#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2018-11-18 23:58:40,012 INFO L273 TraceCheckUtils]: 206: Hoare triple {12040#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {12040#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2018-11-18 23:58:40,013 INFO L273 TraceCheckUtils]: 207: Hoare triple {12040#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {12040#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2018-11-18 23:58:40,014 INFO L273 TraceCheckUtils]: 208: Hoare triple {12040#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {12053#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2018-11-18 23:58:40,014 INFO L273 TraceCheckUtils]: 209: Hoare triple {12053#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} assume true; {12053#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2018-11-18 23:58:40,015 INFO L273 TraceCheckUtils]: 210: Hoare triple {12053#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {12053#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2018-11-18 23:58:40,016 INFO L273 TraceCheckUtils]: 211: Hoare triple {12053#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {12053#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2018-11-18 23:58:40,017 INFO L273 TraceCheckUtils]: 212: Hoare triple {12053#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {12066#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} is VALID [2018-11-18 23:58:40,017 INFO L273 TraceCheckUtils]: 213: Hoare triple {12066#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} assume true; {12066#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} is VALID [2018-11-18 23:58:40,018 INFO L273 TraceCheckUtils]: 214: Hoare triple {12066#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} assume !(~i~0 < ~edgecount~0); {11408#false} is VALID [2018-11-18 23:58:40,018 INFO L273 TraceCheckUtils]: 215: Hoare triple {11408#false} ~i~0 := 0; {11408#false} is VALID [2018-11-18 23:58:40,018 INFO L273 TraceCheckUtils]: 216: Hoare triple {11408#false} assume true; {11408#false} is VALID [2018-11-18 23:58:40,019 INFO L273 TraceCheckUtils]: 217: Hoare triple {11408#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11408#false} is VALID [2018-11-18 23:58:40,019 INFO L256 TraceCheckUtils]: 218: Hoare triple {11408#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {11408#false} is VALID [2018-11-18 23:58:40,019 INFO L273 TraceCheckUtils]: 219: Hoare triple {11408#false} ~cond := #in~cond; {11408#false} is VALID [2018-11-18 23:58:40,019 INFO L273 TraceCheckUtils]: 220: Hoare triple {11408#false} assume 0 == ~cond; {11408#false} is VALID [2018-11-18 23:58:40,019 INFO L273 TraceCheckUtils]: 221: Hoare triple {11408#false} assume !false; {11408#false} is VALID [2018-11-18 23:58:40,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2872 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 2840 trivial. 0 not checked. [2018-11-18 23:58:40,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:58:40,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 21 [2018-11-18 23:58:40,074 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 222 [2018-11-18 23:58:40,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:58:40,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-18 23:58:40,205 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:40,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 23:58:40,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 23:58:40,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2018-11-18 23:58:40,206 INFO L87 Difference]: Start difference. First operand 227 states and 270 transitions. Second operand 21 states. [2018-11-18 23:58:46,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:46,621 INFO L93 Difference]: Finished difference Result 495 states and 600 transitions. [2018-11-18 23:58:46,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-11-18 23:58:46,622 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 222 [2018-11-18 23:58:46,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:58:46,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 23:58:46,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 580 transitions. [2018-11-18 23:58:46,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 23:58:46,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 580 transitions. [2018-11-18 23:58:46,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 82 states and 580 transitions. [2018-11-18 23:58:47,829 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 580 edges. 580 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:47,843 INFO L225 Difference]: With dead ends: 495 [2018-11-18 23:58:47,843 INFO L226 Difference]: Without dead ends: 483 [2018-11-18 23:58:47,846 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3433 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2355, Invalid=6765, Unknown=0, NotChecked=0, Total=9120 [2018-11-18 23:58:47,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-11-18 23:58:48,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 247. [2018-11-18 23:58:48,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:58:48,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 483 states. Second operand 247 states. [2018-11-18 23:58:48,354 INFO L74 IsIncluded]: Start isIncluded. First operand 483 states. Second operand 247 states. [2018-11-18 23:58:48,354 INFO L87 Difference]: Start difference. First operand 483 states. Second operand 247 states. [2018-11-18 23:58:48,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:48,368 INFO L93 Difference]: Finished difference Result 483 states and 583 transitions. [2018-11-18 23:58:48,368 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 583 transitions. [2018-11-18 23:58:48,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:48,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:48,370 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand 483 states. [2018-11-18 23:58:48,370 INFO L87 Difference]: Start difference. First operand 247 states. Second operand 483 states. [2018-11-18 23:58:48,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:48,382 INFO L93 Difference]: Finished difference Result 483 states and 583 transitions. [2018-11-18 23:58:48,383 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 583 transitions. [2018-11-18 23:58:48,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:48,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:48,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:58:48,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:58:48,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-11-18 23:58:48,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 290 transitions. [2018-11-18 23:58:48,390 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 290 transitions. Word has length 222 [2018-11-18 23:58:48,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:58:48,390 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 290 transitions. [2018-11-18 23:58:48,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 23:58:48,390 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 290 transitions. [2018-11-18 23:58:48,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-11-18 23:58:48,393 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:58:48,394 INFO L375 BasicCegarLoop]: trace histogram [40, 35, 35, 35, 10, 9, 9, 9, 6, 6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:58:48,394 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:58:48,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:58:48,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1929751567, now seen corresponding path program 7 times [2018-11-18 23:58:48,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:58:48,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:58:48,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:48,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:58:48,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:49,079 INFO L256 TraceCheckUtils]: 0: Hoare triple {14228#true} call ULTIMATE.init(); {14228#true} is VALID [2018-11-18 23:58:49,080 INFO L273 TraceCheckUtils]: 1: Hoare triple {14228#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {14228#true} is VALID [2018-11-18 23:58:49,080 INFO L273 TraceCheckUtils]: 2: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,080 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14228#true} {14228#true} #108#return; {14228#true} is VALID [2018-11-18 23:58:49,080 INFO L256 TraceCheckUtils]: 4: Hoare triple {14228#true} call #t~ret18 := main(); {14228#true} is VALID [2018-11-18 23:58:49,080 INFO L273 TraceCheckUtils]: 5: Hoare triple {14228#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {14228#true} is VALID [2018-11-18 23:58:49,080 INFO L273 TraceCheckUtils]: 6: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,080 INFO L273 TraceCheckUtils]: 7: Hoare triple {14228#true} assume !!(~i~0 < ~nodecount~0); {14228#true} is VALID [2018-11-18 23:58:49,080 INFO L273 TraceCheckUtils]: 8: Hoare triple {14228#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14228#true} is VALID [2018-11-18 23:58:49,081 INFO L273 TraceCheckUtils]: 9: Hoare triple {14228#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14228#true} is VALID [2018-11-18 23:58:49,081 INFO L273 TraceCheckUtils]: 10: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,081 INFO L273 TraceCheckUtils]: 11: Hoare triple {14228#true} assume !!(~i~0 < ~nodecount~0); {14228#true} is VALID [2018-11-18 23:58:49,081 INFO L273 TraceCheckUtils]: 12: Hoare triple {14228#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14228#true} is VALID [2018-11-18 23:58:49,081 INFO L273 TraceCheckUtils]: 13: Hoare triple {14228#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14228#true} is VALID [2018-11-18 23:58:49,081 INFO L273 TraceCheckUtils]: 14: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,081 INFO L273 TraceCheckUtils]: 15: Hoare triple {14228#true} assume !!(~i~0 < ~nodecount~0); {14228#true} is VALID [2018-11-18 23:58:49,081 INFO L273 TraceCheckUtils]: 16: Hoare triple {14228#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14228#true} is VALID [2018-11-18 23:58:49,081 INFO L273 TraceCheckUtils]: 17: Hoare triple {14228#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14228#true} is VALID [2018-11-18 23:58:49,082 INFO L273 TraceCheckUtils]: 18: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,082 INFO L273 TraceCheckUtils]: 19: Hoare triple {14228#true} assume !!(~i~0 < ~nodecount~0); {14228#true} is VALID [2018-11-18 23:58:49,082 INFO L273 TraceCheckUtils]: 20: Hoare triple {14228#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14228#true} is VALID [2018-11-18 23:58:49,082 INFO L273 TraceCheckUtils]: 21: Hoare triple {14228#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14228#true} is VALID [2018-11-18 23:58:49,082 INFO L273 TraceCheckUtils]: 22: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,082 INFO L273 TraceCheckUtils]: 23: Hoare triple {14228#true} assume !!(~i~0 < ~nodecount~0); {14228#true} is VALID [2018-11-18 23:58:49,082 INFO L273 TraceCheckUtils]: 24: Hoare triple {14228#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14228#true} is VALID [2018-11-18 23:58:49,082 INFO L273 TraceCheckUtils]: 25: Hoare triple {14228#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14228#true} is VALID [2018-11-18 23:58:49,083 INFO L273 TraceCheckUtils]: 26: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,083 INFO L273 TraceCheckUtils]: 27: Hoare triple {14228#true} assume !(~i~0 < ~nodecount~0); {14228#true} is VALID [2018-11-18 23:58:49,083 INFO L273 TraceCheckUtils]: 28: Hoare triple {14228#true} ~i~0 := 0; {14228#true} is VALID [2018-11-18 23:58:49,083 INFO L273 TraceCheckUtils]: 29: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,083 INFO L273 TraceCheckUtils]: 30: Hoare triple {14228#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14228#true} is VALID [2018-11-18 23:58:49,083 INFO L273 TraceCheckUtils]: 31: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,083 INFO L273 TraceCheckUtils]: 32: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14228#true} is VALID [2018-11-18 23:58:49,083 INFO L273 TraceCheckUtils]: 33: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14228#true} is VALID [2018-11-18 23:58:49,083 INFO L273 TraceCheckUtils]: 34: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14228#true} is VALID [2018-11-18 23:58:49,084 INFO L273 TraceCheckUtils]: 35: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,084 INFO L273 TraceCheckUtils]: 36: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14228#true} is VALID [2018-11-18 23:58:49,084 INFO L273 TraceCheckUtils]: 37: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14228#true} is VALID [2018-11-18 23:58:49,084 INFO L273 TraceCheckUtils]: 38: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14228#true} is VALID [2018-11-18 23:58:49,084 INFO L273 TraceCheckUtils]: 39: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,084 INFO L273 TraceCheckUtils]: 40: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14228#true} is VALID [2018-11-18 23:58:49,084 INFO L273 TraceCheckUtils]: 41: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14228#true} is VALID [2018-11-18 23:58:49,084 INFO L273 TraceCheckUtils]: 42: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14228#true} is VALID [2018-11-18 23:58:49,085 INFO L273 TraceCheckUtils]: 43: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,085 INFO L273 TraceCheckUtils]: 44: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14228#true} is VALID [2018-11-18 23:58:49,085 INFO L273 TraceCheckUtils]: 45: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14228#true} is VALID [2018-11-18 23:58:49,085 INFO L273 TraceCheckUtils]: 46: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14228#true} is VALID [2018-11-18 23:58:49,085 INFO L273 TraceCheckUtils]: 47: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,085 INFO L273 TraceCheckUtils]: 48: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14228#true} is VALID [2018-11-18 23:58:49,085 INFO L273 TraceCheckUtils]: 49: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14228#true} is VALID [2018-11-18 23:58:49,085 INFO L273 TraceCheckUtils]: 50: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14228#true} is VALID [2018-11-18 23:58:49,085 INFO L273 TraceCheckUtils]: 51: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,086 INFO L273 TraceCheckUtils]: 52: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14228#true} is VALID [2018-11-18 23:58:49,086 INFO L273 TraceCheckUtils]: 53: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14228#true} is VALID [2018-11-18 23:58:49,086 INFO L273 TraceCheckUtils]: 54: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14228#true} is VALID [2018-11-18 23:58:49,086 INFO L273 TraceCheckUtils]: 55: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,086 INFO L273 TraceCheckUtils]: 56: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14228#true} is VALID [2018-11-18 23:58:49,086 INFO L273 TraceCheckUtils]: 57: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14228#true} is VALID [2018-11-18 23:58:49,086 INFO L273 TraceCheckUtils]: 58: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14228#true} is VALID [2018-11-18 23:58:49,086 INFO L273 TraceCheckUtils]: 59: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,086 INFO L273 TraceCheckUtils]: 60: Hoare triple {14228#true} assume !(~j~0 < ~edgecount~0); {14228#true} is VALID [2018-11-18 23:58:49,087 INFO L273 TraceCheckUtils]: 61: Hoare triple {14228#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14228#true} is VALID [2018-11-18 23:58:49,087 INFO L273 TraceCheckUtils]: 62: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,087 INFO L273 TraceCheckUtils]: 63: Hoare triple {14228#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14228#true} is VALID [2018-11-18 23:58:49,087 INFO L273 TraceCheckUtils]: 64: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,087 INFO L273 TraceCheckUtils]: 65: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14228#true} is VALID [2018-11-18 23:58:49,087 INFO L273 TraceCheckUtils]: 66: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14228#true} is VALID [2018-11-18 23:58:49,087 INFO L273 TraceCheckUtils]: 67: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14228#true} is VALID [2018-11-18 23:58:49,087 INFO L273 TraceCheckUtils]: 68: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,088 INFO L273 TraceCheckUtils]: 69: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14228#true} is VALID [2018-11-18 23:58:49,088 INFO L273 TraceCheckUtils]: 70: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14228#true} is VALID [2018-11-18 23:58:49,088 INFO L273 TraceCheckUtils]: 71: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14228#true} is VALID [2018-11-18 23:58:49,088 INFO L273 TraceCheckUtils]: 72: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,088 INFO L273 TraceCheckUtils]: 73: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14228#true} is VALID [2018-11-18 23:58:49,088 INFO L273 TraceCheckUtils]: 74: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14228#true} is VALID [2018-11-18 23:58:49,088 INFO L273 TraceCheckUtils]: 75: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14228#true} is VALID [2018-11-18 23:58:49,088 INFO L273 TraceCheckUtils]: 76: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,088 INFO L273 TraceCheckUtils]: 77: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14228#true} is VALID [2018-11-18 23:58:49,089 INFO L273 TraceCheckUtils]: 78: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14228#true} is VALID [2018-11-18 23:58:49,089 INFO L273 TraceCheckUtils]: 79: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14228#true} is VALID [2018-11-18 23:58:49,089 INFO L273 TraceCheckUtils]: 80: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,089 INFO L273 TraceCheckUtils]: 81: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14228#true} is VALID [2018-11-18 23:58:49,089 INFO L273 TraceCheckUtils]: 82: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14228#true} is VALID [2018-11-18 23:58:49,089 INFO L273 TraceCheckUtils]: 83: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14228#true} is VALID [2018-11-18 23:58:49,089 INFO L273 TraceCheckUtils]: 84: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,089 INFO L273 TraceCheckUtils]: 85: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14228#true} is VALID [2018-11-18 23:58:49,090 INFO L273 TraceCheckUtils]: 86: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14228#true} is VALID [2018-11-18 23:58:49,090 INFO L273 TraceCheckUtils]: 87: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14228#true} is VALID [2018-11-18 23:58:49,090 INFO L273 TraceCheckUtils]: 88: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,090 INFO L273 TraceCheckUtils]: 89: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14228#true} is VALID [2018-11-18 23:58:49,090 INFO L273 TraceCheckUtils]: 90: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14228#true} is VALID [2018-11-18 23:58:49,090 INFO L273 TraceCheckUtils]: 91: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14228#true} is VALID [2018-11-18 23:58:49,090 INFO L273 TraceCheckUtils]: 92: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,090 INFO L273 TraceCheckUtils]: 93: Hoare triple {14228#true} assume !(~j~0 < ~edgecount~0); {14228#true} is VALID [2018-11-18 23:58:49,090 INFO L273 TraceCheckUtils]: 94: Hoare triple {14228#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14228#true} is VALID [2018-11-18 23:58:49,091 INFO L273 TraceCheckUtils]: 95: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,091 INFO L273 TraceCheckUtils]: 96: Hoare triple {14228#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14228#true} is VALID [2018-11-18 23:58:49,091 INFO L273 TraceCheckUtils]: 97: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,091 INFO L273 TraceCheckUtils]: 98: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14228#true} is VALID [2018-11-18 23:58:49,091 INFO L273 TraceCheckUtils]: 99: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14228#true} is VALID [2018-11-18 23:58:49,091 INFO L273 TraceCheckUtils]: 100: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14228#true} is VALID [2018-11-18 23:58:49,091 INFO L273 TraceCheckUtils]: 101: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,091 INFO L273 TraceCheckUtils]: 102: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14228#true} is VALID [2018-11-18 23:58:49,092 INFO L273 TraceCheckUtils]: 103: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14228#true} is VALID [2018-11-18 23:58:49,092 INFO L273 TraceCheckUtils]: 104: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14228#true} is VALID [2018-11-18 23:58:49,092 INFO L273 TraceCheckUtils]: 105: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,092 INFO L273 TraceCheckUtils]: 106: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14228#true} is VALID [2018-11-18 23:58:49,092 INFO L273 TraceCheckUtils]: 107: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14228#true} is VALID [2018-11-18 23:58:49,092 INFO L273 TraceCheckUtils]: 108: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14228#true} is VALID [2018-11-18 23:58:49,092 INFO L273 TraceCheckUtils]: 109: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,092 INFO L273 TraceCheckUtils]: 110: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14228#true} is VALID [2018-11-18 23:58:49,092 INFO L273 TraceCheckUtils]: 111: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14228#true} is VALID [2018-11-18 23:58:49,093 INFO L273 TraceCheckUtils]: 112: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14228#true} is VALID [2018-11-18 23:58:49,093 INFO L273 TraceCheckUtils]: 113: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,093 INFO L273 TraceCheckUtils]: 114: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14228#true} is VALID [2018-11-18 23:58:49,093 INFO L273 TraceCheckUtils]: 115: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14228#true} is VALID [2018-11-18 23:58:49,093 INFO L273 TraceCheckUtils]: 116: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14228#true} is VALID [2018-11-18 23:58:49,093 INFO L273 TraceCheckUtils]: 117: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,093 INFO L273 TraceCheckUtils]: 118: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14228#true} is VALID [2018-11-18 23:58:49,093 INFO L273 TraceCheckUtils]: 119: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14228#true} is VALID [2018-11-18 23:58:49,093 INFO L273 TraceCheckUtils]: 120: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14228#true} is VALID [2018-11-18 23:58:49,094 INFO L273 TraceCheckUtils]: 121: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,094 INFO L273 TraceCheckUtils]: 122: Hoare triple {14228#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14228#true} is VALID [2018-11-18 23:58:49,094 INFO L273 TraceCheckUtils]: 123: Hoare triple {14228#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14228#true} is VALID [2018-11-18 23:58:49,094 INFO L273 TraceCheckUtils]: 124: Hoare triple {14228#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14228#true} is VALID [2018-11-18 23:58:49,094 INFO L273 TraceCheckUtils]: 125: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,094 INFO L273 TraceCheckUtils]: 126: Hoare triple {14228#true} assume !(~j~0 < ~edgecount~0); {14228#true} is VALID [2018-11-18 23:58:49,094 INFO L273 TraceCheckUtils]: 127: Hoare triple {14228#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14228#true} is VALID [2018-11-18 23:58:49,094 INFO L273 TraceCheckUtils]: 128: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,095 INFO L273 TraceCheckUtils]: 129: Hoare triple {14228#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14230#(= main_~j~0 0)} is VALID [2018-11-18 23:58:49,095 INFO L273 TraceCheckUtils]: 130: Hoare triple {14230#(= main_~j~0 0)} assume true; {14230#(= main_~j~0 0)} is VALID [2018-11-18 23:58:49,095 INFO L273 TraceCheckUtils]: 131: Hoare triple {14230#(= main_~j~0 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14230#(= main_~j~0 0)} is VALID [2018-11-18 23:58:49,096 INFO L273 TraceCheckUtils]: 132: Hoare triple {14230#(= main_~j~0 0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14230#(= main_~j~0 0)} is VALID [2018-11-18 23:58:49,096 INFO L273 TraceCheckUtils]: 133: Hoare triple {14230#(= main_~j~0 0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14231#(<= main_~j~0 1)} is VALID [2018-11-18 23:58:49,097 INFO L273 TraceCheckUtils]: 134: Hoare triple {14231#(<= main_~j~0 1)} assume true; {14231#(<= main_~j~0 1)} is VALID [2018-11-18 23:58:49,097 INFO L273 TraceCheckUtils]: 135: Hoare triple {14231#(<= main_~j~0 1)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14231#(<= main_~j~0 1)} is VALID [2018-11-18 23:58:49,097 INFO L273 TraceCheckUtils]: 136: Hoare triple {14231#(<= main_~j~0 1)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14231#(<= main_~j~0 1)} is VALID [2018-11-18 23:58:49,098 INFO L273 TraceCheckUtils]: 137: Hoare triple {14231#(<= main_~j~0 1)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14232#(<= main_~j~0 2)} is VALID [2018-11-18 23:58:49,098 INFO L273 TraceCheckUtils]: 138: Hoare triple {14232#(<= main_~j~0 2)} assume true; {14232#(<= main_~j~0 2)} is VALID [2018-11-18 23:58:49,098 INFO L273 TraceCheckUtils]: 139: Hoare triple {14232#(<= main_~j~0 2)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14232#(<= main_~j~0 2)} is VALID [2018-11-18 23:58:49,099 INFO L273 TraceCheckUtils]: 140: Hoare triple {14232#(<= main_~j~0 2)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14232#(<= main_~j~0 2)} is VALID [2018-11-18 23:58:49,099 INFO L273 TraceCheckUtils]: 141: Hoare triple {14232#(<= main_~j~0 2)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14233#(<= main_~j~0 3)} is VALID [2018-11-18 23:58:49,099 INFO L273 TraceCheckUtils]: 142: Hoare triple {14233#(<= main_~j~0 3)} assume true; {14233#(<= main_~j~0 3)} is VALID [2018-11-18 23:58:49,100 INFO L273 TraceCheckUtils]: 143: Hoare triple {14233#(<= main_~j~0 3)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14233#(<= main_~j~0 3)} is VALID [2018-11-18 23:58:49,100 INFO L273 TraceCheckUtils]: 144: Hoare triple {14233#(<= main_~j~0 3)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14233#(<= main_~j~0 3)} is VALID [2018-11-18 23:58:49,101 INFO L273 TraceCheckUtils]: 145: Hoare triple {14233#(<= main_~j~0 3)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14234#(<= main_~j~0 4)} is VALID [2018-11-18 23:58:49,102 INFO L273 TraceCheckUtils]: 146: Hoare triple {14234#(<= main_~j~0 4)} assume true; {14234#(<= main_~j~0 4)} is VALID [2018-11-18 23:58:49,102 INFO L273 TraceCheckUtils]: 147: Hoare triple {14234#(<= main_~j~0 4)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14234#(<= main_~j~0 4)} is VALID [2018-11-18 23:58:49,103 INFO L273 TraceCheckUtils]: 148: Hoare triple {14234#(<= main_~j~0 4)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14234#(<= main_~j~0 4)} is VALID [2018-11-18 23:58:49,104 INFO L273 TraceCheckUtils]: 149: Hoare triple {14234#(<= main_~j~0 4)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14235#(<= main_~j~0 5)} is VALID [2018-11-18 23:58:49,104 INFO L273 TraceCheckUtils]: 150: Hoare triple {14235#(<= main_~j~0 5)} assume true; {14235#(<= main_~j~0 5)} is VALID [2018-11-18 23:58:49,105 INFO L273 TraceCheckUtils]: 151: Hoare triple {14235#(<= main_~j~0 5)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14235#(<= main_~j~0 5)} is VALID [2018-11-18 23:58:49,105 INFO L273 TraceCheckUtils]: 152: Hoare triple {14235#(<= main_~j~0 5)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14235#(<= main_~j~0 5)} is VALID [2018-11-18 23:58:49,106 INFO L273 TraceCheckUtils]: 153: Hoare triple {14235#(<= main_~j~0 5)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14236#(<= main_~j~0 6)} is VALID [2018-11-18 23:58:49,106 INFO L273 TraceCheckUtils]: 154: Hoare triple {14236#(<= main_~j~0 6)} assume true; {14236#(<= main_~j~0 6)} is VALID [2018-11-18 23:58:49,107 INFO L273 TraceCheckUtils]: 155: Hoare triple {14236#(<= main_~j~0 6)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14236#(<= main_~j~0 6)} is VALID [2018-11-18 23:58:49,107 INFO L273 TraceCheckUtils]: 156: Hoare triple {14236#(<= main_~j~0 6)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14236#(<= main_~j~0 6)} is VALID [2018-11-18 23:58:49,108 INFO L273 TraceCheckUtils]: 157: Hoare triple {14236#(<= main_~j~0 6)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14237#(<= main_~j~0 7)} is VALID [2018-11-18 23:58:49,109 INFO L273 TraceCheckUtils]: 158: Hoare triple {14237#(<= main_~j~0 7)} assume true; {14237#(<= main_~j~0 7)} is VALID [2018-11-18 23:58:49,109 INFO L273 TraceCheckUtils]: 159: Hoare triple {14237#(<= main_~j~0 7)} assume !(~j~0 < ~edgecount~0); {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,110 INFO L273 TraceCheckUtils]: 160: Hoare triple {14238#(<= main_~edgecount~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,111 INFO L273 TraceCheckUtils]: 161: Hoare triple {14238#(<= main_~edgecount~0 7)} assume true; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,111 INFO L273 TraceCheckUtils]: 162: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,112 INFO L273 TraceCheckUtils]: 163: Hoare triple {14238#(<= main_~edgecount~0 7)} assume true; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,112 INFO L273 TraceCheckUtils]: 164: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,113 INFO L273 TraceCheckUtils]: 165: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,113 INFO L273 TraceCheckUtils]: 166: Hoare triple {14238#(<= main_~edgecount~0 7)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,114 INFO L273 TraceCheckUtils]: 167: Hoare triple {14238#(<= main_~edgecount~0 7)} assume true; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,114 INFO L273 TraceCheckUtils]: 168: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,115 INFO L273 TraceCheckUtils]: 169: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,115 INFO L273 TraceCheckUtils]: 170: Hoare triple {14238#(<= main_~edgecount~0 7)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,116 INFO L273 TraceCheckUtils]: 171: Hoare triple {14238#(<= main_~edgecount~0 7)} assume true; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,116 INFO L273 TraceCheckUtils]: 172: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,117 INFO L273 TraceCheckUtils]: 173: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,117 INFO L273 TraceCheckUtils]: 174: Hoare triple {14238#(<= main_~edgecount~0 7)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,118 INFO L273 TraceCheckUtils]: 175: Hoare triple {14238#(<= main_~edgecount~0 7)} assume true; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,118 INFO L273 TraceCheckUtils]: 176: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,119 INFO L273 TraceCheckUtils]: 177: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,119 INFO L273 TraceCheckUtils]: 178: Hoare triple {14238#(<= main_~edgecount~0 7)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,120 INFO L273 TraceCheckUtils]: 179: Hoare triple {14238#(<= main_~edgecount~0 7)} assume true; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,120 INFO L273 TraceCheckUtils]: 180: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,121 INFO L273 TraceCheckUtils]: 181: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,121 INFO L273 TraceCheckUtils]: 182: Hoare triple {14238#(<= main_~edgecount~0 7)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,122 INFO L273 TraceCheckUtils]: 183: Hoare triple {14238#(<= main_~edgecount~0 7)} assume true; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,122 INFO L273 TraceCheckUtils]: 184: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,123 INFO L273 TraceCheckUtils]: 185: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,123 INFO L273 TraceCheckUtils]: 186: Hoare triple {14238#(<= main_~edgecount~0 7)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,124 INFO L273 TraceCheckUtils]: 187: Hoare triple {14238#(<= main_~edgecount~0 7)} assume true; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,124 INFO L273 TraceCheckUtils]: 188: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,125 INFO L273 TraceCheckUtils]: 189: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,125 INFO L273 TraceCheckUtils]: 190: Hoare triple {14238#(<= main_~edgecount~0 7)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,126 INFO L273 TraceCheckUtils]: 191: Hoare triple {14238#(<= main_~edgecount~0 7)} assume true; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,126 INFO L273 TraceCheckUtils]: 192: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !(~j~0 < ~edgecount~0); {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,127 INFO L273 TraceCheckUtils]: 193: Hoare triple {14238#(<= main_~edgecount~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,127 INFO L273 TraceCheckUtils]: 194: Hoare triple {14238#(<= main_~edgecount~0 7)} assume true; {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,128 INFO L273 TraceCheckUtils]: 195: Hoare triple {14238#(<= main_~edgecount~0 7)} assume !(~i~0 < ~nodecount~0); {14238#(<= main_~edgecount~0 7)} is VALID [2018-11-18 23:58:49,129 INFO L273 TraceCheckUtils]: 196: Hoare triple {14238#(<= main_~edgecount~0 7)} ~i~0 := 0; {14239#(and (<= main_~edgecount~0 7) (= main_~i~0 0))} is VALID [2018-11-18 23:58:49,129 INFO L273 TraceCheckUtils]: 197: Hoare triple {14239#(and (<= main_~edgecount~0 7) (= main_~i~0 0))} assume true; {14239#(and (<= main_~edgecount~0 7) (= main_~i~0 0))} is VALID [2018-11-18 23:58:49,130 INFO L273 TraceCheckUtils]: 198: Hoare triple {14239#(and (<= main_~edgecount~0 7) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {14239#(and (<= main_~edgecount~0 7) (= main_~i~0 0))} is VALID [2018-11-18 23:58:49,131 INFO L273 TraceCheckUtils]: 199: Hoare triple {14239#(and (<= main_~edgecount~0 7) (= main_~i~0 0))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {14239#(and (<= main_~edgecount~0 7) (= main_~i~0 0))} is VALID [2018-11-18 23:58:49,132 INFO L273 TraceCheckUtils]: 200: Hoare triple {14239#(and (<= main_~edgecount~0 7) (= main_~i~0 0))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14240#(<= main_~edgecount~0 (+ main_~i~0 6))} is VALID [2018-11-18 23:58:49,132 INFO L273 TraceCheckUtils]: 201: Hoare triple {14240#(<= main_~edgecount~0 (+ main_~i~0 6))} assume true; {14240#(<= main_~edgecount~0 (+ main_~i~0 6))} is VALID [2018-11-18 23:58:49,133 INFO L273 TraceCheckUtils]: 202: Hoare triple {14240#(<= main_~edgecount~0 (+ main_~i~0 6))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {14240#(<= main_~edgecount~0 (+ main_~i~0 6))} is VALID [2018-11-18 23:58:49,133 INFO L273 TraceCheckUtils]: 203: Hoare triple {14240#(<= main_~edgecount~0 (+ main_~i~0 6))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {14240#(<= main_~edgecount~0 (+ main_~i~0 6))} is VALID [2018-11-18 23:58:49,134 INFO L273 TraceCheckUtils]: 204: Hoare triple {14240#(<= main_~edgecount~0 (+ main_~i~0 6))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14241#(<= main_~edgecount~0 (+ main_~i~0 5))} is VALID [2018-11-18 23:58:49,135 INFO L273 TraceCheckUtils]: 205: Hoare triple {14241#(<= main_~edgecount~0 (+ main_~i~0 5))} assume true; {14241#(<= main_~edgecount~0 (+ main_~i~0 5))} is VALID [2018-11-18 23:58:49,135 INFO L273 TraceCheckUtils]: 206: Hoare triple {14241#(<= main_~edgecount~0 (+ main_~i~0 5))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {14241#(<= main_~edgecount~0 (+ main_~i~0 5))} is VALID [2018-11-18 23:58:49,136 INFO L273 TraceCheckUtils]: 207: Hoare triple {14241#(<= main_~edgecount~0 (+ main_~i~0 5))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {14241#(<= main_~edgecount~0 (+ main_~i~0 5))} is VALID [2018-11-18 23:58:49,137 INFO L273 TraceCheckUtils]: 208: Hoare triple {14241#(<= main_~edgecount~0 (+ main_~i~0 5))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14242#(<= main_~edgecount~0 (+ main_~i~0 4))} is VALID [2018-11-18 23:58:49,137 INFO L273 TraceCheckUtils]: 209: Hoare triple {14242#(<= main_~edgecount~0 (+ main_~i~0 4))} assume true; {14242#(<= main_~edgecount~0 (+ main_~i~0 4))} is VALID [2018-11-18 23:58:49,138 INFO L273 TraceCheckUtils]: 210: Hoare triple {14242#(<= main_~edgecount~0 (+ main_~i~0 4))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {14242#(<= main_~edgecount~0 (+ main_~i~0 4))} is VALID [2018-11-18 23:58:49,138 INFO L273 TraceCheckUtils]: 211: Hoare triple {14242#(<= main_~edgecount~0 (+ main_~i~0 4))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {14242#(<= main_~edgecount~0 (+ main_~i~0 4))} is VALID [2018-11-18 23:58:49,139 INFO L273 TraceCheckUtils]: 212: Hoare triple {14242#(<= main_~edgecount~0 (+ main_~i~0 4))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14243#(<= main_~edgecount~0 (+ main_~i~0 3))} is VALID [2018-11-18 23:58:49,140 INFO L273 TraceCheckUtils]: 213: Hoare triple {14243#(<= main_~edgecount~0 (+ main_~i~0 3))} assume true; {14243#(<= main_~edgecount~0 (+ main_~i~0 3))} is VALID [2018-11-18 23:58:49,140 INFO L273 TraceCheckUtils]: 214: Hoare triple {14243#(<= main_~edgecount~0 (+ main_~i~0 3))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {14243#(<= main_~edgecount~0 (+ main_~i~0 3))} is VALID [2018-11-18 23:58:49,141 INFO L273 TraceCheckUtils]: 215: Hoare triple {14243#(<= main_~edgecount~0 (+ main_~i~0 3))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {14243#(<= main_~edgecount~0 (+ main_~i~0 3))} is VALID [2018-11-18 23:58:49,141 INFO L273 TraceCheckUtils]: 216: Hoare triple {14243#(<= main_~edgecount~0 (+ main_~i~0 3))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14244#(<= main_~edgecount~0 (+ main_~i~0 2))} is VALID [2018-11-18 23:58:49,142 INFO L273 TraceCheckUtils]: 217: Hoare triple {14244#(<= main_~edgecount~0 (+ main_~i~0 2))} assume true; {14244#(<= main_~edgecount~0 (+ main_~i~0 2))} is VALID [2018-11-18 23:58:49,142 INFO L273 TraceCheckUtils]: 218: Hoare triple {14244#(<= main_~edgecount~0 (+ main_~i~0 2))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {14244#(<= main_~edgecount~0 (+ main_~i~0 2))} is VALID [2018-11-18 23:58:49,143 INFO L273 TraceCheckUtils]: 219: Hoare triple {14244#(<= main_~edgecount~0 (+ main_~i~0 2))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {14244#(<= main_~edgecount~0 (+ main_~i~0 2))} is VALID [2018-11-18 23:58:49,144 INFO L273 TraceCheckUtils]: 220: Hoare triple {14244#(<= main_~edgecount~0 (+ main_~i~0 2))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14245#(<= main_~edgecount~0 (+ main_~i~0 1))} is VALID [2018-11-18 23:58:49,144 INFO L273 TraceCheckUtils]: 221: Hoare triple {14245#(<= main_~edgecount~0 (+ main_~i~0 1))} assume true; {14245#(<= main_~edgecount~0 (+ main_~i~0 1))} is VALID [2018-11-18 23:58:49,145 INFO L273 TraceCheckUtils]: 222: Hoare triple {14245#(<= main_~edgecount~0 (+ main_~i~0 1))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {14245#(<= main_~edgecount~0 (+ main_~i~0 1))} is VALID [2018-11-18 23:58:49,145 INFO L273 TraceCheckUtils]: 223: Hoare triple {14245#(<= main_~edgecount~0 (+ main_~i~0 1))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {14245#(<= main_~edgecount~0 (+ main_~i~0 1))} is VALID [2018-11-18 23:58:49,146 INFO L273 TraceCheckUtils]: 224: Hoare triple {14245#(<= main_~edgecount~0 (+ main_~i~0 1))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14246#(<= main_~edgecount~0 main_~i~0)} is VALID [2018-11-18 23:58:49,147 INFO L273 TraceCheckUtils]: 225: Hoare triple {14246#(<= main_~edgecount~0 main_~i~0)} assume true; {14246#(<= main_~edgecount~0 main_~i~0)} is VALID [2018-11-18 23:58:49,147 INFO L273 TraceCheckUtils]: 226: Hoare triple {14246#(<= main_~edgecount~0 main_~i~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {14246#(<= main_~edgecount~0 main_~i~0)} is VALID [2018-11-18 23:58:49,148 INFO L273 TraceCheckUtils]: 227: Hoare triple {14246#(<= main_~edgecount~0 main_~i~0)} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {14246#(<= main_~edgecount~0 main_~i~0)} is VALID [2018-11-18 23:58:49,149 INFO L273 TraceCheckUtils]: 228: Hoare triple {14246#(<= main_~edgecount~0 main_~i~0)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14247#(<= (+ main_~edgecount~0 1) main_~i~0)} is VALID [2018-11-18 23:58:49,149 INFO L273 TraceCheckUtils]: 229: Hoare triple {14247#(<= (+ main_~edgecount~0 1) main_~i~0)} assume true; {14247#(<= (+ main_~edgecount~0 1) main_~i~0)} is VALID [2018-11-18 23:58:49,150 INFO L273 TraceCheckUtils]: 230: Hoare triple {14247#(<= (+ main_~edgecount~0 1) main_~i~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,151 INFO L273 TraceCheckUtils]: 231: Hoare triple {14229#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {14229#false} is VALID [2018-11-18 23:58:49,151 INFO L273 TraceCheckUtils]: 232: Hoare triple {14229#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14229#false} is VALID [2018-11-18 23:58:49,151 INFO L273 TraceCheckUtils]: 233: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,151 INFO L273 TraceCheckUtils]: 234: Hoare triple {14229#false} assume !(~i~0 < ~edgecount~0); {14229#false} is VALID [2018-11-18 23:58:49,151 INFO L273 TraceCheckUtils]: 235: Hoare triple {14229#false} ~i~0 := 0; {14229#false} is VALID [2018-11-18 23:58:49,152 INFO L273 TraceCheckUtils]: 236: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,152 INFO L273 TraceCheckUtils]: 237: Hoare triple {14229#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,152 INFO L256 TraceCheckUtils]: 238: Hoare triple {14229#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {14229#false} is VALID [2018-11-18 23:58:49,152 INFO L273 TraceCheckUtils]: 239: Hoare triple {14229#false} ~cond := #in~cond; {14229#false} is VALID [2018-11-18 23:58:49,152 INFO L273 TraceCheckUtils]: 240: Hoare triple {14229#false} assume 0 == ~cond; {14229#false} is VALID [2018-11-18 23:58:49,153 INFO L273 TraceCheckUtils]: 241: Hoare triple {14229#false} assume !false; {14229#false} is VALID [2018-11-18 23:58:49,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3002 backedges. 1510 proven. 354 refuted. 0 times theorem prover too weak. 1138 trivial. 0 not checked. [2018-11-18 23:58:49,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:58:49,183 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:58:49,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:58:49,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:49,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:58:49,851 INFO L256 TraceCheckUtils]: 0: Hoare triple {14228#true} call ULTIMATE.init(); {14228#true} is VALID [2018-11-18 23:58:49,851 INFO L273 TraceCheckUtils]: 1: Hoare triple {14228#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {14228#true} is VALID [2018-11-18 23:58:49,851 INFO L273 TraceCheckUtils]: 2: Hoare triple {14228#true} assume true; {14228#true} is VALID [2018-11-18 23:58:49,851 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14228#true} {14228#true} #108#return; {14228#true} is VALID [2018-11-18 23:58:49,852 INFO L256 TraceCheckUtils]: 4: Hoare triple {14228#true} call #t~ret18 := main(); {14228#true} is VALID [2018-11-18 23:58:49,854 INFO L273 TraceCheckUtils]: 5: Hoare triple {14228#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:49,854 INFO L273 TraceCheckUtils]: 6: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume true; {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:49,854 INFO L273 TraceCheckUtils]: 7: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:49,874 INFO L273 TraceCheckUtils]: 8: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:49,882 INFO L273 TraceCheckUtils]: 9: Hoare triple {14266#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:49,882 INFO L273 TraceCheckUtils]: 10: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume true; {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:49,883 INFO L273 TraceCheckUtils]: 11: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:49,883 INFO L273 TraceCheckUtils]: 12: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:49,883 INFO L273 TraceCheckUtils]: 13: Hoare triple {14266#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:49,884 INFO L273 TraceCheckUtils]: 14: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume true; {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:49,884 INFO L273 TraceCheckUtils]: 15: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:49,884 INFO L273 TraceCheckUtils]: 16: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:49,885 INFO L273 TraceCheckUtils]: 17: Hoare triple {14266#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:49,885 INFO L273 TraceCheckUtils]: 18: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume true; {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:49,885 INFO L273 TraceCheckUtils]: 19: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:49,886 INFO L273 TraceCheckUtils]: 20: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:49,886 INFO L273 TraceCheckUtils]: 21: Hoare triple {14266#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:49,886 INFO L273 TraceCheckUtils]: 22: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume true; {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:49,888 INFO L273 TraceCheckUtils]: 23: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:49,889 INFO L273 TraceCheckUtils]: 24: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:49,889 INFO L273 TraceCheckUtils]: 25: Hoare triple {14266#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:49,889 INFO L273 TraceCheckUtils]: 26: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume true; {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:49,890 INFO L273 TraceCheckUtils]: 27: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:49,890 INFO L273 TraceCheckUtils]: 28: Hoare triple {14266#(<= 20 main_~edgecount~0)} ~i~0 := 0; {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:49,890 INFO L273 TraceCheckUtils]: 29: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume true; {14266#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:49,891 INFO L273 TraceCheckUtils]: 30: Hoare triple {14266#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14342#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:49,891 INFO L273 TraceCheckUtils]: 31: Hoare triple {14342#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume true; {14342#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:49,892 INFO L273 TraceCheckUtils]: 32: Hoare triple {14342#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14342#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:49,893 INFO L273 TraceCheckUtils]: 33: Hoare triple {14342#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14342#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:49,894 INFO L273 TraceCheckUtils]: 34: Hoare triple {14342#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14355#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:58:49,894 INFO L273 TraceCheckUtils]: 35: Hoare triple {14355#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume true; {14355#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:58:49,895 INFO L273 TraceCheckUtils]: 36: Hoare triple {14355#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14355#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:58:49,896 INFO L273 TraceCheckUtils]: 37: Hoare triple {14355#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14355#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:58:49,897 INFO L273 TraceCheckUtils]: 38: Hoare triple {14355#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14368#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:58:49,897 INFO L273 TraceCheckUtils]: 39: Hoare triple {14368#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} assume true; {14368#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:58:49,898 INFO L273 TraceCheckUtils]: 40: Hoare triple {14368#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14368#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:58:49,899 INFO L273 TraceCheckUtils]: 41: Hoare triple {14368#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14368#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:58:49,900 INFO L273 TraceCheckUtils]: 42: Hoare triple {14368#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14381#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:58:49,900 INFO L273 TraceCheckUtils]: 43: Hoare triple {14381#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume true; {14381#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:58:49,901 INFO L273 TraceCheckUtils]: 44: Hoare triple {14381#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14381#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:58:49,907 INFO L273 TraceCheckUtils]: 45: Hoare triple {14381#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14381#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:58:49,908 INFO L273 TraceCheckUtils]: 46: Hoare triple {14381#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14394#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-18 23:58:49,909 INFO L273 TraceCheckUtils]: 47: Hoare triple {14394#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume true; {14394#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-18 23:58:49,909 INFO L273 TraceCheckUtils]: 48: Hoare triple {14394#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14394#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-18 23:58:49,910 INFO L273 TraceCheckUtils]: 49: Hoare triple {14394#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14394#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-18 23:58:49,910 INFO L273 TraceCheckUtils]: 50: Hoare triple {14394#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14407#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2018-11-18 23:58:49,910 INFO L273 TraceCheckUtils]: 51: Hoare triple {14407#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume true; {14407#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2018-11-18 23:58:49,911 INFO L273 TraceCheckUtils]: 52: Hoare triple {14407#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14407#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2018-11-18 23:58:49,912 INFO L273 TraceCheckUtils]: 53: Hoare triple {14407#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14407#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2018-11-18 23:58:49,913 INFO L273 TraceCheckUtils]: 54: Hoare triple {14407#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14420#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} is VALID [2018-11-18 23:58:49,913 INFO L273 TraceCheckUtils]: 55: Hoare triple {14420#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} assume true; {14420#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} is VALID [2018-11-18 23:58:49,914 INFO L273 TraceCheckUtils]: 56: Hoare triple {14420#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14420#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} is VALID [2018-11-18 23:58:49,915 INFO L273 TraceCheckUtils]: 57: Hoare triple {14420#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14420#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} is VALID [2018-11-18 23:58:49,916 INFO L273 TraceCheckUtils]: 58: Hoare triple {14420#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14433#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} is VALID [2018-11-18 23:58:49,916 INFO L273 TraceCheckUtils]: 59: Hoare triple {14433#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} assume true; {14433#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} is VALID [2018-11-18 23:58:49,917 INFO L273 TraceCheckUtils]: 60: Hoare triple {14433#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} assume !(~j~0 < ~edgecount~0); {14229#false} is VALID [2018-11-18 23:58:49,917 INFO L273 TraceCheckUtils]: 61: Hoare triple {14229#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14229#false} is VALID [2018-11-18 23:58:49,917 INFO L273 TraceCheckUtils]: 62: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,918 INFO L273 TraceCheckUtils]: 63: Hoare triple {14229#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14229#false} is VALID [2018-11-18 23:58:49,918 INFO L273 TraceCheckUtils]: 64: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,918 INFO L273 TraceCheckUtils]: 65: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,918 INFO L273 TraceCheckUtils]: 66: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14229#false} is VALID [2018-11-18 23:58:49,918 INFO L273 TraceCheckUtils]: 67: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14229#false} is VALID [2018-11-18 23:58:49,919 INFO L273 TraceCheckUtils]: 68: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,919 INFO L273 TraceCheckUtils]: 69: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,919 INFO L273 TraceCheckUtils]: 70: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14229#false} is VALID [2018-11-18 23:58:49,919 INFO L273 TraceCheckUtils]: 71: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14229#false} is VALID [2018-11-18 23:58:49,919 INFO L273 TraceCheckUtils]: 72: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,919 INFO L273 TraceCheckUtils]: 73: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,920 INFO L273 TraceCheckUtils]: 74: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14229#false} is VALID [2018-11-18 23:58:49,920 INFO L273 TraceCheckUtils]: 75: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14229#false} is VALID [2018-11-18 23:58:49,920 INFO L273 TraceCheckUtils]: 76: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,920 INFO L273 TraceCheckUtils]: 77: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,920 INFO L273 TraceCheckUtils]: 78: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14229#false} is VALID [2018-11-18 23:58:49,921 INFO L273 TraceCheckUtils]: 79: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14229#false} is VALID [2018-11-18 23:58:49,921 INFO L273 TraceCheckUtils]: 80: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,921 INFO L273 TraceCheckUtils]: 81: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,921 INFO L273 TraceCheckUtils]: 82: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14229#false} is VALID [2018-11-18 23:58:49,921 INFO L273 TraceCheckUtils]: 83: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14229#false} is VALID [2018-11-18 23:58:49,922 INFO L273 TraceCheckUtils]: 84: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,922 INFO L273 TraceCheckUtils]: 85: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,922 INFO L273 TraceCheckUtils]: 86: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14229#false} is VALID [2018-11-18 23:58:49,922 INFO L273 TraceCheckUtils]: 87: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14229#false} is VALID [2018-11-18 23:58:49,922 INFO L273 TraceCheckUtils]: 88: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,922 INFO L273 TraceCheckUtils]: 89: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,923 INFO L273 TraceCheckUtils]: 90: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14229#false} is VALID [2018-11-18 23:58:49,923 INFO L273 TraceCheckUtils]: 91: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14229#false} is VALID [2018-11-18 23:58:49,923 INFO L273 TraceCheckUtils]: 92: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,923 INFO L273 TraceCheckUtils]: 93: Hoare triple {14229#false} assume !(~j~0 < ~edgecount~0); {14229#false} is VALID [2018-11-18 23:58:49,923 INFO L273 TraceCheckUtils]: 94: Hoare triple {14229#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14229#false} is VALID [2018-11-18 23:58:49,923 INFO L273 TraceCheckUtils]: 95: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,924 INFO L273 TraceCheckUtils]: 96: Hoare triple {14229#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14229#false} is VALID [2018-11-18 23:58:49,924 INFO L273 TraceCheckUtils]: 97: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,924 INFO L273 TraceCheckUtils]: 98: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,924 INFO L273 TraceCheckUtils]: 99: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14229#false} is VALID [2018-11-18 23:58:49,924 INFO L273 TraceCheckUtils]: 100: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14229#false} is VALID [2018-11-18 23:58:49,924 INFO L273 TraceCheckUtils]: 101: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,925 INFO L273 TraceCheckUtils]: 102: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,925 INFO L273 TraceCheckUtils]: 103: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14229#false} is VALID [2018-11-18 23:58:49,925 INFO L273 TraceCheckUtils]: 104: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14229#false} is VALID [2018-11-18 23:58:49,925 INFO L273 TraceCheckUtils]: 105: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,925 INFO L273 TraceCheckUtils]: 106: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,925 INFO L273 TraceCheckUtils]: 107: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14229#false} is VALID [2018-11-18 23:58:49,925 INFO L273 TraceCheckUtils]: 108: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14229#false} is VALID [2018-11-18 23:58:49,925 INFO L273 TraceCheckUtils]: 109: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,925 INFO L273 TraceCheckUtils]: 110: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,926 INFO L273 TraceCheckUtils]: 111: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14229#false} is VALID [2018-11-18 23:58:49,926 INFO L273 TraceCheckUtils]: 112: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14229#false} is VALID [2018-11-18 23:58:49,926 INFO L273 TraceCheckUtils]: 113: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,926 INFO L273 TraceCheckUtils]: 114: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,926 INFO L273 TraceCheckUtils]: 115: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14229#false} is VALID [2018-11-18 23:58:49,926 INFO L273 TraceCheckUtils]: 116: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14229#false} is VALID [2018-11-18 23:58:49,926 INFO L273 TraceCheckUtils]: 117: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,926 INFO L273 TraceCheckUtils]: 118: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,926 INFO L273 TraceCheckUtils]: 119: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14229#false} is VALID [2018-11-18 23:58:49,927 INFO L273 TraceCheckUtils]: 120: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14229#false} is VALID [2018-11-18 23:58:49,927 INFO L273 TraceCheckUtils]: 121: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,927 INFO L273 TraceCheckUtils]: 122: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,927 INFO L273 TraceCheckUtils]: 123: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14229#false} is VALID [2018-11-18 23:58:49,927 INFO L273 TraceCheckUtils]: 124: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14229#false} is VALID [2018-11-18 23:58:49,927 INFO L273 TraceCheckUtils]: 125: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,927 INFO L273 TraceCheckUtils]: 126: Hoare triple {14229#false} assume !(~j~0 < ~edgecount~0); {14229#false} is VALID [2018-11-18 23:58:49,927 INFO L273 TraceCheckUtils]: 127: Hoare triple {14229#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14229#false} is VALID [2018-11-18 23:58:49,927 INFO L273 TraceCheckUtils]: 128: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,928 INFO L273 TraceCheckUtils]: 129: Hoare triple {14229#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14229#false} is VALID [2018-11-18 23:58:49,928 INFO L273 TraceCheckUtils]: 130: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,928 INFO L273 TraceCheckUtils]: 131: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,928 INFO L273 TraceCheckUtils]: 132: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14229#false} is VALID [2018-11-18 23:58:49,928 INFO L273 TraceCheckUtils]: 133: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14229#false} is VALID [2018-11-18 23:58:49,928 INFO L273 TraceCheckUtils]: 134: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,928 INFO L273 TraceCheckUtils]: 135: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,928 INFO L273 TraceCheckUtils]: 136: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14229#false} is VALID [2018-11-18 23:58:49,928 INFO L273 TraceCheckUtils]: 137: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14229#false} is VALID [2018-11-18 23:58:49,929 INFO L273 TraceCheckUtils]: 138: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,929 INFO L273 TraceCheckUtils]: 139: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,929 INFO L273 TraceCheckUtils]: 140: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14229#false} is VALID [2018-11-18 23:58:49,929 INFO L273 TraceCheckUtils]: 141: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14229#false} is VALID [2018-11-18 23:58:49,929 INFO L273 TraceCheckUtils]: 142: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,929 INFO L273 TraceCheckUtils]: 143: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,929 INFO L273 TraceCheckUtils]: 144: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14229#false} is VALID [2018-11-18 23:58:49,929 INFO L273 TraceCheckUtils]: 145: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14229#false} is VALID [2018-11-18 23:58:49,929 INFO L273 TraceCheckUtils]: 146: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,930 INFO L273 TraceCheckUtils]: 147: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,930 INFO L273 TraceCheckUtils]: 148: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14229#false} is VALID [2018-11-18 23:58:49,930 INFO L273 TraceCheckUtils]: 149: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14229#false} is VALID [2018-11-18 23:58:49,930 INFO L273 TraceCheckUtils]: 150: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,930 INFO L273 TraceCheckUtils]: 151: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,930 INFO L273 TraceCheckUtils]: 152: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14229#false} is VALID [2018-11-18 23:58:49,930 INFO L273 TraceCheckUtils]: 153: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14229#false} is VALID [2018-11-18 23:58:49,930 INFO L273 TraceCheckUtils]: 154: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,930 INFO L273 TraceCheckUtils]: 155: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,931 INFO L273 TraceCheckUtils]: 156: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14229#false} is VALID [2018-11-18 23:58:49,931 INFO L273 TraceCheckUtils]: 157: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14229#false} is VALID [2018-11-18 23:58:49,931 INFO L273 TraceCheckUtils]: 158: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,931 INFO L273 TraceCheckUtils]: 159: Hoare triple {14229#false} assume !(~j~0 < ~edgecount~0); {14229#false} is VALID [2018-11-18 23:58:49,931 INFO L273 TraceCheckUtils]: 160: Hoare triple {14229#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14229#false} is VALID [2018-11-18 23:58:49,931 INFO L273 TraceCheckUtils]: 161: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,931 INFO L273 TraceCheckUtils]: 162: Hoare triple {14229#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14229#false} is VALID [2018-11-18 23:58:49,931 INFO L273 TraceCheckUtils]: 163: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,931 INFO L273 TraceCheckUtils]: 164: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,932 INFO L273 TraceCheckUtils]: 165: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14229#false} is VALID [2018-11-18 23:58:49,932 INFO L273 TraceCheckUtils]: 166: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14229#false} is VALID [2018-11-18 23:58:49,932 INFO L273 TraceCheckUtils]: 167: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,932 INFO L273 TraceCheckUtils]: 168: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,932 INFO L273 TraceCheckUtils]: 169: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14229#false} is VALID [2018-11-18 23:58:49,932 INFO L273 TraceCheckUtils]: 170: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14229#false} is VALID [2018-11-18 23:58:49,932 INFO L273 TraceCheckUtils]: 171: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,932 INFO L273 TraceCheckUtils]: 172: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,933 INFO L273 TraceCheckUtils]: 173: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14229#false} is VALID [2018-11-18 23:58:49,933 INFO L273 TraceCheckUtils]: 174: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14229#false} is VALID [2018-11-18 23:58:49,933 INFO L273 TraceCheckUtils]: 175: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,933 INFO L273 TraceCheckUtils]: 176: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,933 INFO L273 TraceCheckUtils]: 177: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14229#false} is VALID [2018-11-18 23:58:49,933 INFO L273 TraceCheckUtils]: 178: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14229#false} is VALID [2018-11-18 23:58:49,933 INFO L273 TraceCheckUtils]: 179: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,933 INFO L273 TraceCheckUtils]: 180: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,933 INFO L273 TraceCheckUtils]: 181: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14229#false} is VALID [2018-11-18 23:58:49,934 INFO L273 TraceCheckUtils]: 182: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14229#false} is VALID [2018-11-18 23:58:49,934 INFO L273 TraceCheckUtils]: 183: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,934 INFO L273 TraceCheckUtils]: 184: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,934 INFO L273 TraceCheckUtils]: 185: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14229#false} is VALID [2018-11-18 23:58:49,934 INFO L273 TraceCheckUtils]: 186: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14229#false} is VALID [2018-11-18 23:58:49,934 INFO L273 TraceCheckUtils]: 187: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,934 INFO L273 TraceCheckUtils]: 188: Hoare triple {14229#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,934 INFO L273 TraceCheckUtils]: 189: Hoare triple {14229#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {14229#false} is VALID [2018-11-18 23:58:49,934 INFO L273 TraceCheckUtils]: 190: Hoare triple {14229#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14229#false} is VALID [2018-11-18 23:58:49,935 INFO L273 TraceCheckUtils]: 191: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,935 INFO L273 TraceCheckUtils]: 192: Hoare triple {14229#false} assume !(~j~0 < ~edgecount~0); {14229#false} is VALID [2018-11-18 23:58:49,935 INFO L273 TraceCheckUtils]: 193: Hoare triple {14229#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14229#false} is VALID [2018-11-18 23:58:49,935 INFO L273 TraceCheckUtils]: 194: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,935 INFO L273 TraceCheckUtils]: 195: Hoare triple {14229#false} assume !(~i~0 < ~nodecount~0); {14229#false} is VALID [2018-11-18 23:58:49,935 INFO L273 TraceCheckUtils]: 196: Hoare triple {14229#false} ~i~0 := 0; {14229#false} is VALID [2018-11-18 23:58:49,935 INFO L273 TraceCheckUtils]: 197: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,935 INFO L273 TraceCheckUtils]: 198: Hoare triple {14229#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,935 INFO L273 TraceCheckUtils]: 199: Hoare triple {14229#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {14229#false} is VALID [2018-11-18 23:58:49,936 INFO L273 TraceCheckUtils]: 200: Hoare triple {14229#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14229#false} is VALID [2018-11-18 23:58:49,936 INFO L273 TraceCheckUtils]: 201: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,936 INFO L273 TraceCheckUtils]: 202: Hoare triple {14229#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,936 INFO L273 TraceCheckUtils]: 203: Hoare triple {14229#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {14229#false} is VALID [2018-11-18 23:58:49,936 INFO L273 TraceCheckUtils]: 204: Hoare triple {14229#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14229#false} is VALID [2018-11-18 23:58:49,936 INFO L273 TraceCheckUtils]: 205: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,936 INFO L273 TraceCheckUtils]: 206: Hoare triple {14229#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,936 INFO L273 TraceCheckUtils]: 207: Hoare triple {14229#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {14229#false} is VALID [2018-11-18 23:58:49,936 INFO L273 TraceCheckUtils]: 208: Hoare triple {14229#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14229#false} is VALID [2018-11-18 23:58:49,937 INFO L273 TraceCheckUtils]: 209: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,937 INFO L273 TraceCheckUtils]: 210: Hoare triple {14229#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,937 INFO L273 TraceCheckUtils]: 211: Hoare triple {14229#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {14229#false} is VALID [2018-11-18 23:58:49,937 INFO L273 TraceCheckUtils]: 212: Hoare triple {14229#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14229#false} is VALID [2018-11-18 23:58:49,937 INFO L273 TraceCheckUtils]: 213: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,937 INFO L273 TraceCheckUtils]: 214: Hoare triple {14229#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,937 INFO L273 TraceCheckUtils]: 215: Hoare triple {14229#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {14229#false} is VALID [2018-11-18 23:58:49,937 INFO L273 TraceCheckUtils]: 216: Hoare triple {14229#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14229#false} is VALID [2018-11-18 23:58:49,937 INFO L273 TraceCheckUtils]: 217: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,938 INFO L273 TraceCheckUtils]: 218: Hoare triple {14229#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,938 INFO L273 TraceCheckUtils]: 219: Hoare triple {14229#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {14229#false} is VALID [2018-11-18 23:58:49,938 INFO L273 TraceCheckUtils]: 220: Hoare triple {14229#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14229#false} is VALID [2018-11-18 23:58:49,938 INFO L273 TraceCheckUtils]: 221: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,938 INFO L273 TraceCheckUtils]: 222: Hoare triple {14229#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,938 INFO L273 TraceCheckUtils]: 223: Hoare triple {14229#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {14229#false} is VALID [2018-11-18 23:58:49,938 INFO L273 TraceCheckUtils]: 224: Hoare triple {14229#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14229#false} is VALID [2018-11-18 23:58:49,938 INFO L273 TraceCheckUtils]: 225: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,939 INFO L273 TraceCheckUtils]: 226: Hoare triple {14229#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,939 INFO L273 TraceCheckUtils]: 227: Hoare triple {14229#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {14229#false} is VALID [2018-11-18 23:58:49,939 INFO L273 TraceCheckUtils]: 228: Hoare triple {14229#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14229#false} is VALID [2018-11-18 23:58:49,939 INFO L273 TraceCheckUtils]: 229: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,939 INFO L273 TraceCheckUtils]: 230: Hoare triple {14229#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,939 INFO L273 TraceCheckUtils]: 231: Hoare triple {14229#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {14229#false} is VALID [2018-11-18 23:58:49,939 INFO L273 TraceCheckUtils]: 232: Hoare triple {14229#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14229#false} is VALID [2018-11-18 23:58:49,939 INFO L273 TraceCheckUtils]: 233: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,939 INFO L273 TraceCheckUtils]: 234: Hoare triple {14229#false} assume !(~i~0 < ~edgecount~0); {14229#false} is VALID [2018-11-18 23:58:49,940 INFO L273 TraceCheckUtils]: 235: Hoare triple {14229#false} ~i~0 := 0; {14229#false} is VALID [2018-11-18 23:58:49,940 INFO L273 TraceCheckUtils]: 236: Hoare triple {14229#false} assume true; {14229#false} is VALID [2018-11-18 23:58:49,940 INFO L273 TraceCheckUtils]: 237: Hoare triple {14229#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14229#false} is VALID [2018-11-18 23:58:49,940 INFO L256 TraceCheckUtils]: 238: Hoare triple {14229#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {14229#false} is VALID [2018-11-18 23:58:49,940 INFO L273 TraceCheckUtils]: 239: Hoare triple {14229#false} ~cond := #in~cond; {14229#false} is VALID [2018-11-18 23:58:49,940 INFO L273 TraceCheckUtils]: 240: Hoare triple {14229#false} assume 0 == ~cond; {14229#false} is VALID [2018-11-18 23:58:49,940 INFO L273 TraceCheckUtils]: 241: Hoare triple {14229#false} assume !false; {14229#false} is VALID [2018-11-18 23:58:49,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3002 backedges. 914 proven. 98 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2018-11-18 23:58:49,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:58:49,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 11] total 29 [2018-11-18 23:58:49,991 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 242 [2018-11-18 23:58:49,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:58:49,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-18 23:58:50,177 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:50,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-18 23:58:50,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-18 23:58:50,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=629, Unknown=0, NotChecked=0, Total=812 [2018-11-18 23:58:50,179 INFO L87 Difference]: Start difference. First operand 247 states and 290 transitions. Second operand 29 states. [2018-11-18 23:58:52,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:52,041 INFO L93 Difference]: Finished difference Result 463 states and 555 transitions. [2018-11-18 23:58:52,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 23:58:52,041 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 242 [2018-11-18 23:58:52,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:58:52,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 23:58:52,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 110 transitions. [2018-11-18 23:58:52,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 23:58:52,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 110 transitions. [2018-11-18 23:58:52,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 110 transitions. [2018-11-18 23:58:52,148 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:52,153 INFO L225 Difference]: With dead ends: 463 [2018-11-18 23:58:52,153 INFO L226 Difference]: Without dead ends: 277 [2018-11-18 23:58:52,154 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=212, Invalid=718, Unknown=0, NotChecked=0, Total=930 [2018-11-18 23:58:52,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-11-18 23:58:53,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 267. [2018-11-18 23:58:53,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:58:53,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 277 states. Second operand 267 states. [2018-11-18 23:58:53,049 INFO L74 IsIncluded]: Start isIncluded. First operand 277 states. Second operand 267 states. [2018-11-18 23:58:53,049 INFO L87 Difference]: Start difference. First operand 277 states. Second operand 267 states. [2018-11-18 23:58:53,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:53,054 INFO L93 Difference]: Finished difference Result 277 states and 330 transitions. [2018-11-18 23:58:53,055 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 330 transitions. [2018-11-18 23:58:53,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:53,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:53,055 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand 277 states. [2018-11-18 23:58:53,055 INFO L87 Difference]: Start difference. First operand 267 states. Second operand 277 states. [2018-11-18 23:58:53,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:53,061 INFO L93 Difference]: Finished difference Result 277 states and 330 transitions. [2018-11-18 23:58:53,061 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 330 transitions. [2018-11-18 23:58:53,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:53,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:53,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:58:53,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:58:53,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-11-18 23:58:53,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 315 transitions. [2018-11-18 23:58:53,068 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 315 transitions. Word has length 242 [2018-11-18 23:58:53,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:58:53,068 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 315 transitions. [2018-11-18 23:58:53,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-18 23:58:53,069 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 315 transitions. [2018-11-18 23:58:53,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-11-18 23:58:53,071 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:58:53,072 INFO L375 BasicCegarLoop]: trace histogram [45, 40, 40, 40, 10, 9, 9, 9, 6, 6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:58:53,072 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:58:53,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:58:53,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1287110198, now seen corresponding path program 8 times [2018-11-18 23:58:53,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:58:53,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:58:53,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:53,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:58:53,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:53,734 INFO L256 TraceCheckUtils]: 0: Hoare triple {16469#true} call ULTIMATE.init(); {16469#true} is VALID [2018-11-18 23:58:53,734 INFO L273 TraceCheckUtils]: 1: Hoare triple {16469#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {16469#true} is VALID [2018-11-18 23:58:53,734 INFO L273 TraceCheckUtils]: 2: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,735 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16469#true} {16469#true} #108#return; {16469#true} is VALID [2018-11-18 23:58:53,735 INFO L256 TraceCheckUtils]: 4: Hoare triple {16469#true} call #t~ret18 := main(); {16469#true} is VALID [2018-11-18 23:58:53,735 INFO L273 TraceCheckUtils]: 5: Hoare triple {16469#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {16469#true} is VALID [2018-11-18 23:58:53,735 INFO L273 TraceCheckUtils]: 6: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,736 INFO L273 TraceCheckUtils]: 7: Hoare triple {16469#true} assume !!(~i~0 < ~nodecount~0); {16469#true} is VALID [2018-11-18 23:58:53,736 INFO L273 TraceCheckUtils]: 8: Hoare triple {16469#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,736 INFO L273 TraceCheckUtils]: 9: Hoare triple {16469#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16469#true} is VALID [2018-11-18 23:58:53,736 INFO L273 TraceCheckUtils]: 10: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,736 INFO L273 TraceCheckUtils]: 11: Hoare triple {16469#true} assume !!(~i~0 < ~nodecount~0); {16469#true} is VALID [2018-11-18 23:58:53,737 INFO L273 TraceCheckUtils]: 12: Hoare triple {16469#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,737 INFO L273 TraceCheckUtils]: 13: Hoare triple {16469#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16469#true} is VALID [2018-11-18 23:58:53,737 INFO L273 TraceCheckUtils]: 14: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,737 INFO L273 TraceCheckUtils]: 15: Hoare triple {16469#true} assume !!(~i~0 < ~nodecount~0); {16469#true} is VALID [2018-11-18 23:58:53,737 INFO L273 TraceCheckUtils]: 16: Hoare triple {16469#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,737 INFO L273 TraceCheckUtils]: 17: Hoare triple {16469#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16469#true} is VALID [2018-11-18 23:58:53,737 INFO L273 TraceCheckUtils]: 18: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,738 INFO L273 TraceCheckUtils]: 19: Hoare triple {16469#true} assume !!(~i~0 < ~nodecount~0); {16469#true} is VALID [2018-11-18 23:58:53,738 INFO L273 TraceCheckUtils]: 20: Hoare triple {16469#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,738 INFO L273 TraceCheckUtils]: 21: Hoare triple {16469#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16469#true} is VALID [2018-11-18 23:58:53,738 INFO L273 TraceCheckUtils]: 22: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,738 INFO L273 TraceCheckUtils]: 23: Hoare triple {16469#true} assume !!(~i~0 < ~nodecount~0); {16469#true} is VALID [2018-11-18 23:58:53,739 INFO L273 TraceCheckUtils]: 24: Hoare triple {16469#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,739 INFO L273 TraceCheckUtils]: 25: Hoare triple {16469#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16469#true} is VALID [2018-11-18 23:58:53,739 INFO L273 TraceCheckUtils]: 26: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,739 INFO L273 TraceCheckUtils]: 27: Hoare triple {16469#true} assume !(~i~0 < ~nodecount~0); {16469#true} is VALID [2018-11-18 23:58:53,739 INFO L273 TraceCheckUtils]: 28: Hoare triple {16469#true} ~i~0 := 0; {16469#true} is VALID [2018-11-18 23:58:53,740 INFO L273 TraceCheckUtils]: 29: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,740 INFO L273 TraceCheckUtils]: 30: Hoare triple {16469#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {16469#true} is VALID [2018-11-18 23:58:53,740 INFO L273 TraceCheckUtils]: 31: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,740 INFO L273 TraceCheckUtils]: 32: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,741 INFO L273 TraceCheckUtils]: 33: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16469#true} is VALID [2018-11-18 23:58:53,741 INFO L273 TraceCheckUtils]: 34: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16469#true} is VALID [2018-11-18 23:58:53,741 INFO L273 TraceCheckUtils]: 35: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,741 INFO L273 TraceCheckUtils]: 36: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,741 INFO L273 TraceCheckUtils]: 37: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16469#true} is VALID [2018-11-18 23:58:53,742 INFO L273 TraceCheckUtils]: 38: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16469#true} is VALID [2018-11-18 23:58:53,742 INFO L273 TraceCheckUtils]: 39: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,742 INFO L273 TraceCheckUtils]: 40: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,742 INFO L273 TraceCheckUtils]: 41: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16469#true} is VALID [2018-11-18 23:58:53,742 INFO L273 TraceCheckUtils]: 42: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16469#true} is VALID [2018-11-18 23:58:53,743 INFO L273 TraceCheckUtils]: 43: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,743 INFO L273 TraceCheckUtils]: 44: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,743 INFO L273 TraceCheckUtils]: 45: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16469#true} is VALID [2018-11-18 23:58:53,743 INFO L273 TraceCheckUtils]: 46: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16469#true} is VALID [2018-11-18 23:58:53,744 INFO L273 TraceCheckUtils]: 47: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,744 INFO L273 TraceCheckUtils]: 48: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,744 INFO L273 TraceCheckUtils]: 49: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16469#true} is VALID [2018-11-18 23:58:53,744 INFO L273 TraceCheckUtils]: 50: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16469#true} is VALID [2018-11-18 23:58:53,744 INFO L273 TraceCheckUtils]: 51: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,745 INFO L273 TraceCheckUtils]: 52: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,745 INFO L273 TraceCheckUtils]: 53: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16469#true} is VALID [2018-11-18 23:58:53,745 INFO L273 TraceCheckUtils]: 54: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16469#true} is VALID [2018-11-18 23:58:53,745 INFO L273 TraceCheckUtils]: 55: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,745 INFO L273 TraceCheckUtils]: 56: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,746 INFO L273 TraceCheckUtils]: 57: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16469#true} is VALID [2018-11-18 23:58:53,746 INFO L273 TraceCheckUtils]: 58: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16469#true} is VALID [2018-11-18 23:58:53,746 INFO L273 TraceCheckUtils]: 59: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,746 INFO L273 TraceCheckUtils]: 60: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,746 INFO L273 TraceCheckUtils]: 61: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16469#true} is VALID [2018-11-18 23:58:53,747 INFO L273 TraceCheckUtils]: 62: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16469#true} is VALID [2018-11-18 23:58:53,747 INFO L273 TraceCheckUtils]: 63: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,747 INFO L273 TraceCheckUtils]: 64: Hoare triple {16469#true} assume !(~j~0 < ~edgecount~0); {16469#true} is VALID [2018-11-18 23:58:53,747 INFO L273 TraceCheckUtils]: 65: Hoare triple {16469#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16469#true} is VALID [2018-11-18 23:58:53,747 INFO L273 TraceCheckUtils]: 66: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,748 INFO L273 TraceCheckUtils]: 67: Hoare triple {16469#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {16469#true} is VALID [2018-11-18 23:58:53,748 INFO L273 TraceCheckUtils]: 68: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,748 INFO L273 TraceCheckUtils]: 69: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,748 INFO L273 TraceCheckUtils]: 70: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16469#true} is VALID [2018-11-18 23:58:53,749 INFO L273 TraceCheckUtils]: 71: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16469#true} is VALID [2018-11-18 23:58:53,749 INFO L273 TraceCheckUtils]: 72: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,749 INFO L273 TraceCheckUtils]: 73: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,749 INFO L273 TraceCheckUtils]: 74: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16469#true} is VALID [2018-11-18 23:58:53,749 INFO L273 TraceCheckUtils]: 75: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16469#true} is VALID [2018-11-18 23:58:53,749 INFO L273 TraceCheckUtils]: 76: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,750 INFO L273 TraceCheckUtils]: 77: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,785 INFO L273 TraceCheckUtils]: 78: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16469#true} is VALID [2018-11-18 23:58:53,785 INFO L273 TraceCheckUtils]: 79: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16469#true} is VALID [2018-11-18 23:58:53,785 INFO L273 TraceCheckUtils]: 80: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,785 INFO L273 TraceCheckUtils]: 81: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,786 INFO L273 TraceCheckUtils]: 82: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16469#true} is VALID [2018-11-18 23:58:53,788 INFO L273 TraceCheckUtils]: 83: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16469#true} is VALID [2018-11-18 23:58:53,788 INFO L273 TraceCheckUtils]: 84: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,788 INFO L273 TraceCheckUtils]: 85: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,789 INFO L273 TraceCheckUtils]: 86: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16469#true} is VALID [2018-11-18 23:58:53,789 INFO L273 TraceCheckUtils]: 87: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16469#true} is VALID [2018-11-18 23:58:53,789 INFO L273 TraceCheckUtils]: 88: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,789 INFO L273 TraceCheckUtils]: 89: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,789 INFO L273 TraceCheckUtils]: 90: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16469#true} is VALID [2018-11-18 23:58:53,789 INFO L273 TraceCheckUtils]: 91: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16469#true} is VALID [2018-11-18 23:58:53,789 INFO L273 TraceCheckUtils]: 92: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,790 INFO L273 TraceCheckUtils]: 93: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,790 INFO L273 TraceCheckUtils]: 94: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16469#true} is VALID [2018-11-18 23:58:53,790 INFO L273 TraceCheckUtils]: 95: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16469#true} is VALID [2018-11-18 23:58:53,790 INFO L273 TraceCheckUtils]: 96: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,790 INFO L273 TraceCheckUtils]: 97: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,790 INFO L273 TraceCheckUtils]: 98: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16469#true} is VALID [2018-11-18 23:58:53,791 INFO L273 TraceCheckUtils]: 99: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16469#true} is VALID [2018-11-18 23:58:53,791 INFO L273 TraceCheckUtils]: 100: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,791 INFO L273 TraceCheckUtils]: 101: Hoare triple {16469#true} assume !(~j~0 < ~edgecount~0); {16469#true} is VALID [2018-11-18 23:58:53,791 INFO L273 TraceCheckUtils]: 102: Hoare triple {16469#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16469#true} is VALID [2018-11-18 23:58:53,791 INFO L273 TraceCheckUtils]: 103: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,792 INFO L273 TraceCheckUtils]: 104: Hoare triple {16469#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {16469#true} is VALID [2018-11-18 23:58:53,792 INFO L273 TraceCheckUtils]: 105: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,792 INFO L273 TraceCheckUtils]: 106: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,792 INFO L273 TraceCheckUtils]: 107: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16469#true} is VALID [2018-11-18 23:58:53,792 INFO L273 TraceCheckUtils]: 108: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16469#true} is VALID [2018-11-18 23:58:53,792 INFO L273 TraceCheckUtils]: 109: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,793 INFO L273 TraceCheckUtils]: 110: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,795 INFO L273 TraceCheckUtils]: 111: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16469#true} is VALID [2018-11-18 23:58:53,796 INFO L273 TraceCheckUtils]: 112: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16469#true} is VALID [2018-11-18 23:58:53,796 INFO L273 TraceCheckUtils]: 113: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,796 INFO L273 TraceCheckUtils]: 114: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,796 INFO L273 TraceCheckUtils]: 115: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16469#true} is VALID [2018-11-18 23:58:53,796 INFO L273 TraceCheckUtils]: 116: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16469#true} is VALID [2018-11-18 23:58:53,796 INFO L273 TraceCheckUtils]: 117: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,797 INFO L273 TraceCheckUtils]: 118: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,797 INFO L273 TraceCheckUtils]: 119: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16469#true} is VALID [2018-11-18 23:58:53,797 INFO L273 TraceCheckUtils]: 120: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16469#true} is VALID [2018-11-18 23:58:53,797 INFO L273 TraceCheckUtils]: 121: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,797 INFO L273 TraceCheckUtils]: 122: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,797 INFO L273 TraceCheckUtils]: 123: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16469#true} is VALID [2018-11-18 23:58:53,797 INFO L273 TraceCheckUtils]: 124: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16469#true} is VALID [2018-11-18 23:58:53,798 INFO L273 TraceCheckUtils]: 125: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,798 INFO L273 TraceCheckUtils]: 126: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,798 INFO L273 TraceCheckUtils]: 127: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16469#true} is VALID [2018-11-18 23:58:53,798 INFO L273 TraceCheckUtils]: 128: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16469#true} is VALID [2018-11-18 23:58:53,798 INFO L273 TraceCheckUtils]: 129: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,798 INFO L273 TraceCheckUtils]: 130: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,799 INFO L273 TraceCheckUtils]: 131: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16469#true} is VALID [2018-11-18 23:58:53,799 INFO L273 TraceCheckUtils]: 132: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16469#true} is VALID [2018-11-18 23:58:53,799 INFO L273 TraceCheckUtils]: 133: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,799 INFO L273 TraceCheckUtils]: 134: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,799 INFO L273 TraceCheckUtils]: 135: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16469#true} is VALID [2018-11-18 23:58:53,799 INFO L273 TraceCheckUtils]: 136: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16469#true} is VALID [2018-11-18 23:58:53,800 INFO L273 TraceCheckUtils]: 137: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,800 INFO L273 TraceCheckUtils]: 138: Hoare triple {16469#true} assume !(~j~0 < ~edgecount~0); {16469#true} is VALID [2018-11-18 23:58:53,800 INFO L273 TraceCheckUtils]: 139: Hoare triple {16469#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16469#true} is VALID [2018-11-18 23:58:53,800 INFO L273 TraceCheckUtils]: 140: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,800 INFO L273 TraceCheckUtils]: 141: Hoare triple {16469#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {16469#true} is VALID [2018-11-18 23:58:53,800 INFO L273 TraceCheckUtils]: 142: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,801 INFO L273 TraceCheckUtils]: 143: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,801 INFO L273 TraceCheckUtils]: 144: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16469#true} is VALID [2018-11-18 23:58:53,801 INFO L273 TraceCheckUtils]: 145: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16469#true} is VALID [2018-11-18 23:58:53,801 INFO L273 TraceCheckUtils]: 146: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,801 INFO L273 TraceCheckUtils]: 147: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,801 INFO L273 TraceCheckUtils]: 148: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16469#true} is VALID [2018-11-18 23:58:53,801 INFO L273 TraceCheckUtils]: 149: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16469#true} is VALID [2018-11-18 23:58:53,802 INFO L273 TraceCheckUtils]: 150: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,802 INFO L273 TraceCheckUtils]: 151: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,802 INFO L273 TraceCheckUtils]: 152: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16469#true} is VALID [2018-11-18 23:58:53,802 INFO L273 TraceCheckUtils]: 153: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16469#true} is VALID [2018-11-18 23:58:53,802 INFO L273 TraceCheckUtils]: 154: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,802 INFO L273 TraceCheckUtils]: 155: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,803 INFO L273 TraceCheckUtils]: 156: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16469#true} is VALID [2018-11-18 23:58:53,803 INFO L273 TraceCheckUtils]: 157: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16469#true} is VALID [2018-11-18 23:58:53,803 INFO L273 TraceCheckUtils]: 158: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,803 INFO L273 TraceCheckUtils]: 159: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,803 INFO L273 TraceCheckUtils]: 160: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16469#true} is VALID [2018-11-18 23:58:53,803 INFO L273 TraceCheckUtils]: 161: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16469#true} is VALID [2018-11-18 23:58:53,804 INFO L273 TraceCheckUtils]: 162: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,804 INFO L273 TraceCheckUtils]: 163: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,804 INFO L273 TraceCheckUtils]: 164: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16469#true} is VALID [2018-11-18 23:58:53,804 INFO L273 TraceCheckUtils]: 165: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16469#true} is VALID [2018-11-18 23:58:53,804 INFO L273 TraceCheckUtils]: 166: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,804 INFO L273 TraceCheckUtils]: 167: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,805 INFO L273 TraceCheckUtils]: 168: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16469#true} is VALID [2018-11-18 23:58:53,805 INFO L273 TraceCheckUtils]: 169: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16469#true} is VALID [2018-11-18 23:58:53,805 INFO L273 TraceCheckUtils]: 170: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,805 INFO L273 TraceCheckUtils]: 171: Hoare triple {16469#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16469#true} is VALID [2018-11-18 23:58:53,805 INFO L273 TraceCheckUtils]: 172: Hoare triple {16469#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16469#true} is VALID [2018-11-18 23:58:53,805 INFO L273 TraceCheckUtils]: 173: Hoare triple {16469#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16469#true} is VALID [2018-11-18 23:58:53,805 INFO L273 TraceCheckUtils]: 174: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,806 INFO L273 TraceCheckUtils]: 175: Hoare triple {16469#true} assume !(~j~0 < ~edgecount~0); {16469#true} is VALID [2018-11-18 23:58:53,806 INFO L273 TraceCheckUtils]: 176: Hoare triple {16469#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16469#true} is VALID [2018-11-18 23:58:53,806 INFO L273 TraceCheckUtils]: 177: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:53,818 INFO L273 TraceCheckUtils]: 178: Hoare triple {16469#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {16471#(= main_~j~0 0)} is VALID [2018-11-18 23:58:53,819 INFO L273 TraceCheckUtils]: 179: Hoare triple {16471#(= main_~j~0 0)} assume true; {16471#(= main_~j~0 0)} is VALID [2018-11-18 23:58:53,820 INFO L273 TraceCheckUtils]: 180: Hoare triple {16471#(= main_~j~0 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16471#(= main_~j~0 0)} is VALID [2018-11-18 23:58:53,822 INFO L273 TraceCheckUtils]: 181: Hoare triple {16471#(= main_~j~0 0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16471#(= main_~j~0 0)} is VALID [2018-11-18 23:58:53,822 INFO L273 TraceCheckUtils]: 182: Hoare triple {16471#(= main_~j~0 0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16472#(<= main_~j~0 1)} is VALID [2018-11-18 23:58:53,824 INFO L273 TraceCheckUtils]: 183: Hoare triple {16472#(<= main_~j~0 1)} assume true; {16472#(<= main_~j~0 1)} is VALID [2018-11-18 23:58:53,824 INFO L273 TraceCheckUtils]: 184: Hoare triple {16472#(<= main_~j~0 1)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16472#(<= main_~j~0 1)} is VALID [2018-11-18 23:58:53,826 INFO L273 TraceCheckUtils]: 185: Hoare triple {16472#(<= main_~j~0 1)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16472#(<= main_~j~0 1)} is VALID [2018-11-18 23:58:53,826 INFO L273 TraceCheckUtils]: 186: Hoare triple {16472#(<= main_~j~0 1)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16473#(<= main_~j~0 2)} is VALID [2018-11-18 23:58:53,829 INFO L273 TraceCheckUtils]: 187: Hoare triple {16473#(<= main_~j~0 2)} assume true; {16473#(<= main_~j~0 2)} is VALID [2018-11-18 23:58:53,829 INFO L273 TraceCheckUtils]: 188: Hoare triple {16473#(<= main_~j~0 2)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16473#(<= main_~j~0 2)} is VALID [2018-11-18 23:58:53,832 INFO L273 TraceCheckUtils]: 189: Hoare triple {16473#(<= main_~j~0 2)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16473#(<= main_~j~0 2)} is VALID [2018-11-18 23:58:53,832 INFO L273 TraceCheckUtils]: 190: Hoare triple {16473#(<= main_~j~0 2)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16474#(<= main_~j~0 3)} is VALID [2018-11-18 23:58:53,835 INFO L273 TraceCheckUtils]: 191: Hoare triple {16474#(<= main_~j~0 3)} assume true; {16474#(<= main_~j~0 3)} is VALID [2018-11-18 23:58:53,835 INFO L273 TraceCheckUtils]: 192: Hoare triple {16474#(<= main_~j~0 3)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16474#(<= main_~j~0 3)} is VALID [2018-11-18 23:58:53,838 INFO L273 TraceCheckUtils]: 193: Hoare triple {16474#(<= main_~j~0 3)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16474#(<= main_~j~0 3)} is VALID [2018-11-18 23:58:53,838 INFO L273 TraceCheckUtils]: 194: Hoare triple {16474#(<= main_~j~0 3)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16475#(<= main_~j~0 4)} is VALID [2018-11-18 23:58:53,838 INFO L273 TraceCheckUtils]: 195: Hoare triple {16475#(<= main_~j~0 4)} assume true; {16475#(<= main_~j~0 4)} is VALID [2018-11-18 23:58:53,839 INFO L273 TraceCheckUtils]: 196: Hoare triple {16475#(<= main_~j~0 4)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16475#(<= main_~j~0 4)} is VALID [2018-11-18 23:58:53,839 INFO L273 TraceCheckUtils]: 197: Hoare triple {16475#(<= main_~j~0 4)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16475#(<= main_~j~0 4)} is VALID [2018-11-18 23:58:53,839 INFO L273 TraceCheckUtils]: 198: Hoare triple {16475#(<= main_~j~0 4)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16476#(<= main_~j~0 5)} is VALID [2018-11-18 23:58:53,840 INFO L273 TraceCheckUtils]: 199: Hoare triple {16476#(<= main_~j~0 5)} assume true; {16476#(<= main_~j~0 5)} is VALID [2018-11-18 23:58:53,840 INFO L273 TraceCheckUtils]: 200: Hoare triple {16476#(<= main_~j~0 5)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16476#(<= main_~j~0 5)} is VALID [2018-11-18 23:58:53,840 INFO L273 TraceCheckUtils]: 201: Hoare triple {16476#(<= main_~j~0 5)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16476#(<= main_~j~0 5)} is VALID [2018-11-18 23:58:53,841 INFO L273 TraceCheckUtils]: 202: Hoare triple {16476#(<= main_~j~0 5)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16477#(<= main_~j~0 6)} is VALID [2018-11-18 23:58:53,841 INFO L273 TraceCheckUtils]: 203: Hoare triple {16477#(<= main_~j~0 6)} assume true; {16477#(<= main_~j~0 6)} is VALID [2018-11-18 23:58:53,842 INFO L273 TraceCheckUtils]: 204: Hoare triple {16477#(<= main_~j~0 6)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16477#(<= main_~j~0 6)} is VALID [2018-11-18 23:58:53,842 INFO L273 TraceCheckUtils]: 205: Hoare triple {16477#(<= main_~j~0 6)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16477#(<= main_~j~0 6)} is VALID [2018-11-18 23:58:53,843 INFO L273 TraceCheckUtils]: 206: Hoare triple {16477#(<= main_~j~0 6)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16478#(<= main_~j~0 7)} is VALID [2018-11-18 23:58:53,843 INFO L273 TraceCheckUtils]: 207: Hoare triple {16478#(<= main_~j~0 7)} assume true; {16478#(<= main_~j~0 7)} is VALID [2018-11-18 23:58:53,844 INFO L273 TraceCheckUtils]: 208: Hoare triple {16478#(<= main_~j~0 7)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16478#(<= main_~j~0 7)} is VALID [2018-11-18 23:58:53,844 INFO L273 TraceCheckUtils]: 209: Hoare triple {16478#(<= main_~j~0 7)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16478#(<= main_~j~0 7)} is VALID [2018-11-18 23:58:53,845 INFO L273 TraceCheckUtils]: 210: Hoare triple {16478#(<= main_~j~0 7)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16479#(<= main_~j~0 8)} is VALID [2018-11-18 23:58:53,845 INFO L273 TraceCheckUtils]: 211: Hoare triple {16479#(<= main_~j~0 8)} assume true; {16479#(<= main_~j~0 8)} is VALID [2018-11-18 23:58:53,846 INFO L273 TraceCheckUtils]: 212: Hoare triple {16479#(<= main_~j~0 8)} assume !(~j~0 < ~edgecount~0); {16480#(<= main_~edgecount~0 8)} is VALID [2018-11-18 23:58:53,847 INFO L273 TraceCheckUtils]: 213: Hoare triple {16480#(<= main_~edgecount~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16480#(<= main_~edgecount~0 8)} is VALID [2018-11-18 23:58:53,847 INFO L273 TraceCheckUtils]: 214: Hoare triple {16480#(<= main_~edgecount~0 8)} assume true; {16480#(<= main_~edgecount~0 8)} is VALID [2018-11-18 23:58:53,848 INFO L273 TraceCheckUtils]: 215: Hoare triple {16480#(<= main_~edgecount~0 8)} assume !(~i~0 < ~nodecount~0); {16480#(<= main_~edgecount~0 8)} is VALID [2018-11-18 23:58:53,849 INFO L273 TraceCheckUtils]: 216: Hoare triple {16480#(<= main_~edgecount~0 8)} ~i~0 := 0; {16481#(and (<= main_~edgecount~0 8) (= main_~i~0 0))} is VALID [2018-11-18 23:58:53,849 INFO L273 TraceCheckUtils]: 217: Hoare triple {16481#(and (<= main_~edgecount~0 8) (= main_~i~0 0))} assume true; {16481#(and (<= main_~edgecount~0 8) (= main_~i~0 0))} is VALID [2018-11-18 23:58:53,850 INFO L273 TraceCheckUtils]: 218: Hoare triple {16481#(and (<= main_~edgecount~0 8) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16481#(and (<= main_~edgecount~0 8) (= main_~i~0 0))} is VALID [2018-11-18 23:58:53,851 INFO L273 TraceCheckUtils]: 219: Hoare triple {16481#(and (<= main_~edgecount~0 8) (= main_~i~0 0))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {16481#(and (<= main_~edgecount~0 8) (= main_~i~0 0))} is VALID [2018-11-18 23:58:53,852 INFO L273 TraceCheckUtils]: 220: Hoare triple {16481#(and (<= main_~edgecount~0 8) (= main_~i~0 0))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {16482#(<= main_~edgecount~0 (+ main_~i~0 7))} is VALID [2018-11-18 23:58:53,852 INFO L273 TraceCheckUtils]: 221: Hoare triple {16482#(<= main_~edgecount~0 (+ main_~i~0 7))} assume true; {16482#(<= main_~edgecount~0 (+ main_~i~0 7))} is VALID [2018-11-18 23:58:53,853 INFO L273 TraceCheckUtils]: 222: Hoare triple {16482#(<= main_~edgecount~0 (+ main_~i~0 7))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16482#(<= main_~edgecount~0 (+ main_~i~0 7))} is VALID [2018-11-18 23:58:53,853 INFO L273 TraceCheckUtils]: 223: Hoare triple {16482#(<= main_~edgecount~0 (+ main_~i~0 7))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {16482#(<= main_~edgecount~0 (+ main_~i~0 7))} is VALID [2018-11-18 23:58:53,854 INFO L273 TraceCheckUtils]: 224: Hoare triple {16482#(<= main_~edgecount~0 (+ main_~i~0 7))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {16483#(<= main_~edgecount~0 (+ main_~i~0 6))} is VALID [2018-11-18 23:58:53,854 INFO L273 TraceCheckUtils]: 225: Hoare triple {16483#(<= main_~edgecount~0 (+ main_~i~0 6))} assume true; {16483#(<= main_~edgecount~0 (+ main_~i~0 6))} is VALID [2018-11-18 23:58:53,855 INFO L273 TraceCheckUtils]: 226: Hoare triple {16483#(<= main_~edgecount~0 (+ main_~i~0 6))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16483#(<= main_~edgecount~0 (+ main_~i~0 6))} is VALID [2018-11-18 23:58:53,855 INFO L273 TraceCheckUtils]: 227: Hoare triple {16483#(<= main_~edgecount~0 (+ main_~i~0 6))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {16483#(<= main_~edgecount~0 (+ main_~i~0 6))} is VALID [2018-11-18 23:58:53,856 INFO L273 TraceCheckUtils]: 228: Hoare triple {16483#(<= main_~edgecount~0 (+ main_~i~0 6))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {16484#(<= main_~edgecount~0 (+ main_~i~0 5))} is VALID [2018-11-18 23:58:53,856 INFO L273 TraceCheckUtils]: 229: Hoare triple {16484#(<= main_~edgecount~0 (+ main_~i~0 5))} assume true; {16484#(<= main_~edgecount~0 (+ main_~i~0 5))} is VALID [2018-11-18 23:58:53,857 INFO L273 TraceCheckUtils]: 230: Hoare triple {16484#(<= main_~edgecount~0 (+ main_~i~0 5))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16484#(<= main_~edgecount~0 (+ main_~i~0 5))} is VALID [2018-11-18 23:58:53,857 INFO L273 TraceCheckUtils]: 231: Hoare triple {16484#(<= main_~edgecount~0 (+ main_~i~0 5))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {16484#(<= main_~edgecount~0 (+ main_~i~0 5))} is VALID [2018-11-18 23:58:53,858 INFO L273 TraceCheckUtils]: 232: Hoare triple {16484#(<= main_~edgecount~0 (+ main_~i~0 5))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {16485#(<= main_~edgecount~0 (+ main_~i~0 4))} is VALID [2018-11-18 23:58:53,859 INFO L273 TraceCheckUtils]: 233: Hoare triple {16485#(<= main_~edgecount~0 (+ main_~i~0 4))} assume true; {16485#(<= main_~edgecount~0 (+ main_~i~0 4))} is VALID [2018-11-18 23:58:53,859 INFO L273 TraceCheckUtils]: 234: Hoare triple {16485#(<= main_~edgecount~0 (+ main_~i~0 4))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16485#(<= main_~edgecount~0 (+ main_~i~0 4))} is VALID [2018-11-18 23:58:53,860 INFO L273 TraceCheckUtils]: 235: Hoare triple {16485#(<= main_~edgecount~0 (+ main_~i~0 4))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {16485#(<= main_~edgecount~0 (+ main_~i~0 4))} is VALID [2018-11-18 23:58:53,860 INFO L273 TraceCheckUtils]: 236: Hoare triple {16485#(<= main_~edgecount~0 (+ main_~i~0 4))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {16486#(<= main_~edgecount~0 (+ main_~i~0 3))} is VALID [2018-11-18 23:58:53,861 INFO L273 TraceCheckUtils]: 237: Hoare triple {16486#(<= main_~edgecount~0 (+ main_~i~0 3))} assume true; {16486#(<= main_~edgecount~0 (+ main_~i~0 3))} is VALID [2018-11-18 23:58:53,861 INFO L273 TraceCheckUtils]: 238: Hoare triple {16486#(<= main_~edgecount~0 (+ main_~i~0 3))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16486#(<= main_~edgecount~0 (+ main_~i~0 3))} is VALID [2018-11-18 23:58:53,862 INFO L273 TraceCheckUtils]: 239: Hoare triple {16486#(<= main_~edgecount~0 (+ main_~i~0 3))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {16486#(<= main_~edgecount~0 (+ main_~i~0 3))} is VALID [2018-11-18 23:58:53,863 INFO L273 TraceCheckUtils]: 240: Hoare triple {16486#(<= main_~edgecount~0 (+ main_~i~0 3))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {16487#(<= main_~edgecount~0 (+ main_~i~0 2))} is VALID [2018-11-18 23:58:53,863 INFO L273 TraceCheckUtils]: 241: Hoare triple {16487#(<= main_~edgecount~0 (+ main_~i~0 2))} assume true; {16487#(<= main_~edgecount~0 (+ main_~i~0 2))} is VALID [2018-11-18 23:58:53,864 INFO L273 TraceCheckUtils]: 242: Hoare triple {16487#(<= main_~edgecount~0 (+ main_~i~0 2))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16487#(<= main_~edgecount~0 (+ main_~i~0 2))} is VALID [2018-11-18 23:58:53,864 INFO L273 TraceCheckUtils]: 243: Hoare triple {16487#(<= main_~edgecount~0 (+ main_~i~0 2))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {16487#(<= main_~edgecount~0 (+ main_~i~0 2))} is VALID [2018-11-18 23:58:53,865 INFO L273 TraceCheckUtils]: 244: Hoare triple {16487#(<= main_~edgecount~0 (+ main_~i~0 2))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {16488#(<= main_~edgecount~0 (+ main_~i~0 1))} is VALID [2018-11-18 23:58:53,865 INFO L273 TraceCheckUtils]: 245: Hoare triple {16488#(<= main_~edgecount~0 (+ main_~i~0 1))} assume true; {16488#(<= main_~edgecount~0 (+ main_~i~0 1))} is VALID [2018-11-18 23:58:53,866 INFO L273 TraceCheckUtils]: 246: Hoare triple {16488#(<= main_~edgecount~0 (+ main_~i~0 1))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16488#(<= main_~edgecount~0 (+ main_~i~0 1))} is VALID [2018-11-18 23:58:53,866 INFO L273 TraceCheckUtils]: 247: Hoare triple {16488#(<= main_~edgecount~0 (+ main_~i~0 1))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {16488#(<= main_~edgecount~0 (+ main_~i~0 1))} is VALID [2018-11-18 23:58:53,867 INFO L273 TraceCheckUtils]: 248: Hoare triple {16488#(<= main_~edgecount~0 (+ main_~i~0 1))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {16489#(<= main_~edgecount~0 main_~i~0)} is VALID [2018-11-18 23:58:53,868 INFO L273 TraceCheckUtils]: 249: Hoare triple {16489#(<= main_~edgecount~0 main_~i~0)} assume true; {16489#(<= main_~edgecount~0 main_~i~0)} is VALID [2018-11-18 23:58:53,869 INFO L273 TraceCheckUtils]: 250: Hoare triple {16489#(<= main_~edgecount~0 main_~i~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16470#false} is VALID [2018-11-18 23:58:53,869 INFO L273 TraceCheckUtils]: 251: Hoare triple {16470#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {16470#false} is VALID [2018-11-18 23:58:53,869 INFO L273 TraceCheckUtils]: 252: Hoare triple {16470#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {16470#false} is VALID [2018-11-18 23:58:53,869 INFO L273 TraceCheckUtils]: 253: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:53,869 INFO L273 TraceCheckUtils]: 254: Hoare triple {16470#false} assume !(~i~0 < ~edgecount~0); {16470#false} is VALID [2018-11-18 23:58:53,870 INFO L273 TraceCheckUtils]: 255: Hoare triple {16470#false} ~i~0 := 0; {16470#false} is VALID [2018-11-18 23:58:53,870 INFO L273 TraceCheckUtils]: 256: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:53,870 INFO L273 TraceCheckUtils]: 257: Hoare triple {16470#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16470#false} is VALID [2018-11-18 23:58:53,870 INFO L256 TraceCheckUtils]: 258: Hoare triple {16470#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {16470#false} is VALID [2018-11-18 23:58:53,870 INFO L273 TraceCheckUtils]: 259: Hoare triple {16470#false} ~cond := #in~cond; {16470#false} is VALID [2018-11-18 23:58:53,871 INFO L273 TraceCheckUtils]: 260: Hoare triple {16470#false} assume 0 == ~cond; {16470#false} is VALID [2018-11-18 23:58:53,871 INFO L273 TraceCheckUtils]: 261: Hoare triple {16470#false} assume !false; {16470#false} is VALID [2018-11-18 23:58:53,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3792 backedges. 1306 proven. 158 refuted. 0 times theorem prover too weak. 2328 trivial. 0 not checked. [2018-11-18 23:58:53,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:58:53,904 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:58:53,912 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:58:54,089 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 23:58:54,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:58:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:54,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:58:54,569 INFO L256 TraceCheckUtils]: 0: Hoare triple {16469#true} call ULTIMATE.init(); {16469#true} is VALID [2018-11-18 23:58:54,569 INFO L273 TraceCheckUtils]: 1: Hoare triple {16469#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {16469#true} is VALID [2018-11-18 23:58:54,569 INFO L273 TraceCheckUtils]: 2: Hoare triple {16469#true} assume true; {16469#true} is VALID [2018-11-18 23:58:54,569 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16469#true} {16469#true} #108#return; {16469#true} is VALID [2018-11-18 23:58:54,570 INFO L256 TraceCheckUtils]: 4: Hoare triple {16469#true} call #t~ret18 := main(); {16469#true} is VALID [2018-11-18 23:58:54,572 INFO L273 TraceCheckUtils]: 5: Hoare triple {16469#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:54,573 INFO L273 TraceCheckUtils]: 6: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume true; {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:54,573 INFO L273 TraceCheckUtils]: 7: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:54,574 INFO L273 TraceCheckUtils]: 8: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:54,574 INFO L273 TraceCheckUtils]: 9: Hoare triple {16508#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:54,575 INFO L273 TraceCheckUtils]: 10: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume true; {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:54,575 INFO L273 TraceCheckUtils]: 11: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:54,576 INFO L273 TraceCheckUtils]: 12: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:54,576 INFO L273 TraceCheckUtils]: 13: Hoare triple {16508#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:54,577 INFO L273 TraceCheckUtils]: 14: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume true; {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:54,577 INFO L273 TraceCheckUtils]: 15: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:54,578 INFO L273 TraceCheckUtils]: 16: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:54,578 INFO L273 TraceCheckUtils]: 17: Hoare triple {16508#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:54,579 INFO L273 TraceCheckUtils]: 18: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume true; {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:54,579 INFO L273 TraceCheckUtils]: 19: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:54,580 INFO L273 TraceCheckUtils]: 20: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:54,580 INFO L273 TraceCheckUtils]: 21: Hoare triple {16508#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:54,581 INFO L273 TraceCheckUtils]: 22: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume true; {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:54,581 INFO L273 TraceCheckUtils]: 23: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:54,582 INFO L273 TraceCheckUtils]: 24: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:54,582 INFO L273 TraceCheckUtils]: 25: Hoare triple {16508#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:54,583 INFO L273 TraceCheckUtils]: 26: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume true; {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:54,583 INFO L273 TraceCheckUtils]: 27: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:54,584 INFO L273 TraceCheckUtils]: 28: Hoare triple {16508#(<= 20 main_~edgecount~0)} ~i~0 := 0; {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:54,584 INFO L273 TraceCheckUtils]: 29: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume true; {16508#(<= 20 main_~edgecount~0)} is VALID [2018-11-18 23:58:54,585 INFO L273 TraceCheckUtils]: 30: Hoare triple {16508#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {16584#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:54,587 INFO L273 TraceCheckUtils]: 31: Hoare triple {16584#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume true; {16584#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:54,588 INFO L273 TraceCheckUtils]: 32: Hoare triple {16584#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16584#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:54,588 INFO L273 TraceCheckUtils]: 33: Hoare triple {16584#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16584#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:58:54,589 INFO L273 TraceCheckUtils]: 34: Hoare triple {16584#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16597#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:58:54,589 INFO L273 TraceCheckUtils]: 35: Hoare triple {16597#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume true; {16597#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:58:54,590 INFO L273 TraceCheckUtils]: 36: Hoare triple {16597#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16597#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:58:54,591 INFO L273 TraceCheckUtils]: 37: Hoare triple {16597#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16597#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:58:54,592 INFO L273 TraceCheckUtils]: 38: Hoare triple {16597#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16610#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:58:54,592 INFO L273 TraceCheckUtils]: 39: Hoare triple {16610#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} assume true; {16610#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:58:54,593 INFO L273 TraceCheckUtils]: 40: Hoare triple {16610#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16610#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:58:54,594 INFO L273 TraceCheckUtils]: 41: Hoare triple {16610#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16610#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:58:54,595 INFO L273 TraceCheckUtils]: 42: Hoare triple {16610#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16623#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:58:54,595 INFO L273 TraceCheckUtils]: 43: Hoare triple {16623#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume true; {16623#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:58:54,596 INFO L273 TraceCheckUtils]: 44: Hoare triple {16623#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16623#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:58:54,597 INFO L273 TraceCheckUtils]: 45: Hoare triple {16623#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16623#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:58:54,598 INFO L273 TraceCheckUtils]: 46: Hoare triple {16623#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16636#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-18 23:58:54,598 INFO L273 TraceCheckUtils]: 47: Hoare triple {16636#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume true; {16636#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-18 23:58:54,599 INFO L273 TraceCheckUtils]: 48: Hoare triple {16636#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16636#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-18 23:58:54,600 INFO L273 TraceCheckUtils]: 49: Hoare triple {16636#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16636#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-18 23:58:54,601 INFO L273 TraceCheckUtils]: 50: Hoare triple {16636#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16649#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2018-11-18 23:58:54,602 INFO L273 TraceCheckUtils]: 51: Hoare triple {16649#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume true; {16649#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2018-11-18 23:58:54,603 INFO L273 TraceCheckUtils]: 52: Hoare triple {16649#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16649#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2018-11-18 23:58:54,603 INFO L273 TraceCheckUtils]: 53: Hoare triple {16649#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16649#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2018-11-18 23:58:54,604 INFO L273 TraceCheckUtils]: 54: Hoare triple {16649#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16662#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} is VALID [2018-11-18 23:58:54,605 INFO L273 TraceCheckUtils]: 55: Hoare triple {16662#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} assume true; {16662#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} is VALID [2018-11-18 23:58:54,606 INFO L273 TraceCheckUtils]: 56: Hoare triple {16662#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16662#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} is VALID [2018-11-18 23:58:54,606 INFO L273 TraceCheckUtils]: 57: Hoare triple {16662#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16662#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} is VALID [2018-11-18 23:58:54,607 INFO L273 TraceCheckUtils]: 58: Hoare triple {16662#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16675#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} is VALID [2018-11-18 23:58:54,608 INFO L273 TraceCheckUtils]: 59: Hoare triple {16675#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} assume true; {16675#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} is VALID [2018-11-18 23:58:54,609 INFO L273 TraceCheckUtils]: 60: Hoare triple {16675#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16675#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} is VALID [2018-11-18 23:58:54,609 INFO L273 TraceCheckUtils]: 61: Hoare triple {16675#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16675#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} is VALID [2018-11-18 23:58:54,610 INFO L273 TraceCheckUtils]: 62: Hoare triple {16675#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16688#(and (<= 20 main_~edgecount~0) (<= main_~j~0 8))} is VALID [2018-11-18 23:58:54,611 INFO L273 TraceCheckUtils]: 63: Hoare triple {16688#(and (<= 20 main_~edgecount~0) (<= main_~j~0 8))} assume true; {16688#(and (<= 20 main_~edgecount~0) (<= main_~j~0 8))} is VALID [2018-11-18 23:58:54,611 INFO L273 TraceCheckUtils]: 64: Hoare triple {16688#(and (<= 20 main_~edgecount~0) (<= main_~j~0 8))} assume !(~j~0 < ~edgecount~0); {16470#false} is VALID [2018-11-18 23:58:54,611 INFO L273 TraceCheckUtils]: 65: Hoare triple {16470#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16470#false} is VALID [2018-11-18 23:58:54,612 INFO L273 TraceCheckUtils]: 66: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,612 INFO L273 TraceCheckUtils]: 67: Hoare triple {16470#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {16470#false} is VALID [2018-11-18 23:58:54,612 INFO L273 TraceCheckUtils]: 68: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,612 INFO L273 TraceCheckUtils]: 69: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,612 INFO L273 TraceCheckUtils]: 70: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16470#false} is VALID [2018-11-18 23:58:54,613 INFO L273 TraceCheckUtils]: 71: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16470#false} is VALID [2018-11-18 23:58:54,613 INFO L273 TraceCheckUtils]: 72: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,613 INFO L273 TraceCheckUtils]: 73: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,613 INFO L273 TraceCheckUtils]: 74: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16470#false} is VALID [2018-11-18 23:58:54,613 INFO L273 TraceCheckUtils]: 75: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16470#false} is VALID [2018-11-18 23:58:54,614 INFO L273 TraceCheckUtils]: 76: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,614 INFO L273 TraceCheckUtils]: 77: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,614 INFO L273 TraceCheckUtils]: 78: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16470#false} is VALID [2018-11-18 23:58:54,614 INFO L273 TraceCheckUtils]: 79: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16470#false} is VALID [2018-11-18 23:58:54,614 INFO L273 TraceCheckUtils]: 80: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,614 INFO L273 TraceCheckUtils]: 81: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,614 INFO L273 TraceCheckUtils]: 82: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16470#false} is VALID [2018-11-18 23:58:54,614 INFO L273 TraceCheckUtils]: 83: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16470#false} is VALID [2018-11-18 23:58:54,615 INFO L273 TraceCheckUtils]: 84: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,615 INFO L273 TraceCheckUtils]: 85: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,615 INFO L273 TraceCheckUtils]: 86: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16470#false} is VALID [2018-11-18 23:58:54,615 INFO L273 TraceCheckUtils]: 87: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16470#false} is VALID [2018-11-18 23:58:54,615 INFO L273 TraceCheckUtils]: 88: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,615 INFO L273 TraceCheckUtils]: 89: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,615 INFO L273 TraceCheckUtils]: 90: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16470#false} is VALID [2018-11-18 23:58:54,615 INFO L273 TraceCheckUtils]: 91: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16470#false} is VALID [2018-11-18 23:58:54,615 INFO L273 TraceCheckUtils]: 92: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,616 INFO L273 TraceCheckUtils]: 93: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,616 INFO L273 TraceCheckUtils]: 94: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16470#false} is VALID [2018-11-18 23:58:54,616 INFO L273 TraceCheckUtils]: 95: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16470#false} is VALID [2018-11-18 23:58:54,616 INFO L273 TraceCheckUtils]: 96: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,616 INFO L273 TraceCheckUtils]: 97: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,616 INFO L273 TraceCheckUtils]: 98: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16470#false} is VALID [2018-11-18 23:58:54,616 INFO L273 TraceCheckUtils]: 99: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16470#false} is VALID [2018-11-18 23:58:54,616 INFO L273 TraceCheckUtils]: 100: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,616 INFO L273 TraceCheckUtils]: 101: Hoare triple {16470#false} assume !(~j~0 < ~edgecount~0); {16470#false} is VALID [2018-11-18 23:58:54,617 INFO L273 TraceCheckUtils]: 102: Hoare triple {16470#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16470#false} is VALID [2018-11-18 23:58:54,617 INFO L273 TraceCheckUtils]: 103: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,617 INFO L273 TraceCheckUtils]: 104: Hoare triple {16470#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {16470#false} is VALID [2018-11-18 23:58:54,617 INFO L273 TraceCheckUtils]: 105: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,617 INFO L273 TraceCheckUtils]: 106: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,617 INFO L273 TraceCheckUtils]: 107: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16470#false} is VALID [2018-11-18 23:58:54,617 INFO L273 TraceCheckUtils]: 108: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16470#false} is VALID [2018-11-18 23:58:54,617 INFO L273 TraceCheckUtils]: 109: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,617 INFO L273 TraceCheckUtils]: 110: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,618 INFO L273 TraceCheckUtils]: 111: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16470#false} is VALID [2018-11-18 23:58:54,618 INFO L273 TraceCheckUtils]: 112: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16470#false} is VALID [2018-11-18 23:58:54,618 INFO L273 TraceCheckUtils]: 113: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,618 INFO L273 TraceCheckUtils]: 114: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,618 INFO L273 TraceCheckUtils]: 115: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16470#false} is VALID [2018-11-18 23:58:54,618 INFO L273 TraceCheckUtils]: 116: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16470#false} is VALID [2018-11-18 23:58:54,618 INFO L273 TraceCheckUtils]: 117: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,618 INFO L273 TraceCheckUtils]: 118: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,618 INFO L273 TraceCheckUtils]: 119: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16470#false} is VALID [2018-11-18 23:58:54,619 INFO L273 TraceCheckUtils]: 120: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16470#false} is VALID [2018-11-18 23:58:54,619 INFO L273 TraceCheckUtils]: 121: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,619 INFO L273 TraceCheckUtils]: 122: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,619 INFO L273 TraceCheckUtils]: 123: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16470#false} is VALID [2018-11-18 23:58:54,619 INFO L273 TraceCheckUtils]: 124: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16470#false} is VALID [2018-11-18 23:58:54,619 INFO L273 TraceCheckUtils]: 125: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,619 INFO L273 TraceCheckUtils]: 126: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,619 INFO L273 TraceCheckUtils]: 127: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16470#false} is VALID [2018-11-18 23:58:54,619 INFO L273 TraceCheckUtils]: 128: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16470#false} is VALID [2018-11-18 23:58:54,620 INFO L273 TraceCheckUtils]: 129: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,620 INFO L273 TraceCheckUtils]: 130: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,620 INFO L273 TraceCheckUtils]: 131: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16470#false} is VALID [2018-11-18 23:58:54,620 INFO L273 TraceCheckUtils]: 132: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16470#false} is VALID [2018-11-18 23:58:54,620 INFO L273 TraceCheckUtils]: 133: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,620 INFO L273 TraceCheckUtils]: 134: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,620 INFO L273 TraceCheckUtils]: 135: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16470#false} is VALID [2018-11-18 23:58:54,620 INFO L273 TraceCheckUtils]: 136: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16470#false} is VALID [2018-11-18 23:58:54,620 INFO L273 TraceCheckUtils]: 137: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,621 INFO L273 TraceCheckUtils]: 138: Hoare triple {16470#false} assume !(~j~0 < ~edgecount~0); {16470#false} is VALID [2018-11-18 23:58:54,621 INFO L273 TraceCheckUtils]: 139: Hoare triple {16470#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16470#false} is VALID [2018-11-18 23:58:54,621 INFO L273 TraceCheckUtils]: 140: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,621 INFO L273 TraceCheckUtils]: 141: Hoare triple {16470#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {16470#false} is VALID [2018-11-18 23:58:54,621 INFO L273 TraceCheckUtils]: 142: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,621 INFO L273 TraceCheckUtils]: 143: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,621 INFO L273 TraceCheckUtils]: 144: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16470#false} is VALID [2018-11-18 23:58:54,621 INFO L273 TraceCheckUtils]: 145: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16470#false} is VALID [2018-11-18 23:58:54,622 INFO L273 TraceCheckUtils]: 146: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,622 INFO L273 TraceCheckUtils]: 147: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,622 INFO L273 TraceCheckUtils]: 148: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16470#false} is VALID [2018-11-18 23:58:54,622 INFO L273 TraceCheckUtils]: 149: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16470#false} is VALID [2018-11-18 23:58:54,622 INFO L273 TraceCheckUtils]: 150: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,622 INFO L273 TraceCheckUtils]: 151: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,622 INFO L273 TraceCheckUtils]: 152: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16470#false} is VALID [2018-11-18 23:58:54,622 INFO L273 TraceCheckUtils]: 153: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16470#false} is VALID [2018-11-18 23:58:54,622 INFO L273 TraceCheckUtils]: 154: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,623 INFO L273 TraceCheckUtils]: 155: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,623 INFO L273 TraceCheckUtils]: 156: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16470#false} is VALID [2018-11-18 23:58:54,623 INFO L273 TraceCheckUtils]: 157: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16470#false} is VALID [2018-11-18 23:58:54,623 INFO L273 TraceCheckUtils]: 158: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,623 INFO L273 TraceCheckUtils]: 159: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,623 INFO L273 TraceCheckUtils]: 160: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16470#false} is VALID [2018-11-18 23:58:54,623 INFO L273 TraceCheckUtils]: 161: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16470#false} is VALID [2018-11-18 23:58:54,623 INFO L273 TraceCheckUtils]: 162: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,623 INFO L273 TraceCheckUtils]: 163: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,624 INFO L273 TraceCheckUtils]: 164: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16470#false} is VALID [2018-11-18 23:58:54,624 INFO L273 TraceCheckUtils]: 165: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16470#false} is VALID [2018-11-18 23:58:54,624 INFO L273 TraceCheckUtils]: 166: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,624 INFO L273 TraceCheckUtils]: 167: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,624 INFO L273 TraceCheckUtils]: 168: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16470#false} is VALID [2018-11-18 23:58:54,624 INFO L273 TraceCheckUtils]: 169: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16470#false} is VALID [2018-11-18 23:58:54,624 INFO L273 TraceCheckUtils]: 170: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,624 INFO L273 TraceCheckUtils]: 171: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,624 INFO L273 TraceCheckUtils]: 172: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16470#false} is VALID [2018-11-18 23:58:54,625 INFO L273 TraceCheckUtils]: 173: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16470#false} is VALID [2018-11-18 23:58:54,625 INFO L273 TraceCheckUtils]: 174: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,625 INFO L273 TraceCheckUtils]: 175: Hoare triple {16470#false} assume !(~j~0 < ~edgecount~0); {16470#false} is VALID [2018-11-18 23:58:54,625 INFO L273 TraceCheckUtils]: 176: Hoare triple {16470#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16470#false} is VALID [2018-11-18 23:58:54,625 INFO L273 TraceCheckUtils]: 177: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,625 INFO L273 TraceCheckUtils]: 178: Hoare triple {16470#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {16470#false} is VALID [2018-11-18 23:58:54,625 INFO L273 TraceCheckUtils]: 179: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,625 INFO L273 TraceCheckUtils]: 180: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,625 INFO L273 TraceCheckUtils]: 181: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16470#false} is VALID [2018-11-18 23:58:54,626 INFO L273 TraceCheckUtils]: 182: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16470#false} is VALID [2018-11-18 23:58:54,626 INFO L273 TraceCheckUtils]: 183: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,626 INFO L273 TraceCheckUtils]: 184: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,626 INFO L273 TraceCheckUtils]: 185: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16470#false} is VALID [2018-11-18 23:58:54,626 INFO L273 TraceCheckUtils]: 186: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16470#false} is VALID [2018-11-18 23:58:54,626 INFO L273 TraceCheckUtils]: 187: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,626 INFO L273 TraceCheckUtils]: 188: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,626 INFO L273 TraceCheckUtils]: 189: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16470#false} is VALID [2018-11-18 23:58:54,626 INFO L273 TraceCheckUtils]: 190: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16470#false} is VALID [2018-11-18 23:58:54,627 INFO L273 TraceCheckUtils]: 191: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,627 INFO L273 TraceCheckUtils]: 192: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,627 INFO L273 TraceCheckUtils]: 193: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16470#false} is VALID [2018-11-18 23:58:54,627 INFO L273 TraceCheckUtils]: 194: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16470#false} is VALID [2018-11-18 23:58:54,627 INFO L273 TraceCheckUtils]: 195: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,627 INFO L273 TraceCheckUtils]: 196: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,627 INFO L273 TraceCheckUtils]: 197: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16470#false} is VALID [2018-11-18 23:58:54,627 INFO L273 TraceCheckUtils]: 198: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16470#false} is VALID [2018-11-18 23:58:54,627 INFO L273 TraceCheckUtils]: 199: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,628 INFO L273 TraceCheckUtils]: 200: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,628 INFO L273 TraceCheckUtils]: 201: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16470#false} is VALID [2018-11-18 23:58:54,628 INFO L273 TraceCheckUtils]: 202: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16470#false} is VALID [2018-11-18 23:58:54,628 INFO L273 TraceCheckUtils]: 203: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,628 INFO L273 TraceCheckUtils]: 204: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,628 INFO L273 TraceCheckUtils]: 205: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16470#false} is VALID [2018-11-18 23:58:54,628 INFO L273 TraceCheckUtils]: 206: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16470#false} is VALID [2018-11-18 23:58:54,628 INFO L273 TraceCheckUtils]: 207: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,628 INFO L273 TraceCheckUtils]: 208: Hoare triple {16470#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,629 INFO L273 TraceCheckUtils]: 209: Hoare triple {16470#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {16470#false} is VALID [2018-11-18 23:58:54,629 INFO L273 TraceCheckUtils]: 210: Hoare triple {16470#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {16470#false} is VALID [2018-11-18 23:58:54,629 INFO L273 TraceCheckUtils]: 211: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,629 INFO L273 TraceCheckUtils]: 212: Hoare triple {16470#false} assume !(~j~0 < ~edgecount~0); {16470#false} is VALID [2018-11-18 23:58:54,629 INFO L273 TraceCheckUtils]: 213: Hoare triple {16470#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16470#false} is VALID [2018-11-18 23:58:54,629 INFO L273 TraceCheckUtils]: 214: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,629 INFO L273 TraceCheckUtils]: 215: Hoare triple {16470#false} assume !(~i~0 < ~nodecount~0); {16470#false} is VALID [2018-11-18 23:58:54,629 INFO L273 TraceCheckUtils]: 216: Hoare triple {16470#false} ~i~0 := 0; {16470#false} is VALID [2018-11-18 23:58:54,630 INFO L273 TraceCheckUtils]: 217: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,630 INFO L273 TraceCheckUtils]: 218: Hoare triple {16470#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,630 INFO L273 TraceCheckUtils]: 219: Hoare triple {16470#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {16470#false} is VALID [2018-11-18 23:58:54,630 INFO L273 TraceCheckUtils]: 220: Hoare triple {16470#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {16470#false} is VALID [2018-11-18 23:58:54,630 INFO L273 TraceCheckUtils]: 221: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,630 INFO L273 TraceCheckUtils]: 222: Hoare triple {16470#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,630 INFO L273 TraceCheckUtils]: 223: Hoare triple {16470#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {16470#false} is VALID [2018-11-18 23:58:54,630 INFO L273 TraceCheckUtils]: 224: Hoare triple {16470#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {16470#false} is VALID [2018-11-18 23:58:54,630 INFO L273 TraceCheckUtils]: 225: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,631 INFO L273 TraceCheckUtils]: 226: Hoare triple {16470#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,631 INFO L273 TraceCheckUtils]: 227: Hoare triple {16470#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {16470#false} is VALID [2018-11-18 23:58:54,631 INFO L273 TraceCheckUtils]: 228: Hoare triple {16470#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {16470#false} is VALID [2018-11-18 23:58:54,631 INFO L273 TraceCheckUtils]: 229: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,631 INFO L273 TraceCheckUtils]: 230: Hoare triple {16470#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,631 INFO L273 TraceCheckUtils]: 231: Hoare triple {16470#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {16470#false} is VALID [2018-11-18 23:58:54,631 INFO L273 TraceCheckUtils]: 232: Hoare triple {16470#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {16470#false} is VALID [2018-11-18 23:58:54,631 INFO L273 TraceCheckUtils]: 233: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,631 INFO L273 TraceCheckUtils]: 234: Hoare triple {16470#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,632 INFO L273 TraceCheckUtils]: 235: Hoare triple {16470#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {16470#false} is VALID [2018-11-18 23:58:54,632 INFO L273 TraceCheckUtils]: 236: Hoare triple {16470#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {16470#false} is VALID [2018-11-18 23:58:54,632 INFO L273 TraceCheckUtils]: 237: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,632 INFO L273 TraceCheckUtils]: 238: Hoare triple {16470#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,632 INFO L273 TraceCheckUtils]: 239: Hoare triple {16470#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {16470#false} is VALID [2018-11-18 23:58:54,632 INFO L273 TraceCheckUtils]: 240: Hoare triple {16470#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {16470#false} is VALID [2018-11-18 23:58:54,632 INFO L273 TraceCheckUtils]: 241: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,632 INFO L273 TraceCheckUtils]: 242: Hoare triple {16470#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,632 INFO L273 TraceCheckUtils]: 243: Hoare triple {16470#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {16470#false} is VALID [2018-11-18 23:58:54,633 INFO L273 TraceCheckUtils]: 244: Hoare triple {16470#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {16470#false} is VALID [2018-11-18 23:58:54,633 INFO L273 TraceCheckUtils]: 245: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,633 INFO L273 TraceCheckUtils]: 246: Hoare triple {16470#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,633 INFO L273 TraceCheckUtils]: 247: Hoare triple {16470#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {16470#false} is VALID [2018-11-18 23:58:54,633 INFO L273 TraceCheckUtils]: 248: Hoare triple {16470#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {16470#false} is VALID [2018-11-18 23:58:54,633 INFO L273 TraceCheckUtils]: 249: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,633 INFO L273 TraceCheckUtils]: 250: Hoare triple {16470#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,633 INFO L273 TraceCheckUtils]: 251: Hoare triple {16470#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {16470#false} is VALID [2018-11-18 23:58:54,634 INFO L273 TraceCheckUtils]: 252: Hoare triple {16470#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {16470#false} is VALID [2018-11-18 23:58:54,634 INFO L273 TraceCheckUtils]: 253: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,634 INFO L273 TraceCheckUtils]: 254: Hoare triple {16470#false} assume !(~i~0 < ~edgecount~0); {16470#false} is VALID [2018-11-18 23:58:54,634 INFO L273 TraceCheckUtils]: 255: Hoare triple {16470#false} ~i~0 := 0; {16470#false} is VALID [2018-11-18 23:58:54,634 INFO L273 TraceCheckUtils]: 256: Hoare triple {16470#false} assume true; {16470#false} is VALID [2018-11-18 23:58:54,635 INFO L273 TraceCheckUtils]: 257: Hoare triple {16470#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16470#false} is VALID [2018-11-18 23:58:54,635 INFO L256 TraceCheckUtils]: 258: Hoare triple {16470#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {16470#false} is VALID [2018-11-18 23:58:54,635 INFO L273 TraceCheckUtils]: 259: Hoare triple {16470#false} ~cond := #in~cond; {16470#false} is VALID [2018-11-18 23:58:54,635 INFO L273 TraceCheckUtils]: 260: Hoare triple {16470#false} assume 0 == ~cond; {16470#false} is VALID [2018-11-18 23:58:54,635 INFO L273 TraceCheckUtils]: 261: Hoare triple {16470#false} assume !false; {16470#false} is VALID [2018-11-18 23:58:54,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3792 backedges. 1170 proven. 128 refuted. 0 times theorem prover too weak. 2494 trivial. 0 not checked. [2018-11-18 23:58:54,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:58:54,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12] total 31 [2018-11-18 23:58:54,715 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 262 [2018-11-18 23:58:54,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:58:54,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-18 23:58:55,072 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:55,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-18 23:58:55,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-18 23:58:55,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=717, Unknown=0, NotChecked=0, Total=930 [2018-11-18 23:58:55,074 INFO L87 Difference]: Start difference. First operand 267 states and 315 transitions. Second operand 31 states. [2018-11-18 23:58:56,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:56,549 INFO L93 Difference]: Finished difference Result 499 states and 600 transitions. [2018-11-18 23:58:56,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 23:58:56,550 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 262 [2018-11-18 23:58:56,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:58:56,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 23:58:56,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 115 transitions. [2018-11-18 23:58:56,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 23:58:56,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 115 transitions. [2018-11-18 23:58:56,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 115 transitions. [2018-11-18 23:58:56,667 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:56,674 INFO L225 Difference]: With dead ends: 499 [2018-11-18 23:58:56,674 INFO L226 Difference]: Without dead ends: 297 [2018-11-18 23:58:56,675 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=811, Unknown=0, NotChecked=0, Total=1056 [2018-11-18 23:58:56,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-11-18 23:58:57,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 287. [2018-11-18 23:58:57,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:58:57,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand 287 states. [2018-11-18 23:58:57,380 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand 287 states. [2018-11-18 23:58:57,381 INFO L87 Difference]: Start difference. First operand 297 states. Second operand 287 states. [2018-11-18 23:58:57,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:57,388 INFO L93 Difference]: Finished difference Result 297 states and 355 transitions. [2018-11-18 23:58:57,388 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 355 transitions. [2018-11-18 23:58:57,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:57,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:57,389 INFO L74 IsIncluded]: Start isIncluded. First operand 287 states. Second operand 297 states. [2018-11-18 23:58:57,389 INFO L87 Difference]: Start difference. First operand 287 states. Second operand 297 states. [2018-11-18 23:58:57,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:57,396 INFO L93 Difference]: Finished difference Result 297 states and 355 transitions. [2018-11-18 23:58:57,396 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 355 transitions. [2018-11-18 23:58:57,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:57,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:57,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:58:57,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:58:57,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-11-18 23:58:57,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 340 transitions. [2018-11-18 23:58:57,404 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 340 transitions. Word has length 262 [2018-11-18 23:58:57,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:58:57,404 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 340 transitions. [2018-11-18 23:58:57,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-18 23:58:57,404 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 340 transitions. [2018-11-18 23:58:57,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-11-18 23:58:57,408 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:58:57,408 INFO L375 BasicCegarLoop]: trace histogram [50, 45, 45, 45, 10, 9, 9, 9, 6, 6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:58:57,408 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:58:57,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:58:57,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1342408995, now seen corresponding path program 9 times [2018-11-18 23:58:57,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:58:57,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:58:57,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:57,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:58:57,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:58,148 INFO L256 TraceCheckUtils]: 0: Hoare triple {18882#true} call ULTIMATE.init(); {18882#true} is VALID [2018-11-18 23:58:58,149 INFO L273 TraceCheckUtils]: 1: Hoare triple {18882#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {18882#true} is VALID [2018-11-18 23:58:58,149 INFO L273 TraceCheckUtils]: 2: Hoare triple {18882#true} assume true; {18882#true} is VALID [2018-11-18 23:58:58,149 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18882#true} {18882#true} #108#return; {18882#true} is VALID [2018-11-18 23:58:58,150 INFO L256 TraceCheckUtils]: 4: Hoare triple {18882#true} call #t~ret18 := main(); {18882#true} is VALID [2018-11-18 23:58:58,150 INFO L273 TraceCheckUtils]: 5: Hoare triple {18882#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,151 INFO L273 TraceCheckUtils]: 6: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,151 INFO L273 TraceCheckUtils]: 7: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,152 INFO L273 TraceCheckUtils]: 8: Hoare triple {18884#(= main_~edgecount~0 20)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,152 INFO L273 TraceCheckUtils]: 9: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,153 INFO L273 TraceCheckUtils]: 10: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,153 INFO L273 TraceCheckUtils]: 11: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,153 INFO L273 TraceCheckUtils]: 12: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,154 INFO L273 TraceCheckUtils]: 13: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,154 INFO L273 TraceCheckUtils]: 14: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,154 INFO L273 TraceCheckUtils]: 15: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,154 INFO L273 TraceCheckUtils]: 16: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,155 INFO L273 TraceCheckUtils]: 17: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,155 INFO L273 TraceCheckUtils]: 18: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,156 INFO L273 TraceCheckUtils]: 19: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,156 INFO L273 TraceCheckUtils]: 20: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,157 INFO L273 TraceCheckUtils]: 21: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,157 INFO L273 TraceCheckUtils]: 22: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,158 INFO L273 TraceCheckUtils]: 23: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,158 INFO L273 TraceCheckUtils]: 24: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,159 INFO L273 TraceCheckUtils]: 25: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,159 INFO L273 TraceCheckUtils]: 26: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,160 INFO L273 TraceCheckUtils]: 27: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(~i~0 < ~nodecount~0); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,160 INFO L273 TraceCheckUtils]: 28: Hoare triple {18884#(= main_~edgecount~0 20)} ~i~0 := 0; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,161 INFO L273 TraceCheckUtils]: 29: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,161 INFO L273 TraceCheckUtils]: 30: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,162 INFO L273 TraceCheckUtils]: 31: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,162 INFO L273 TraceCheckUtils]: 32: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,163 INFO L273 TraceCheckUtils]: 33: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,163 INFO L273 TraceCheckUtils]: 34: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,164 INFO L273 TraceCheckUtils]: 35: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,164 INFO L273 TraceCheckUtils]: 36: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,165 INFO L273 TraceCheckUtils]: 37: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,165 INFO L273 TraceCheckUtils]: 38: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,166 INFO L273 TraceCheckUtils]: 39: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,166 INFO L273 TraceCheckUtils]: 40: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,167 INFO L273 TraceCheckUtils]: 41: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,167 INFO L273 TraceCheckUtils]: 42: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,168 INFO L273 TraceCheckUtils]: 43: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,168 INFO L273 TraceCheckUtils]: 44: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,169 INFO L273 TraceCheckUtils]: 45: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,169 INFO L273 TraceCheckUtils]: 46: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,170 INFO L273 TraceCheckUtils]: 47: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,170 INFO L273 TraceCheckUtils]: 48: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,171 INFO L273 TraceCheckUtils]: 49: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,171 INFO L273 TraceCheckUtils]: 50: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,172 INFO L273 TraceCheckUtils]: 51: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,172 INFO L273 TraceCheckUtils]: 52: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,173 INFO L273 TraceCheckUtils]: 53: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,173 INFO L273 TraceCheckUtils]: 54: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,174 INFO L273 TraceCheckUtils]: 55: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,174 INFO L273 TraceCheckUtils]: 56: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,175 INFO L273 TraceCheckUtils]: 57: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,175 INFO L273 TraceCheckUtils]: 58: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,176 INFO L273 TraceCheckUtils]: 59: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,176 INFO L273 TraceCheckUtils]: 60: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,177 INFO L273 TraceCheckUtils]: 61: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,177 INFO L273 TraceCheckUtils]: 62: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,178 INFO L273 TraceCheckUtils]: 63: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,178 INFO L273 TraceCheckUtils]: 64: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,179 INFO L273 TraceCheckUtils]: 65: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,179 INFO L273 TraceCheckUtils]: 66: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,180 INFO L273 TraceCheckUtils]: 67: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,180 INFO L273 TraceCheckUtils]: 68: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(~j~0 < ~edgecount~0); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,181 INFO L273 TraceCheckUtils]: 69: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,181 INFO L273 TraceCheckUtils]: 70: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,182 INFO L273 TraceCheckUtils]: 71: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,182 INFO L273 TraceCheckUtils]: 72: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,183 INFO L273 TraceCheckUtils]: 73: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,183 INFO L273 TraceCheckUtils]: 74: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,184 INFO L273 TraceCheckUtils]: 75: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,184 INFO L273 TraceCheckUtils]: 76: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,185 INFO L273 TraceCheckUtils]: 77: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,185 INFO L273 TraceCheckUtils]: 78: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,186 INFO L273 TraceCheckUtils]: 79: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,186 INFO L273 TraceCheckUtils]: 80: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,187 INFO L273 TraceCheckUtils]: 81: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,187 INFO L273 TraceCheckUtils]: 82: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,188 INFO L273 TraceCheckUtils]: 83: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,188 INFO L273 TraceCheckUtils]: 84: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,189 INFO L273 TraceCheckUtils]: 85: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,189 INFO L273 TraceCheckUtils]: 86: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,190 INFO L273 TraceCheckUtils]: 87: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,190 INFO L273 TraceCheckUtils]: 88: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,191 INFO L273 TraceCheckUtils]: 89: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,191 INFO L273 TraceCheckUtils]: 90: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,192 INFO L273 TraceCheckUtils]: 91: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,192 INFO L273 TraceCheckUtils]: 92: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,193 INFO L273 TraceCheckUtils]: 93: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,193 INFO L273 TraceCheckUtils]: 94: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,194 INFO L273 TraceCheckUtils]: 95: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,194 INFO L273 TraceCheckUtils]: 96: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,195 INFO L273 TraceCheckUtils]: 97: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,195 INFO L273 TraceCheckUtils]: 98: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,196 INFO L273 TraceCheckUtils]: 99: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,196 INFO L273 TraceCheckUtils]: 100: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,197 INFO L273 TraceCheckUtils]: 101: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,197 INFO L273 TraceCheckUtils]: 102: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,198 INFO L273 TraceCheckUtils]: 103: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,198 INFO L273 TraceCheckUtils]: 104: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,199 INFO L273 TraceCheckUtils]: 105: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,199 INFO L273 TraceCheckUtils]: 106: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,200 INFO L273 TraceCheckUtils]: 107: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,200 INFO L273 TraceCheckUtils]: 108: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,201 INFO L273 TraceCheckUtils]: 109: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(~j~0 < ~edgecount~0); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,201 INFO L273 TraceCheckUtils]: 110: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,202 INFO L273 TraceCheckUtils]: 111: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,202 INFO L273 TraceCheckUtils]: 112: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,203 INFO L273 TraceCheckUtils]: 113: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,203 INFO L273 TraceCheckUtils]: 114: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,204 INFO L273 TraceCheckUtils]: 115: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,204 INFO L273 TraceCheckUtils]: 116: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,205 INFO L273 TraceCheckUtils]: 117: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,205 INFO L273 TraceCheckUtils]: 118: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,206 INFO L273 TraceCheckUtils]: 119: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,206 INFO L273 TraceCheckUtils]: 120: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,207 INFO L273 TraceCheckUtils]: 121: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,207 INFO L273 TraceCheckUtils]: 122: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,208 INFO L273 TraceCheckUtils]: 123: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,208 INFO L273 TraceCheckUtils]: 124: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,209 INFO L273 TraceCheckUtils]: 125: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,210 INFO L273 TraceCheckUtils]: 126: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,210 INFO L273 TraceCheckUtils]: 127: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,211 INFO L273 TraceCheckUtils]: 128: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,211 INFO L273 TraceCheckUtils]: 129: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,212 INFO L273 TraceCheckUtils]: 130: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,212 INFO L273 TraceCheckUtils]: 131: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,213 INFO L273 TraceCheckUtils]: 132: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,213 INFO L273 TraceCheckUtils]: 133: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,214 INFO L273 TraceCheckUtils]: 134: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,214 INFO L273 TraceCheckUtils]: 135: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,215 INFO L273 TraceCheckUtils]: 136: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,215 INFO L273 TraceCheckUtils]: 137: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,216 INFO L273 TraceCheckUtils]: 138: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,216 INFO L273 TraceCheckUtils]: 139: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,217 INFO L273 TraceCheckUtils]: 140: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,217 INFO L273 TraceCheckUtils]: 141: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,218 INFO L273 TraceCheckUtils]: 142: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,218 INFO L273 TraceCheckUtils]: 143: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,219 INFO L273 TraceCheckUtils]: 144: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,219 INFO L273 TraceCheckUtils]: 145: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,220 INFO L273 TraceCheckUtils]: 146: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,220 INFO L273 TraceCheckUtils]: 147: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,221 INFO L273 TraceCheckUtils]: 148: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,221 INFO L273 TraceCheckUtils]: 149: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,222 INFO L273 TraceCheckUtils]: 150: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(~j~0 < ~edgecount~0); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,222 INFO L273 TraceCheckUtils]: 151: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,223 INFO L273 TraceCheckUtils]: 152: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,223 INFO L273 TraceCheckUtils]: 153: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,224 INFO L273 TraceCheckUtils]: 154: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,224 INFO L273 TraceCheckUtils]: 155: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,225 INFO L273 TraceCheckUtils]: 156: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,225 INFO L273 TraceCheckUtils]: 157: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,226 INFO L273 TraceCheckUtils]: 158: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,226 INFO L273 TraceCheckUtils]: 159: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,227 INFO L273 TraceCheckUtils]: 160: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,227 INFO L273 TraceCheckUtils]: 161: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,228 INFO L273 TraceCheckUtils]: 162: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,228 INFO L273 TraceCheckUtils]: 163: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,229 INFO L273 TraceCheckUtils]: 164: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,229 INFO L273 TraceCheckUtils]: 165: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,230 INFO L273 TraceCheckUtils]: 166: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,230 INFO L273 TraceCheckUtils]: 167: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,231 INFO L273 TraceCheckUtils]: 168: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,231 INFO L273 TraceCheckUtils]: 169: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,232 INFO L273 TraceCheckUtils]: 170: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,232 INFO L273 TraceCheckUtils]: 171: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,233 INFO L273 TraceCheckUtils]: 172: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,233 INFO L273 TraceCheckUtils]: 173: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,234 INFO L273 TraceCheckUtils]: 174: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,234 INFO L273 TraceCheckUtils]: 175: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,235 INFO L273 TraceCheckUtils]: 176: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,235 INFO L273 TraceCheckUtils]: 177: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,236 INFO L273 TraceCheckUtils]: 178: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,236 INFO L273 TraceCheckUtils]: 179: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,237 INFO L273 TraceCheckUtils]: 180: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,237 INFO L273 TraceCheckUtils]: 181: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,238 INFO L273 TraceCheckUtils]: 182: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,238 INFO L273 TraceCheckUtils]: 183: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,239 INFO L273 TraceCheckUtils]: 184: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,239 INFO L273 TraceCheckUtils]: 185: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,240 INFO L273 TraceCheckUtils]: 186: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,240 INFO L273 TraceCheckUtils]: 187: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,241 INFO L273 TraceCheckUtils]: 188: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,241 INFO L273 TraceCheckUtils]: 189: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,242 INFO L273 TraceCheckUtils]: 190: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,242 INFO L273 TraceCheckUtils]: 191: Hoare triple {18884#(= main_~edgecount~0 20)} assume !(~j~0 < ~edgecount~0); {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,243 INFO L273 TraceCheckUtils]: 192: Hoare triple {18884#(= main_~edgecount~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,243 INFO L273 TraceCheckUtils]: 193: Hoare triple {18884#(= main_~edgecount~0 20)} assume true; {18884#(= main_~edgecount~0 20)} is VALID [2018-11-18 23:58:58,244 INFO L273 TraceCheckUtils]: 194: Hoare triple {18884#(= main_~edgecount~0 20)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {18885#(and (= main_~j~0 0) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,245 INFO L273 TraceCheckUtils]: 195: Hoare triple {18885#(and (= main_~j~0 0) (= main_~edgecount~0 20))} assume true; {18885#(and (= main_~j~0 0) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,246 INFO L273 TraceCheckUtils]: 196: Hoare triple {18885#(and (= main_~j~0 0) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18885#(and (= main_~j~0 0) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,246 INFO L273 TraceCheckUtils]: 197: Hoare triple {18885#(and (= main_~j~0 0) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18885#(and (= main_~j~0 0) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,247 INFO L273 TraceCheckUtils]: 198: Hoare triple {18885#(and (= main_~j~0 0) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18886#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,248 INFO L273 TraceCheckUtils]: 199: Hoare triple {18886#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} assume true; {18886#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,249 INFO L273 TraceCheckUtils]: 200: Hoare triple {18886#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18886#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,250 INFO L273 TraceCheckUtils]: 201: Hoare triple {18886#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18886#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,250 INFO L273 TraceCheckUtils]: 202: Hoare triple {18886#(and (<= main_~j~0 1) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18887#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,251 INFO L273 TraceCheckUtils]: 203: Hoare triple {18887#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} assume true; {18887#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,252 INFO L273 TraceCheckUtils]: 204: Hoare triple {18887#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18887#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,253 INFO L273 TraceCheckUtils]: 205: Hoare triple {18887#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18887#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,254 INFO L273 TraceCheckUtils]: 206: Hoare triple {18887#(and (<= main_~j~0 2) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18888#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,254 INFO L273 TraceCheckUtils]: 207: Hoare triple {18888#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} assume true; {18888#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,255 INFO L273 TraceCheckUtils]: 208: Hoare triple {18888#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18888#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,256 INFO L273 TraceCheckUtils]: 209: Hoare triple {18888#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18888#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,257 INFO L273 TraceCheckUtils]: 210: Hoare triple {18888#(and (<= main_~j~0 3) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18889#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,258 INFO L273 TraceCheckUtils]: 211: Hoare triple {18889#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} assume true; {18889#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,259 INFO L273 TraceCheckUtils]: 212: Hoare triple {18889#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18889#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,259 INFO L273 TraceCheckUtils]: 213: Hoare triple {18889#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18889#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,260 INFO L273 TraceCheckUtils]: 214: Hoare triple {18889#(and (<= main_~j~0 4) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18890#(and (<= main_~j~0 5) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,261 INFO L273 TraceCheckUtils]: 215: Hoare triple {18890#(and (<= main_~j~0 5) (= main_~edgecount~0 20))} assume true; {18890#(and (<= main_~j~0 5) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,262 INFO L273 TraceCheckUtils]: 216: Hoare triple {18890#(and (<= main_~j~0 5) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18890#(and (<= main_~j~0 5) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,262 INFO L273 TraceCheckUtils]: 217: Hoare triple {18890#(and (<= main_~j~0 5) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18890#(and (<= main_~j~0 5) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,263 INFO L273 TraceCheckUtils]: 218: Hoare triple {18890#(and (<= main_~j~0 5) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18891#(and (= main_~edgecount~0 20) (<= main_~j~0 6))} is VALID [2018-11-18 23:58:58,264 INFO L273 TraceCheckUtils]: 219: Hoare triple {18891#(and (= main_~edgecount~0 20) (<= main_~j~0 6))} assume true; {18891#(and (= main_~edgecount~0 20) (<= main_~j~0 6))} is VALID [2018-11-18 23:58:58,265 INFO L273 TraceCheckUtils]: 220: Hoare triple {18891#(and (= main_~edgecount~0 20) (<= main_~j~0 6))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18891#(and (= main_~edgecount~0 20) (<= main_~j~0 6))} is VALID [2018-11-18 23:58:58,266 INFO L273 TraceCheckUtils]: 221: Hoare triple {18891#(and (= main_~edgecount~0 20) (<= main_~j~0 6))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18891#(and (= main_~edgecount~0 20) (<= main_~j~0 6))} is VALID [2018-11-18 23:58:58,266 INFO L273 TraceCheckUtils]: 222: Hoare triple {18891#(and (= main_~edgecount~0 20) (<= main_~j~0 6))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18892#(and (<= main_~j~0 7) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,267 INFO L273 TraceCheckUtils]: 223: Hoare triple {18892#(and (<= main_~j~0 7) (= main_~edgecount~0 20))} assume true; {18892#(and (<= main_~j~0 7) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,268 INFO L273 TraceCheckUtils]: 224: Hoare triple {18892#(and (<= main_~j~0 7) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18892#(and (<= main_~j~0 7) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,269 INFO L273 TraceCheckUtils]: 225: Hoare triple {18892#(and (<= main_~j~0 7) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18892#(and (<= main_~j~0 7) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,269 INFO L273 TraceCheckUtils]: 226: Hoare triple {18892#(and (<= main_~j~0 7) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18893#(and (<= main_~j~0 8) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,270 INFO L273 TraceCheckUtils]: 227: Hoare triple {18893#(and (<= main_~j~0 8) (= main_~edgecount~0 20))} assume true; {18893#(and (<= main_~j~0 8) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,271 INFO L273 TraceCheckUtils]: 228: Hoare triple {18893#(and (<= main_~j~0 8) (= main_~edgecount~0 20))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18893#(and (<= main_~j~0 8) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,272 INFO L273 TraceCheckUtils]: 229: Hoare triple {18893#(and (<= main_~j~0 8) (= main_~edgecount~0 20))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18893#(and (<= main_~j~0 8) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,273 INFO L273 TraceCheckUtils]: 230: Hoare triple {18893#(and (<= main_~j~0 8) (= main_~edgecount~0 20))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18894#(and (<= main_~j~0 9) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,273 INFO L273 TraceCheckUtils]: 231: Hoare triple {18894#(and (<= main_~j~0 9) (= main_~edgecount~0 20))} assume true; {18894#(and (<= main_~j~0 9) (= main_~edgecount~0 20))} is VALID [2018-11-18 23:58:58,274 INFO L273 TraceCheckUtils]: 232: Hoare triple {18894#(and (<= main_~j~0 9) (= main_~edgecount~0 20))} assume !(~j~0 < ~edgecount~0); {18883#false} is VALID [2018-11-18 23:58:58,274 INFO L273 TraceCheckUtils]: 233: Hoare triple {18883#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18883#false} is VALID [2018-11-18 23:58:58,275 INFO L273 TraceCheckUtils]: 234: Hoare triple {18883#false} assume true; {18883#false} is VALID [2018-11-18 23:58:58,275 INFO L273 TraceCheckUtils]: 235: Hoare triple {18883#false} assume !(~i~0 < ~nodecount~0); {18883#false} is VALID [2018-11-18 23:58:58,275 INFO L273 TraceCheckUtils]: 236: Hoare triple {18883#false} ~i~0 := 0; {18883#false} is VALID [2018-11-18 23:58:58,275 INFO L273 TraceCheckUtils]: 237: Hoare triple {18883#false} assume true; {18883#false} is VALID [2018-11-18 23:58:58,275 INFO L273 TraceCheckUtils]: 238: Hoare triple {18883#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {18883#false} is VALID [2018-11-18 23:58:58,275 INFO L273 TraceCheckUtils]: 239: Hoare triple {18883#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {18883#false} is VALID [2018-11-18 23:58:58,276 INFO L273 TraceCheckUtils]: 240: Hoare triple {18883#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18883#false} is VALID [2018-11-18 23:58:58,276 INFO L273 TraceCheckUtils]: 241: Hoare triple {18883#false} assume true; {18883#false} is VALID [2018-11-18 23:58:58,276 INFO L273 TraceCheckUtils]: 242: Hoare triple {18883#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {18883#false} is VALID [2018-11-18 23:58:58,276 INFO L273 TraceCheckUtils]: 243: Hoare triple {18883#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {18883#false} is VALID [2018-11-18 23:58:58,276 INFO L273 TraceCheckUtils]: 244: Hoare triple {18883#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18883#false} is VALID [2018-11-18 23:58:58,277 INFO L273 TraceCheckUtils]: 245: Hoare triple {18883#false} assume true; {18883#false} is VALID [2018-11-18 23:58:58,277 INFO L273 TraceCheckUtils]: 246: Hoare triple {18883#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {18883#false} is VALID [2018-11-18 23:58:58,277 INFO L273 TraceCheckUtils]: 247: Hoare triple {18883#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {18883#false} is VALID [2018-11-18 23:58:58,277 INFO L273 TraceCheckUtils]: 248: Hoare triple {18883#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18883#false} is VALID [2018-11-18 23:58:58,277 INFO L273 TraceCheckUtils]: 249: Hoare triple {18883#false} assume true; {18883#false} is VALID [2018-11-18 23:58:58,277 INFO L273 TraceCheckUtils]: 250: Hoare triple {18883#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {18883#false} is VALID [2018-11-18 23:58:58,277 INFO L273 TraceCheckUtils]: 251: Hoare triple {18883#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {18883#false} is VALID [2018-11-18 23:58:58,277 INFO L273 TraceCheckUtils]: 252: Hoare triple {18883#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18883#false} is VALID [2018-11-18 23:58:58,278 INFO L273 TraceCheckUtils]: 253: Hoare triple {18883#false} assume true; {18883#false} is VALID [2018-11-18 23:58:58,278 INFO L273 TraceCheckUtils]: 254: Hoare triple {18883#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {18883#false} is VALID [2018-11-18 23:58:58,278 INFO L273 TraceCheckUtils]: 255: Hoare triple {18883#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {18883#false} is VALID [2018-11-18 23:58:58,278 INFO L273 TraceCheckUtils]: 256: Hoare triple {18883#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18883#false} is VALID [2018-11-18 23:58:58,278 INFO L273 TraceCheckUtils]: 257: Hoare triple {18883#false} assume true; {18883#false} is VALID [2018-11-18 23:58:58,278 INFO L273 TraceCheckUtils]: 258: Hoare triple {18883#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {18883#false} is VALID [2018-11-18 23:58:58,278 INFO L273 TraceCheckUtils]: 259: Hoare triple {18883#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {18883#false} is VALID [2018-11-18 23:58:58,278 INFO L273 TraceCheckUtils]: 260: Hoare triple {18883#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18883#false} is VALID [2018-11-18 23:58:58,278 INFO L273 TraceCheckUtils]: 261: Hoare triple {18883#false} assume true; {18883#false} is VALID [2018-11-18 23:58:58,279 INFO L273 TraceCheckUtils]: 262: Hoare triple {18883#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {18883#false} is VALID [2018-11-18 23:58:58,279 INFO L273 TraceCheckUtils]: 263: Hoare triple {18883#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {18883#false} is VALID [2018-11-18 23:58:58,279 INFO L273 TraceCheckUtils]: 264: Hoare triple {18883#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18883#false} is VALID [2018-11-18 23:58:58,279 INFO L273 TraceCheckUtils]: 265: Hoare triple {18883#false} assume true; {18883#false} is VALID [2018-11-18 23:58:58,279 INFO L273 TraceCheckUtils]: 266: Hoare triple {18883#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {18883#false} is VALID [2018-11-18 23:58:58,279 INFO L273 TraceCheckUtils]: 267: Hoare triple {18883#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {18883#false} is VALID [2018-11-18 23:58:58,279 INFO L273 TraceCheckUtils]: 268: Hoare triple {18883#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18883#false} is VALID [2018-11-18 23:58:58,279 INFO L273 TraceCheckUtils]: 269: Hoare triple {18883#false} assume true; {18883#false} is VALID [2018-11-18 23:58:58,279 INFO L273 TraceCheckUtils]: 270: Hoare triple {18883#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {18883#false} is VALID [2018-11-18 23:58:58,280 INFO L273 TraceCheckUtils]: 271: Hoare triple {18883#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {18883#false} is VALID [2018-11-18 23:58:58,280 INFO L273 TraceCheckUtils]: 272: Hoare triple {18883#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18883#false} is VALID [2018-11-18 23:58:58,280 INFO L273 TraceCheckUtils]: 273: Hoare triple {18883#false} assume true; {18883#false} is VALID [2018-11-18 23:58:58,280 INFO L273 TraceCheckUtils]: 274: Hoare triple {18883#false} assume !(~i~0 < ~edgecount~0); {18883#false} is VALID [2018-11-18 23:58:58,280 INFO L273 TraceCheckUtils]: 275: Hoare triple {18883#false} ~i~0 := 0; {18883#false} is VALID [2018-11-18 23:58:58,280 INFO L273 TraceCheckUtils]: 276: Hoare triple {18883#false} assume true; {18883#false} is VALID [2018-11-18 23:58:58,280 INFO L273 TraceCheckUtils]: 277: Hoare triple {18883#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18883#false} is VALID [2018-11-18 23:58:58,280 INFO L256 TraceCheckUtils]: 278: Hoare triple {18883#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {18883#false} is VALID [2018-11-18 23:58:58,280 INFO L273 TraceCheckUtils]: 279: Hoare triple {18883#false} ~cond := #in~cond; {18883#false} is VALID [2018-11-18 23:58:58,281 INFO L273 TraceCheckUtils]: 280: Hoare triple {18883#false} assume 0 == ~cond; {18883#false} is VALID [2018-11-18 23:58:58,281 INFO L273 TraceCheckUtils]: 281: Hoare triple {18883#false} assume !false; {18883#false} is VALID [2018-11-18 23:58:58,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4682 backedges. 1462 proven. 162 refuted. 0 times theorem prover too weak. 3058 trivial. 0 not checked. [2018-11-18 23:58:58,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:58:58,329 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:58:58,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 23:58:58,996 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-18 23:58:58,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:58:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:59,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:58:59,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 14 treesize of output 17 [2018-11-18 23:58:59,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 19 [2018-11-18 23:58:59,760 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-18 23:58:59,856 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:58:59,905 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:58:59,930 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:58:59,930 INFO L303 Elim1Store]: Index analysis took 112 ms [2018-11-18 23:58:59,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-18 23:58:59,957 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 23:59:00,071 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:59:00,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:59:00,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:59:00,200 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:27, output treesize:13 [2018-11-18 23:59:00,203 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:59:00,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 15 treesize of output 12 [2018-11-18 23:59:00,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 23:59:00,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:59:00,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:59:00,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:59:00,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-18 23:59:00,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 21 treesize of output 16 [2018-11-18 23:59:00,483 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:59:00,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 23:59:00,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:59:00,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:59:00,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:59:00,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:26 [2018-11-18 23:59:00,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 32 treesize of output 25 [2018-11-18 23:59:00,701 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:59:00,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 45 [2018-11-18 23:59:00,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 23:59:00,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 23:59:00,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 23:59:00,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:75 [2018-11-18 23:59:00,832 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:59:01,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 57 treesize of output 48 [2018-11-18 23:59:01,302 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:59:01,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 65 [2018-11-18 23:59:01,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-11-18 23:59:01,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 23:59:01,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 44 treesize of output 37 [2018-11-18 23:59:01,489 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:59:01,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 34 [2018-11-18 23:59:01,495 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 23:59:01,509 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:59:01,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 23:59:01,562 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:102, output treesize:94 [2018-11-18 23:59:02,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 64 treesize of output 53 [2018-11-18 23:59:02,234 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:59:02,236 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:59:02,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 56 [2018-11-18 23:59:02,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:59:02,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:59:02,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 74 treesize of output 61 [2018-11-18 23:59:02,348 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:59:02,350 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:59:02,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 56 [2018-11-18 23:59:02,376 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 23:59:02,399 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:59:02,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 23:59:02,451 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:131 [2018-11-18 23:59:19,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 22 [2018-11-18 23:59:19,954 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:59:19,955 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:59:19,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-11-18 23:59:19,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:59:19,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:59:19,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:59:19,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:3 [2018-11-18 23:59:19,984 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:59:20,045 INFO L256 TraceCheckUtils]: 0: Hoare triple {18882#true} call ULTIMATE.init(); {18882#true} is VALID [2018-11-18 23:59:20,045 INFO L273 TraceCheckUtils]: 1: Hoare triple {18882#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {18882#true} is VALID [2018-11-18 23:59:20,045 INFO L273 TraceCheckUtils]: 2: Hoare triple {18882#true} assume true; {18882#true} is VALID [2018-11-18 23:59:20,046 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18882#true} {18882#true} #108#return; {18882#true} is VALID [2018-11-18 23:59:20,046 INFO L256 TraceCheckUtils]: 4: Hoare triple {18882#true} call #t~ret18 := main(); {18882#true} is VALID [2018-11-18 23:59:20,048 INFO L273 TraceCheckUtils]: 5: Hoare triple {18882#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {18913#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= main_~i~0 0) (= 5 main_~nodecount~0))} is VALID [2018-11-18 23:59:20,049 INFO L273 TraceCheckUtils]: 6: Hoare triple {18913#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= main_~i~0 0) (= 5 main_~nodecount~0))} assume true; {18913#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= main_~i~0 0) (= 5 main_~nodecount~0))} is VALID [2018-11-18 23:59:20,050 INFO L273 TraceCheckUtils]: 7: Hoare triple {18913#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= main_~i~0 0) (= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0); {18913#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= main_~i~0 0) (= 5 main_~nodecount~0))} is VALID [2018-11-18 23:59:20,051 INFO L273 TraceCheckUtils]: 8: Hoare triple {18913#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= 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); {18923#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|))) (= main_~i~0 0) (= 5 main_~nodecount~0))} is VALID [2018-11-18 23:59:20,052 INFO L273 TraceCheckUtils]: 9: Hoare triple {18923#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|))) (= main_~i~0 0) (= 5 main_~nodecount~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18927#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0) (= 5 main_~nodecount~0))} is VALID [2018-11-18 23:59:20,053 INFO L273 TraceCheckUtils]: 10: Hoare triple {18927#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0) (= 5 main_~nodecount~0))} assume true; {18927#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0) (= 5 main_~nodecount~0))} is VALID [2018-11-18 23:59:20,054 INFO L273 TraceCheckUtils]: 11: Hoare triple {18927#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0) (= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0); {18927#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0) (= 5 main_~nodecount~0))} is VALID [2018-11-18 23:59:20,055 INFO L273 TraceCheckUtils]: 12: Hoare triple {18927#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= main_~i~0 1) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0) (= 5 main_~nodecount~0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18937#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0) (= 5 main_~nodecount~0))} is VALID [2018-11-18 23:59:20,056 INFO L273 TraceCheckUtils]: 13: Hoare triple {18937#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0) (= 5 main_~nodecount~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18937#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0) (= 5 main_~nodecount~0))} is VALID [2018-11-18 23:59:20,057 INFO L273 TraceCheckUtils]: 14: Hoare triple {18937#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0) (= 5 main_~nodecount~0))} assume true; {18937#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0) (= 5 main_~nodecount~0))} is VALID [2018-11-18 23:59:20,058 INFO L273 TraceCheckUtils]: 15: Hoare triple {18937#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0) (= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0); {18937#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0) (= 5 main_~nodecount~0))} is VALID [2018-11-18 23:59:20,060 INFO L273 TraceCheckUtils]: 16: Hoare triple {18937#(and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0) (= 5 main_~nodecount~0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18950#(or (and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|)) ~INFINITY~0) (= 5 main_~nodecount~0)) (and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= (* 4 main_~i~0) 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|)) ~INFINITY~0) (= 5 main_~nodecount~0)))} is VALID [2018-11-18 23:59:20,061 INFO L273 TraceCheckUtils]: 17: Hoare triple {18950#(or (and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|)) ~INFINITY~0) (= 5 main_~nodecount~0)) (and (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= (* 4 main_~i~0) 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|)) ~INFINITY~0) (= 5 main_~nodecount~0)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18954#(or (and (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) ~INFINITY~0) (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (<= main_~i~0 1) (= 5 main_~nodecount~0)) (and (= 0 |main_~#distance~0.offset|) (exists ((v_main_~i~0_41 Int)) (and (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_41))) ~INFINITY~0) (<= main_~i~0 (+ v_main_~i~0_41 1)))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= 5 main_~nodecount~0)))} is VALID [2018-11-18 23:59:20,062 INFO L273 TraceCheckUtils]: 18: Hoare triple {18954#(or (and (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) ~INFINITY~0) (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (<= main_~i~0 1) (= 5 main_~nodecount~0)) (and (= 0 |main_~#distance~0.offset|) (exists ((v_main_~i~0_41 Int)) (and (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_41))) ~INFINITY~0) (<= main_~i~0 (+ v_main_~i~0_41 1)))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= 5 main_~nodecount~0)))} assume true; {18954#(or (and (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) ~INFINITY~0) (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (<= main_~i~0 1) (= 5 main_~nodecount~0)) (and (= 0 |main_~#distance~0.offset|) (exists ((v_main_~i~0_41 Int)) (and (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_41))) ~INFINITY~0) (<= main_~i~0 (+ v_main_~i~0_41 1)))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= 5 main_~nodecount~0)))} is VALID [2018-11-18 23:59:20,063 INFO L273 TraceCheckUtils]: 19: Hoare triple {18954#(or (and (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) ~INFINITY~0) (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (<= main_~i~0 1) (= 5 main_~nodecount~0)) (and (= 0 |main_~#distance~0.offset|) (exists ((v_main_~i~0_41 Int)) (and (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_41))) ~INFINITY~0) (<= main_~i~0 (+ v_main_~i~0_41 1)))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= 5 main_~nodecount~0)))} assume !!(~i~0 < ~nodecount~0); {18954#(or (and (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) ~INFINITY~0) (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (<= main_~i~0 1) (= 5 main_~nodecount~0)) (and (= 0 |main_~#distance~0.offset|) (exists ((v_main_~i~0_41 Int)) (and (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_41))) ~INFINITY~0) (<= main_~i~0 (+ v_main_~i~0_41 1)))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= 5 main_~nodecount~0)))} is VALID [2018-11-18 23:59:20,065 INFO L273 TraceCheckUtils]: 20: Hoare triple {18954#(or (and (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) ~INFINITY~0) (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (<= main_~i~0 1) (= 5 main_~nodecount~0)) (and (= 0 |main_~#distance~0.offset|) (exists ((v_main_~i~0_41 Int)) (and (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_41))) ~INFINITY~0) (<= main_~i~0 (+ v_main_~i~0_41 1)))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= 5 main_~nodecount~0)))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18964#(or (and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|)) ~INFINITY~0) (= 5 main_~nodecount~0)) (and (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) ~INFINITY~0) (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|)) ~INFINITY~0) (= 5 main_~nodecount~0)))} is VALID [2018-11-18 23:59:20,067 INFO L273 TraceCheckUtils]: 21: Hoare triple {18964#(or (and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|)) ~INFINITY~0) (= 5 main_~nodecount~0)) (and (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) ~INFINITY~0) (= 0 |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|)) ~INFINITY~0) (= 5 main_~nodecount~0)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18968#(or (and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (exists ((v_prenex_2 Int)) (and (<= main_~i~0 (+ v_prenex_2 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_prenex_2))) ~INFINITY~0))) (= 5 main_~nodecount~0)) (and (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) ~INFINITY~0) (= 0 |main_~#distance~0.offset|) (exists ((v_main_~i~0_42 Int)) (and (<= v_main_~i~0_42 1) (<= main_~i~0 (+ v_main_~i~0_42 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_42))) ~INFINITY~0))) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= 5 main_~nodecount~0)))} is VALID [2018-11-18 23:59:20,068 INFO L273 TraceCheckUtils]: 22: Hoare triple {18968#(or (and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (exists ((v_prenex_2 Int)) (and (<= main_~i~0 (+ v_prenex_2 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_prenex_2))) ~INFINITY~0))) (= 5 main_~nodecount~0)) (and (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) ~INFINITY~0) (= 0 |main_~#distance~0.offset|) (exists ((v_main_~i~0_42 Int)) (and (<= v_main_~i~0_42 1) (<= main_~i~0 (+ v_main_~i~0_42 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_42))) ~INFINITY~0))) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= 5 main_~nodecount~0)))} assume true; {18968#(or (and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (exists ((v_prenex_2 Int)) (and (<= main_~i~0 (+ v_prenex_2 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_prenex_2))) ~INFINITY~0))) (= 5 main_~nodecount~0)) (and (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) ~INFINITY~0) (= 0 |main_~#distance~0.offset|) (exists ((v_main_~i~0_42 Int)) (and (<= v_main_~i~0_42 1) (<= main_~i~0 (+ v_main_~i~0_42 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_42))) ~INFINITY~0))) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= 5 main_~nodecount~0)))} is VALID [2018-11-18 23:59:20,074 INFO L273 TraceCheckUtils]: 23: Hoare triple {18968#(or (and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (exists ((v_prenex_2 Int)) (and (<= main_~i~0 (+ v_prenex_2 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_prenex_2))) ~INFINITY~0))) (= 5 main_~nodecount~0)) (and (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) ~INFINITY~0) (= 0 |main_~#distance~0.offset|) (exists ((v_main_~i~0_42 Int)) (and (<= v_main_~i~0_42 1) (<= main_~i~0 (+ v_main_~i~0_42 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_42))) ~INFINITY~0))) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= 5 main_~nodecount~0)))} assume !!(~i~0 < ~nodecount~0); {18975#(or (and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (< main_~i~0 main_~nodecount~0) (exists ((v_prenex_2 Int)) (and (<= main_~i~0 (+ v_prenex_2 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_prenex_2))) ~INFINITY~0))) (= 5 main_~nodecount~0)) (and (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) ~INFINITY~0) (= 0 |main_~#distance~0.offset|) (exists ((v_main_~i~0_42 Int)) (and (<= v_main_~i~0_42 1) (<= main_~i~0 (+ v_main_~i~0_42 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_42))) ~INFINITY~0))) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= 5 main_~nodecount~0)))} is VALID [2018-11-18 23:59:20,076 INFO L273 TraceCheckUtils]: 24: Hoare triple {18975#(or (and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (< main_~i~0 main_~nodecount~0) (exists ((v_prenex_2 Int)) (and (<= main_~i~0 (+ v_prenex_2 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_prenex_2))) ~INFINITY~0))) (= 5 main_~nodecount~0)) (and (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) ~INFINITY~0) (= 0 |main_~#distance~0.offset|) (exists ((v_main_~i~0_42 Int)) (and (<= v_main_~i~0_42 1) (<= main_~i~0 (+ v_main_~i~0_42 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_42))) ~INFINITY~0))) (= main_~source~0 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) ~INFINITY~0) (= 5 main_~nodecount~0)))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18979#(or (and (= 0 |main_~#distance~0.offset|) (not (= (* 4 main_~i~0) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (exists ((v_main_~i~0_42 Int)) (and (<= v_main_~i~0_42 1) (<= main_~i~0 (+ v_main_~i~0_42 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_42)))))) (= 5 main_~nodecount~0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|)))) (and (= 0 |main_~#distance~0.offset|) (not (= (* 4 main_~i~0) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (< main_~i~0 main_~nodecount~0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|))) (= 5 main_~nodecount~0)))} is VALID [2018-11-18 23:59:20,079 INFO L273 TraceCheckUtils]: 25: Hoare triple {18979#(or (and (= 0 |main_~#distance~0.offset|) (not (= (* 4 main_~i~0) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (exists ((v_main_~i~0_42 Int)) (and (<= v_main_~i~0_42 1) (<= main_~i~0 (+ v_main_~i~0_42 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_42)))))) (= 5 main_~nodecount~0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|)))) (and (= 0 |main_~#distance~0.offset|) (not (= (* 4 main_~i~0) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (< main_~i~0 main_~nodecount~0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset|))) (= 5 main_~nodecount~0)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18983#(or (and (= 0 |main_~#distance~0.offset|) (< main_~i~0 (+ main_~nodecount~0 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (not (= 4 (* 4 main_~i~0))) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (= 5 main_~nodecount~0)) (and (= 0 |main_~#distance~0.offset|) (exists ((v_main_~i~0_42 Int)) (and (<= v_main_~i~0_42 1) (<= main_~i~0 (+ v_main_~i~0_42 2)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_42)))))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset| (- 4)))) (not (= 4 (* 4 main_~i~0))) (= 5 main_~nodecount~0)))} is VALID [2018-11-18 23:59:20,080 INFO L273 TraceCheckUtils]: 26: Hoare triple {18983#(or (and (= 0 |main_~#distance~0.offset|) (< main_~i~0 (+ main_~nodecount~0 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (not (= 4 (* 4 main_~i~0))) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (= 5 main_~nodecount~0)) (and (= 0 |main_~#distance~0.offset|) (exists ((v_main_~i~0_42 Int)) (and (<= v_main_~i~0_42 1) (<= main_~i~0 (+ v_main_~i~0_42 2)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_42)))))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset| (- 4)))) (not (= 4 (* 4 main_~i~0))) (= 5 main_~nodecount~0)))} assume true; {18983#(or (and (= 0 |main_~#distance~0.offset|) (< main_~i~0 (+ main_~nodecount~0 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (not (= 4 (* 4 main_~i~0))) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (= 5 main_~nodecount~0)) (and (= 0 |main_~#distance~0.offset|) (exists ((v_main_~i~0_42 Int)) (and (<= v_main_~i~0_42 1) (<= main_~i~0 (+ v_main_~i~0_42 2)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_42)))))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset| (- 4)))) (not (= 4 (* 4 main_~i~0))) (= 5 main_~nodecount~0)))} is VALID [2018-11-18 23:59:20,082 INFO L273 TraceCheckUtils]: 27: Hoare triple {18983#(or (and (= 0 |main_~#distance~0.offset|) (< main_~i~0 (+ main_~nodecount~0 1)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (not (= 4 (* 4 main_~i~0))) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (= 5 main_~nodecount~0)) (and (= 0 |main_~#distance~0.offset|) (exists ((v_main_~i~0_42 Int)) (and (<= v_main_~i~0_42 1) (<= main_~i~0 (+ v_main_~i~0_42 2)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_42)))))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 main_~i~0) |main_~#distance~0.offset| (- 4)))) (not (= 4 (* 4 main_~i~0))) (= 5 main_~nodecount~0)))} assume !(~i~0 < ~nodecount~0); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,083 INFO L273 TraceCheckUtils]: 28: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} ~i~0 := 0; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,084 INFO L273 TraceCheckUtils]: 29: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,085 INFO L273 TraceCheckUtils]: 30: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,086 INFO L273 TraceCheckUtils]: 31: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,087 INFO L273 TraceCheckUtils]: 32: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,088 INFO L273 TraceCheckUtils]: 33: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,089 INFO L273 TraceCheckUtils]: 34: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,090 INFO L273 TraceCheckUtils]: 35: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,091 INFO L273 TraceCheckUtils]: 36: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,092 INFO L273 TraceCheckUtils]: 37: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,093 INFO L273 TraceCheckUtils]: 38: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,094 INFO L273 TraceCheckUtils]: 39: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,095 INFO L273 TraceCheckUtils]: 40: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,096 INFO L273 TraceCheckUtils]: 41: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,097 INFO L273 TraceCheckUtils]: 42: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,098 INFO L273 TraceCheckUtils]: 43: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,099 INFO L273 TraceCheckUtils]: 44: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,100 INFO L273 TraceCheckUtils]: 45: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,101 INFO L273 TraceCheckUtils]: 46: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,102 INFO L273 TraceCheckUtils]: 47: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,103 INFO L273 TraceCheckUtils]: 48: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,104 INFO L273 TraceCheckUtils]: 49: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,105 INFO L273 TraceCheckUtils]: 50: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,106 INFO L273 TraceCheckUtils]: 51: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,109 INFO L273 TraceCheckUtils]: 52: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,110 INFO L273 TraceCheckUtils]: 53: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,111 INFO L273 TraceCheckUtils]: 54: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,111 INFO L273 TraceCheckUtils]: 55: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,112 INFO L273 TraceCheckUtils]: 56: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,113 INFO L273 TraceCheckUtils]: 57: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,114 INFO L273 TraceCheckUtils]: 58: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,115 INFO L273 TraceCheckUtils]: 59: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,116 INFO L273 TraceCheckUtils]: 60: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,117 INFO L273 TraceCheckUtils]: 61: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,118 INFO L273 TraceCheckUtils]: 62: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,118 INFO L273 TraceCheckUtils]: 63: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,120 INFO L273 TraceCheckUtils]: 64: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,121 INFO L273 TraceCheckUtils]: 65: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,122 INFO L273 TraceCheckUtils]: 66: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,122 INFO L273 TraceCheckUtils]: 67: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,123 INFO L273 TraceCheckUtils]: 68: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(~j~0 < ~edgecount~0); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,124 INFO L273 TraceCheckUtils]: 69: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,125 INFO L273 TraceCheckUtils]: 70: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,126 INFO L273 TraceCheckUtils]: 71: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,127 INFO L273 TraceCheckUtils]: 72: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,128 INFO L273 TraceCheckUtils]: 73: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,129 INFO L273 TraceCheckUtils]: 74: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,130 INFO L273 TraceCheckUtils]: 75: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,131 INFO L273 TraceCheckUtils]: 76: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,132 INFO L273 TraceCheckUtils]: 77: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,133 INFO L273 TraceCheckUtils]: 78: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,134 INFO L273 TraceCheckUtils]: 79: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,135 INFO L273 TraceCheckUtils]: 80: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,136 INFO L273 TraceCheckUtils]: 81: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,137 INFO L273 TraceCheckUtils]: 82: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,138 INFO L273 TraceCheckUtils]: 83: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,139 INFO L273 TraceCheckUtils]: 84: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,140 INFO L273 TraceCheckUtils]: 85: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,141 INFO L273 TraceCheckUtils]: 86: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,142 INFO L273 TraceCheckUtils]: 87: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,143 INFO L273 TraceCheckUtils]: 88: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,145 INFO L273 TraceCheckUtils]: 89: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,146 INFO L273 TraceCheckUtils]: 90: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,147 INFO L273 TraceCheckUtils]: 91: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,147 INFO L273 TraceCheckUtils]: 92: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,149 INFO L273 TraceCheckUtils]: 93: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,150 INFO L273 TraceCheckUtils]: 94: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,151 INFO L273 TraceCheckUtils]: 95: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,152 INFO L273 TraceCheckUtils]: 96: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,153 INFO L273 TraceCheckUtils]: 97: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,154 INFO L273 TraceCheckUtils]: 98: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,155 INFO L273 TraceCheckUtils]: 99: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,156 INFO L273 TraceCheckUtils]: 100: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,157 INFO L273 TraceCheckUtils]: 101: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,158 INFO L273 TraceCheckUtils]: 102: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,159 INFO L273 TraceCheckUtils]: 103: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,160 INFO L273 TraceCheckUtils]: 104: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,161 INFO L273 TraceCheckUtils]: 105: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,162 INFO L273 TraceCheckUtils]: 106: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,163 INFO L273 TraceCheckUtils]: 107: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,163 INFO L273 TraceCheckUtils]: 108: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,164 INFO L273 TraceCheckUtils]: 109: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(~j~0 < ~edgecount~0); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,165 INFO L273 TraceCheckUtils]: 110: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,166 INFO L273 TraceCheckUtils]: 111: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,167 INFO L273 TraceCheckUtils]: 112: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,168 INFO L273 TraceCheckUtils]: 113: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,169 INFO L273 TraceCheckUtils]: 114: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,170 INFO L273 TraceCheckUtils]: 115: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,171 INFO L273 TraceCheckUtils]: 116: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,172 INFO L273 TraceCheckUtils]: 117: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,173 INFO L273 TraceCheckUtils]: 118: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,174 INFO L273 TraceCheckUtils]: 119: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,175 INFO L273 TraceCheckUtils]: 120: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,176 INFO L273 TraceCheckUtils]: 121: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,177 INFO L273 TraceCheckUtils]: 122: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,178 INFO L273 TraceCheckUtils]: 123: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,179 INFO L273 TraceCheckUtils]: 124: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,180 INFO L273 TraceCheckUtils]: 125: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,181 INFO L273 TraceCheckUtils]: 126: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,182 INFO L273 TraceCheckUtils]: 127: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,183 INFO L273 TraceCheckUtils]: 128: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,184 INFO L273 TraceCheckUtils]: 129: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,202 INFO L273 TraceCheckUtils]: 130: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,218 INFO L273 TraceCheckUtils]: 131: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,234 INFO L273 TraceCheckUtils]: 132: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,251 INFO L273 TraceCheckUtils]: 133: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,265 INFO L273 TraceCheckUtils]: 134: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,280 INFO L273 TraceCheckUtils]: 135: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,289 INFO L273 TraceCheckUtils]: 136: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,303 INFO L273 TraceCheckUtils]: 137: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,315 INFO L273 TraceCheckUtils]: 138: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,331 INFO L273 TraceCheckUtils]: 139: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,340 INFO L273 TraceCheckUtils]: 140: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,353 INFO L273 TraceCheckUtils]: 141: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,366 INFO L273 TraceCheckUtils]: 142: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,379 INFO L273 TraceCheckUtils]: 143: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,392 INFO L273 TraceCheckUtils]: 144: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,404 INFO L273 TraceCheckUtils]: 145: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,417 INFO L273 TraceCheckUtils]: 146: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,430 INFO L273 TraceCheckUtils]: 147: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,443 INFO L273 TraceCheckUtils]: 148: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,456 INFO L273 TraceCheckUtils]: 149: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,469 INFO L273 TraceCheckUtils]: 150: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(~j~0 < ~edgecount~0); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,481 INFO L273 TraceCheckUtils]: 151: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,495 INFO L273 TraceCheckUtils]: 152: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,507 INFO L273 TraceCheckUtils]: 153: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,517 INFO L273 TraceCheckUtils]: 154: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,530 INFO L273 TraceCheckUtils]: 155: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,543 INFO L273 TraceCheckUtils]: 156: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,556 INFO L273 TraceCheckUtils]: 157: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,571 INFO L273 TraceCheckUtils]: 158: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,581 INFO L273 TraceCheckUtils]: 159: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,594 INFO L273 TraceCheckUtils]: 160: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,607 INFO L273 TraceCheckUtils]: 161: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,620 INFO L273 TraceCheckUtils]: 162: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,635 INFO L273 TraceCheckUtils]: 163: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,646 INFO L273 TraceCheckUtils]: 164: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,659 INFO L273 TraceCheckUtils]: 165: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,664 INFO L273 TraceCheckUtils]: 166: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,666 INFO L273 TraceCheckUtils]: 167: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,667 INFO L273 TraceCheckUtils]: 168: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,668 INFO L273 TraceCheckUtils]: 169: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,668 INFO L273 TraceCheckUtils]: 170: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,670 INFO L273 TraceCheckUtils]: 171: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,671 INFO L273 TraceCheckUtils]: 172: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,672 INFO L273 TraceCheckUtils]: 173: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,673 INFO L273 TraceCheckUtils]: 174: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,674 INFO L273 TraceCheckUtils]: 175: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,675 INFO L273 TraceCheckUtils]: 176: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,676 INFO L273 TraceCheckUtils]: 177: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,677 INFO L273 TraceCheckUtils]: 178: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,678 INFO L273 TraceCheckUtils]: 179: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,679 INFO L273 TraceCheckUtils]: 180: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,680 INFO L273 TraceCheckUtils]: 181: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,681 INFO L273 TraceCheckUtils]: 182: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,682 INFO L273 TraceCheckUtils]: 183: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,683 INFO L273 TraceCheckUtils]: 184: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,684 INFO L273 TraceCheckUtils]: 185: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,685 INFO L273 TraceCheckUtils]: 186: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,686 INFO L273 TraceCheckUtils]: 187: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,687 INFO L273 TraceCheckUtils]: 188: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,688 INFO L273 TraceCheckUtils]: 189: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,689 INFO L273 TraceCheckUtils]: 190: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,690 INFO L273 TraceCheckUtils]: 191: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(~j~0 < ~edgecount~0); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,691 INFO L273 TraceCheckUtils]: 192: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,692 INFO L273 TraceCheckUtils]: 193: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,693 INFO L273 TraceCheckUtils]: 194: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,694 INFO L273 TraceCheckUtils]: 195: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,695 INFO L273 TraceCheckUtils]: 196: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,696 INFO L273 TraceCheckUtils]: 197: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,697 INFO L273 TraceCheckUtils]: 198: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,698 INFO L273 TraceCheckUtils]: 199: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,699 INFO L273 TraceCheckUtils]: 200: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,700 INFO L273 TraceCheckUtils]: 201: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,701 INFO L273 TraceCheckUtils]: 202: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,702 INFO L273 TraceCheckUtils]: 203: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,704 INFO L273 TraceCheckUtils]: 204: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,705 INFO L273 TraceCheckUtils]: 205: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,705 INFO L273 TraceCheckUtils]: 206: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,706 INFO L273 TraceCheckUtils]: 207: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,708 INFO L273 TraceCheckUtils]: 208: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,709 INFO L273 TraceCheckUtils]: 209: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,709 INFO L273 TraceCheckUtils]: 210: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,710 INFO L273 TraceCheckUtils]: 211: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,712 INFO L273 TraceCheckUtils]: 212: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,713 INFO L273 TraceCheckUtils]: 213: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,714 INFO L273 TraceCheckUtils]: 214: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,715 INFO L273 TraceCheckUtils]: 215: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,716 INFO L273 TraceCheckUtils]: 216: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,717 INFO L273 TraceCheckUtils]: 217: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,718 INFO L273 TraceCheckUtils]: 218: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,719 INFO L273 TraceCheckUtils]: 219: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,720 INFO L273 TraceCheckUtils]: 220: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,721 INFO L273 TraceCheckUtils]: 221: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,722 INFO L273 TraceCheckUtils]: 222: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,732 INFO L273 TraceCheckUtils]: 223: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,733 INFO L273 TraceCheckUtils]: 224: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,733 INFO L273 TraceCheckUtils]: 225: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,734 INFO L273 TraceCheckUtils]: 226: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,735 INFO L273 TraceCheckUtils]: 227: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,735 INFO L273 TraceCheckUtils]: 228: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,736 INFO L273 TraceCheckUtils]: 229: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,737 INFO L273 TraceCheckUtils]: 230: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,738 INFO L273 TraceCheckUtils]: 231: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,739 INFO L273 TraceCheckUtils]: 232: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(~j~0 < ~edgecount~0); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,740 INFO L273 TraceCheckUtils]: 233: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,741 INFO L273 TraceCheckUtils]: 234: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,746 INFO L273 TraceCheckUtils]: 235: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(~i~0 < ~nodecount~0); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,747 INFO L273 TraceCheckUtils]: 236: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} ~i~0 := 0; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,747 INFO L273 TraceCheckUtils]: 237: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,748 INFO L273 TraceCheckUtils]: 238: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,749 INFO L273 TraceCheckUtils]: 239: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,749 INFO L273 TraceCheckUtils]: 240: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,750 INFO L273 TraceCheckUtils]: 241: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,751 INFO L273 TraceCheckUtils]: 242: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,752 INFO L273 TraceCheckUtils]: 243: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,753 INFO L273 TraceCheckUtils]: 244: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,754 INFO L273 TraceCheckUtils]: 245: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,755 INFO L273 TraceCheckUtils]: 246: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,756 INFO L273 TraceCheckUtils]: 247: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,757 INFO L273 TraceCheckUtils]: 248: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,758 INFO L273 TraceCheckUtils]: 249: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,759 INFO L273 TraceCheckUtils]: 250: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,760 INFO L273 TraceCheckUtils]: 251: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,761 INFO L273 TraceCheckUtils]: 252: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,762 INFO L273 TraceCheckUtils]: 253: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,763 INFO L273 TraceCheckUtils]: 254: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,764 INFO L273 TraceCheckUtils]: 255: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,765 INFO L273 TraceCheckUtils]: 256: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,766 INFO L273 TraceCheckUtils]: 257: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,767 INFO L273 TraceCheckUtils]: 258: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,768 INFO L273 TraceCheckUtils]: 259: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,769 INFO L273 TraceCheckUtils]: 260: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,770 INFO L273 TraceCheckUtils]: 261: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,771 INFO L273 TraceCheckUtils]: 262: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,772 INFO L273 TraceCheckUtils]: 263: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,773 INFO L273 TraceCheckUtils]: 264: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,774 INFO L273 TraceCheckUtils]: 265: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,775 INFO L273 TraceCheckUtils]: 266: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,776 INFO L273 TraceCheckUtils]: 267: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,777 INFO L273 TraceCheckUtils]: 268: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,778 INFO L273 TraceCheckUtils]: 269: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,779 INFO L273 TraceCheckUtils]: 270: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,780 INFO L273 TraceCheckUtils]: 271: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,781 INFO L273 TraceCheckUtils]: 272: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,782 INFO L273 TraceCheckUtils]: 273: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume true; {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,783 INFO L273 TraceCheckUtils]: 274: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} assume !(~i~0 < ~edgecount~0); {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} is VALID [2018-11-18 23:59:20,784 INFO L273 TraceCheckUtils]: 275: Hoare triple {18990#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))))} ~i~0 := 0; {19735#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))) (= main_~i~0 0))} is VALID [2018-11-18 23:59:20,785 INFO L273 TraceCheckUtils]: 276: Hoare triple {19735#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))) (= main_~i~0 0))} assume true; {19735#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))) (= main_~i~0 0))} is VALID [2018-11-18 23:59:20,786 INFO L273 TraceCheckUtils]: 277: Hoare triple {19735#(and (= 0 |main_~#distance~0.offset|) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) |main_~#distance~0.offset|) (exists ((v_prenex_4 Int)) (and (< v_prenex_4 6) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_prenex_4) |main_~#distance~0.offset| (- 4))) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (<= 5 v_prenex_4) (not (= 4 (* 4 v_prenex_4))))) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {19742#(<= 0 |main_#t~mem17|)} is VALID [2018-11-18 23:59:20,787 INFO L256 TraceCheckUtils]: 278: Hoare triple {19742#(<= 0 |main_#t~mem17|)} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {19746#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 23:59:20,788 INFO L273 TraceCheckUtils]: 279: Hoare triple {19746#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {19750#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-18 23:59:20,788 INFO L273 TraceCheckUtils]: 280: Hoare triple {19750#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18883#false} is VALID [2018-11-18 23:59:20,789 INFO L273 TraceCheckUtils]: 281: Hoare triple {18883#false} assume !false; {18883#false} is VALID [2018-11-18 23:59:21,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4682 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 4632 trivial. 0 not checked. [2018-11-18 23:59:21,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:59:21,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 29 [2018-11-18 23:59:21,416 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 282 [2018-11-18 23:59:21,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:59:21,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-18 23:59:21,605 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:59:21,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-18 23:59:21,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-18 23:59:21,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2018-11-18 23:59:21,607 INFO L87 Difference]: Start difference. First operand 287 states and 340 transitions. Second operand 29 states. [2018-11-18 23:59:23,670 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 39 [2018-11-18 23:59:25,313 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-18 23:59:28,724 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 42 [2018-11-18 23:59:31,349 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 45 [2018-11-18 23:59:32,346 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 47 [2018-11-18 23:59:32,886 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 48 [2018-11-18 23:59:33,137 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 48 [2018-11-18 23:59:33,415 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 48 [2018-11-18 23:59:34,011 WARN L180 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 47 [2018-11-18 23:59:34,292 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 47 [2018-11-18 23:59:34,574 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 47 [2018-11-18 23:59:34,873 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 48 [2018-11-18 23:59:35,174 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 48 [2018-11-18 23:59:45,944 WARN L180 SmtUtils]: Spent 10.11 s on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2018-11-18 23:59:48,115 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 41 [2018-11-18 23:59:49,232 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 41 [2018-11-19 00:00:38,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:38,676 INFO L93 Difference]: Finished difference Result 831 states and 1011 transitions. [2018-11-19 00:00:38,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-11-19 00:00:38,676 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 282 [2018-11-19 00:00:38,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:00:38,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-19 00:00:38,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 475 transitions. [2018-11-19 00:00:38,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-19 00:00:38,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 475 transitions. [2018-11-19 00:00:38,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 80 states and 475 transitions. [2018-11-19 00:00:39,589 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:00:39,609 INFO L225 Difference]: With dead ends: 831 [2018-11-19 00:00:39,609 INFO L226 Difference]: Without dead ends: 613 [2018-11-19 00:00:39,612 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 267 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2590 ImplicationChecksByTransitivity, 32.4s TimeCoverageRelationStatistics Valid=1670, Invalid=7257, Unknown=3, NotChecked=0, Total=8930 [2018-11-19 00:00:39,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-11-19 00:00:42,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 576. [2018-11-19 00:00:42,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:00:42,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 613 states. Second operand 576 states. [2018-11-19 00:00:42,124 INFO L74 IsIncluded]: Start isIncluded. First operand 613 states. Second operand 576 states. [2018-11-19 00:00:42,124 INFO L87 Difference]: Start difference. First operand 613 states. Second operand 576 states. [2018-11-19 00:00:42,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:42,149 INFO L93 Difference]: Finished difference Result 613 states and 740 transitions. [2018-11-19 00:00:42,150 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 740 transitions. [2018-11-19 00:00:42,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:00:42,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:00:42,151 INFO L74 IsIncluded]: Start isIncluded. First operand 576 states. Second operand 613 states. [2018-11-19 00:00:42,151 INFO L87 Difference]: Start difference. First operand 576 states. Second operand 613 states. [2018-11-19 00:00:42,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:42,173 INFO L93 Difference]: Finished difference Result 613 states and 740 transitions. [2018-11-19 00:00:42,173 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 740 transitions. [2018-11-19 00:00:42,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:00:42,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:00:42,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:00:42,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:00:42,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2018-11-19 00:00:42,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 690 transitions. [2018-11-19 00:00:42,197 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 690 transitions. Word has length 282 [2018-11-19 00:00:42,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:00:42,197 INFO L480 AbstractCegarLoop]: Abstraction has 576 states and 690 transitions. [2018-11-19 00:00:42,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-19 00:00:42,197 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 690 transitions. [2018-11-19 00:00:42,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-11-19 00:00:42,202 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:00:42,202 INFO L375 BasicCegarLoop]: trace histogram [55, 50, 50, 49, 10, 9, 9, 9, 6, 6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:00:42,203 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:00:42,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:00:42,203 INFO L82 PathProgramCache]: Analyzing trace with hash 604374778, now seen corresponding path program 1 times [2018-11-19 00:00:42,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:00:42,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:00:42,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:00:42,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:00:42,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:00:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:00:43,413 INFO L256 TraceCheckUtils]: 0: Hoare triple {22897#true} call ULTIMATE.init(); {22897#true} is VALID [2018-11-19 00:00:43,413 INFO L273 TraceCheckUtils]: 1: Hoare triple {22897#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {22897#true} is VALID [2018-11-19 00:00:43,413 INFO L273 TraceCheckUtils]: 2: Hoare triple {22897#true} assume true; {22897#true} is VALID [2018-11-19 00:00:43,414 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22897#true} {22897#true} #108#return; {22897#true} is VALID [2018-11-19 00:00:43,414 INFO L256 TraceCheckUtils]: 4: Hoare triple {22897#true} call #t~ret18 := main(); {22897#true} is VALID [2018-11-19 00:00:43,414 INFO L273 TraceCheckUtils]: 5: Hoare triple {22897#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {22897#true} is VALID [2018-11-19 00:00:43,414 INFO L273 TraceCheckUtils]: 6: Hoare triple {22897#true} assume true; {22897#true} is VALID [2018-11-19 00:00:43,415 INFO L273 TraceCheckUtils]: 7: Hoare triple {22897#true} assume !!(~i~0 < ~nodecount~0); {22897#true} is VALID [2018-11-19 00:00:43,415 INFO L273 TraceCheckUtils]: 8: Hoare triple {22897#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {22897#true} is VALID [2018-11-19 00:00:43,415 INFO L273 TraceCheckUtils]: 9: Hoare triple {22897#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22897#true} is VALID [2018-11-19 00:00:43,415 INFO L273 TraceCheckUtils]: 10: Hoare triple {22897#true} assume true; {22897#true} is VALID [2018-11-19 00:00:43,415 INFO L273 TraceCheckUtils]: 11: Hoare triple {22897#true} assume !!(~i~0 < ~nodecount~0); {22897#true} is VALID [2018-11-19 00:00:43,415 INFO L273 TraceCheckUtils]: 12: Hoare triple {22897#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {22897#true} is VALID [2018-11-19 00:00:43,416 INFO L273 TraceCheckUtils]: 13: Hoare triple {22897#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22897#true} is VALID [2018-11-19 00:00:43,416 INFO L273 TraceCheckUtils]: 14: Hoare triple {22897#true} assume true; {22897#true} is VALID [2018-11-19 00:00:43,416 INFO L273 TraceCheckUtils]: 15: Hoare triple {22897#true} assume !!(~i~0 < ~nodecount~0); {22897#true} is VALID [2018-11-19 00:00:43,416 INFO L273 TraceCheckUtils]: 16: Hoare triple {22897#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {22897#true} is VALID [2018-11-19 00:00:43,416 INFO L273 TraceCheckUtils]: 17: Hoare triple {22897#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22897#true} is VALID [2018-11-19 00:00:43,416 INFO L273 TraceCheckUtils]: 18: Hoare triple {22897#true} assume true; {22897#true} is VALID [2018-11-19 00:00:43,416 INFO L273 TraceCheckUtils]: 19: Hoare triple {22897#true} assume !!(~i~0 < ~nodecount~0); {22897#true} is VALID [2018-11-19 00:00:43,416 INFO L273 TraceCheckUtils]: 20: Hoare triple {22897#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {22897#true} is VALID [2018-11-19 00:00:43,416 INFO L273 TraceCheckUtils]: 21: Hoare triple {22897#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22897#true} is VALID [2018-11-19 00:00:43,417 INFO L273 TraceCheckUtils]: 22: Hoare triple {22897#true} assume true; {22897#true} is VALID [2018-11-19 00:00:43,417 INFO L273 TraceCheckUtils]: 23: Hoare triple {22897#true} assume !!(~i~0 < ~nodecount~0); {22897#true} is VALID [2018-11-19 00:00:43,417 INFO L273 TraceCheckUtils]: 24: Hoare triple {22897#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {22897#true} is VALID [2018-11-19 00:00:43,417 INFO L273 TraceCheckUtils]: 25: Hoare triple {22897#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22897#true} is VALID [2018-11-19 00:00:43,417 INFO L273 TraceCheckUtils]: 26: Hoare triple {22897#true} assume true; {22897#true} is VALID [2018-11-19 00:00:43,417 INFO L273 TraceCheckUtils]: 27: Hoare triple {22897#true} assume !(~i~0 < ~nodecount~0); {22897#true} is VALID [2018-11-19 00:00:43,417 INFO L273 TraceCheckUtils]: 28: Hoare triple {22897#true} ~i~0 := 0; {22897#true} is VALID [2018-11-19 00:00:43,417 INFO L273 TraceCheckUtils]: 29: Hoare triple {22897#true} assume true; {22897#true} is VALID [2018-11-19 00:00:43,417 INFO L273 TraceCheckUtils]: 30: Hoare triple {22897#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {22897#true} is VALID [2018-11-19 00:00:43,418 INFO L273 TraceCheckUtils]: 31: Hoare triple {22897#true} assume true; {22897#true} is VALID [2018-11-19 00:00:43,418 INFO L273 TraceCheckUtils]: 32: Hoare triple {22897#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22897#true} is VALID [2018-11-19 00:00:43,418 INFO L273 TraceCheckUtils]: 33: Hoare triple {22897#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22897#true} is VALID [2018-11-19 00:00:43,418 INFO L273 TraceCheckUtils]: 34: Hoare triple {22897#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22897#true} is VALID [2018-11-19 00:00:43,418 INFO L273 TraceCheckUtils]: 35: Hoare triple {22897#true} assume true; {22897#true} is VALID [2018-11-19 00:00:43,418 INFO L273 TraceCheckUtils]: 36: Hoare triple {22897#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22897#true} is VALID [2018-11-19 00:00:43,418 INFO L273 TraceCheckUtils]: 37: Hoare triple {22897#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22897#true} is VALID [2018-11-19 00:00:43,418 INFO L273 TraceCheckUtils]: 38: Hoare triple {22897#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22897#true} is VALID [2018-11-19 00:00:43,418 INFO L273 TraceCheckUtils]: 39: Hoare triple {22897#true} assume true; {22897#true} is VALID [2018-11-19 00:00:43,419 INFO L273 TraceCheckUtils]: 40: Hoare triple {22897#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22897#true} is VALID [2018-11-19 00:00:43,419 INFO L273 TraceCheckUtils]: 41: Hoare triple {22897#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22897#true} is VALID [2018-11-19 00:00:43,419 INFO L273 TraceCheckUtils]: 42: Hoare triple {22897#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22897#true} is VALID [2018-11-19 00:00:43,419 INFO L273 TraceCheckUtils]: 43: Hoare triple {22897#true} assume true; {22897#true} is VALID [2018-11-19 00:00:43,419 INFO L273 TraceCheckUtils]: 44: Hoare triple {22897#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22897#true} is VALID [2018-11-19 00:00:43,419 INFO L273 TraceCheckUtils]: 45: Hoare triple {22897#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22897#true} is VALID [2018-11-19 00:00:43,419 INFO L273 TraceCheckUtils]: 46: Hoare triple {22897#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22897#true} is VALID [2018-11-19 00:00:43,419 INFO L273 TraceCheckUtils]: 47: Hoare triple {22897#true} assume true; {22897#true} is VALID [2018-11-19 00:00:43,419 INFO L273 TraceCheckUtils]: 48: Hoare triple {22897#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22897#true} is VALID [2018-11-19 00:00:43,420 INFO L273 TraceCheckUtils]: 49: Hoare triple {22897#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22897#true} is VALID [2018-11-19 00:00:43,420 INFO L273 TraceCheckUtils]: 50: Hoare triple {22897#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22897#true} is VALID [2018-11-19 00:00:43,420 INFO L273 TraceCheckUtils]: 51: Hoare triple {22897#true} assume true; {22897#true} is VALID [2018-11-19 00:00:43,420 INFO L273 TraceCheckUtils]: 52: Hoare triple {22897#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22897#true} is VALID [2018-11-19 00:00:43,420 INFO L273 TraceCheckUtils]: 53: Hoare triple {22897#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22897#true} is VALID [2018-11-19 00:00:43,420 INFO L273 TraceCheckUtils]: 54: Hoare triple {22897#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22897#true} is VALID [2018-11-19 00:00:43,420 INFO L273 TraceCheckUtils]: 55: Hoare triple {22897#true} assume true; {22897#true} is VALID [2018-11-19 00:00:43,420 INFO L273 TraceCheckUtils]: 56: Hoare triple {22897#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22897#true} is VALID [2018-11-19 00:00:43,420 INFO L273 TraceCheckUtils]: 57: Hoare triple {22897#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22897#true} is VALID [2018-11-19 00:00:43,421 INFO L273 TraceCheckUtils]: 58: Hoare triple {22897#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22897#true} is VALID [2018-11-19 00:00:43,421 INFO L273 TraceCheckUtils]: 59: Hoare triple {22897#true} assume true; {22897#true} is VALID [2018-11-19 00:00:43,421 INFO L273 TraceCheckUtils]: 60: Hoare triple {22897#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22897#true} is VALID [2018-11-19 00:00:43,421 INFO L273 TraceCheckUtils]: 61: Hoare triple {22897#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22897#true} is VALID [2018-11-19 00:00:43,421 INFO L273 TraceCheckUtils]: 62: Hoare triple {22897#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22897#true} is VALID [2018-11-19 00:00:43,421 INFO L273 TraceCheckUtils]: 63: Hoare triple {22897#true} assume true; {22897#true} is VALID [2018-11-19 00:00:43,421 INFO L273 TraceCheckUtils]: 64: Hoare triple {22897#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22897#true} is VALID [2018-11-19 00:00:43,421 INFO L273 TraceCheckUtils]: 65: Hoare triple {22897#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22897#true} is VALID [2018-11-19 00:00:43,421 INFO L273 TraceCheckUtils]: 66: Hoare triple {22897#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22897#true} is VALID [2018-11-19 00:00:43,421 INFO L273 TraceCheckUtils]: 67: Hoare triple {22897#true} assume true; {22897#true} is VALID [2018-11-19 00:00:43,422 INFO L273 TraceCheckUtils]: 68: Hoare triple {22897#true} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22897#true} is VALID [2018-11-19 00:00:43,422 INFO L273 TraceCheckUtils]: 69: Hoare triple {22897#true} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22897#true} is VALID [2018-11-19 00:00:43,422 INFO L273 TraceCheckUtils]: 70: Hoare triple {22897#true} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22897#true} is VALID [2018-11-19 00:00:43,422 INFO L273 TraceCheckUtils]: 71: Hoare triple {22897#true} assume true; {22897#true} is VALID [2018-11-19 00:00:43,422 INFO L273 TraceCheckUtils]: 72: Hoare triple {22897#true} assume !(~j~0 < ~edgecount~0); {22897#true} is VALID [2018-11-19 00:00:43,422 INFO L273 TraceCheckUtils]: 73: Hoare triple {22897#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22897#true} is VALID [2018-11-19 00:00:43,422 INFO L273 TraceCheckUtils]: 74: Hoare triple {22897#true} assume true; {22897#true} is VALID [2018-11-19 00:00:43,423 INFO L273 TraceCheckUtils]: 75: Hoare triple {22897#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {22899#(= main_~j~0 0)} is VALID [2018-11-19 00:00:43,423 INFO L273 TraceCheckUtils]: 76: Hoare triple {22899#(= main_~j~0 0)} assume true; {22899#(= main_~j~0 0)} is VALID [2018-11-19 00:00:43,423 INFO L273 TraceCheckUtils]: 77: Hoare triple {22899#(= main_~j~0 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22899#(= main_~j~0 0)} is VALID [2018-11-19 00:00:43,423 INFO L273 TraceCheckUtils]: 78: Hoare triple {22899#(= main_~j~0 0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22899#(= main_~j~0 0)} is VALID [2018-11-19 00:00:43,424 INFO L273 TraceCheckUtils]: 79: Hoare triple {22899#(= main_~j~0 0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22900#(<= 1 main_~j~0)} is VALID [2018-11-19 00:00:43,424 INFO L273 TraceCheckUtils]: 80: Hoare triple {22900#(<= 1 main_~j~0)} assume true; {22900#(<= 1 main_~j~0)} is VALID [2018-11-19 00:00:43,424 INFO L273 TraceCheckUtils]: 81: Hoare triple {22900#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22900#(<= 1 main_~j~0)} is VALID [2018-11-19 00:00:43,425 INFO L273 TraceCheckUtils]: 82: Hoare triple {22900#(<= 1 main_~j~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22900#(<= 1 main_~j~0)} is VALID [2018-11-19 00:00:43,425 INFO L273 TraceCheckUtils]: 83: Hoare triple {22900#(<= 1 main_~j~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22901#(<= 2 main_~j~0)} is VALID [2018-11-19 00:00:43,426 INFO L273 TraceCheckUtils]: 84: Hoare triple {22901#(<= 2 main_~j~0)} assume true; {22901#(<= 2 main_~j~0)} is VALID [2018-11-19 00:00:43,426 INFO L273 TraceCheckUtils]: 85: Hoare triple {22901#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22901#(<= 2 main_~j~0)} is VALID [2018-11-19 00:00:43,427 INFO L273 TraceCheckUtils]: 86: Hoare triple {22901#(<= 2 main_~j~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22901#(<= 2 main_~j~0)} is VALID [2018-11-19 00:00:43,427 INFO L273 TraceCheckUtils]: 87: Hoare triple {22901#(<= 2 main_~j~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22902#(<= 3 main_~j~0)} is VALID [2018-11-19 00:00:43,428 INFO L273 TraceCheckUtils]: 88: Hoare triple {22902#(<= 3 main_~j~0)} assume true; {22902#(<= 3 main_~j~0)} is VALID [2018-11-19 00:00:43,428 INFO L273 TraceCheckUtils]: 89: Hoare triple {22902#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22902#(<= 3 main_~j~0)} is VALID [2018-11-19 00:00:43,429 INFO L273 TraceCheckUtils]: 90: Hoare triple {22902#(<= 3 main_~j~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22902#(<= 3 main_~j~0)} is VALID [2018-11-19 00:00:43,430 INFO L273 TraceCheckUtils]: 91: Hoare triple {22902#(<= 3 main_~j~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22903#(<= 4 main_~j~0)} is VALID [2018-11-19 00:00:43,430 INFO L273 TraceCheckUtils]: 92: Hoare triple {22903#(<= 4 main_~j~0)} assume true; {22903#(<= 4 main_~j~0)} is VALID [2018-11-19 00:00:43,431 INFO L273 TraceCheckUtils]: 93: Hoare triple {22903#(<= 4 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22903#(<= 4 main_~j~0)} is VALID [2018-11-19 00:00:43,431 INFO L273 TraceCheckUtils]: 94: Hoare triple {22903#(<= 4 main_~j~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22903#(<= 4 main_~j~0)} is VALID [2018-11-19 00:00:43,432 INFO L273 TraceCheckUtils]: 95: Hoare triple {22903#(<= 4 main_~j~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22904#(<= 5 main_~j~0)} is VALID [2018-11-19 00:00:43,432 INFO L273 TraceCheckUtils]: 96: Hoare triple {22904#(<= 5 main_~j~0)} assume true; {22904#(<= 5 main_~j~0)} is VALID [2018-11-19 00:00:43,433 INFO L273 TraceCheckUtils]: 97: Hoare triple {22904#(<= 5 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22904#(<= 5 main_~j~0)} is VALID [2018-11-19 00:00:43,433 INFO L273 TraceCheckUtils]: 98: Hoare triple {22904#(<= 5 main_~j~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22904#(<= 5 main_~j~0)} is VALID [2018-11-19 00:00:43,434 INFO L273 TraceCheckUtils]: 99: Hoare triple {22904#(<= 5 main_~j~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22905#(<= 6 main_~j~0)} is VALID [2018-11-19 00:00:43,435 INFO L273 TraceCheckUtils]: 100: Hoare triple {22905#(<= 6 main_~j~0)} assume true; {22905#(<= 6 main_~j~0)} is VALID [2018-11-19 00:00:43,435 INFO L273 TraceCheckUtils]: 101: Hoare triple {22905#(<= 6 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22905#(<= 6 main_~j~0)} is VALID [2018-11-19 00:00:43,436 INFO L273 TraceCheckUtils]: 102: Hoare triple {22905#(<= 6 main_~j~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22905#(<= 6 main_~j~0)} is VALID [2018-11-19 00:00:43,436 INFO L273 TraceCheckUtils]: 103: Hoare triple {22905#(<= 6 main_~j~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22906#(<= 7 main_~j~0)} is VALID [2018-11-19 00:00:43,437 INFO L273 TraceCheckUtils]: 104: Hoare triple {22906#(<= 7 main_~j~0)} assume true; {22906#(<= 7 main_~j~0)} is VALID [2018-11-19 00:00:43,437 INFO L273 TraceCheckUtils]: 105: Hoare triple {22906#(<= 7 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22906#(<= 7 main_~j~0)} is VALID [2018-11-19 00:00:43,438 INFO L273 TraceCheckUtils]: 106: Hoare triple {22906#(<= 7 main_~j~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22906#(<= 7 main_~j~0)} is VALID [2018-11-19 00:00:43,439 INFO L273 TraceCheckUtils]: 107: Hoare triple {22906#(<= 7 main_~j~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22907#(<= 8 main_~j~0)} is VALID [2018-11-19 00:00:43,439 INFO L273 TraceCheckUtils]: 108: Hoare triple {22907#(<= 8 main_~j~0)} assume true; {22907#(<= 8 main_~j~0)} is VALID [2018-11-19 00:00:43,440 INFO L273 TraceCheckUtils]: 109: Hoare triple {22907#(<= 8 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22907#(<= 8 main_~j~0)} is VALID [2018-11-19 00:00:43,440 INFO L273 TraceCheckUtils]: 110: Hoare triple {22907#(<= 8 main_~j~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22907#(<= 8 main_~j~0)} is VALID [2018-11-19 00:00:43,441 INFO L273 TraceCheckUtils]: 111: Hoare triple {22907#(<= 8 main_~j~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22908#(<= 9 main_~j~0)} is VALID [2018-11-19 00:00:43,441 INFO L273 TraceCheckUtils]: 112: Hoare triple {22908#(<= 9 main_~j~0)} assume true; {22908#(<= 9 main_~j~0)} is VALID [2018-11-19 00:00:43,443 INFO L273 TraceCheckUtils]: 113: Hoare triple {22908#(<= 9 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,445 INFO L273 TraceCheckUtils]: 114: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,446 INFO L273 TraceCheckUtils]: 115: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,446 INFO L273 TraceCheckUtils]: 116: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,446 INFO L273 TraceCheckUtils]: 117: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,447 INFO L273 TraceCheckUtils]: 118: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,447 INFO L273 TraceCheckUtils]: 119: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,447 INFO L273 TraceCheckUtils]: 120: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,447 INFO L273 TraceCheckUtils]: 121: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,448 INFO L273 TraceCheckUtils]: 122: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,448 INFO L273 TraceCheckUtils]: 123: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,448 INFO L273 TraceCheckUtils]: 124: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,449 INFO L273 TraceCheckUtils]: 125: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,449 INFO L273 TraceCheckUtils]: 126: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,450 INFO L273 TraceCheckUtils]: 127: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,450 INFO L273 TraceCheckUtils]: 128: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,451 INFO L273 TraceCheckUtils]: 129: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,451 INFO L273 TraceCheckUtils]: 130: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,452 INFO L273 TraceCheckUtils]: 131: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,452 INFO L273 TraceCheckUtils]: 132: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,453 INFO L273 TraceCheckUtils]: 133: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,453 INFO L273 TraceCheckUtils]: 134: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,454 INFO L273 TraceCheckUtils]: 135: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,454 INFO L273 TraceCheckUtils]: 136: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,455 INFO L273 TraceCheckUtils]: 137: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,455 INFO L273 TraceCheckUtils]: 138: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,456 INFO L273 TraceCheckUtils]: 139: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,456 INFO L273 TraceCheckUtils]: 140: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,457 INFO L273 TraceCheckUtils]: 141: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,457 INFO L273 TraceCheckUtils]: 142: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,458 INFO L273 TraceCheckUtils]: 143: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,458 INFO L273 TraceCheckUtils]: 144: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,459 INFO L273 TraceCheckUtils]: 145: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,459 INFO L273 TraceCheckUtils]: 146: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,460 INFO L273 TraceCheckUtils]: 147: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,460 INFO L273 TraceCheckUtils]: 148: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,461 INFO L273 TraceCheckUtils]: 149: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,461 INFO L273 TraceCheckUtils]: 150: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,462 INFO L273 TraceCheckUtils]: 151: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,462 INFO L273 TraceCheckUtils]: 152: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,463 INFO L273 TraceCheckUtils]: 153: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,463 INFO L273 TraceCheckUtils]: 154: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,464 INFO L273 TraceCheckUtils]: 155: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,464 INFO L273 TraceCheckUtils]: 156: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,465 INFO L273 TraceCheckUtils]: 157: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,465 INFO L273 TraceCheckUtils]: 158: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,466 INFO L273 TraceCheckUtils]: 159: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,466 INFO L273 TraceCheckUtils]: 160: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,467 INFO L273 TraceCheckUtils]: 161: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,467 INFO L273 TraceCheckUtils]: 162: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,468 INFO L273 TraceCheckUtils]: 163: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,468 INFO L273 TraceCheckUtils]: 164: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,469 INFO L273 TraceCheckUtils]: 165: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,469 INFO L273 TraceCheckUtils]: 166: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,470 INFO L273 TraceCheckUtils]: 167: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,470 INFO L273 TraceCheckUtils]: 168: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,471 INFO L273 TraceCheckUtils]: 169: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,471 INFO L273 TraceCheckUtils]: 170: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,472 INFO L273 TraceCheckUtils]: 171: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,472 INFO L273 TraceCheckUtils]: 172: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,473 INFO L273 TraceCheckUtils]: 173: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,473 INFO L273 TraceCheckUtils]: 174: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,474 INFO L273 TraceCheckUtils]: 175: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,474 INFO L273 TraceCheckUtils]: 176: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,475 INFO L273 TraceCheckUtils]: 177: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,475 INFO L273 TraceCheckUtils]: 178: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,476 INFO L273 TraceCheckUtils]: 179: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,476 INFO L273 TraceCheckUtils]: 180: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,477 INFO L273 TraceCheckUtils]: 181: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,477 INFO L273 TraceCheckUtils]: 182: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,478 INFO L273 TraceCheckUtils]: 183: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,478 INFO L273 TraceCheckUtils]: 184: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,479 INFO L273 TraceCheckUtils]: 185: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,479 INFO L273 TraceCheckUtils]: 186: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,480 INFO L273 TraceCheckUtils]: 187: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,480 INFO L273 TraceCheckUtils]: 188: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,481 INFO L273 TraceCheckUtils]: 189: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,481 INFO L273 TraceCheckUtils]: 190: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,482 INFO L273 TraceCheckUtils]: 191: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,482 INFO L273 TraceCheckUtils]: 192: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,483 INFO L273 TraceCheckUtils]: 193: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,483 INFO L273 TraceCheckUtils]: 194: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,484 INFO L273 TraceCheckUtils]: 195: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,484 INFO L273 TraceCheckUtils]: 196: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,485 INFO L273 TraceCheckUtils]: 197: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,485 INFO L273 TraceCheckUtils]: 198: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,486 INFO L273 TraceCheckUtils]: 199: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,486 INFO L273 TraceCheckUtils]: 200: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,487 INFO L273 TraceCheckUtils]: 201: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,487 INFO L273 TraceCheckUtils]: 202: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,488 INFO L273 TraceCheckUtils]: 203: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,488 INFO L273 TraceCheckUtils]: 204: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,489 INFO L273 TraceCheckUtils]: 205: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,489 INFO L273 TraceCheckUtils]: 206: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,490 INFO L273 TraceCheckUtils]: 207: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,490 INFO L273 TraceCheckUtils]: 208: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,491 INFO L273 TraceCheckUtils]: 209: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,491 INFO L273 TraceCheckUtils]: 210: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,492 INFO L273 TraceCheckUtils]: 211: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,492 INFO L273 TraceCheckUtils]: 212: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,493 INFO L273 TraceCheckUtils]: 213: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,493 INFO L273 TraceCheckUtils]: 214: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,494 INFO L273 TraceCheckUtils]: 215: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,494 INFO L273 TraceCheckUtils]: 216: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,495 INFO L273 TraceCheckUtils]: 217: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,495 INFO L273 TraceCheckUtils]: 218: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,496 INFO L273 TraceCheckUtils]: 219: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,496 INFO L273 TraceCheckUtils]: 220: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,497 INFO L273 TraceCheckUtils]: 221: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,497 INFO L273 TraceCheckUtils]: 222: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,498 INFO L273 TraceCheckUtils]: 223: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,498 INFO L273 TraceCheckUtils]: 224: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,499 INFO L273 TraceCheckUtils]: 225: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,499 INFO L273 TraceCheckUtils]: 226: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,500 INFO L273 TraceCheckUtils]: 227: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,500 INFO L273 TraceCheckUtils]: 228: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,501 INFO L273 TraceCheckUtils]: 229: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,501 INFO L273 TraceCheckUtils]: 230: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,502 INFO L273 TraceCheckUtils]: 231: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,502 INFO L273 TraceCheckUtils]: 232: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,503 INFO L273 TraceCheckUtils]: 233: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,503 INFO L273 TraceCheckUtils]: 234: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,504 INFO L273 TraceCheckUtils]: 235: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,504 INFO L273 TraceCheckUtils]: 236: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,505 INFO L273 TraceCheckUtils]: 237: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,505 INFO L273 TraceCheckUtils]: 238: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,506 INFO L273 TraceCheckUtils]: 239: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,506 INFO L273 TraceCheckUtils]: 240: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,507 INFO L273 TraceCheckUtils]: 241: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,507 INFO L273 TraceCheckUtils]: 242: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,508 INFO L273 TraceCheckUtils]: 243: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,508 INFO L273 TraceCheckUtils]: 244: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,509 INFO L273 TraceCheckUtils]: 245: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,509 INFO L273 TraceCheckUtils]: 246: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,510 INFO L273 TraceCheckUtils]: 247: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,510 INFO L273 TraceCheckUtils]: 248: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,511 INFO L273 TraceCheckUtils]: 249: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem7;havoc #t~mem5;havoc #t~mem6;call #t~mem8 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem9 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem8 + #t~mem9, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem9;havoc #t~mem8; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,511 INFO L273 TraceCheckUtils]: 250: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,512 INFO L273 TraceCheckUtils]: 251: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,512 INFO L273 TraceCheckUtils]: 252: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,513 INFO L273 TraceCheckUtils]: 253: Hoare triple {22909#(<= 10 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,513 INFO L273 TraceCheckUtils]: 254: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume true; {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,514 INFO L273 TraceCheckUtils]: 255: Hoare triple {22909#(<= 10 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {22909#(<= 10 main_~edgecount~0)} is VALID [2018-11-19 00:00:43,514 INFO L273 TraceCheckUtils]: 256: Hoare triple {22909#(<= 10 main_~edgecount~0)} ~i~0 := 0; {22910#(and (<= 10 main_~edgecount~0) (= main_~i~0 0))} is VALID [2018-11-19 00:00:43,515 INFO L273 TraceCheckUtils]: 257: Hoare triple {22910#(and (<= 10 main_~edgecount~0) (= main_~i~0 0))} assume true; {22910#(and (<= 10 main_~edgecount~0) (= main_~i~0 0))} is VALID [2018-11-19 00:00:43,516 INFO L273 TraceCheckUtils]: 258: Hoare triple {22910#(and (<= 10 main_~edgecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {22910#(and (<= 10 main_~edgecount~0) (= main_~i~0 0))} is VALID [2018-11-19 00:00:43,517 INFO L273 TraceCheckUtils]: 259: Hoare triple {22910#(and (<= 10 main_~edgecount~0) (= main_~i~0 0))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {22910#(and (<= 10 main_~edgecount~0) (= main_~i~0 0))} is VALID [2018-11-19 00:00:43,518 INFO L273 TraceCheckUtils]: 260: Hoare triple {22910#(and (<= 10 main_~edgecount~0) (= main_~i~0 0))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {22911#(<= (+ main_~i~0 9) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,518 INFO L273 TraceCheckUtils]: 261: Hoare triple {22911#(<= (+ main_~i~0 9) main_~edgecount~0)} assume true; {22911#(<= (+ main_~i~0 9) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,519 INFO L273 TraceCheckUtils]: 262: Hoare triple {22911#(<= (+ main_~i~0 9) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {22911#(<= (+ main_~i~0 9) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,519 INFO L273 TraceCheckUtils]: 263: Hoare triple {22911#(<= (+ main_~i~0 9) main_~edgecount~0)} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {22911#(<= (+ main_~i~0 9) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,520 INFO L273 TraceCheckUtils]: 264: Hoare triple {22911#(<= (+ main_~i~0 9) main_~edgecount~0)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {22912#(<= (+ main_~i~0 8) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,520 INFO L273 TraceCheckUtils]: 265: Hoare triple {22912#(<= (+ main_~i~0 8) main_~edgecount~0)} assume true; {22912#(<= (+ main_~i~0 8) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,521 INFO L273 TraceCheckUtils]: 266: Hoare triple {22912#(<= (+ main_~i~0 8) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {22912#(<= (+ main_~i~0 8) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,521 INFO L273 TraceCheckUtils]: 267: Hoare triple {22912#(<= (+ main_~i~0 8) main_~edgecount~0)} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {22912#(<= (+ main_~i~0 8) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,522 INFO L273 TraceCheckUtils]: 268: Hoare triple {22912#(<= (+ main_~i~0 8) main_~edgecount~0)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {22913#(<= (+ main_~i~0 7) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,523 INFO L273 TraceCheckUtils]: 269: Hoare triple {22913#(<= (+ main_~i~0 7) main_~edgecount~0)} assume true; {22913#(<= (+ main_~i~0 7) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,523 INFO L273 TraceCheckUtils]: 270: Hoare triple {22913#(<= (+ main_~i~0 7) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {22913#(<= (+ main_~i~0 7) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,524 INFO L273 TraceCheckUtils]: 271: Hoare triple {22913#(<= (+ main_~i~0 7) main_~edgecount~0)} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {22913#(<= (+ main_~i~0 7) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,525 INFO L273 TraceCheckUtils]: 272: Hoare triple {22913#(<= (+ main_~i~0 7) main_~edgecount~0)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {22914#(<= (+ main_~i~0 6) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,525 INFO L273 TraceCheckUtils]: 273: Hoare triple {22914#(<= (+ main_~i~0 6) main_~edgecount~0)} assume true; {22914#(<= (+ main_~i~0 6) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,526 INFO L273 TraceCheckUtils]: 274: Hoare triple {22914#(<= (+ main_~i~0 6) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {22914#(<= (+ main_~i~0 6) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,526 INFO L273 TraceCheckUtils]: 275: Hoare triple {22914#(<= (+ main_~i~0 6) main_~edgecount~0)} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {22914#(<= (+ main_~i~0 6) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,527 INFO L273 TraceCheckUtils]: 276: Hoare triple {22914#(<= (+ main_~i~0 6) main_~edgecount~0)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {22915#(<= (+ main_~i~0 5) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,527 INFO L273 TraceCheckUtils]: 277: Hoare triple {22915#(<= (+ main_~i~0 5) main_~edgecount~0)} assume true; {22915#(<= (+ main_~i~0 5) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,528 INFO L273 TraceCheckUtils]: 278: Hoare triple {22915#(<= (+ main_~i~0 5) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {22915#(<= (+ main_~i~0 5) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,528 INFO L273 TraceCheckUtils]: 279: Hoare triple {22915#(<= (+ main_~i~0 5) main_~edgecount~0)} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {22915#(<= (+ main_~i~0 5) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,529 INFO L273 TraceCheckUtils]: 280: Hoare triple {22915#(<= (+ main_~i~0 5) main_~edgecount~0)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {22916#(<= (+ main_~i~0 4) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,530 INFO L273 TraceCheckUtils]: 281: Hoare triple {22916#(<= (+ main_~i~0 4) main_~edgecount~0)} assume true; {22916#(<= (+ main_~i~0 4) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,530 INFO L273 TraceCheckUtils]: 282: Hoare triple {22916#(<= (+ main_~i~0 4) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {22916#(<= (+ main_~i~0 4) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,531 INFO L273 TraceCheckUtils]: 283: Hoare triple {22916#(<= (+ main_~i~0 4) main_~edgecount~0)} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {22916#(<= (+ main_~i~0 4) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,532 INFO L273 TraceCheckUtils]: 284: Hoare triple {22916#(<= (+ main_~i~0 4) main_~edgecount~0)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {22917#(<= (+ main_~i~0 3) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,532 INFO L273 TraceCheckUtils]: 285: Hoare triple {22917#(<= (+ main_~i~0 3) main_~edgecount~0)} assume true; {22917#(<= (+ main_~i~0 3) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,533 INFO L273 TraceCheckUtils]: 286: Hoare triple {22917#(<= (+ main_~i~0 3) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {22917#(<= (+ main_~i~0 3) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,533 INFO L273 TraceCheckUtils]: 287: Hoare triple {22917#(<= (+ main_~i~0 3) main_~edgecount~0)} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {22917#(<= (+ main_~i~0 3) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,534 INFO L273 TraceCheckUtils]: 288: Hoare triple {22917#(<= (+ main_~i~0 3) main_~edgecount~0)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {22918#(<= (+ main_~i~0 2) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,534 INFO L273 TraceCheckUtils]: 289: Hoare triple {22918#(<= (+ main_~i~0 2) main_~edgecount~0)} assume true; {22918#(<= (+ main_~i~0 2) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,535 INFO L273 TraceCheckUtils]: 290: Hoare triple {22918#(<= (+ main_~i~0 2) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {22918#(<= (+ main_~i~0 2) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,535 INFO L273 TraceCheckUtils]: 291: Hoare triple {22918#(<= (+ main_~i~0 2) main_~edgecount~0)} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {22918#(<= (+ main_~i~0 2) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,536 INFO L273 TraceCheckUtils]: 292: Hoare triple {22918#(<= (+ main_~i~0 2) main_~edgecount~0)} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {22919#(<= (+ main_~i~0 1) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,537 INFO L273 TraceCheckUtils]: 293: Hoare triple {22919#(<= (+ main_~i~0 1) main_~edgecount~0)} assume true; {22919#(<= (+ main_~i~0 1) main_~edgecount~0)} is VALID [2018-11-19 00:00:43,537 INFO L273 TraceCheckUtils]: 294: Hoare triple {22919#(<= (+ main_~i~0 1) main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {22898#false} is VALID [2018-11-19 00:00:43,538 INFO L273 TraceCheckUtils]: 295: Hoare triple {22898#false} ~i~0 := 0; {22898#false} is VALID [2018-11-19 00:00:43,538 INFO L273 TraceCheckUtils]: 296: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:43,538 INFO L273 TraceCheckUtils]: 297: Hoare triple {22898#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {22898#false} is VALID [2018-11-19 00:00:43,538 INFO L256 TraceCheckUtils]: 298: Hoare triple {22898#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {22898#false} is VALID [2018-11-19 00:00:43,538 INFO L273 TraceCheckUtils]: 299: Hoare triple {22898#false} ~cond := #in~cond; {22898#false} is VALID [2018-11-19 00:00:43,539 INFO L273 TraceCheckUtils]: 300: Hoare triple {22898#false} assume 0 == ~cond; {22898#false} is VALID [2018-11-19 00:00:43,539 INFO L273 TraceCheckUtils]: 301: Hoare triple {22898#false} assume !false; {22898#false} is VALID [2018-11-19 00:00:43,595 INFO L134 CoverageAnalysis]: Checked inductivity of 5672 backedges. 1916 proven. 1434 refuted. 0 times theorem prover too weak. 2322 trivial. 0 not checked. [2018-11-19 00:00:43,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:00:43,595 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:00:43,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:00:43,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:00:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:00:43,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:00:44,449 INFO L256 TraceCheckUtils]: 0: Hoare triple {22897#true} call ULTIMATE.init(); {22897#true} is VALID [2018-11-19 00:00:44,449 INFO L273 TraceCheckUtils]: 1: Hoare triple {22897#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {22897#true} is VALID [2018-11-19 00:00:44,450 INFO L273 TraceCheckUtils]: 2: Hoare triple {22897#true} assume true; {22897#true} is VALID [2018-11-19 00:00:44,450 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22897#true} {22897#true} #108#return; {22897#true} is VALID [2018-11-19 00:00:44,450 INFO L256 TraceCheckUtils]: 4: Hoare triple {22897#true} call #t~ret18 := main(); {22897#true} is VALID [2018-11-19 00:00:44,452 INFO L273 TraceCheckUtils]: 5: Hoare triple {22897#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Source~0.base);call write~unchecked~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~unchecked~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~unchecked~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~unchecked~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~unchecked~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~unchecked~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Dest~0.base);call write~unchecked~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~unchecked~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~unchecked~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~unchecked~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~unchecked~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~unchecked~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#Weight~0.base);call write~unchecked~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~unchecked~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~unchecked~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~unchecked~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~unchecked~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~unchecked~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~unchecked~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~unchecked~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~unchecked~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~unchecked~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~unchecked~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~unchecked~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~unchecked~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~unchecked~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~unchecked~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~unchecked~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~unchecked~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~unchecked~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~unchecked~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~unchecked~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.alloc(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {22938#(<= 20 main_~edgecount~0)} is VALID [2018-11-19 00:00:44,453 INFO L273 TraceCheckUtils]: 6: Hoare triple {22938#(<= 20 main_~edgecount~0)} assume true; {22938#(<= 20 main_~edgecount~0)} is VALID [2018-11-19 00:00:44,453 INFO L273 TraceCheckUtils]: 7: Hoare triple {22938#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {22938#(<= 20 main_~edgecount~0)} is VALID [2018-11-19 00:00:44,453 INFO L273 TraceCheckUtils]: 8: Hoare triple {22938#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {22938#(<= 20 main_~edgecount~0)} is VALID [2018-11-19 00:00:44,454 INFO L273 TraceCheckUtils]: 9: Hoare triple {22938#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22938#(<= 20 main_~edgecount~0)} is VALID [2018-11-19 00:00:44,454 INFO L273 TraceCheckUtils]: 10: Hoare triple {22938#(<= 20 main_~edgecount~0)} assume true; {22938#(<= 20 main_~edgecount~0)} is VALID [2018-11-19 00:00:44,455 INFO L273 TraceCheckUtils]: 11: Hoare triple {22938#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {22938#(<= 20 main_~edgecount~0)} is VALID [2018-11-19 00:00:44,455 INFO L273 TraceCheckUtils]: 12: Hoare triple {22938#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {22938#(<= 20 main_~edgecount~0)} is VALID [2018-11-19 00:00:44,456 INFO L273 TraceCheckUtils]: 13: Hoare triple {22938#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22938#(<= 20 main_~edgecount~0)} is VALID [2018-11-19 00:00:44,456 INFO L273 TraceCheckUtils]: 14: Hoare triple {22938#(<= 20 main_~edgecount~0)} assume true; {22938#(<= 20 main_~edgecount~0)} is VALID [2018-11-19 00:00:44,457 INFO L273 TraceCheckUtils]: 15: Hoare triple {22938#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {22938#(<= 20 main_~edgecount~0)} is VALID [2018-11-19 00:00:44,457 INFO L273 TraceCheckUtils]: 16: Hoare triple {22938#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {22938#(<= 20 main_~edgecount~0)} is VALID [2018-11-19 00:00:44,458 INFO L273 TraceCheckUtils]: 17: Hoare triple {22938#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22938#(<= 20 main_~edgecount~0)} is VALID [2018-11-19 00:00:44,458 INFO L273 TraceCheckUtils]: 18: Hoare triple {22938#(<= 20 main_~edgecount~0)} assume true; {22938#(<= 20 main_~edgecount~0)} is VALID [2018-11-19 00:00:44,459 INFO L273 TraceCheckUtils]: 19: Hoare triple {22938#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {22938#(<= 20 main_~edgecount~0)} is VALID [2018-11-19 00:00:44,459 INFO L273 TraceCheckUtils]: 20: Hoare triple {22938#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {22938#(<= 20 main_~edgecount~0)} is VALID [2018-11-19 00:00:44,460 INFO L273 TraceCheckUtils]: 21: Hoare triple {22938#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22938#(<= 20 main_~edgecount~0)} is VALID [2018-11-19 00:00:44,460 INFO L273 TraceCheckUtils]: 22: Hoare triple {22938#(<= 20 main_~edgecount~0)} assume true; {22938#(<= 20 main_~edgecount~0)} is VALID [2018-11-19 00:00:44,461 INFO L273 TraceCheckUtils]: 23: Hoare triple {22938#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {22938#(<= 20 main_~edgecount~0)} is VALID [2018-11-19 00:00:44,461 INFO L273 TraceCheckUtils]: 24: Hoare triple {22938#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {22938#(<= 20 main_~edgecount~0)} is VALID [2018-11-19 00:00:44,462 INFO L273 TraceCheckUtils]: 25: Hoare triple {22938#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22938#(<= 20 main_~edgecount~0)} is VALID [2018-11-19 00:00:44,462 INFO L273 TraceCheckUtils]: 26: Hoare triple {22938#(<= 20 main_~edgecount~0)} assume true; {22938#(<= 20 main_~edgecount~0)} is VALID [2018-11-19 00:00:44,463 INFO L273 TraceCheckUtils]: 27: Hoare triple {22938#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {22938#(<= 20 main_~edgecount~0)} is VALID [2018-11-19 00:00:44,463 INFO L273 TraceCheckUtils]: 28: Hoare triple {22938#(<= 20 main_~edgecount~0)} ~i~0 := 0; {22938#(<= 20 main_~edgecount~0)} is VALID [2018-11-19 00:00:44,464 INFO L273 TraceCheckUtils]: 29: Hoare triple {22938#(<= 20 main_~edgecount~0)} assume true; {22938#(<= 20 main_~edgecount~0)} is VALID [2018-11-19 00:00:44,464 INFO L273 TraceCheckUtils]: 30: Hoare triple {22938#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {23014#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-19 00:00:44,465 INFO L273 TraceCheckUtils]: 31: Hoare triple {23014#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume true; {23014#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-19 00:00:44,466 INFO L273 TraceCheckUtils]: 32: Hoare triple {23014#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23014#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-19 00:00:44,467 INFO L273 TraceCheckUtils]: 33: Hoare triple {23014#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {23014#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-19 00:00:44,467 INFO L273 TraceCheckUtils]: 34: Hoare triple {23014#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {23027#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-19 00:00:44,468 INFO L273 TraceCheckUtils]: 35: Hoare triple {23027#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume true; {23027#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-19 00:00:44,469 INFO L273 TraceCheckUtils]: 36: Hoare triple {23027#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23027#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-19 00:00:44,470 INFO L273 TraceCheckUtils]: 37: Hoare triple {23027#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {23027#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-19 00:00:44,471 INFO L273 TraceCheckUtils]: 38: Hoare triple {23027#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {23040#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-19 00:00:44,471 INFO L273 TraceCheckUtils]: 39: Hoare triple {23040#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} assume true; {23040#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-19 00:00:44,472 INFO L273 TraceCheckUtils]: 40: Hoare triple {23040#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23040#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-19 00:00:44,473 INFO L273 TraceCheckUtils]: 41: Hoare triple {23040#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {23040#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-19 00:00:44,474 INFO L273 TraceCheckUtils]: 42: Hoare triple {23040#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {23053#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-19 00:00:44,474 INFO L273 TraceCheckUtils]: 43: Hoare triple {23053#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume true; {23053#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-19 00:00:44,475 INFO L273 TraceCheckUtils]: 44: Hoare triple {23053#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23053#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-19 00:00:44,476 INFO L273 TraceCheckUtils]: 45: Hoare triple {23053#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {23053#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-19 00:00:44,477 INFO L273 TraceCheckUtils]: 46: Hoare triple {23053#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {23066#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-19 00:00:44,477 INFO L273 TraceCheckUtils]: 47: Hoare triple {23066#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume true; {23066#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-19 00:00:44,478 INFO L273 TraceCheckUtils]: 48: Hoare triple {23066#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23066#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-19 00:00:44,479 INFO L273 TraceCheckUtils]: 49: Hoare triple {23066#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {23066#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-19 00:00:44,480 INFO L273 TraceCheckUtils]: 50: Hoare triple {23066#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {23079#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2018-11-19 00:00:44,481 INFO L273 TraceCheckUtils]: 51: Hoare triple {23079#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume true; {23079#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2018-11-19 00:00:44,482 INFO L273 TraceCheckUtils]: 52: Hoare triple {23079#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23079#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2018-11-19 00:00:44,482 INFO L273 TraceCheckUtils]: 53: Hoare triple {23079#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {23079#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2018-11-19 00:00:44,483 INFO L273 TraceCheckUtils]: 54: Hoare triple {23079#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {23092#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} is VALID [2018-11-19 00:00:44,484 INFO L273 TraceCheckUtils]: 55: Hoare triple {23092#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} assume true; {23092#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} is VALID [2018-11-19 00:00:44,485 INFO L273 TraceCheckUtils]: 56: Hoare triple {23092#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23092#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} is VALID [2018-11-19 00:00:44,485 INFO L273 TraceCheckUtils]: 57: Hoare triple {23092#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {23092#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} is VALID [2018-11-19 00:00:44,486 INFO L273 TraceCheckUtils]: 58: Hoare triple {23092#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {23105#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} is VALID [2018-11-19 00:00:44,487 INFO L273 TraceCheckUtils]: 59: Hoare triple {23105#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} assume true; {23105#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} is VALID [2018-11-19 00:00:44,488 INFO L273 TraceCheckUtils]: 60: Hoare triple {23105#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23105#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} is VALID [2018-11-19 00:00:44,488 INFO L273 TraceCheckUtils]: 61: Hoare triple {23105#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {23105#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} is VALID [2018-11-19 00:00:44,489 INFO L273 TraceCheckUtils]: 62: Hoare triple {23105#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {23118#(and (<= 20 main_~edgecount~0) (<= main_~j~0 8))} is VALID [2018-11-19 00:00:44,490 INFO L273 TraceCheckUtils]: 63: Hoare triple {23118#(and (<= 20 main_~edgecount~0) (<= main_~j~0 8))} assume true; {23118#(and (<= 20 main_~edgecount~0) (<= main_~j~0 8))} is VALID [2018-11-19 00:00:44,491 INFO L273 TraceCheckUtils]: 64: Hoare triple {23118#(and (<= 20 main_~edgecount~0) (<= main_~j~0 8))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23118#(and (<= 20 main_~edgecount~0) (<= main_~j~0 8))} is VALID [2018-11-19 00:00:44,491 INFO L273 TraceCheckUtils]: 65: Hoare triple {23118#(and (<= 20 main_~edgecount~0) (<= main_~j~0 8))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {23118#(and (<= 20 main_~edgecount~0) (<= main_~j~0 8))} is VALID [2018-11-19 00:00:44,492 INFO L273 TraceCheckUtils]: 66: Hoare triple {23118#(and (<= 20 main_~edgecount~0) (<= main_~j~0 8))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {23131#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2018-11-19 00:00:44,493 INFO L273 TraceCheckUtils]: 67: Hoare triple {23131#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} assume true; {23131#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2018-11-19 00:00:44,494 INFO L273 TraceCheckUtils]: 68: Hoare triple {23131#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {23131#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2018-11-19 00:00:44,495 INFO L273 TraceCheckUtils]: 69: Hoare triple {23131#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {23131#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} is VALID [2018-11-19 00:00:44,495 INFO L273 TraceCheckUtils]: 70: Hoare triple {23131#(and (<= 20 main_~edgecount~0) (<= main_~j~0 9))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {23144#(and (<= 20 main_~edgecount~0) (<= main_~j~0 10))} is VALID [2018-11-19 00:00:44,496 INFO L273 TraceCheckUtils]: 71: Hoare triple {23144#(and (<= 20 main_~edgecount~0) (<= main_~j~0 10))} assume true; {23144#(and (<= 20 main_~edgecount~0) (<= main_~j~0 10))} is VALID [2018-11-19 00:00:44,497 INFO L273 TraceCheckUtils]: 72: Hoare triple {23144#(and (<= 20 main_~edgecount~0) (<= main_~j~0 10))} assume !(~j~0 < ~edgecount~0); {22898#false} is VALID [2018-11-19 00:00:44,497 INFO L273 TraceCheckUtils]: 73: Hoare triple {22898#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22898#false} is VALID [2018-11-19 00:00:44,497 INFO L273 TraceCheckUtils]: 74: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,497 INFO L273 TraceCheckUtils]: 75: Hoare triple {22898#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {22898#false} is VALID [2018-11-19 00:00:44,498 INFO L273 TraceCheckUtils]: 76: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,498 INFO L273 TraceCheckUtils]: 77: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,498 INFO L273 TraceCheckUtils]: 78: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,498 INFO L273 TraceCheckUtils]: 79: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,498 INFO L273 TraceCheckUtils]: 80: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,499 INFO L273 TraceCheckUtils]: 81: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,499 INFO L273 TraceCheckUtils]: 82: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,499 INFO L273 TraceCheckUtils]: 83: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,499 INFO L273 TraceCheckUtils]: 84: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,499 INFO L273 TraceCheckUtils]: 85: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,499 INFO L273 TraceCheckUtils]: 86: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,500 INFO L273 TraceCheckUtils]: 87: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,500 INFO L273 TraceCheckUtils]: 88: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,500 INFO L273 TraceCheckUtils]: 89: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,500 INFO L273 TraceCheckUtils]: 90: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,500 INFO L273 TraceCheckUtils]: 91: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,500 INFO L273 TraceCheckUtils]: 92: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,500 INFO L273 TraceCheckUtils]: 93: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,500 INFO L273 TraceCheckUtils]: 94: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,500 INFO L273 TraceCheckUtils]: 95: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,501 INFO L273 TraceCheckUtils]: 96: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,501 INFO L273 TraceCheckUtils]: 97: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,501 INFO L273 TraceCheckUtils]: 98: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,501 INFO L273 TraceCheckUtils]: 99: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,501 INFO L273 TraceCheckUtils]: 100: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,501 INFO L273 TraceCheckUtils]: 101: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,501 INFO L273 TraceCheckUtils]: 102: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,501 INFO L273 TraceCheckUtils]: 103: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,501 INFO L273 TraceCheckUtils]: 104: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,502 INFO L273 TraceCheckUtils]: 105: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,502 INFO L273 TraceCheckUtils]: 106: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,502 INFO L273 TraceCheckUtils]: 107: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,502 INFO L273 TraceCheckUtils]: 108: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,502 INFO L273 TraceCheckUtils]: 109: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,502 INFO L273 TraceCheckUtils]: 110: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,502 INFO L273 TraceCheckUtils]: 111: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,502 INFO L273 TraceCheckUtils]: 112: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,502 INFO L273 TraceCheckUtils]: 113: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,503 INFO L273 TraceCheckUtils]: 114: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,503 INFO L273 TraceCheckUtils]: 115: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,503 INFO L273 TraceCheckUtils]: 116: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,503 INFO L273 TraceCheckUtils]: 117: Hoare triple {22898#false} assume !(~j~0 < ~edgecount~0); {22898#false} is VALID [2018-11-19 00:00:44,503 INFO L273 TraceCheckUtils]: 118: Hoare triple {22898#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22898#false} is VALID [2018-11-19 00:00:44,503 INFO L273 TraceCheckUtils]: 119: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,503 INFO L273 TraceCheckUtils]: 120: Hoare triple {22898#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {22898#false} is VALID [2018-11-19 00:00:44,503 INFO L273 TraceCheckUtils]: 121: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,503 INFO L273 TraceCheckUtils]: 122: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,503 INFO L273 TraceCheckUtils]: 123: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,504 INFO L273 TraceCheckUtils]: 124: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,504 INFO L273 TraceCheckUtils]: 125: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,504 INFO L273 TraceCheckUtils]: 126: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,504 INFO L273 TraceCheckUtils]: 127: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,504 INFO L273 TraceCheckUtils]: 128: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,504 INFO L273 TraceCheckUtils]: 129: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,504 INFO L273 TraceCheckUtils]: 130: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,504 INFO L273 TraceCheckUtils]: 131: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,504 INFO L273 TraceCheckUtils]: 132: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,505 INFO L273 TraceCheckUtils]: 133: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,505 INFO L273 TraceCheckUtils]: 134: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,505 INFO L273 TraceCheckUtils]: 135: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,505 INFO L273 TraceCheckUtils]: 136: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,505 INFO L273 TraceCheckUtils]: 137: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,505 INFO L273 TraceCheckUtils]: 138: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,505 INFO L273 TraceCheckUtils]: 139: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,505 INFO L273 TraceCheckUtils]: 140: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,505 INFO L273 TraceCheckUtils]: 141: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,506 INFO L273 TraceCheckUtils]: 142: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,506 INFO L273 TraceCheckUtils]: 143: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,506 INFO L273 TraceCheckUtils]: 144: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,506 INFO L273 TraceCheckUtils]: 145: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,506 INFO L273 TraceCheckUtils]: 146: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,506 INFO L273 TraceCheckUtils]: 147: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,506 INFO L273 TraceCheckUtils]: 148: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,506 INFO L273 TraceCheckUtils]: 149: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,506 INFO L273 TraceCheckUtils]: 150: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,507 INFO L273 TraceCheckUtils]: 151: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,507 INFO L273 TraceCheckUtils]: 152: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,507 INFO L273 TraceCheckUtils]: 153: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,507 INFO L273 TraceCheckUtils]: 154: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,507 INFO L273 TraceCheckUtils]: 155: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,507 INFO L273 TraceCheckUtils]: 156: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,507 INFO L273 TraceCheckUtils]: 157: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,507 INFO L273 TraceCheckUtils]: 158: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,507 INFO L273 TraceCheckUtils]: 159: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,507 INFO L273 TraceCheckUtils]: 160: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,508 INFO L273 TraceCheckUtils]: 161: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,508 INFO L273 TraceCheckUtils]: 162: Hoare triple {22898#false} assume !(~j~0 < ~edgecount~0); {22898#false} is VALID [2018-11-19 00:00:44,508 INFO L273 TraceCheckUtils]: 163: Hoare triple {22898#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22898#false} is VALID [2018-11-19 00:00:44,508 INFO L273 TraceCheckUtils]: 164: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,508 INFO L273 TraceCheckUtils]: 165: Hoare triple {22898#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {22898#false} is VALID [2018-11-19 00:00:44,508 INFO L273 TraceCheckUtils]: 166: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,508 INFO L273 TraceCheckUtils]: 167: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,508 INFO L273 TraceCheckUtils]: 168: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,508 INFO L273 TraceCheckUtils]: 169: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,509 INFO L273 TraceCheckUtils]: 170: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,509 INFO L273 TraceCheckUtils]: 171: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,509 INFO L273 TraceCheckUtils]: 172: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,509 INFO L273 TraceCheckUtils]: 173: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,509 INFO L273 TraceCheckUtils]: 174: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,509 INFO L273 TraceCheckUtils]: 175: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,509 INFO L273 TraceCheckUtils]: 176: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,509 INFO L273 TraceCheckUtils]: 177: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,509 INFO L273 TraceCheckUtils]: 178: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,510 INFO L273 TraceCheckUtils]: 179: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,510 INFO L273 TraceCheckUtils]: 180: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,510 INFO L273 TraceCheckUtils]: 181: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,510 INFO L273 TraceCheckUtils]: 182: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,510 INFO L273 TraceCheckUtils]: 183: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,510 INFO L273 TraceCheckUtils]: 184: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,510 INFO L273 TraceCheckUtils]: 185: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,510 INFO L273 TraceCheckUtils]: 186: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,510 INFO L273 TraceCheckUtils]: 187: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,511 INFO L273 TraceCheckUtils]: 188: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,511 INFO L273 TraceCheckUtils]: 189: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,511 INFO L273 TraceCheckUtils]: 190: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,511 INFO L273 TraceCheckUtils]: 191: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,511 INFO L273 TraceCheckUtils]: 192: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,511 INFO L273 TraceCheckUtils]: 193: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,511 INFO L273 TraceCheckUtils]: 194: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,511 INFO L273 TraceCheckUtils]: 195: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,511 INFO L273 TraceCheckUtils]: 196: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,512 INFO L273 TraceCheckUtils]: 197: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,512 INFO L273 TraceCheckUtils]: 198: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,512 INFO L273 TraceCheckUtils]: 199: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,512 INFO L273 TraceCheckUtils]: 200: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,512 INFO L273 TraceCheckUtils]: 201: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,512 INFO L273 TraceCheckUtils]: 202: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,512 INFO L273 TraceCheckUtils]: 203: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,512 INFO L273 TraceCheckUtils]: 204: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,512 INFO L273 TraceCheckUtils]: 205: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,513 INFO L273 TraceCheckUtils]: 206: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,513 INFO L273 TraceCheckUtils]: 207: Hoare triple {22898#false} assume !(~j~0 < ~edgecount~0); {22898#false} is VALID [2018-11-19 00:00:44,513 INFO L273 TraceCheckUtils]: 208: Hoare triple {22898#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22898#false} is VALID [2018-11-19 00:00:44,513 INFO L273 TraceCheckUtils]: 209: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,513 INFO L273 TraceCheckUtils]: 210: Hoare triple {22898#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {22898#false} is VALID [2018-11-19 00:00:44,513 INFO L273 TraceCheckUtils]: 211: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,513 INFO L273 TraceCheckUtils]: 212: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,514 INFO L273 TraceCheckUtils]: 213: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,514 INFO L273 TraceCheckUtils]: 214: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,514 INFO L273 TraceCheckUtils]: 215: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,514 INFO L273 TraceCheckUtils]: 216: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,514 INFO L273 TraceCheckUtils]: 217: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,514 INFO L273 TraceCheckUtils]: 218: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,514 INFO L273 TraceCheckUtils]: 219: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,514 INFO L273 TraceCheckUtils]: 220: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,514 INFO L273 TraceCheckUtils]: 221: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,515 INFO L273 TraceCheckUtils]: 222: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,515 INFO L273 TraceCheckUtils]: 223: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,515 INFO L273 TraceCheckUtils]: 224: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,515 INFO L273 TraceCheckUtils]: 225: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,515 INFO L273 TraceCheckUtils]: 226: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,515 INFO L273 TraceCheckUtils]: 227: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,515 INFO L273 TraceCheckUtils]: 228: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,515 INFO L273 TraceCheckUtils]: 229: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,515 INFO L273 TraceCheckUtils]: 230: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,516 INFO L273 TraceCheckUtils]: 231: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,516 INFO L273 TraceCheckUtils]: 232: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,516 INFO L273 TraceCheckUtils]: 233: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,516 INFO L273 TraceCheckUtils]: 234: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,516 INFO L273 TraceCheckUtils]: 235: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,516 INFO L273 TraceCheckUtils]: 236: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,516 INFO L273 TraceCheckUtils]: 237: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,516 INFO L273 TraceCheckUtils]: 238: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,516 INFO L273 TraceCheckUtils]: 239: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,517 INFO L273 TraceCheckUtils]: 240: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,517 INFO L273 TraceCheckUtils]: 241: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,517 INFO L273 TraceCheckUtils]: 242: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,517 INFO L273 TraceCheckUtils]: 243: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,517 INFO L273 TraceCheckUtils]: 244: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,517 INFO L273 TraceCheckUtils]: 245: Hoare triple {22898#false} assume !(#t~mem7 > #t~mem5 + #t~mem6);havoc #t~mem7;havoc #t~mem5;havoc #t~mem6; {22898#false} is VALID [2018-11-19 00:00:44,517 INFO L273 TraceCheckUtils]: 246: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,517 INFO L273 TraceCheckUtils]: 247: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,517 INFO L273 TraceCheckUtils]: 248: Hoare triple {22898#false} assume !!(~j~0 < ~edgecount~0);call #t~mem3 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem3;havoc #t~mem3;call #t~mem4 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem4;havoc #t~mem4;call #t~mem7 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem5 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem6 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,517 INFO L273 TraceCheckUtils]: 249: Hoare triple {22898#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem7;havoc #t~mem5;havoc #t~mem6;call #t~mem8 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem9 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4);call write~int(#t~mem8 + #t~mem9, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);havoc #t~mem9;havoc #t~mem8; {22898#false} is VALID [2018-11-19 00:00:44,518 INFO L273 TraceCheckUtils]: 250: Hoare triple {22898#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {22898#false} is VALID [2018-11-19 00:00:44,518 INFO L273 TraceCheckUtils]: 251: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,518 INFO L273 TraceCheckUtils]: 252: Hoare triple {22898#false} assume !(~j~0 < ~edgecount~0); {22898#false} is VALID [2018-11-19 00:00:44,518 INFO L273 TraceCheckUtils]: 253: Hoare triple {22898#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22898#false} is VALID [2018-11-19 00:00:44,518 INFO L273 TraceCheckUtils]: 254: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,518 INFO L273 TraceCheckUtils]: 255: Hoare triple {22898#false} assume !(~i~0 < ~nodecount~0); {22898#false} is VALID [2018-11-19 00:00:44,518 INFO L273 TraceCheckUtils]: 256: Hoare triple {22898#false} ~i~0 := 0; {22898#false} is VALID [2018-11-19 00:00:44,518 INFO L273 TraceCheckUtils]: 257: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,518 INFO L273 TraceCheckUtils]: 258: Hoare triple {22898#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,519 INFO L273 TraceCheckUtils]: 259: Hoare triple {22898#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {22898#false} is VALID [2018-11-19 00:00:44,519 INFO L273 TraceCheckUtils]: 260: Hoare triple {22898#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {22898#false} is VALID [2018-11-19 00:00:44,519 INFO L273 TraceCheckUtils]: 261: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,519 INFO L273 TraceCheckUtils]: 262: Hoare triple {22898#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,519 INFO L273 TraceCheckUtils]: 263: Hoare triple {22898#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {22898#false} is VALID [2018-11-19 00:00:44,519 INFO L273 TraceCheckUtils]: 264: Hoare triple {22898#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {22898#false} is VALID [2018-11-19 00:00:44,519 INFO L273 TraceCheckUtils]: 265: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,519 INFO L273 TraceCheckUtils]: 266: Hoare triple {22898#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,519 INFO L273 TraceCheckUtils]: 267: Hoare triple {22898#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {22898#false} is VALID [2018-11-19 00:00:44,520 INFO L273 TraceCheckUtils]: 268: Hoare triple {22898#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {22898#false} is VALID [2018-11-19 00:00:44,520 INFO L273 TraceCheckUtils]: 269: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,520 INFO L273 TraceCheckUtils]: 270: Hoare triple {22898#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,520 INFO L273 TraceCheckUtils]: 271: Hoare triple {22898#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {22898#false} is VALID [2018-11-19 00:00:44,520 INFO L273 TraceCheckUtils]: 272: Hoare triple {22898#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {22898#false} is VALID [2018-11-19 00:00:44,520 INFO L273 TraceCheckUtils]: 273: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,520 INFO L273 TraceCheckUtils]: 274: Hoare triple {22898#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,521 INFO L273 TraceCheckUtils]: 275: Hoare triple {22898#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {22898#false} is VALID [2018-11-19 00:00:44,521 INFO L273 TraceCheckUtils]: 276: Hoare triple {22898#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {22898#false} is VALID [2018-11-19 00:00:44,521 INFO L273 TraceCheckUtils]: 277: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,521 INFO L273 TraceCheckUtils]: 278: Hoare triple {22898#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,521 INFO L273 TraceCheckUtils]: 279: Hoare triple {22898#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {22898#false} is VALID [2018-11-19 00:00:44,521 INFO L273 TraceCheckUtils]: 280: Hoare triple {22898#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {22898#false} is VALID [2018-11-19 00:00:44,521 INFO L273 TraceCheckUtils]: 281: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,521 INFO L273 TraceCheckUtils]: 282: Hoare triple {22898#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,521 INFO L273 TraceCheckUtils]: 283: Hoare triple {22898#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {22898#false} is VALID [2018-11-19 00:00:44,522 INFO L273 TraceCheckUtils]: 284: Hoare triple {22898#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {22898#false} is VALID [2018-11-19 00:00:44,522 INFO L273 TraceCheckUtils]: 285: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,522 INFO L273 TraceCheckUtils]: 286: Hoare triple {22898#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,522 INFO L273 TraceCheckUtils]: 287: Hoare triple {22898#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {22898#false} is VALID [2018-11-19 00:00:44,522 INFO L273 TraceCheckUtils]: 288: Hoare triple {22898#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {22898#false} is VALID [2018-11-19 00:00:44,522 INFO L273 TraceCheckUtils]: 289: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,522 INFO L273 TraceCheckUtils]: 290: Hoare triple {22898#false} assume !!(~i~0 < ~edgecount~0);call #t~mem11 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem11;havoc #t~mem11;call #t~mem12 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem12;havoc #t~mem12;call #t~mem15 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem14 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,522 INFO L273 TraceCheckUtils]: 291: Hoare triple {22898#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem13;havoc #t~mem15;havoc #t~mem14; {22898#false} is VALID [2018-11-19 00:00:44,522 INFO L273 TraceCheckUtils]: 292: Hoare triple {22898#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {22898#false} is VALID [2018-11-19 00:00:44,522 INFO L273 TraceCheckUtils]: 293: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,523 INFO L273 TraceCheckUtils]: 294: Hoare triple {22898#false} assume !(~i~0 < ~edgecount~0); {22898#false} is VALID [2018-11-19 00:00:44,523 INFO L273 TraceCheckUtils]: 295: Hoare triple {22898#false} ~i~0 := 0; {22898#false} is VALID [2018-11-19 00:00:44,523 INFO L273 TraceCheckUtils]: 296: Hoare triple {22898#false} assume true; {22898#false} is VALID [2018-11-19 00:00:44,523 INFO L273 TraceCheckUtils]: 297: Hoare triple {22898#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {22898#false} is VALID [2018-11-19 00:00:44,523 INFO L256 TraceCheckUtils]: 298: Hoare triple {22898#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {22898#false} is VALID [2018-11-19 00:00:44,523 INFO L273 TraceCheckUtils]: 299: Hoare triple {22898#false} ~cond := #in~cond; {22898#false} is VALID [2018-11-19 00:00:44,523 INFO L273 TraceCheckUtils]: 300: Hoare triple {22898#false} assume 0 == ~cond; {22898#false} is VALID [2018-11-19 00:00:44,523 INFO L273 TraceCheckUtils]: 301: Hoare triple {22898#false} assume !false; {22898#false} is VALID [2018-11-19 00:00:44,570 INFO L134 CoverageAnalysis]: Checked inductivity of 5672 backedges. 1778 proven. 200 refuted. 0 times theorem prover too weak. 3694 trivial. 0 not checked. [2018-11-19 00:00:44,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:00:44,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 14] total 35 [2018-11-19 00:00:44,591 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 302 [2018-11-19 00:00:44,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:00:44,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-19 00:00:44,788 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:00:44,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-19 00:00:44,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-19 00:00:44,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=963, Unknown=0, NotChecked=0, Total=1190 [2018-11-19 00:00:44,789 INFO L87 Difference]: Start difference. First operand 576 states and 690 transitions. Second operand 35 states. [2018-11-19 00:00:53,688 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-19 00:01:01,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:01:01,517 INFO L93 Difference]: Finished difference Result 1803 states and 2234 transitions. [2018-11-19 00:01:01,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-11-19 00:01:01,517 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 302 [2018-11-19 00:01:01,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:01:01,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-19 00:01:01,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 933 transitions. [2018-11-19 00:01:01,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-19 00:01:01,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 933 transitions. [2018-11-19 00:01:01,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 145 states and 933 transitions. [2018-11-19 00:01:03,012 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 933 edges. 933 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:01:03,098 INFO L225 Difference]: With dead ends: 1803 [2018-11-19 00:01:03,098 INFO L226 Difference]: Without dead ends: 1339 [2018-11-19 00:01:03,106 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10717 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=4503, Invalid=26649, Unknown=0, NotChecked=0, Total=31152 [2018-11-19 00:01:03,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states.