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/AutomizerCInline_WitnessPrinter.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-61f4311 [2018-11-23 13:03:08,304 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:03:08,310 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:03:08,325 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:03:08,326 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:03:08,327 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:03:08,328 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:03:08,330 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:03:08,332 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:03:08,333 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:03:08,334 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:03:08,334 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:03:08,335 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:03:08,336 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:03:08,337 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:03:08,338 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:03:08,339 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:03:08,341 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:03:08,343 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:03:08,347 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:03:08,348 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:03:08,349 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:03:08,354 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:03:08,354 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:03:08,354 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:03:08,359 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:03:08,363 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:03:08,364 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:03:08,364 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:03:08,365 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:03:08,366 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:03:08,367 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:03:08,367 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:03:08,368 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:03:08,370 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:03:08,370 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:03:08,371 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-23 13:03:08,388 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:03:08,388 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:03:08,392 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:03:08,392 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:03:08,393 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:03:08,393 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:03:08,393 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:03:08,393 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:03:08,394 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:03:08,394 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:03:08,394 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:03:08,394 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:03:08,394 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:03:08,395 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:03:08,396 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:03:08,396 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:03:08,396 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:03:08,396 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:03:08,396 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:03:08,397 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:03:08,397 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:03:08,397 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:03:08,397 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:03:08,397 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:03:08,398 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:03:08,398 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:03:08,398 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:03:08,398 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:03:08,398 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:03:08,399 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:03:08,399 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:03:08,456 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:03:08,471 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:03:08,475 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:03:08,477 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:03:08,478 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:03:08,479 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-23 13:03:08,545 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bd494847/e144b458451a4f2083ba1b112134b150/FLAG629e8df01 [2018-11-23 13:03:08,982 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:03:08,983 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01_true-unreach-call.i [2018-11-23 13:03:08,990 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bd494847/e144b458451a4f2083ba1b112134b150/FLAG629e8df01 [2018-11-23 13:03:09,355 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bd494847/e144b458451a4f2083ba1b112134b150 [2018-11-23 13:03:09,365 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:03:09,367 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:03:09,367 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:03:09,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:03:09,372 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:03:09,373 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:03:09" (1/1) ... [2018-11-23 13:03:09,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d22123d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:09, skipping insertion in model container [2018-11-23 13:03:09,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:03:09" (1/1) ... [2018-11-23 13:03:09,387 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:03:09,416 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:03:09,686 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:03:09,691 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:03:09,744 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:03:09,767 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:03:09,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:09 WrapperNode [2018-11-23 13:03:09,768 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:03:09,769 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:03:09,769 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:03:09,769 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:03:09,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:09" (1/1) ... [2018-11-23 13:03:09,792 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:09" (1/1) ... [2018-11-23 13:03:09,805 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:03:09,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:03:09,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:03:09,806 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:03:09,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:09" (1/1) ... [2018-11-23 13:03:09,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:09" (1/1) ... [2018-11-23 13:03:09,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:09" (1/1) ... [2018-11-23 13:03:09,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:09" (1/1) ... [2018-11-23 13:03:09,851 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:09" (1/1) ... [2018-11-23 13:03:09,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:09" (1/1) ... [2018-11-23 13:03:09,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:09" (1/1) ... [2018-11-23 13:03:09,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:03:09,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:03:09,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:03:09,870 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:03:09,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:09" (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-23 13:03:09,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:03:09,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:03:09,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:03:09,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:03:09,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:03:09,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:03:09,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:03:09,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-23 13:03:09,998 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:03:09,998 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:03:09,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:03:09,998 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:03:09,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:03:11,035 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:03:11,036 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 13:03:11,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:03:11 BoogieIcfgContainer [2018-11-23 13:03:11,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:03:11,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:03:11,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:03:11,041 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:03:11,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:03:09" (1/3) ... [2018-11-23 13:03:11,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1235bf97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:03:11, skipping insertion in model container [2018-11-23 13:03:11,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:09" (2/3) ... [2018-11-23 13:03:11,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1235bf97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:03:11, skipping insertion in model container [2018-11-23 13:03:11,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:03:11" (3/3) ... [2018-11-23 13:03:11,045 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_01_true-unreach-call.i [2018-11-23 13:03:11,055 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:03:11,063 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:03:11,081 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:03:11,113 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:03:11,114 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:03:11,114 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:03:11,114 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:03:11,114 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:03:11,115 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:03:11,115 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:03:11,115 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:03:11,115 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:03:11,132 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-11-23 13:03:11,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:03:11,139 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:11,140 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:11,142 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:11,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:11,149 INFO L82 PathProgramCache]: Analyzing trace with hash 288590464, now seen corresponding path program 1 times [2018-11-23 13:03:11,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:11,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:11,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:11,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:11,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:11,362 INFO L256 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {38#true} is VALID [2018-11-23 13:03:11,367 INFO L273 TraceCheckUtils]: 1: Hoare triple {38#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {38#true} is VALID [2018-11-23 13:03:11,368 INFO L273 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2018-11-23 13:03:11,368 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #103#return; {38#true} is VALID [2018-11-23 13:03:11,368 INFO L256 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret18 := main(); {38#true} is VALID [2018-11-23 13:03:11,369 INFO L273 TraceCheckUtils]: 5: Hoare triple {38#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {38#true} is VALID [2018-11-23 13:03:11,378 INFO L273 TraceCheckUtils]: 6: Hoare triple {38#true} assume !true; {39#false} is VALID [2018-11-23 13:03:11,378 INFO L273 TraceCheckUtils]: 7: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2018-11-23 13:03:11,379 INFO L273 TraceCheckUtils]: 8: Hoare triple {39#false} assume !true; {39#false} is VALID [2018-11-23 13:03:11,379 INFO L273 TraceCheckUtils]: 9: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2018-11-23 13:03:11,379 INFO L273 TraceCheckUtils]: 10: Hoare triple {39#false} assume !true; {39#false} is VALID [2018-11-23 13:03:11,380 INFO L273 TraceCheckUtils]: 11: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2018-11-23 13:03:11,380 INFO L273 TraceCheckUtils]: 12: Hoare triple {39#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {39#false} is VALID [2018-11-23 13:03:11,380 INFO L256 TraceCheckUtils]: 13: Hoare triple {39#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {39#false} is VALID [2018-11-23 13:03:11,381 INFO L273 TraceCheckUtils]: 14: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2018-11-23 13:03:11,381 INFO L273 TraceCheckUtils]: 15: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2018-11-23 13:03:11,381 INFO L273 TraceCheckUtils]: 16: Hoare triple {39#false} assume !false; {39#false} is VALID [2018-11-23 13:03:11,385 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-23 13:03:11,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:11,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:03:11,393 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 13:03:11,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:11,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:03:11,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:11,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:03:11,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:03:11,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:03:11,498 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2018-11-23 13:03:11,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:11,839 INFO L93 Difference]: Finished difference Result 61 states and 85 transitions. [2018-11-23 13:03:11,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:03:11,839 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 13:03:11,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:11,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:03:11,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 85 transitions. [2018-11-23 13:03:11,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:03:11,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 85 transitions. [2018-11-23 13:03:11,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 85 transitions. [2018-11-23 13:03:12,190 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-23 13:03:12,203 INFO L225 Difference]: With dead ends: 61 [2018-11-23 13:03:12,203 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 13:03:12,207 INFO L631 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-23 13:03:12,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 13:03:12,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 13:03:12,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:12,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-23 13:03:12,252 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 13:03:12,252 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 13:03:12,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:12,257 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2018-11-23 13:03:12,257 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2018-11-23 13:03:12,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:12,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:12,258 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 13:03:12,258 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 13:03:12,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:12,263 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2018-11-23 13:03:12,263 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2018-11-23 13:03:12,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:12,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:12,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:12,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:12,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:03:12,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2018-11-23 13:03:12,270 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 17 [2018-11-23 13:03:12,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:12,270 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2018-11-23 13:03:12,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:03:12,270 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2018-11-23 13:03:12,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:03:12,272 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:12,272 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:12,272 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:12,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:12,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1211863700, now seen corresponding path program 1 times [2018-11-23 13:03:12,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:12,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:12,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:12,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:12,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:12,523 INFO L256 TraceCheckUtils]: 0: Hoare triple {221#true} call ULTIMATE.init(); {221#true} is VALID [2018-11-23 13:03:12,524 INFO L273 TraceCheckUtils]: 1: Hoare triple {221#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {221#true} is VALID [2018-11-23 13:03:12,524 INFO L273 TraceCheckUtils]: 2: Hoare triple {221#true} assume true; {221#true} is VALID [2018-11-23 13:03:12,525 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {221#true} {221#true} #103#return; {221#true} is VALID [2018-11-23 13:03:12,525 INFO L256 TraceCheckUtils]: 4: Hoare triple {221#true} call #t~ret18 := main(); {221#true} is VALID [2018-11-23 13:03:12,545 INFO L273 TraceCheckUtils]: 5: Hoare triple {221#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {223#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-23 13:03:12,546 INFO L273 TraceCheckUtils]: 6: Hoare triple {223#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume !(~i~0 < ~nodecount~0); {222#false} is VALID [2018-11-23 13:03:12,546 INFO L273 TraceCheckUtils]: 7: Hoare triple {222#false} ~i~0 := 0; {222#false} is VALID [2018-11-23 13:03:12,547 INFO L273 TraceCheckUtils]: 8: Hoare triple {222#false} assume !(~i~0 < ~nodecount~0); {222#false} is VALID [2018-11-23 13:03:12,547 INFO L273 TraceCheckUtils]: 9: Hoare triple {222#false} ~i~0 := 0; {222#false} is VALID [2018-11-23 13:03:12,547 INFO L273 TraceCheckUtils]: 10: Hoare triple {222#false} assume !(~i~0 < ~edgecount~0); {222#false} is VALID [2018-11-23 13:03:12,548 INFO L273 TraceCheckUtils]: 11: Hoare triple {222#false} ~i~0 := 0; {222#false} is VALID [2018-11-23 13:03:12,548 INFO L273 TraceCheckUtils]: 12: Hoare triple {222#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {222#false} is VALID [2018-11-23 13:03:12,548 INFO L256 TraceCheckUtils]: 13: Hoare triple {222#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {222#false} is VALID [2018-11-23 13:03:12,548 INFO L273 TraceCheckUtils]: 14: Hoare triple {222#false} ~cond := #in~cond; {222#false} is VALID [2018-11-23 13:03:12,549 INFO L273 TraceCheckUtils]: 15: Hoare triple {222#false} assume 0 == ~cond; {222#false} is VALID [2018-11-23 13:03:12,549 INFO L273 TraceCheckUtils]: 16: Hoare triple {222#false} assume !false; {222#false} is VALID [2018-11-23 13:03:12,551 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-23 13:03:12,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:12,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:03:12,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 13:03:12,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:12,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:03:12,757 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:12,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:03:12,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:03:12,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:03:12,759 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 3 states. [2018-11-23 13:03:13,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:13,097 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2018-11-23 13:03:13,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:03:13,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 13:03:13,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:13,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:03:13,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-23 13:03:13,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:03:13,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-23 13:03:13,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2018-11-23 13:03:13,223 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:13,226 INFO L225 Difference]: With dead ends: 54 [2018-11-23 13:03:13,226 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 13:03:13,228 INFO L631 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-23 13:03:13,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 13:03:13,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-11-23 13:03:13,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:13,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 31 states. [2018-11-23 13:03:13,249 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 31 states. [2018-11-23 13:03:13,249 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 31 states. [2018-11-23 13:03:13,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:13,252 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2018-11-23 13:03:13,252 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2018-11-23 13:03:13,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:13,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:13,253 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 33 states. [2018-11-23 13:03:13,254 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 33 states. [2018-11-23 13:03:13,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:13,257 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2018-11-23 13:03:13,257 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2018-11-23 13:03:13,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:13,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:13,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:13,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:13,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:03:13,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2018-11-23 13:03:13,261 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 17 [2018-11-23 13:03:13,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:13,261 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2018-11-23 13:03:13,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:03:13,262 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2018-11-23 13:03:13,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:03:13,263 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:13,263 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:13,263 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:13,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:13,264 INFO L82 PathProgramCache]: Analyzing trace with hash 151989727, now seen corresponding path program 1 times [2018-11-23 13:03:13,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:13,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:13,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:13,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:13,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:13,423 INFO L256 TraceCheckUtils]: 0: Hoare triple {407#true} call ULTIMATE.init(); {407#true} is VALID [2018-11-23 13:03:13,424 INFO L273 TraceCheckUtils]: 1: Hoare triple {407#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {407#true} is VALID [2018-11-23 13:03:13,424 INFO L273 TraceCheckUtils]: 2: Hoare triple {407#true} assume true; {407#true} is VALID [2018-11-23 13:03:13,424 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {407#true} {407#true} #103#return; {407#true} is VALID [2018-11-23 13:03:13,425 INFO L256 TraceCheckUtils]: 4: Hoare triple {407#true} call #t~ret18 := main(); {407#true} is VALID [2018-11-23 13:03:13,438 INFO L273 TraceCheckUtils]: 5: Hoare triple {407#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {409#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-23 13:03:13,451 INFO L273 TraceCheckUtils]: 6: Hoare triple {409#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {409#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-23 13:03:13,463 INFO L273 TraceCheckUtils]: 7: Hoare triple {409#(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); {409#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-23 13:03:13,464 INFO L273 TraceCheckUtils]: 8: Hoare triple {409#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {410#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-23 13:03:13,466 INFO L273 TraceCheckUtils]: 9: Hoare triple {410#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {408#false} is VALID [2018-11-23 13:03:13,466 INFO L273 TraceCheckUtils]: 10: Hoare triple {408#false} ~i~0 := 0; {408#false} is VALID [2018-11-23 13:03:13,466 INFO L273 TraceCheckUtils]: 11: Hoare triple {408#false} assume !(~i~0 < ~nodecount~0); {408#false} is VALID [2018-11-23 13:03:13,467 INFO L273 TraceCheckUtils]: 12: Hoare triple {408#false} ~i~0 := 0; {408#false} is VALID [2018-11-23 13:03:13,467 INFO L273 TraceCheckUtils]: 13: Hoare triple {408#false} assume !(~i~0 < ~edgecount~0); {408#false} is VALID [2018-11-23 13:03:13,467 INFO L273 TraceCheckUtils]: 14: Hoare triple {408#false} ~i~0 := 0; {408#false} is VALID [2018-11-23 13:03:13,468 INFO L273 TraceCheckUtils]: 15: Hoare triple {408#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {408#false} is VALID [2018-11-23 13:03:13,468 INFO L256 TraceCheckUtils]: 16: Hoare triple {408#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {408#false} is VALID [2018-11-23 13:03:13,469 INFO L273 TraceCheckUtils]: 17: Hoare triple {408#false} ~cond := #in~cond; {408#false} is VALID [2018-11-23 13:03:13,469 INFO L273 TraceCheckUtils]: 18: Hoare triple {408#false} assume 0 == ~cond; {408#false} is VALID [2018-11-23 13:03:13,470 INFO L273 TraceCheckUtils]: 19: Hoare triple {408#false} assume !false; {408#false} is VALID [2018-11-23 13:03:13,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:13,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:13,472 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-23 13:03:13,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:13,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:13,732 INFO L256 TraceCheckUtils]: 0: Hoare triple {407#true} call ULTIMATE.init(); {407#true} is VALID [2018-11-23 13:03:13,733 INFO L273 TraceCheckUtils]: 1: Hoare triple {407#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {407#true} is VALID [2018-11-23 13:03:13,733 INFO L273 TraceCheckUtils]: 2: Hoare triple {407#true} assume true; {407#true} is VALID [2018-11-23 13:03:13,733 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {407#true} {407#true} #103#return; {407#true} is VALID [2018-11-23 13:03:13,734 INFO L256 TraceCheckUtils]: 4: Hoare triple {407#true} call #t~ret18 := main(); {407#true} is VALID [2018-11-23 13:03:13,738 INFO L273 TraceCheckUtils]: 5: Hoare triple {407#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {429#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:03:13,739 INFO L273 TraceCheckUtils]: 6: Hoare triple {429#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {429#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:03:13,740 INFO L273 TraceCheckUtils]: 7: Hoare triple {429#(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); {429#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:03:13,745 INFO L273 TraceCheckUtils]: 8: Hoare triple {429#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {439#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:03:13,747 INFO L273 TraceCheckUtils]: 9: Hoare triple {439#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} assume !(~i~0 < ~nodecount~0); {408#false} is VALID [2018-11-23 13:03:13,747 INFO L273 TraceCheckUtils]: 10: Hoare triple {408#false} ~i~0 := 0; {408#false} is VALID [2018-11-23 13:03:13,747 INFO L273 TraceCheckUtils]: 11: Hoare triple {408#false} assume !(~i~0 < ~nodecount~0); {408#false} is VALID [2018-11-23 13:03:13,748 INFO L273 TraceCheckUtils]: 12: Hoare triple {408#false} ~i~0 := 0; {408#false} is VALID [2018-11-23 13:03:13,748 INFO L273 TraceCheckUtils]: 13: Hoare triple {408#false} assume !(~i~0 < ~edgecount~0); {408#false} is VALID [2018-11-23 13:03:13,748 INFO L273 TraceCheckUtils]: 14: Hoare triple {408#false} ~i~0 := 0; {408#false} is VALID [2018-11-23 13:03:13,748 INFO L273 TraceCheckUtils]: 15: Hoare triple {408#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {408#false} is VALID [2018-11-23 13:03:13,749 INFO L256 TraceCheckUtils]: 16: Hoare triple {408#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {408#false} is VALID [2018-11-23 13:03:13,749 INFO L273 TraceCheckUtils]: 17: Hoare triple {408#false} ~cond := #in~cond; {408#false} is VALID [2018-11-23 13:03:13,749 INFO L273 TraceCheckUtils]: 18: Hoare triple {408#false} assume 0 == ~cond; {408#false} is VALID [2018-11-23 13:03:13,749 INFO L273 TraceCheckUtils]: 19: Hoare triple {408#false} assume !false; {408#false} is VALID [2018-11-23 13:03:13,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:13,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:13,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 13:03:13,772 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 13:03:13,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:13,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:03:13,921 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:13,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:03:13,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:03:13,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:03:13,923 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 6 states. [2018-11-23 13:03:14,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:14,405 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2018-11-23 13:03:14,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:03:14,405 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 13:03:14,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:14,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:03:14,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2018-11-23 13:03:14,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:03:14,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2018-11-23 13:03:14,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2018-11-23 13:03:14,534 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:14,536 INFO L225 Difference]: With dead ends: 57 [2018-11-23 13:03:14,536 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 13:03:14,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:03:14,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 13:03:14,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-23 13:03:14,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:14,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 34 states. [2018-11-23 13:03:14,574 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 34 states. [2018-11-23 13:03:14,574 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 34 states. [2018-11-23 13:03:14,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:14,578 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-11-23 13:03:14,578 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-23 13:03:14,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:14,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:14,579 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 36 states. [2018-11-23 13:03:14,579 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 36 states. [2018-11-23 13:03:14,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:14,582 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-11-23 13:03:14,582 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-23 13:03:14,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:14,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:14,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:14,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:14,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 13:03:14,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-11-23 13:03:14,586 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 20 [2018-11-23 13:03:14,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:14,586 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-11-23 13:03:14,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:03:14,587 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-11-23 13:03:14,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:03:14,588 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:14,588 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:14,588 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:14,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:14,589 INFO L82 PathProgramCache]: Analyzing trace with hash 2046020276, now seen corresponding path program 2 times [2018-11-23 13:03:14,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:14,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:14,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:14,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:14,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:14,839 INFO L256 TraceCheckUtils]: 0: Hoare triple {667#true} call ULTIMATE.init(); {667#true} is VALID [2018-11-23 13:03:14,839 INFO L273 TraceCheckUtils]: 1: Hoare triple {667#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {667#true} is VALID [2018-11-23 13:03:14,840 INFO L273 TraceCheckUtils]: 2: Hoare triple {667#true} assume true; {667#true} is VALID [2018-11-23 13:03:14,840 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {667#true} {667#true} #103#return; {667#true} is VALID [2018-11-23 13:03:14,841 INFO L256 TraceCheckUtils]: 4: Hoare triple {667#true} call #t~ret18 := main(); {667#true} is VALID [2018-11-23 13:03:14,851 INFO L273 TraceCheckUtils]: 5: Hoare triple {667#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {669#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-23 13:03:14,852 INFO L273 TraceCheckUtils]: 6: Hoare triple {669#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0); {669#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-23 13:03:14,855 INFO L273 TraceCheckUtils]: 7: Hoare triple {669#(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); {669#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-23 13:03:14,857 INFO L273 TraceCheckUtils]: 8: Hoare triple {669#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {670#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} is VALID [2018-11-23 13:03:14,857 INFO L273 TraceCheckUtils]: 9: Hoare triple {670#(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); {670#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} is VALID [2018-11-23 13:03:14,860 INFO L273 TraceCheckUtils]: 10: Hoare triple {670#(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); {671#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-23 13:03:14,860 INFO L273 TraceCheckUtils]: 11: Hoare triple {671#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {672#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-23 13:03:14,862 INFO L273 TraceCheckUtils]: 12: Hoare triple {672#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {668#false} is VALID [2018-11-23 13:03:14,862 INFO L273 TraceCheckUtils]: 13: Hoare triple {668#false} ~i~0 := 0; {668#false} is VALID [2018-11-23 13:03:14,863 INFO L273 TraceCheckUtils]: 14: Hoare triple {668#false} assume !(~i~0 < ~nodecount~0); {668#false} is VALID [2018-11-23 13:03:14,863 INFO L273 TraceCheckUtils]: 15: Hoare triple {668#false} ~i~0 := 0; {668#false} is VALID [2018-11-23 13:03:14,863 INFO L273 TraceCheckUtils]: 16: Hoare triple {668#false} assume !(~i~0 < ~edgecount~0); {668#false} is VALID [2018-11-23 13:03:14,864 INFO L273 TraceCheckUtils]: 17: Hoare triple {668#false} ~i~0 := 0; {668#false} is VALID [2018-11-23 13:03:14,864 INFO L273 TraceCheckUtils]: 18: Hoare triple {668#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {668#false} is VALID [2018-11-23 13:03:14,864 INFO L256 TraceCheckUtils]: 19: Hoare triple {668#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {668#false} is VALID [2018-11-23 13:03:14,865 INFO L273 TraceCheckUtils]: 20: Hoare triple {668#false} ~cond := #in~cond; {668#false} is VALID [2018-11-23 13:03:14,865 INFO L273 TraceCheckUtils]: 21: Hoare triple {668#false} assume 0 == ~cond; {668#false} is VALID [2018-11-23 13:03:14,865 INFO L273 TraceCheckUtils]: 22: Hoare triple {668#false} assume !false; {668#false} is VALID [2018-11-23 13:03:14,867 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:14,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:14,867 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-23 13:03:14,876 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:03:14,924 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 13:03:14,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:14,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:15,278 INFO L256 TraceCheckUtils]: 0: Hoare triple {667#true} call ULTIMATE.init(); {667#true} is VALID [2018-11-23 13:03:15,278 INFO L273 TraceCheckUtils]: 1: Hoare triple {667#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {667#true} is VALID [2018-11-23 13:03:15,278 INFO L273 TraceCheckUtils]: 2: Hoare triple {667#true} assume true; {667#true} is VALID [2018-11-23 13:03:15,279 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {667#true} {667#true} #103#return; {667#true} is VALID [2018-11-23 13:03:15,279 INFO L256 TraceCheckUtils]: 4: Hoare triple {667#true} call #t~ret18 := main(); {667#true} is VALID [2018-11-23 13:03:15,294 INFO L273 TraceCheckUtils]: 5: Hoare triple {667#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {691#(<= 5 main_~nodecount~0)} is VALID [2018-11-23 13:03:15,307 INFO L273 TraceCheckUtils]: 6: Hoare triple {691#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {691#(<= 5 main_~nodecount~0)} is VALID [2018-11-23 13:03:15,320 INFO L273 TraceCheckUtils]: 7: Hoare triple {691#(<= 5 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {691#(<= 5 main_~nodecount~0)} is VALID [2018-11-23 13:03:15,333 INFO L273 TraceCheckUtils]: 8: Hoare triple {691#(<= 5 main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {691#(<= 5 main_~nodecount~0)} is VALID [2018-11-23 13:03:15,345 INFO L273 TraceCheckUtils]: 9: Hoare triple {691#(<= 5 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {691#(<= 5 main_~nodecount~0)} is VALID [2018-11-23 13:03:15,360 INFO L273 TraceCheckUtils]: 10: Hoare triple {691#(<= 5 main_~nodecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {691#(<= 5 main_~nodecount~0)} is VALID [2018-11-23 13:03:15,369 INFO L273 TraceCheckUtils]: 11: Hoare triple {691#(<= 5 main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {691#(<= 5 main_~nodecount~0)} is VALID [2018-11-23 13:03:15,382 INFO L273 TraceCheckUtils]: 12: Hoare triple {691#(<= 5 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {691#(<= 5 main_~nodecount~0)} is VALID [2018-11-23 13:03:15,395 INFO L273 TraceCheckUtils]: 13: Hoare triple {691#(<= 5 main_~nodecount~0)} ~i~0 := 0; {716#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:03:15,396 INFO L273 TraceCheckUtils]: 14: Hoare triple {716#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} assume !(~i~0 < ~nodecount~0); {668#false} is VALID [2018-11-23 13:03:15,396 INFO L273 TraceCheckUtils]: 15: Hoare triple {668#false} ~i~0 := 0; {668#false} is VALID [2018-11-23 13:03:15,397 INFO L273 TraceCheckUtils]: 16: Hoare triple {668#false} assume !(~i~0 < ~edgecount~0); {668#false} is VALID [2018-11-23 13:03:15,397 INFO L273 TraceCheckUtils]: 17: Hoare triple {668#false} ~i~0 := 0; {668#false} is VALID [2018-11-23 13:03:15,397 INFO L273 TraceCheckUtils]: 18: Hoare triple {668#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {668#false} is VALID [2018-11-23 13:03:15,398 INFO L256 TraceCheckUtils]: 19: Hoare triple {668#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {668#false} is VALID [2018-11-23 13:03:15,398 INFO L273 TraceCheckUtils]: 20: Hoare triple {668#false} ~cond := #in~cond; {668#false} is VALID [2018-11-23 13:03:15,398 INFO L273 TraceCheckUtils]: 21: Hoare triple {668#false} assume 0 == ~cond; {668#false} is VALID [2018-11-23 13:03:15,398 INFO L273 TraceCheckUtils]: 22: Hoare triple {668#false} assume !false; {668#false} is VALID [2018-11-23 13:03:15,399 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 13:03:15,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:03:15,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-11-23 13:03:15,422 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-23 13:03:15,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:15,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:03:15,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:15,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:03:15,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:03:15,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:03:15,541 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 8 states. [2018-11-23 13:03:16,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:16,174 INFO L93 Difference]: Finished difference Result 90 states and 115 transitions. [2018-11-23 13:03:16,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:03:16,174 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-23 13:03:16,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:16,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:03:16,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2018-11-23 13:03:16,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:03:16,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2018-11-23 13:03:16,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 111 transitions. [2018-11-23 13:03:16,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:16,361 INFO L225 Difference]: With dead ends: 90 [2018-11-23 13:03:16,361 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 13:03:16,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:03:16,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 13:03:16,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 40. [2018-11-23 13:03:16,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:16,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 40 states. [2018-11-23 13:03:16,435 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 40 states. [2018-11-23 13:03:16,436 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 40 states. [2018-11-23 13:03:16,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:16,441 INFO L93 Difference]: Finished difference Result 64 states and 79 transitions. [2018-11-23 13:03:16,442 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2018-11-23 13:03:16,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:16,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:16,443 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 64 states. [2018-11-23 13:03:16,443 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 64 states. [2018-11-23 13:03:16,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:16,448 INFO L93 Difference]: Finished difference Result 64 states and 79 transitions. [2018-11-23 13:03:16,450 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2018-11-23 13:03:16,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:16,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:16,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:16,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:16,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 13:03:16,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-23 13:03:16,459 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 23 [2018-11-23 13:03:16,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:16,461 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-23 13:03:16,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:03:16,461 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 13:03:16,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 13:03:16,462 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:16,462 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:16,463 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:16,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:16,463 INFO L82 PathProgramCache]: Analyzing trace with hash 923171222, now seen corresponding path program 1 times [2018-11-23 13:03:16,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:16,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:16,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:16,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:03:16,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:16,612 INFO L256 TraceCheckUtils]: 0: Hoare triple {1053#true} call ULTIMATE.init(); {1053#true} is VALID [2018-11-23 13:03:16,612 INFO L273 TraceCheckUtils]: 1: Hoare triple {1053#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {1053#true} is VALID [2018-11-23 13:03:16,613 INFO L273 TraceCheckUtils]: 2: Hoare triple {1053#true} assume true; {1053#true} is VALID [2018-11-23 13:03:16,613 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1053#true} {1053#true} #103#return; {1053#true} is VALID [2018-11-23 13:03:16,613 INFO L256 TraceCheckUtils]: 4: Hoare triple {1053#true} call #t~ret18 := main(); {1053#true} is VALID [2018-11-23 13:03:16,628 INFO L273 TraceCheckUtils]: 5: Hoare triple {1053#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {1055#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-23 13:03:16,629 INFO L273 TraceCheckUtils]: 6: Hoare triple {1055#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {1055#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-23 13:03:16,634 INFO L273 TraceCheckUtils]: 7: Hoare triple {1055#(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); {1055#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-23 13:03:16,637 INFO L273 TraceCheckUtils]: 8: Hoare triple {1055#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1056#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-23 13:03:16,638 INFO L273 TraceCheckUtils]: 9: Hoare triple {1056#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {1056#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-23 13:03:16,642 INFO L273 TraceCheckUtils]: 10: Hoare triple {1056#(<= (+ 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); {1056#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-23 13:03:16,644 INFO L273 TraceCheckUtils]: 11: Hoare triple {1056#(<= (+ main_~i~0 4) main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1057#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-23 13:03:16,644 INFO L273 TraceCheckUtils]: 12: Hoare triple {1057#(<= (+ main_~i~0 3) main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {1054#false} is VALID [2018-11-23 13:03:16,645 INFO L273 TraceCheckUtils]: 13: Hoare triple {1054#false} ~i~0 := 0; {1054#false} is VALID [2018-11-23 13:03:16,645 INFO L273 TraceCheckUtils]: 14: Hoare triple {1054#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1054#false} is VALID [2018-11-23 13:03:16,645 INFO L273 TraceCheckUtils]: 15: Hoare triple {1054#false} assume !(~j~0 < ~edgecount~0); {1054#false} is VALID [2018-11-23 13:03:16,645 INFO L273 TraceCheckUtils]: 16: Hoare triple {1054#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1054#false} is VALID [2018-11-23 13:03:16,645 INFO L273 TraceCheckUtils]: 17: Hoare triple {1054#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1054#false} is VALID [2018-11-23 13:03:16,646 INFO L273 TraceCheckUtils]: 18: Hoare triple {1054#false} assume !(~j~0 < ~edgecount~0); {1054#false} is VALID [2018-11-23 13:03:16,646 INFO L273 TraceCheckUtils]: 19: Hoare triple {1054#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1054#false} is VALID [2018-11-23 13:03:16,646 INFO L273 TraceCheckUtils]: 20: Hoare triple {1054#false} assume !(~i~0 < ~nodecount~0); {1054#false} is VALID [2018-11-23 13:03:16,646 INFO L273 TraceCheckUtils]: 21: Hoare triple {1054#false} ~i~0 := 0; {1054#false} is VALID [2018-11-23 13:03:16,647 INFO L273 TraceCheckUtils]: 22: Hoare triple {1054#false} assume !(~i~0 < ~edgecount~0); {1054#false} is VALID [2018-11-23 13:03:16,647 INFO L273 TraceCheckUtils]: 23: Hoare triple {1054#false} ~i~0 := 0; {1054#false} is VALID [2018-11-23 13:03:16,647 INFO L273 TraceCheckUtils]: 24: Hoare triple {1054#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1054#false} is VALID [2018-11-23 13:03:16,647 INFO L256 TraceCheckUtils]: 25: Hoare triple {1054#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {1054#false} is VALID [2018-11-23 13:03:16,647 INFO L273 TraceCheckUtils]: 26: Hoare triple {1054#false} ~cond := #in~cond; {1054#false} is VALID [2018-11-23 13:03:16,648 INFO L273 TraceCheckUtils]: 27: Hoare triple {1054#false} assume 0 == ~cond; {1054#false} is VALID [2018-11-23 13:03:16,648 INFO L273 TraceCheckUtils]: 28: Hoare triple {1054#false} assume !false; {1054#false} is VALID [2018-11-23 13:03:16,649 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 13:03:16,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:16,650 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-23 13:03:16,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:16,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:16,891 INFO L256 TraceCheckUtils]: 0: Hoare triple {1053#true} call ULTIMATE.init(); {1053#true} is VALID [2018-11-23 13:03:16,891 INFO L273 TraceCheckUtils]: 1: Hoare triple {1053#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {1053#true} is VALID [2018-11-23 13:03:16,892 INFO L273 TraceCheckUtils]: 2: Hoare triple {1053#true} assume true; {1053#true} is VALID [2018-11-23 13:03:16,892 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1053#true} {1053#true} #103#return; {1053#true} is VALID [2018-11-23 13:03:16,892 INFO L256 TraceCheckUtils]: 4: Hoare triple {1053#true} call #t~ret18 := main(); {1053#true} is VALID [2018-11-23 13:03:16,898 INFO L273 TraceCheckUtils]: 5: Hoare triple {1053#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {1076#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:03:16,899 INFO L273 TraceCheckUtils]: 6: Hoare triple {1076#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {1076#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:03:16,900 INFO L273 TraceCheckUtils]: 7: Hoare triple {1076#(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); {1076#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:03:16,901 INFO L273 TraceCheckUtils]: 8: Hoare triple {1076#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1086#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:03:16,911 INFO L273 TraceCheckUtils]: 9: Hoare triple {1086#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} assume !!(~i~0 < ~nodecount~0); {1086#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:03:16,913 INFO L273 TraceCheckUtils]: 10: Hoare triple {1086#(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); {1086#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:03:16,913 INFO L273 TraceCheckUtils]: 11: Hoare triple {1086#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1096#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2018-11-23 13:03:16,914 INFO L273 TraceCheckUtils]: 12: Hoare triple {1096#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !(~i~0 < ~nodecount~0); {1054#false} is VALID [2018-11-23 13:03:16,914 INFO L273 TraceCheckUtils]: 13: Hoare triple {1054#false} ~i~0 := 0; {1054#false} is VALID [2018-11-23 13:03:16,914 INFO L273 TraceCheckUtils]: 14: Hoare triple {1054#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1054#false} is VALID [2018-11-23 13:03:16,915 INFO L273 TraceCheckUtils]: 15: Hoare triple {1054#false} assume !(~j~0 < ~edgecount~0); {1054#false} is VALID [2018-11-23 13:03:16,915 INFO L273 TraceCheckUtils]: 16: Hoare triple {1054#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1054#false} is VALID [2018-11-23 13:03:16,915 INFO L273 TraceCheckUtils]: 17: Hoare triple {1054#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1054#false} is VALID [2018-11-23 13:03:16,915 INFO L273 TraceCheckUtils]: 18: Hoare triple {1054#false} assume !(~j~0 < ~edgecount~0); {1054#false} is VALID [2018-11-23 13:03:16,915 INFO L273 TraceCheckUtils]: 19: Hoare triple {1054#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1054#false} is VALID [2018-11-23 13:03:16,916 INFO L273 TraceCheckUtils]: 20: Hoare triple {1054#false} assume !(~i~0 < ~nodecount~0); {1054#false} is VALID [2018-11-23 13:03:16,916 INFO L273 TraceCheckUtils]: 21: Hoare triple {1054#false} ~i~0 := 0; {1054#false} is VALID [2018-11-23 13:03:16,916 INFO L273 TraceCheckUtils]: 22: Hoare triple {1054#false} assume !(~i~0 < ~edgecount~0); {1054#false} is VALID [2018-11-23 13:03:16,916 INFO L273 TraceCheckUtils]: 23: Hoare triple {1054#false} ~i~0 := 0; {1054#false} is VALID [2018-11-23 13:03:16,916 INFO L273 TraceCheckUtils]: 24: Hoare triple {1054#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1054#false} is VALID [2018-11-23 13:03:16,917 INFO L256 TraceCheckUtils]: 25: Hoare triple {1054#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {1054#false} is VALID [2018-11-23 13:03:16,917 INFO L273 TraceCheckUtils]: 26: Hoare triple {1054#false} ~cond := #in~cond; {1054#false} is VALID [2018-11-23 13:03:16,917 INFO L273 TraceCheckUtils]: 27: Hoare triple {1054#false} assume 0 == ~cond; {1054#false} is VALID [2018-11-23 13:03:16,917 INFO L273 TraceCheckUtils]: 28: Hoare triple {1054#false} assume !false; {1054#false} is VALID [2018-11-23 13:03:16,919 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 13:03:16,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:16,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 13:03:16,939 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-23 13:03:16,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:16,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:03:16,978 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:16,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:03:16,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:03:16,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:03:16,979 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 8 states. [2018-11-23 13:03:17,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:17,243 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2018-11-23 13:03:17,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:03:17,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-23 13:03:17,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:17,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:03:17,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2018-11-23 13:03:17,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:03:17,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2018-11-23 13:03:17,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 73 transitions. [2018-11-23 13:03:17,374 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:17,377 INFO L225 Difference]: With dead ends: 77 [2018-11-23 13:03:17,379 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 13:03:17,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:03:17,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 13:03:17,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-11-23 13:03:17,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:17,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 43 states. [2018-11-23 13:03:17,442 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 43 states. [2018-11-23 13:03:17,443 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 43 states. [2018-11-23 13:03:17,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:17,444 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2018-11-23 13:03:17,445 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2018-11-23 13:03:17,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:17,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:17,446 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 50 states. [2018-11-23 13:03:17,446 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 50 states. [2018-11-23 13:03:17,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:17,448 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2018-11-23 13:03:17,449 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2018-11-23 13:03:17,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:17,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:17,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:17,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:17,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 13:03:17,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2018-11-23 13:03:17,452 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 29 [2018-11-23 13:03:17,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:17,452 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-11-23 13:03:17,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:03:17,452 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2018-11-23 13:03:17,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 13:03:17,453 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:17,453 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:17,454 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:17,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:17,454 INFO L82 PathProgramCache]: Analyzing trace with hash -2001961887, now seen corresponding path program 2 times [2018-11-23 13:03:17,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:17,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:17,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:17,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:17,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:17,677 INFO L256 TraceCheckUtils]: 0: Hoare triple {1412#true} call ULTIMATE.init(); {1412#true} is VALID [2018-11-23 13:03:17,678 INFO L273 TraceCheckUtils]: 1: Hoare triple {1412#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {1412#true} is VALID [2018-11-23 13:03:17,678 INFO L273 TraceCheckUtils]: 2: Hoare triple {1412#true} assume true; {1412#true} is VALID [2018-11-23 13:03:17,679 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1412#true} {1412#true} #103#return; {1412#true} is VALID [2018-11-23 13:03:17,679 INFO L256 TraceCheckUtils]: 4: Hoare triple {1412#true} call #t~ret18 := main(); {1412#true} is VALID [2018-11-23 13:03:17,684 INFO L273 TraceCheckUtils]: 5: Hoare triple {1412#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {1414#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-23 13:03:17,685 INFO L273 TraceCheckUtils]: 6: Hoare triple {1414#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0); {1414#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-23 13:03:17,685 INFO L273 TraceCheckUtils]: 7: Hoare triple {1414#(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); {1414#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-23 13:03:17,686 INFO L273 TraceCheckUtils]: 8: Hoare triple {1414#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1415#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} is VALID [2018-11-23 13:03:17,687 INFO L273 TraceCheckUtils]: 9: Hoare triple {1415#(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); {1415#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} is VALID [2018-11-23 13:03:17,689 INFO L273 TraceCheckUtils]: 10: Hoare triple {1415#(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); {1416#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-23 13:03:17,690 INFO L273 TraceCheckUtils]: 11: Hoare triple {1416#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1417#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-23 13:03:17,690 INFO L273 TraceCheckUtils]: 12: Hoare triple {1417#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {1417#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-23 13:03:17,691 INFO L273 TraceCheckUtils]: 13: Hoare triple {1417#(<= (+ 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); {1417#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-23 13:03:17,692 INFO L273 TraceCheckUtils]: 14: Hoare triple {1417#(<= (+ main_~i~0 4) main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1418#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-23 13:03:17,693 INFO L273 TraceCheckUtils]: 15: Hoare triple {1418#(<= (+ main_~i~0 3) main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {1413#false} is VALID [2018-11-23 13:03:17,693 INFO L273 TraceCheckUtils]: 16: Hoare triple {1413#false} ~i~0 := 0; {1413#false} is VALID [2018-11-23 13:03:17,693 INFO L273 TraceCheckUtils]: 17: Hoare triple {1413#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1413#false} is VALID [2018-11-23 13:03:17,694 INFO L273 TraceCheckUtils]: 18: Hoare triple {1413#false} assume !(~j~0 < ~edgecount~0); {1413#false} is VALID [2018-11-23 13:03:17,694 INFO L273 TraceCheckUtils]: 19: Hoare triple {1413#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1413#false} is VALID [2018-11-23 13:03:17,694 INFO L273 TraceCheckUtils]: 20: Hoare triple {1413#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1413#false} is VALID [2018-11-23 13:03:17,695 INFO L273 TraceCheckUtils]: 21: Hoare triple {1413#false} assume !(~j~0 < ~edgecount~0); {1413#false} is VALID [2018-11-23 13:03:17,695 INFO L273 TraceCheckUtils]: 22: Hoare triple {1413#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1413#false} is VALID [2018-11-23 13:03:17,695 INFO L273 TraceCheckUtils]: 23: Hoare triple {1413#false} assume !(~i~0 < ~nodecount~0); {1413#false} is VALID [2018-11-23 13:03:17,696 INFO L273 TraceCheckUtils]: 24: Hoare triple {1413#false} ~i~0 := 0; {1413#false} is VALID [2018-11-23 13:03:17,696 INFO L273 TraceCheckUtils]: 25: Hoare triple {1413#false} assume !(~i~0 < ~edgecount~0); {1413#false} is VALID [2018-11-23 13:03:17,697 INFO L273 TraceCheckUtils]: 26: Hoare triple {1413#false} ~i~0 := 0; {1413#false} is VALID [2018-11-23 13:03:17,697 INFO L273 TraceCheckUtils]: 27: Hoare triple {1413#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1413#false} is VALID [2018-11-23 13:03:17,697 INFO L256 TraceCheckUtils]: 28: Hoare triple {1413#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {1413#false} is VALID [2018-11-23 13:03:17,698 INFO L273 TraceCheckUtils]: 29: Hoare triple {1413#false} ~cond := #in~cond; {1413#false} is VALID [2018-11-23 13:03:17,698 INFO L273 TraceCheckUtils]: 30: Hoare triple {1413#false} assume 0 == ~cond; {1413#false} is VALID [2018-11-23 13:03:17,698 INFO L273 TraceCheckUtils]: 31: Hoare triple {1413#false} assume !false; {1413#false} is VALID [2018-11-23 13:03:17,700 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 13:03:17,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:17,701 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-23 13:03:17,720 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:03:17,767 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 13:03:17,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:17,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:17,897 INFO L256 TraceCheckUtils]: 0: Hoare triple {1412#true} call ULTIMATE.init(); {1412#true} is VALID [2018-11-23 13:03:17,898 INFO L273 TraceCheckUtils]: 1: Hoare triple {1412#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {1412#true} is VALID [2018-11-23 13:03:17,898 INFO L273 TraceCheckUtils]: 2: Hoare triple {1412#true} assume true; {1412#true} is VALID [2018-11-23 13:03:17,899 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1412#true} {1412#true} #103#return; {1412#true} is VALID [2018-11-23 13:03:17,899 INFO L256 TraceCheckUtils]: 4: Hoare triple {1412#true} call #t~ret18 := main(); {1412#true} is VALID [2018-11-23 13:03:17,902 INFO L273 TraceCheckUtils]: 5: Hoare triple {1412#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {1437#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:17,903 INFO L273 TraceCheckUtils]: 6: Hoare triple {1437#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {1437#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:17,904 INFO L273 TraceCheckUtils]: 7: Hoare triple {1437#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1437#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:17,906 INFO L273 TraceCheckUtils]: 8: Hoare triple {1437#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1437#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:17,906 INFO L273 TraceCheckUtils]: 9: Hoare triple {1437#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {1437#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:17,911 INFO L273 TraceCheckUtils]: 10: Hoare triple {1437#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1437#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:17,912 INFO L273 TraceCheckUtils]: 11: Hoare triple {1437#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1437#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:17,912 INFO L273 TraceCheckUtils]: 12: Hoare triple {1437#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {1437#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:17,913 INFO L273 TraceCheckUtils]: 13: Hoare triple {1437#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1437#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:17,914 INFO L273 TraceCheckUtils]: 14: Hoare triple {1437#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1437#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:17,914 INFO L273 TraceCheckUtils]: 15: Hoare triple {1437#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {1437#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:17,915 INFO L273 TraceCheckUtils]: 16: Hoare triple {1437#(<= 20 main_~edgecount~0)} ~i~0 := 0; {1437#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:17,915 INFO L273 TraceCheckUtils]: 17: Hoare triple {1437#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1437#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:17,917 INFO L273 TraceCheckUtils]: 18: Hoare triple {1437#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {1437#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:17,920 INFO L273 TraceCheckUtils]: 19: Hoare triple {1437#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1437#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:17,921 INFO L273 TraceCheckUtils]: 20: Hoare triple {1437#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1437#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:17,922 INFO L273 TraceCheckUtils]: 21: Hoare triple {1437#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {1437#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:17,922 INFO L273 TraceCheckUtils]: 22: Hoare triple {1437#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1437#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:17,923 INFO L273 TraceCheckUtils]: 23: Hoare triple {1437#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {1437#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:17,928 INFO L273 TraceCheckUtils]: 24: Hoare triple {1437#(<= 20 main_~edgecount~0)} ~i~0 := 0; {1495#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:03:17,929 INFO L273 TraceCheckUtils]: 25: Hoare triple {1495#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} assume !(~i~0 < ~edgecount~0); {1413#false} is VALID [2018-11-23 13:03:17,929 INFO L273 TraceCheckUtils]: 26: Hoare triple {1413#false} ~i~0 := 0; {1413#false} is VALID [2018-11-23 13:03:17,929 INFO L273 TraceCheckUtils]: 27: Hoare triple {1413#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1413#false} is VALID [2018-11-23 13:03:17,929 INFO L256 TraceCheckUtils]: 28: Hoare triple {1413#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {1413#false} is VALID [2018-11-23 13:03:17,929 INFO L273 TraceCheckUtils]: 29: Hoare triple {1413#false} ~cond := #in~cond; {1413#false} is VALID [2018-11-23 13:03:17,930 INFO L273 TraceCheckUtils]: 30: Hoare triple {1413#false} assume 0 == ~cond; {1413#false} is VALID [2018-11-23 13:03:17,930 INFO L273 TraceCheckUtils]: 31: Hoare triple {1413#false} assume !false; {1413#false} is VALID [2018-11-23 13:03:17,932 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-23 13:03:17,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:03:17,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-23 13:03:17,958 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-23 13:03:17,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:17,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:03:18,061 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:18,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:03:18,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:03:18,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:03:18,062 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand 9 states. [2018-11-23 13:03:19,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:19,581 INFO L93 Difference]: Finished difference Result 109 states and 138 transitions. [2018-11-23 13:03:19,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:03:19,581 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-23 13:03:19,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:19,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:03:19,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2018-11-23 13:03:19,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:03:19,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2018-11-23 13:03:19,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 124 transitions. [2018-11-23 13:03:19,799 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:19,802 INFO L225 Difference]: With dead ends: 109 [2018-11-23 13:03:19,802 INFO L226 Difference]: Without dead ends: 82 [2018-11-23 13:03:19,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 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-23 13:03:19,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-23 13:03:19,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 49. [2018-11-23 13:03:19,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:19,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 49 states. [2018-11-23 13:03:19,868 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 49 states. [2018-11-23 13:03:19,868 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 49 states. [2018-11-23 13:03:19,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:19,873 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2018-11-23 13:03:19,874 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 102 transitions. [2018-11-23 13:03:19,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:19,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:19,874 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 82 states. [2018-11-23 13:03:19,875 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 82 states. [2018-11-23 13:03:19,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:19,878 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2018-11-23 13:03:19,879 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 102 transitions. [2018-11-23 13:03:19,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:19,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:19,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:19,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:19,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 13:03:19,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2018-11-23 13:03:19,882 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 32 [2018-11-23 13:03:19,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:19,882 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2018-11-23 13:03:19,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:03:19,882 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2018-11-23 13:03:19,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 13:03:19,883 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:19,883 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:19,884 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:19,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:19,884 INFO L82 PathProgramCache]: Analyzing trace with hash -200531555, now seen corresponding path program 1 times [2018-11-23 13:03:19,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:19,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:19,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:19,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:03:19,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:20,044 INFO L256 TraceCheckUtils]: 0: Hoare triple {1906#true} call ULTIMATE.init(); {1906#true} is VALID [2018-11-23 13:03:20,044 INFO L273 TraceCheckUtils]: 1: Hoare triple {1906#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {1906#true} is VALID [2018-11-23 13:03:20,044 INFO L273 TraceCheckUtils]: 2: Hoare triple {1906#true} assume true; {1906#true} is VALID [2018-11-23 13:03:20,044 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1906#true} {1906#true} #103#return; {1906#true} is VALID [2018-11-23 13:03:20,045 INFO L256 TraceCheckUtils]: 4: Hoare triple {1906#true} call #t~ret18 := main(); {1906#true} is VALID [2018-11-23 13:03:20,047 INFO L273 TraceCheckUtils]: 5: Hoare triple {1906#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {1908#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-23 13:03:20,050 INFO L273 TraceCheckUtils]: 6: Hoare triple {1908#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {1908#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-23 13:03:20,050 INFO L273 TraceCheckUtils]: 7: Hoare triple {1908#(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); {1908#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-23 13:03:20,051 INFO L273 TraceCheckUtils]: 8: Hoare triple {1908#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1909#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-23 13:03:20,051 INFO L273 TraceCheckUtils]: 9: Hoare triple {1909#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {1909#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-23 13:03:20,052 INFO L273 TraceCheckUtils]: 10: Hoare triple {1909#(<= (+ 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); {1909#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-23 13:03:20,054 INFO L273 TraceCheckUtils]: 11: Hoare triple {1909#(<= (+ main_~i~0 4) main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1910#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-23 13:03:20,058 INFO L273 TraceCheckUtils]: 12: Hoare triple {1910#(<= (+ main_~i~0 3) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {1910#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-23 13:03:20,062 INFO L273 TraceCheckUtils]: 13: Hoare triple {1910#(<= (+ 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); {1910#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-23 13:03:20,071 INFO L273 TraceCheckUtils]: 14: Hoare triple {1910#(<= (+ main_~i~0 3) main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1911#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-23 13:03:20,076 INFO L273 TraceCheckUtils]: 15: Hoare triple {1911#(<= (+ main_~i~0 2) main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {1907#false} is VALID [2018-11-23 13:03:20,077 INFO L273 TraceCheckUtils]: 16: Hoare triple {1907#false} ~i~0 := 0; {1907#false} is VALID [2018-11-23 13:03:20,077 INFO L273 TraceCheckUtils]: 17: Hoare triple {1907#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1907#false} is VALID [2018-11-23 13:03:20,077 INFO L273 TraceCheckUtils]: 18: Hoare triple {1907#false} assume !(~j~0 < ~edgecount~0); {1907#false} is VALID [2018-11-23 13:03:20,077 INFO L273 TraceCheckUtils]: 19: Hoare triple {1907#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1907#false} is VALID [2018-11-23 13:03:20,077 INFO L273 TraceCheckUtils]: 20: Hoare triple {1907#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1907#false} is VALID [2018-11-23 13:03:20,077 INFO L273 TraceCheckUtils]: 21: Hoare triple {1907#false} assume !(~j~0 < ~edgecount~0); {1907#false} is VALID [2018-11-23 13:03:20,077 INFO L273 TraceCheckUtils]: 22: Hoare triple {1907#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1907#false} is VALID [2018-11-23 13:03:20,078 INFO L273 TraceCheckUtils]: 23: Hoare triple {1907#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1907#false} is VALID [2018-11-23 13:03:20,078 INFO L273 TraceCheckUtils]: 24: Hoare triple {1907#false} assume !(~j~0 < ~edgecount~0); {1907#false} is VALID [2018-11-23 13:03:20,078 INFO L273 TraceCheckUtils]: 25: Hoare triple {1907#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1907#false} is VALID [2018-11-23 13:03:20,078 INFO L273 TraceCheckUtils]: 26: Hoare triple {1907#false} assume !(~i~0 < ~nodecount~0); {1907#false} is VALID [2018-11-23 13:03:20,078 INFO L273 TraceCheckUtils]: 27: Hoare triple {1907#false} ~i~0 := 0; {1907#false} is VALID [2018-11-23 13:03:20,078 INFO L273 TraceCheckUtils]: 28: Hoare triple {1907#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); {1907#false} is VALID [2018-11-23 13:03:20,079 INFO L273 TraceCheckUtils]: 29: Hoare triple {1907#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {1907#false} is VALID [2018-11-23 13:03:20,079 INFO L273 TraceCheckUtils]: 30: Hoare triple {1907#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {1907#false} is VALID [2018-11-23 13:03:20,079 INFO L273 TraceCheckUtils]: 31: Hoare triple {1907#false} assume !(~i~0 < ~edgecount~0); {1907#false} is VALID [2018-11-23 13:03:20,079 INFO L273 TraceCheckUtils]: 32: Hoare triple {1907#false} ~i~0 := 0; {1907#false} is VALID [2018-11-23 13:03:20,079 INFO L273 TraceCheckUtils]: 33: Hoare triple {1907#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1907#false} is VALID [2018-11-23 13:03:20,079 INFO L256 TraceCheckUtils]: 34: Hoare triple {1907#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {1907#false} is VALID [2018-11-23 13:03:20,080 INFO L273 TraceCheckUtils]: 35: Hoare triple {1907#false} ~cond := #in~cond; {1907#false} is VALID [2018-11-23 13:03:20,080 INFO L273 TraceCheckUtils]: 36: Hoare triple {1907#false} assume 0 == ~cond; {1907#false} is VALID [2018-11-23 13:03:20,080 INFO L273 TraceCheckUtils]: 37: Hoare triple {1907#false} assume !false; {1907#false} is VALID [2018-11-23 13:03:20,081 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 13:03:20,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:20,081 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-23 13:03:20,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:20,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:20,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:20,453 INFO L256 TraceCheckUtils]: 0: Hoare triple {1906#true} call ULTIMATE.init(); {1906#true} is VALID [2018-11-23 13:03:20,453 INFO L273 TraceCheckUtils]: 1: Hoare triple {1906#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {1906#true} is VALID [2018-11-23 13:03:20,454 INFO L273 TraceCheckUtils]: 2: Hoare triple {1906#true} assume true; {1906#true} is VALID [2018-11-23 13:03:20,454 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1906#true} {1906#true} #103#return; {1906#true} is VALID [2018-11-23 13:03:20,454 INFO L256 TraceCheckUtils]: 4: Hoare triple {1906#true} call #t~ret18 := main(); {1906#true} is VALID [2018-11-23 13:03:20,457 INFO L273 TraceCheckUtils]: 5: Hoare triple {1906#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {1930#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:03:20,458 INFO L273 TraceCheckUtils]: 6: Hoare triple {1930#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {1930#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:03:20,459 INFO L273 TraceCheckUtils]: 7: Hoare triple {1930#(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); {1930#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:03:20,460 INFO L273 TraceCheckUtils]: 8: Hoare triple {1930#(and (<= 5 main_~nodecount~0) (<= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1940#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:03:20,461 INFO L273 TraceCheckUtils]: 9: Hoare triple {1940#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} assume !!(~i~0 < ~nodecount~0); {1940#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:03:20,462 INFO L273 TraceCheckUtils]: 10: Hoare triple {1940#(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); {1940#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:03:20,463 INFO L273 TraceCheckUtils]: 11: Hoare triple {1940#(and (<= 5 main_~nodecount~0) (<= main_~i~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1950#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2018-11-23 13:03:20,464 INFO L273 TraceCheckUtils]: 12: Hoare triple {1950#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0); {1950#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2018-11-23 13:03:20,465 INFO L273 TraceCheckUtils]: 13: Hoare triple {1950#(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); {1950#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} is VALID [2018-11-23 13:03:20,467 INFO L273 TraceCheckUtils]: 14: Hoare triple {1950#(and (<= main_~i~0 2) (<= 5 main_~nodecount~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1960#(and (<= main_~i~0 3) (<= 5 main_~nodecount~0))} is VALID [2018-11-23 13:03:20,468 INFO L273 TraceCheckUtils]: 15: Hoare triple {1960#(and (<= main_~i~0 3) (<= 5 main_~nodecount~0))} assume !(~i~0 < ~nodecount~0); {1907#false} is VALID [2018-11-23 13:03:20,468 INFO L273 TraceCheckUtils]: 16: Hoare triple {1907#false} ~i~0 := 0; {1907#false} is VALID [2018-11-23 13:03:20,468 INFO L273 TraceCheckUtils]: 17: Hoare triple {1907#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1907#false} is VALID [2018-11-23 13:03:20,468 INFO L273 TraceCheckUtils]: 18: Hoare triple {1907#false} assume !(~j~0 < ~edgecount~0); {1907#false} is VALID [2018-11-23 13:03:20,469 INFO L273 TraceCheckUtils]: 19: Hoare triple {1907#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1907#false} is VALID [2018-11-23 13:03:20,469 INFO L273 TraceCheckUtils]: 20: Hoare triple {1907#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1907#false} is VALID [2018-11-23 13:03:20,469 INFO L273 TraceCheckUtils]: 21: Hoare triple {1907#false} assume !(~j~0 < ~edgecount~0); {1907#false} is VALID [2018-11-23 13:03:20,470 INFO L273 TraceCheckUtils]: 22: Hoare triple {1907#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1907#false} is VALID [2018-11-23 13:03:20,470 INFO L273 TraceCheckUtils]: 23: Hoare triple {1907#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1907#false} is VALID [2018-11-23 13:03:20,470 INFO L273 TraceCheckUtils]: 24: Hoare triple {1907#false} assume !(~j~0 < ~edgecount~0); {1907#false} is VALID [2018-11-23 13:03:20,471 INFO L273 TraceCheckUtils]: 25: Hoare triple {1907#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1907#false} is VALID [2018-11-23 13:03:20,471 INFO L273 TraceCheckUtils]: 26: Hoare triple {1907#false} assume !(~i~0 < ~nodecount~0); {1907#false} is VALID [2018-11-23 13:03:20,472 INFO L273 TraceCheckUtils]: 27: Hoare triple {1907#false} ~i~0 := 0; {1907#false} is VALID [2018-11-23 13:03:20,472 INFO L273 TraceCheckUtils]: 28: Hoare triple {1907#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); {1907#false} is VALID [2018-11-23 13:03:20,472 INFO L273 TraceCheckUtils]: 29: Hoare triple {1907#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {1907#false} is VALID [2018-11-23 13:03:20,473 INFO L273 TraceCheckUtils]: 30: Hoare triple {1907#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {1907#false} is VALID [2018-11-23 13:03:20,473 INFO L273 TraceCheckUtils]: 31: Hoare triple {1907#false} assume !(~i~0 < ~edgecount~0); {1907#false} is VALID [2018-11-23 13:03:20,473 INFO L273 TraceCheckUtils]: 32: Hoare triple {1907#false} ~i~0 := 0; {1907#false} is VALID [2018-11-23 13:03:20,474 INFO L273 TraceCheckUtils]: 33: Hoare triple {1907#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1907#false} is VALID [2018-11-23 13:03:20,474 INFO L256 TraceCheckUtils]: 34: Hoare triple {1907#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {1907#false} is VALID [2018-11-23 13:03:20,474 INFO L273 TraceCheckUtils]: 35: Hoare triple {1907#false} ~cond := #in~cond; {1907#false} is VALID [2018-11-23 13:03:20,474 INFO L273 TraceCheckUtils]: 36: Hoare triple {1907#false} assume 0 == ~cond; {1907#false} is VALID [2018-11-23 13:03:20,474 INFO L273 TraceCheckUtils]: 37: Hoare triple {1907#false} assume !false; {1907#false} is VALID [2018-11-23 13:03:20,476 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 13:03:20,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:20,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-23 13:03:20,497 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-11-23 13:03:20,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:20,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:03:20,543 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:20,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:03:20,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:03:20,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=48, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:03:20,544 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand 10 states. [2018-11-23 13:03:20,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:20,949 INFO L93 Difference]: Finished difference Result 102 states and 127 transitions. [2018-11-23 13:03:20,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:03:20,949 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-11-23 13:03:20,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:20,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:03:20,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2018-11-23 13:03:20,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:03:20,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2018-11-23 13:03:20,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 77 transitions. [2018-11-23 13:03:21,035 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:21,037 INFO L225 Difference]: With dead ends: 102 [2018-11-23 13:03:21,037 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 13:03:21,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=48, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:03:21,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 13:03:21,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 52. [2018-11-23 13:03:21,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:21,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 52 states. [2018-11-23 13:03:21,114 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 52 states. [2018-11-23 13:03:21,114 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 52 states. [2018-11-23 13:03:21,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:21,117 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2018-11-23 13:03:21,117 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2018-11-23 13:03:21,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:21,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:21,118 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 69 states. [2018-11-23 13:03:21,118 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 69 states. [2018-11-23 13:03:21,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:21,120 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2018-11-23 13:03:21,120 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2018-11-23 13:03:21,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:21,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:21,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:21,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:21,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 13:03:21,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2018-11-23 13:03:21,122 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 38 [2018-11-23 13:03:21,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:21,123 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2018-11-23 13:03:21,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:03:21,123 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2018-11-23 13:03:21,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 13:03:21,124 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:21,124 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-11-23 13:03:21,124 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:21,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:21,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1715802930, now seen corresponding path program 2 times [2018-11-23 13:03:21,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:21,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:21,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:21,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:21,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:21,431 INFO L256 TraceCheckUtils]: 0: Hoare triple {2380#true} call ULTIMATE.init(); {2380#true} is VALID [2018-11-23 13:03:21,431 INFO L273 TraceCheckUtils]: 1: Hoare triple {2380#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {2380#true} is VALID [2018-11-23 13:03:21,432 INFO L273 TraceCheckUtils]: 2: Hoare triple {2380#true} assume true; {2380#true} is VALID [2018-11-23 13:03:21,432 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2380#true} {2380#true} #103#return; {2380#true} is VALID [2018-11-23 13:03:21,432 INFO L256 TraceCheckUtils]: 4: Hoare triple {2380#true} call #t~ret18 := main(); {2380#true} is VALID [2018-11-23 13:03:21,435 INFO L273 TraceCheckUtils]: 5: Hoare triple {2380#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {2382#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-23 13:03:21,436 INFO L273 TraceCheckUtils]: 6: Hoare triple {2382#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0); {2382#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-23 13:03:21,437 INFO L273 TraceCheckUtils]: 7: Hoare triple {2382#(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); {2382#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-23 13:03:21,437 INFO L273 TraceCheckUtils]: 8: Hoare triple {2382#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2383#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} is VALID [2018-11-23 13:03:21,438 INFO L273 TraceCheckUtils]: 9: Hoare triple {2383#(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); {2383#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} is VALID [2018-11-23 13:03:21,439 INFO L273 TraceCheckUtils]: 10: Hoare triple {2383#(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); {2384#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-23 13:03:21,440 INFO L273 TraceCheckUtils]: 11: Hoare triple {2384#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2385#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-23 13:03:21,441 INFO L273 TraceCheckUtils]: 12: Hoare triple {2385#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2385#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-23 13:03:21,441 INFO L273 TraceCheckUtils]: 13: Hoare triple {2385#(<= (+ 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); {2385#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-23 13:03:21,442 INFO L273 TraceCheckUtils]: 14: Hoare triple {2385#(<= (+ main_~i~0 4) main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2386#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-23 13:03:21,443 INFO L273 TraceCheckUtils]: 15: Hoare triple {2386#(<= (+ main_~i~0 3) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2386#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-23 13:03:21,444 INFO L273 TraceCheckUtils]: 16: Hoare triple {2386#(<= (+ 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); {2386#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-23 13:03:21,444 INFO L273 TraceCheckUtils]: 17: Hoare triple {2386#(<= (+ main_~i~0 3) main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2387#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-23 13:03:21,445 INFO L273 TraceCheckUtils]: 18: Hoare triple {2387#(<= (+ main_~i~0 2) main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {2381#false} is VALID [2018-11-23 13:03:21,446 INFO L273 TraceCheckUtils]: 19: Hoare triple {2381#false} ~i~0 := 0; {2381#false} is VALID [2018-11-23 13:03:21,446 INFO L273 TraceCheckUtils]: 20: Hoare triple {2381#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2381#false} is VALID [2018-11-23 13:03:21,446 INFO L273 TraceCheckUtils]: 21: Hoare triple {2381#false} assume !(~j~0 < ~edgecount~0); {2381#false} is VALID [2018-11-23 13:03:21,446 INFO L273 TraceCheckUtils]: 22: Hoare triple {2381#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2381#false} is VALID [2018-11-23 13:03:21,447 INFO L273 TraceCheckUtils]: 23: Hoare triple {2381#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2381#false} is VALID [2018-11-23 13:03:21,447 INFO L273 TraceCheckUtils]: 24: Hoare triple {2381#false} assume !(~j~0 < ~edgecount~0); {2381#false} is VALID [2018-11-23 13:03:21,447 INFO L273 TraceCheckUtils]: 25: Hoare triple {2381#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2381#false} is VALID [2018-11-23 13:03:21,447 INFO L273 TraceCheckUtils]: 26: Hoare triple {2381#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2381#false} is VALID [2018-11-23 13:03:21,448 INFO L273 TraceCheckUtils]: 27: Hoare triple {2381#false} assume !(~j~0 < ~edgecount~0); {2381#false} is VALID [2018-11-23 13:03:21,448 INFO L273 TraceCheckUtils]: 28: Hoare triple {2381#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2381#false} is VALID [2018-11-23 13:03:21,448 INFO L273 TraceCheckUtils]: 29: Hoare triple {2381#false} assume !(~i~0 < ~nodecount~0); {2381#false} is VALID [2018-11-23 13:03:21,448 INFO L273 TraceCheckUtils]: 30: Hoare triple {2381#false} ~i~0 := 0; {2381#false} is VALID [2018-11-23 13:03:21,448 INFO L273 TraceCheckUtils]: 31: Hoare triple {2381#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); {2381#false} is VALID [2018-11-23 13:03:21,448 INFO L273 TraceCheckUtils]: 32: Hoare triple {2381#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {2381#false} is VALID [2018-11-23 13:03:21,448 INFO L273 TraceCheckUtils]: 33: Hoare triple {2381#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2381#false} is VALID [2018-11-23 13:03:21,449 INFO L273 TraceCheckUtils]: 34: Hoare triple {2381#false} assume !(~i~0 < ~edgecount~0); {2381#false} is VALID [2018-11-23 13:03:21,449 INFO L273 TraceCheckUtils]: 35: Hoare triple {2381#false} ~i~0 := 0; {2381#false} is VALID [2018-11-23 13:03:21,449 INFO L273 TraceCheckUtils]: 36: Hoare triple {2381#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2381#false} is VALID [2018-11-23 13:03:21,449 INFO L256 TraceCheckUtils]: 37: Hoare triple {2381#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {2381#false} is VALID [2018-11-23 13:03:21,450 INFO L273 TraceCheckUtils]: 38: Hoare triple {2381#false} ~cond := #in~cond; {2381#false} is VALID [2018-11-23 13:03:21,450 INFO L273 TraceCheckUtils]: 39: Hoare triple {2381#false} assume 0 == ~cond; {2381#false} is VALID [2018-11-23 13:03:21,450 INFO L273 TraceCheckUtils]: 40: Hoare triple {2381#false} assume !false; {2381#false} is VALID [2018-11-23 13:03:21,452 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 13:03:21,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:21,452 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-23 13:03:21,462 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:03:21,512 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:03:21,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:21,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:21,759 INFO L256 TraceCheckUtils]: 0: Hoare triple {2380#true} call ULTIMATE.init(); {2380#true} is VALID [2018-11-23 13:03:21,759 INFO L273 TraceCheckUtils]: 1: Hoare triple {2380#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {2380#true} is VALID [2018-11-23 13:03:21,760 INFO L273 TraceCheckUtils]: 2: Hoare triple {2380#true} assume true; {2380#true} is VALID [2018-11-23 13:03:21,760 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2380#true} {2380#true} #103#return; {2380#true} is VALID [2018-11-23 13:03:21,760 INFO L256 TraceCheckUtils]: 4: Hoare triple {2380#true} call #t~ret18 := main(); {2380#true} is VALID [2018-11-23 13:03:21,763 INFO L273 TraceCheckUtils]: 5: Hoare triple {2380#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {2406#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:21,763 INFO L273 TraceCheckUtils]: 6: Hoare triple {2406#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {2406#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:21,764 INFO L273 TraceCheckUtils]: 7: Hoare triple {2406#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2406#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:21,764 INFO L273 TraceCheckUtils]: 8: Hoare triple {2406#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2406#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:21,765 INFO L273 TraceCheckUtils]: 9: Hoare triple {2406#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {2406#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:21,765 INFO L273 TraceCheckUtils]: 10: Hoare triple {2406#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2406#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:21,766 INFO L273 TraceCheckUtils]: 11: Hoare triple {2406#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2406#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:21,766 INFO L273 TraceCheckUtils]: 12: Hoare triple {2406#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {2406#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:21,767 INFO L273 TraceCheckUtils]: 13: Hoare triple {2406#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2406#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:21,767 INFO L273 TraceCheckUtils]: 14: Hoare triple {2406#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2406#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:21,768 INFO L273 TraceCheckUtils]: 15: Hoare triple {2406#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {2406#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:21,768 INFO L273 TraceCheckUtils]: 16: Hoare triple {2406#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2406#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:21,770 INFO L273 TraceCheckUtils]: 17: Hoare triple {2406#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2406#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:21,770 INFO L273 TraceCheckUtils]: 18: Hoare triple {2406#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {2406#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:21,771 INFO L273 TraceCheckUtils]: 19: Hoare triple {2406#(<= 20 main_~edgecount~0)} ~i~0 := 0; {2406#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:21,771 INFO L273 TraceCheckUtils]: 20: Hoare triple {2406#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2406#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:21,772 INFO L273 TraceCheckUtils]: 21: Hoare triple {2406#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {2406#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:21,775 INFO L273 TraceCheckUtils]: 22: Hoare triple {2406#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:21,776 INFO L273 TraceCheckUtils]: 23: Hoare triple {2406#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2406#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:21,776 INFO L273 TraceCheckUtils]: 24: Hoare triple {2406#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {2406#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:21,778 INFO L273 TraceCheckUtils]: 25: Hoare triple {2406#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:21,779 INFO L273 TraceCheckUtils]: 26: Hoare triple {2406#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2406#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:21,779 INFO L273 TraceCheckUtils]: 27: Hoare triple {2406#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {2406#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:21,779 INFO L273 TraceCheckUtils]: 28: Hoare triple {2406#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:21,780 INFO L273 TraceCheckUtils]: 29: Hoare triple {2406#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {2406#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:21,780 INFO L273 TraceCheckUtils]: 30: Hoare triple {2406#(<= 20 main_~edgecount~0)} ~i~0 := 0; {2482#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:03:21,781 INFO L273 TraceCheckUtils]: 31: Hoare triple {2482#(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); {2482#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:03:21,781 INFO L273 TraceCheckUtils]: 32: Hoare triple {2482#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {2482#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:03:21,782 INFO L273 TraceCheckUtils]: 33: Hoare triple {2482#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2492#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:03:21,783 INFO L273 TraceCheckUtils]: 34: Hoare triple {2492#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} assume !(~i~0 < ~edgecount~0); {2381#false} is VALID [2018-11-23 13:03:21,783 INFO L273 TraceCheckUtils]: 35: Hoare triple {2381#false} ~i~0 := 0; {2381#false} is VALID [2018-11-23 13:03:21,783 INFO L273 TraceCheckUtils]: 36: Hoare triple {2381#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2381#false} is VALID [2018-11-23 13:03:21,783 INFO L256 TraceCheckUtils]: 37: Hoare triple {2381#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {2381#false} is VALID [2018-11-23 13:03:21,784 INFO L273 TraceCheckUtils]: 38: Hoare triple {2381#false} ~cond := #in~cond; {2381#false} is VALID [2018-11-23 13:03:21,784 INFO L273 TraceCheckUtils]: 39: Hoare triple {2381#false} assume 0 == ~cond; {2381#false} is VALID [2018-11-23 13:03:21,784 INFO L273 TraceCheckUtils]: 40: Hoare triple {2381#false} assume !false; {2381#false} is VALID [2018-11-23 13:03:21,786 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-23 13:03:21,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:21,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-23 13:03:21,807 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-11-23 13:03:21,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:21,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:03:21,863 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:21,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:03:21,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:03:21,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:03:21,864 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand 11 states. [2018-11-23 13:03:22,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:22,898 INFO L93 Difference]: Finished difference Result 133 states and 169 transitions. [2018-11-23 13:03:22,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:03:22,898 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-11-23 13:03:22,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:22,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:03:22,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2018-11-23 13:03:22,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:03:22,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2018-11-23 13:03:22,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 143 transitions. [2018-11-23 13:03:23,138 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:23,141 INFO L225 Difference]: With dead ends: 133 [2018-11-23 13:03:23,141 INFO L226 Difference]: Without dead ends: 100 [2018-11-23 13:03:23,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:03:23,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-23 13:03:23,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 60. [2018-11-23 13:03:23,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:23,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand 60 states. [2018-11-23 13:03:23,502 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 60 states. [2018-11-23 13:03:23,502 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 60 states. [2018-11-23 13:03:23,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:23,506 INFO L93 Difference]: Finished difference Result 100 states and 125 transitions. [2018-11-23 13:03:23,507 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 125 transitions. [2018-11-23 13:03:23,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:23,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:23,507 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 100 states. [2018-11-23 13:03:23,508 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 100 states. [2018-11-23 13:03:23,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:23,512 INFO L93 Difference]: Finished difference Result 100 states and 125 transitions. [2018-11-23 13:03:23,512 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 125 transitions. [2018-11-23 13:03:23,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:23,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:23,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:23,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:23,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 13:03:23,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2018-11-23 13:03:23,515 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 41 [2018-11-23 13:03:23,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:23,515 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2018-11-23 13:03:23,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:03:23,515 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2018-11-23 13:03:23,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 13:03:23,516 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:23,516 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:23,516 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:23,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:23,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1685784586, now seen corresponding path program 3 times [2018-11-23 13:03:23,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:23,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:23,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:23,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:03:23,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:24,297 INFO L256 TraceCheckUtils]: 0: Hoare triple {2990#true} call ULTIMATE.init(); {2990#true} is VALID [2018-11-23 13:03:24,297 INFO L273 TraceCheckUtils]: 1: Hoare triple {2990#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {2990#true} is VALID [2018-11-23 13:03:24,297 INFO L273 TraceCheckUtils]: 2: Hoare triple {2990#true} assume true; {2990#true} is VALID [2018-11-23 13:03:24,298 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2990#true} {2990#true} #103#return; {2990#true} is VALID [2018-11-23 13:03:24,298 INFO L256 TraceCheckUtils]: 4: Hoare triple {2990#true} call #t~ret18 := main(); {2990#true} is VALID [2018-11-23 13:03:24,301 INFO L273 TraceCheckUtils]: 5: Hoare triple {2990#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {2992#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-23 13:03:24,302 INFO L273 TraceCheckUtils]: 6: Hoare triple {2992#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {2992#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-23 13:03:24,303 INFO L273 TraceCheckUtils]: 7: Hoare triple {2992#(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); {2992#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-23 13:03:24,304 INFO L273 TraceCheckUtils]: 8: Hoare triple {2992#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2993#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-23 13:03:24,304 INFO L273 TraceCheckUtils]: 9: Hoare triple {2993#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2993#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-23 13:03:24,305 INFO L273 TraceCheckUtils]: 10: Hoare triple {2993#(<= (+ 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); {2993#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-23 13:03:24,306 INFO L273 TraceCheckUtils]: 11: Hoare triple {2993#(<= (+ main_~i~0 4) main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2994#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-23 13:03:24,307 INFO L273 TraceCheckUtils]: 12: Hoare triple {2994#(<= (+ main_~i~0 3) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2994#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-23 13:03:24,307 INFO L273 TraceCheckUtils]: 13: Hoare triple {2994#(<= (+ 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); {2994#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-23 13:03:24,308 INFO L273 TraceCheckUtils]: 14: Hoare triple {2994#(<= (+ main_~i~0 3) main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2995#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-23 13:03:24,309 INFO L273 TraceCheckUtils]: 15: Hoare triple {2995#(<= (+ main_~i~0 2) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {2995#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-23 13:03:24,309 INFO L273 TraceCheckUtils]: 16: Hoare triple {2995#(<= (+ 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); {2995#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-23 13:03:24,310 INFO L273 TraceCheckUtils]: 17: Hoare triple {2995#(<= (+ main_~i~0 2) main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2996#(<= (+ main_~i~0 1) main_~nodecount~0)} is VALID [2018-11-23 13:03:24,311 INFO L273 TraceCheckUtils]: 18: Hoare triple {2996#(<= (+ main_~i~0 1) main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {2991#false} is VALID [2018-11-23 13:03:24,312 INFO L273 TraceCheckUtils]: 19: Hoare triple {2991#false} ~i~0 := 0; {2991#false} is VALID [2018-11-23 13:03:24,312 INFO L273 TraceCheckUtils]: 20: Hoare triple {2991#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2991#false} is VALID [2018-11-23 13:03:24,312 INFO L273 TraceCheckUtils]: 21: Hoare triple {2991#false} assume !(~j~0 < ~edgecount~0); {2991#false} is VALID [2018-11-23 13:03:24,313 INFO L273 TraceCheckUtils]: 22: Hoare triple {2991#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2991#false} is VALID [2018-11-23 13:03:24,313 INFO L273 TraceCheckUtils]: 23: Hoare triple {2991#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2991#false} is VALID [2018-11-23 13:03:24,313 INFO L273 TraceCheckUtils]: 24: Hoare triple {2991#false} assume !(~j~0 < ~edgecount~0); {2991#false} is VALID [2018-11-23 13:03:24,313 INFO L273 TraceCheckUtils]: 25: Hoare triple {2991#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2991#false} is VALID [2018-11-23 13:03:24,313 INFO L273 TraceCheckUtils]: 26: Hoare triple {2991#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2991#false} is VALID [2018-11-23 13:03:24,314 INFO L273 TraceCheckUtils]: 27: Hoare triple {2991#false} assume !(~j~0 < ~edgecount~0); {2991#false} is VALID [2018-11-23 13:03:24,314 INFO L273 TraceCheckUtils]: 28: Hoare triple {2991#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2991#false} is VALID [2018-11-23 13:03:24,314 INFO L273 TraceCheckUtils]: 29: Hoare triple {2991#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2991#false} is VALID [2018-11-23 13:03:24,314 INFO L273 TraceCheckUtils]: 30: Hoare triple {2991#false} assume !(~j~0 < ~edgecount~0); {2991#false} is VALID [2018-11-23 13:03:24,314 INFO L273 TraceCheckUtils]: 31: Hoare triple {2991#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2991#false} is VALID [2018-11-23 13:03:24,314 INFO L273 TraceCheckUtils]: 32: Hoare triple {2991#false} assume !(~i~0 < ~nodecount~0); {2991#false} is VALID [2018-11-23 13:03:24,315 INFO L273 TraceCheckUtils]: 33: Hoare triple {2991#false} ~i~0 := 0; {2991#false} is VALID [2018-11-23 13:03:24,315 INFO L273 TraceCheckUtils]: 34: Hoare triple {2991#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); {2991#false} is VALID [2018-11-23 13:03:24,315 INFO L273 TraceCheckUtils]: 35: Hoare triple {2991#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {2991#false} is VALID [2018-11-23 13:03:24,315 INFO L273 TraceCheckUtils]: 36: Hoare triple {2991#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2991#false} is VALID [2018-11-23 13:03:24,315 INFO L273 TraceCheckUtils]: 37: Hoare triple {2991#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); {2991#false} is VALID [2018-11-23 13:03:24,315 INFO L273 TraceCheckUtils]: 38: Hoare triple {2991#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {2991#false} is VALID [2018-11-23 13:03:24,316 INFO L273 TraceCheckUtils]: 39: Hoare triple {2991#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2991#false} is VALID [2018-11-23 13:03:24,316 INFO L273 TraceCheckUtils]: 40: Hoare triple {2991#false} assume !(~i~0 < ~edgecount~0); {2991#false} is VALID [2018-11-23 13:03:24,316 INFO L273 TraceCheckUtils]: 41: Hoare triple {2991#false} ~i~0 := 0; {2991#false} is VALID [2018-11-23 13:03:24,316 INFO L273 TraceCheckUtils]: 42: Hoare triple {2991#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2991#false} is VALID [2018-11-23 13:03:24,316 INFO L256 TraceCheckUtils]: 43: Hoare triple {2991#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {2991#false} is VALID [2018-11-23 13:03:24,316 INFO L273 TraceCheckUtils]: 44: Hoare triple {2991#false} ~cond := #in~cond; {2991#false} is VALID [2018-11-23 13:03:24,317 INFO L273 TraceCheckUtils]: 45: Hoare triple {2991#false} assume 0 == ~cond; {2991#false} is VALID [2018-11-23 13:03:24,317 INFO L273 TraceCheckUtils]: 46: Hoare triple {2991#false} assume !false; {2991#false} is VALID [2018-11-23 13:03:24,319 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-23 13:03:24,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:24,319 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-23 13:03:24,333 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:03:24,375 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 13:03:24,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:24,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:24,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:24,477 INFO L256 TraceCheckUtils]: 0: Hoare triple {2990#true} call ULTIMATE.init(); {2990#true} is VALID [2018-11-23 13:03:24,477 INFO L273 TraceCheckUtils]: 1: Hoare triple {2990#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {2990#true} is VALID [2018-11-23 13:03:24,478 INFO L273 TraceCheckUtils]: 2: Hoare triple {2990#true} assume true; {2990#true} is VALID [2018-11-23 13:03:24,478 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2990#true} {2990#true} #103#return; {2990#true} is VALID [2018-11-23 13:03:24,478 INFO L256 TraceCheckUtils]: 4: Hoare triple {2990#true} call #t~ret18 := main(); {2990#true} is VALID [2018-11-23 13:03:24,481 INFO L273 TraceCheckUtils]: 5: Hoare triple {2990#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {3015#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:24,481 INFO L273 TraceCheckUtils]: 6: Hoare triple {3015#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3015#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:24,482 INFO L273 TraceCheckUtils]: 7: Hoare triple {3015#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3015#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:24,482 INFO L273 TraceCheckUtils]: 8: Hoare triple {3015#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3015#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:24,483 INFO L273 TraceCheckUtils]: 9: Hoare triple {3015#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3015#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:24,483 INFO L273 TraceCheckUtils]: 10: Hoare triple {3015#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3015#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:24,485 INFO L273 TraceCheckUtils]: 11: Hoare triple {3015#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3015#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:24,485 INFO L273 TraceCheckUtils]: 12: Hoare triple {3015#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3015#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:24,486 INFO L273 TraceCheckUtils]: 13: Hoare triple {3015#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3015#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:24,486 INFO L273 TraceCheckUtils]: 14: Hoare triple {3015#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3015#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:24,487 INFO L273 TraceCheckUtils]: 15: Hoare triple {3015#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {3015#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:24,488 INFO L273 TraceCheckUtils]: 16: Hoare triple {3015#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3015#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:24,488 INFO L273 TraceCheckUtils]: 17: Hoare triple {3015#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3015#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:24,489 INFO L273 TraceCheckUtils]: 18: Hoare triple {3015#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {3015#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:24,489 INFO L273 TraceCheckUtils]: 19: Hoare triple {3015#(<= 20 main_~edgecount~0)} ~i~0 := 0; {3015#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:24,490 INFO L273 TraceCheckUtils]: 20: Hoare triple {3015#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3015#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:24,490 INFO L273 TraceCheckUtils]: 21: Hoare triple {3015#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {3015#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:24,491 INFO L273 TraceCheckUtils]: 22: Hoare triple {3015#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3015#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:24,491 INFO L273 TraceCheckUtils]: 23: Hoare triple {3015#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3015#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:24,492 INFO L273 TraceCheckUtils]: 24: Hoare triple {3015#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {3015#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:24,493 INFO L273 TraceCheckUtils]: 25: Hoare triple {3015#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3015#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:24,493 INFO L273 TraceCheckUtils]: 26: Hoare triple {3015#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3015#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:24,494 INFO L273 TraceCheckUtils]: 27: Hoare triple {3015#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {3015#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:24,494 INFO L273 TraceCheckUtils]: 28: Hoare triple {3015#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3015#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:24,495 INFO L273 TraceCheckUtils]: 29: Hoare triple {3015#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3088#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-23 13:03:24,496 INFO L273 TraceCheckUtils]: 30: Hoare triple {3088#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume !(~j~0 < ~edgecount~0); {2991#false} is VALID [2018-11-23 13:03:24,496 INFO L273 TraceCheckUtils]: 31: Hoare triple {2991#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2991#false} is VALID [2018-11-23 13:03:24,496 INFO L273 TraceCheckUtils]: 32: Hoare triple {2991#false} assume !(~i~0 < ~nodecount~0); {2991#false} is VALID [2018-11-23 13:03:24,497 INFO L273 TraceCheckUtils]: 33: Hoare triple {2991#false} ~i~0 := 0; {2991#false} is VALID [2018-11-23 13:03:24,497 INFO L273 TraceCheckUtils]: 34: Hoare triple {2991#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); {2991#false} is VALID [2018-11-23 13:03:24,497 INFO L273 TraceCheckUtils]: 35: Hoare triple {2991#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {2991#false} is VALID [2018-11-23 13:03:24,498 INFO L273 TraceCheckUtils]: 36: Hoare triple {2991#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2991#false} is VALID [2018-11-23 13:03:24,498 INFO L273 TraceCheckUtils]: 37: Hoare triple {2991#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); {2991#false} is VALID [2018-11-23 13:03:24,498 INFO L273 TraceCheckUtils]: 38: Hoare triple {2991#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {2991#false} is VALID [2018-11-23 13:03:24,498 INFO L273 TraceCheckUtils]: 39: Hoare triple {2991#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {2991#false} is VALID [2018-11-23 13:03:24,499 INFO L273 TraceCheckUtils]: 40: Hoare triple {2991#false} assume !(~i~0 < ~edgecount~0); {2991#false} is VALID [2018-11-23 13:03:24,499 INFO L273 TraceCheckUtils]: 41: Hoare triple {2991#false} ~i~0 := 0; {2991#false} is VALID [2018-11-23 13:03:24,499 INFO L273 TraceCheckUtils]: 42: Hoare triple {2991#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2991#false} is VALID [2018-11-23 13:03:24,499 INFO L256 TraceCheckUtils]: 43: Hoare triple {2991#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {2991#false} is VALID [2018-11-23 13:03:24,499 INFO L273 TraceCheckUtils]: 44: Hoare triple {2991#false} ~cond := #in~cond; {2991#false} is VALID [2018-11-23 13:03:24,500 INFO L273 TraceCheckUtils]: 45: Hoare triple {2991#false} assume 0 == ~cond; {2991#false} is VALID [2018-11-23 13:03:24,500 INFO L273 TraceCheckUtils]: 46: Hoare triple {2991#false} assume !false; {2991#false} is VALID [2018-11-23 13:03:24,502 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-23 13:03:24,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:03:24,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-23 13:03:24,522 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-11-23 13:03:24,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:24,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:03:24,578 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:24,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:03:24,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:03:24,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:03:24,579 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand 9 states. [2018-11-23 13:03:25,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:25,426 INFO L93 Difference]: Finished difference Result 139 states and 178 transitions. [2018-11-23 13:03:25,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:03:25,426 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-11-23 13:03:25,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:25,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:03:25,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2018-11-23 13:03:25,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:03:25,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 83 transitions. [2018-11-23 13:03:25,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 83 transitions. [2018-11-23 13:03:25,565 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:25,567 INFO L225 Difference]: With dead ends: 139 [2018-11-23 13:03:25,567 INFO L226 Difference]: Without dead ends: 98 [2018-11-23 13:03:25,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:03:25,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-23 13:03:25,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 67. [2018-11-23 13:03:25,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:25,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 67 states. [2018-11-23 13:03:25,760 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 67 states. [2018-11-23 13:03:25,760 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 67 states. [2018-11-23 13:03:25,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:25,764 INFO L93 Difference]: Finished difference Result 98 states and 122 transitions. [2018-11-23 13:03:25,764 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 122 transitions. [2018-11-23 13:03:25,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:25,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:25,765 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 98 states. [2018-11-23 13:03:25,765 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 98 states. [2018-11-23 13:03:25,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:25,768 INFO L93 Difference]: Finished difference Result 98 states and 122 transitions. [2018-11-23 13:03:25,769 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 122 transitions. [2018-11-23 13:03:25,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:25,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:25,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:25,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:25,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 13:03:25,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2018-11-23 13:03:25,794 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 47 [2018-11-23 13:03:25,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:25,794 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2018-11-23 13:03:25,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:03:25,795 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2018-11-23 13:03:25,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 13:03:25,795 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:25,796 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:25,796 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:25,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:25,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1961700387, now seen corresponding path program 1 times [2018-11-23 13:03:25,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:25,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:25,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:25,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:03:25,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:26,005 INFO L256 TraceCheckUtils]: 0: Hoare triple {3635#true} call ULTIMATE.init(); {3635#true} is VALID [2018-11-23 13:03:26,006 INFO L273 TraceCheckUtils]: 1: Hoare triple {3635#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {3635#true} is VALID [2018-11-23 13:03:26,006 INFO L273 TraceCheckUtils]: 2: Hoare triple {3635#true} assume true; {3635#true} is VALID [2018-11-23 13:03:26,006 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3635#true} {3635#true} #103#return; {3635#true} is VALID [2018-11-23 13:03:26,007 INFO L256 TraceCheckUtils]: 4: Hoare triple {3635#true} call #t~ret18 := main(); {3635#true} is VALID [2018-11-23 13:03:26,009 INFO L273 TraceCheckUtils]: 5: Hoare triple {3635#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {3637#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-23 13:03:26,010 INFO L273 TraceCheckUtils]: 6: Hoare triple {3637#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0); {3637#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-23 13:03:26,010 INFO L273 TraceCheckUtils]: 7: Hoare triple {3637#(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); {3637#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} is VALID [2018-11-23 13:03:26,011 INFO L273 TraceCheckUtils]: 8: Hoare triple {3637#(and (= 0 main_~source~0) (<= 5 main_~nodecount~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3638#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} is VALID [2018-11-23 13:03:26,012 INFO L273 TraceCheckUtils]: 9: Hoare triple {3638#(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); {3638#(and (or (not (= main_~i~0 0)) (<= 5 main_~nodecount~0)) (or (= 0 main_~source~0) (= main_~i~0 0)))} is VALID [2018-11-23 13:03:26,013 INFO L273 TraceCheckUtils]: 10: Hoare triple {3638#(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); {3639#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} is VALID [2018-11-23 13:03:26,014 INFO L273 TraceCheckUtils]: 11: Hoare triple {3639#(and (<= 5 main_~nodecount~0) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3640#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-23 13:03:26,014 INFO L273 TraceCheckUtils]: 12: Hoare triple {3640#(<= (+ main_~i~0 4) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3640#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-23 13:03:26,015 INFO L273 TraceCheckUtils]: 13: Hoare triple {3640#(<= (+ 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); {3640#(<= (+ main_~i~0 4) main_~nodecount~0)} is VALID [2018-11-23 13:03:26,016 INFO L273 TraceCheckUtils]: 14: Hoare triple {3640#(<= (+ main_~i~0 4) main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3641#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-23 13:03:26,016 INFO L273 TraceCheckUtils]: 15: Hoare triple {3641#(<= (+ main_~i~0 3) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3641#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-23 13:03:26,017 INFO L273 TraceCheckUtils]: 16: Hoare triple {3641#(<= (+ 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); {3641#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2018-11-23 13:03:26,018 INFO L273 TraceCheckUtils]: 17: Hoare triple {3641#(<= (+ main_~i~0 3) main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3642#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-23 13:03:26,019 INFO L273 TraceCheckUtils]: 18: Hoare triple {3642#(<= (+ main_~i~0 2) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {3642#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-23 13:03:26,019 INFO L273 TraceCheckUtils]: 19: Hoare triple {3642#(<= (+ 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); {3642#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2018-11-23 13:03:26,020 INFO L273 TraceCheckUtils]: 20: Hoare triple {3642#(<= (+ main_~i~0 2) main_~nodecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3643#(<= (+ main_~i~0 1) main_~nodecount~0)} is VALID [2018-11-23 13:03:26,021 INFO L273 TraceCheckUtils]: 21: Hoare triple {3643#(<= (+ main_~i~0 1) main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {3636#false} is VALID [2018-11-23 13:03:26,021 INFO L273 TraceCheckUtils]: 22: Hoare triple {3636#false} ~i~0 := 0; {3636#false} is VALID [2018-11-23 13:03:26,021 INFO L273 TraceCheckUtils]: 23: Hoare triple {3636#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3636#false} is VALID [2018-11-23 13:03:26,022 INFO L273 TraceCheckUtils]: 24: Hoare triple {3636#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); {3636#false} is VALID [2018-11-23 13:03:26,022 INFO L273 TraceCheckUtils]: 25: Hoare triple {3636#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {3636#false} is VALID [2018-11-23 13:03:26,022 INFO L273 TraceCheckUtils]: 26: Hoare triple {3636#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {3636#false} is VALID [2018-11-23 13:03:26,023 INFO L273 TraceCheckUtils]: 27: Hoare triple {3636#false} assume !(~j~0 < ~edgecount~0); {3636#false} is VALID [2018-11-23 13:03:26,023 INFO L273 TraceCheckUtils]: 28: Hoare triple {3636#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3636#false} is VALID [2018-11-23 13:03:26,023 INFO L273 TraceCheckUtils]: 29: Hoare triple {3636#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3636#false} is VALID [2018-11-23 13:03:26,023 INFO L273 TraceCheckUtils]: 30: Hoare triple {3636#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); {3636#false} is VALID [2018-11-23 13:03:26,023 INFO L273 TraceCheckUtils]: 31: Hoare triple {3636#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {3636#false} is VALID [2018-11-23 13:03:26,024 INFO L273 TraceCheckUtils]: 32: Hoare triple {3636#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {3636#false} is VALID [2018-11-23 13:03:26,024 INFO L273 TraceCheckUtils]: 33: Hoare triple {3636#false} assume !(~j~0 < ~edgecount~0); {3636#false} is VALID [2018-11-23 13:03:26,024 INFO L273 TraceCheckUtils]: 34: Hoare triple {3636#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3636#false} is VALID [2018-11-23 13:03:26,024 INFO L273 TraceCheckUtils]: 35: Hoare triple {3636#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3636#false} is VALID [2018-11-23 13:03:26,024 INFO L273 TraceCheckUtils]: 36: Hoare triple {3636#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); {3636#false} is VALID [2018-11-23 13:03:26,024 INFO L273 TraceCheckUtils]: 37: Hoare triple {3636#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {3636#false} is VALID [2018-11-23 13:03:26,024 INFO L273 TraceCheckUtils]: 38: Hoare triple {3636#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {3636#false} is VALID [2018-11-23 13:03:26,024 INFO L273 TraceCheckUtils]: 39: Hoare triple {3636#false} assume !(~j~0 < ~edgecount~0); {3636#false} is VALID [2018-11-23 13:03:26,025 INFO L273 TraceCheckUtils]: 40: Hoare triple {3636#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3636#false} is VALID [2018-11-23 13:03:26,025 INFO L273 TraceCheckUtils]: 41: Hoare triple {3636#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3636#false} is VALID [2018-11-23 13:03:26,025 INFO L273 TraceCheckUtils]: 42: Hoare triple {3636#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); {3636#false} is VALID [2018-11-23 13:03:26,025 INFO L273 TraceCheckUtils]: 43: Hoare triple {3636#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {3636#false} is VALID [2018-11-23 13:03:26,025 INFO L273 TraceCheckUtils]: 44: Hoare triple {3636#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {3636#false} is VALID [2018-11-23 13:03:26,025 INFO L273 TraceCheckUtils]: 45: Hoare triple {3636#false} assume !(~j~0 < ~edgecount~0); {3636#false} is VALID [2018-11-23 13:03:26,025 INFO L273 TraceCheckUtils]: 46: Hoare triple {3636#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3636#false} is VALID [2018-11-23 13:03:26,025 INFO L273 TraceCheckUtils]: 47: Hoare triple {3636#false} assume !(~i~0 < ~nodecount~0); {3636#false} is VALID [2018-11-23 13:03:26,026 INFO L273 TraceCheckUtils]: 48: Hoare triple {3636#false} ~i~0 := 0; {3636#false} is VALID [2018-11-23 13:03:26,026 INFO L273 TraceCheckUtils]: 49: Hoare triple {3636#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); {3636#false} is VALID [2018-11-23 13:03:26,026 INFO L273 TraceCheckUtils]: 50: Hoare triple {3636#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {3636#false} is VALID [2018-11-23 13:03:26,026 INFO L273 TraceCheckUtils]: 51: Hoare triple {3636#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3636#false} is VALID [2018-11-23 13:03:26,026 INFO L273 TraceCheckUtils]: 52: Hoare triple {3636#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); {3636#false} is VALID [2018-11-23 13:03:26,026 INFO L273 TraceCheckUtils]: 53: Hoare triple {3636#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {3636#false} is VALID [2018-11-23 13:03:26,026 INFO L273 TraceCheckUtils]: 54: Hoare triple {3636#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3636#false} is VALID [2018-11-23 13:03:26,026 INFO L273 TraceCheckUtils]: 55: Hoare triple {3636#false} assume !(~i~0 < ~edgecount~0); {3636#false} is VALID [2018-11-23 13:03:26,027 INFO L273 TraceCheckUtils]: 56: Hoare triple {3636#false} ~i~0 := 0; {3636#false} is VALID [2018-11-23 13:03:26,027 INFO L273 TraceCheckUtils]: 57: Hoare triple {3636#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3636#false} is VALID [2018-11-23 13:03:26,027 INFO L256 TraceCheckUtils]: 58: Hoare triple {3636#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {3636#false} is VALID [2018-11-23 13:03:26,027 INFO L273 TraceCheckUtils]: 59: Hoare triple {3636#false} ~cond := #in~cond; {3636#false} is VALID [2018-11-23 13:03:26,027 INFO L273 TraceCheckUtils]: 60: Hoare triple {3636#false} assume 0 == ~cond; {3636#false} is VALID [2018-11-23 13:03:26,027 INFO L273 TraceCheckUtils]: 61: Hoare triple {3636#false} assume !false; {3636#false} is VALID [2018-11-23 13:03:26,030 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-23 13:03:26,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:26,030 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-23 13:03:26,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:26,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:26,285 INFO L256 TraceCheckUtils]: 0: Hoare triple {3635#true} call ULTIMATE.init(); {3635#true} is VALID [2018-11-23 13:03:26,285 INFO L273 TraceCheckUtils]: 1: Hoare triple {3635#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {3635#true} is VALID [2018-11-23 13:03:26,285 INFO L273 TraceCheckUtils]: 2: Hoare triple {3635#true} assume true; {3635#true} is VALID [2018-11-23 13:03:26,286 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3635#true} {3635#true} #103#return; {3635#true} is VALID [2018-11-23 13:03:26,286 INFO L256 TraceCheckUtils]: 4: Hoare triple {3635#true} call #t~ret18 := main(); {3635#true} is VALID [2018-11-23 13:03:26,290 INFO L273 TraceCheckUtils]: 5: Hoare triple {3635#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {3662#(and (<= main_~source~0 0) (<= 0 main_~i~0))} is VALID [2018-11-23 13:03:26,291 INFO L273 TraceCheckUtils]: 6: Hoare triple {3662#(and (<= main_~source~0 0) (<= 0 main_~i~0))} assume !!(~i~0 < ~nodecount~0); {3662#(and (<= main_~source~0 0) (<= 0 main_~i~0))} is VALID [2018-11-23 13:03:26,292 INFO L273 TraceCheckUtils]: 7: Hoare triple {3662#(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); {3662#(and (<= main_~source~0 0) (<= 0 main_~i~0))} is VALID [2018-11-23 13:03:26,292 INFO L273 TraceCheckUtils]: 8: Hoare triple {3662#(and (<= main_~source~0 0) (<= 0 main_~i~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3672#(and (<= main_~source~0 0) (<= 1 main_~i~0))} is VALID [2018-11-23 13:03:26,293 INFO L273 TraceCheckUtils]: 9: Hoare triple {3672#(and (<= main_~source~0 0) (<= 1 main_~i~0))} assume !!(~i~0 < ~nodecount~0); {3672#(and (<= main_~source~0 0) (<= 1 main_~i~0))} is VALID [2018-11-23 13:03:26,294 INFO L273 TraceCheckUtils]: 10: Hoare triple {3672#(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); {3636#false} is VALID [2018-11-23 13:03:26,294 INFO L273 TraceCheckUtils]: 11: Hoare triple {3636#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3636#false} is VALID [2018-11-23 13:03:26,295 INFO L273 TraceCheckUtils]: 12: Hoare triple {3636#false} assume !!(~i~0 < ~nodecount~0); {3636#false} is VALID [2018-11-23 13:03:26,295 INFO L273 TraceCheckUtils]: 13: Hoare triple {3636#false} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3636#false} is VALID [2018-11-23 13:03:26,295 INFO L273 TraceCheckUtils]: 14: Hoare triple {3636#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3636#false} is VALID [2018-11-23 13:03:26,295 INFO L273 TraceCheckUtils]: 15: Hoare triple {3636#false} assume !!(~i~0 < ~nodecount~0); {3636#false} is VALID [2018-11-23 13:03:26,295 INFO L273 TraceCheckUtils]: 16: Hoare triple {3636#false} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3636#false} is VALID [2018-11-23 13:03:26,296 INFO L273 TraceCheckUtils]: 17: Hoare triple {3636#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3636#false} is VALID [2018-11-23 13:03:26,296 INFO L273 TraceCheckUtils]: 18: Hoare triple {3636#false} assume !!(~i~0 < ~nodecount~0); {3636#false} is VALID [2018-11-23 13:03:26,296 INFO L273 TraceCheckUtils]: 19: Hoare triple {3636#false} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3636#false} is VALID [2018-11-23 13:03:26,296 INFO L273 TraceCheckUtils]: 20: Hoare triple {3636#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3636#false} is VALID [2018-11-23 13:03:26,296 INFO L273 TraceCheckUtils]: 21: Hoare triple {3636#false} assume !(~i~0 < ~nodecount~0); {3636#false} is VALID [2018-11-23 13:03:26,297 INFO L273 TraceCheckUtils]: 22: Hoare triple {3636#false} ~i~0 := 0; {3636#false} is VALID [2018-11-23 13:03:26,297 INFO L273 TraceCheckUtils]: 23: Hoare triple {3636#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3636#false} is VALID [2018-11-23 13:03:26,297 INFO L273 TraceCheckUtils]: 24: Hoare triple {3636#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); {3636#false} is VALID [2018-11-23 13:03:26,297 INFO L273 TraceCheckUtils]: 25: Hoare triple {3636#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {3636#false} is VALID [2018-11-23 13:03:26,298 INFO L273 TraceCheckUtils]: 26: Hoare triple {3636#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {3636#false} is VALID [2018-11-23 13:03:26,298 INFO L273 TraceCheckUtils]: 27: Hoare triple {3636#false} assume !(~j~0 < ~edgecount~0); {3636#false} is VALID [2018-11-23 13:03:26,298 INFO L273 TraceCheckUtils]: 28: Hoare triple {3636#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3636#false} is VALID [2018-11-23 13:03:26,298 INFO L273 TraceCheckUtils]: 29: Hoare triple {3636#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3636#false} is VALID [2018-11-23 13:03:26,298 INFO L273 TraceCheckUtils]: 30: Hoare triple {3636#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); {3636#false} is VALID [2018-11-23 13:03:26,298 INFO L273 TraceCheckUtils]: 31: Hoare triple {3636#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {3636#false} is VALID [2018-11-23 13:03:26,298 INFO L273 TraceCheckUtils]: 32: Hoare triple {3636#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {3636#false} is VALID [2018-11-23 13:03:26,299 INFO L273 TraceCheckUtils]: 33: Hoare triple {3636#false} assume !(~j~0 < ~edgecount~0); {3636#false} is VALID [2018-11-23 13:03:26,299 INFO L273 TraceCheckUtils]: 34: Hoare triple {3636#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3636#false} is VALID [2018-11-23 13:03:26,299 INFO L273 TraceCheckUtils]: 35: Hoare triple {3636#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3636#false} is VALID [2018-11-23 13:03:26,299 INFO L273 TraceCheckUtils]: 36: Hoare triple {3636#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); {3636#false} is VALID [2018-11-23 13:03:26,299 INFO L273 TraceCheckUtils]: 37: Hoare triple {3636#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {3636#false} is VALID [2018-11-23 13:03:26,299 INFO L273 TraceCheckUtils]: 38: Hoare triple {3636#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {3636#false} is VALID [2018-11-23 13:03:26,299 INFO L273 TraceCheckUtils]: 39: Hoare triple {3636#false} assume !(~j~0 < ~edgecount~0); {3636#false} is VALID [2018-11-23 13:03:26,299 INFO L273 TraceCheckUtils]: 40: Hoare triple {3636#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3636#false} is VALID [2018-11-23 13:03:26,300 INFO L273 TraceCheckUtils]: 41: Hoare triple {3636#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3636#false} is VALID [2018-11-23 13:03:26,300 INFO L273 TraceCheckUtils]: 42: Hoare triple {3636#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); {3636#false} is VALID [2018-11-23 13:03:26,300 INFO L273 TraceCheckUtils]: 43: Hoare triple {3636#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {3636#false} is VALID [2018-11-23 13:03:26,300 INFO L273 TraceCheckUtils]: 44: Hoare triple {3636#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {3636#false} is VALID [2018-11-23 13:03:26,300 INFO L273 TraceCheckUtils]: 45: Hoare triple {3636#false} assume !(~j~0 < ~edgecount~0); {3636#false} is VALID [2018-11-23 13:03:26,300 INFO L273 TraceCheckUtils]: 46: Hoare triple {3636#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3636#false} is VALID [2018-11-23 13:03:26,300 INFO L273 TraceCheckUtils]: 47: Hoare triple {3636#false} assume !(~i~0 < ~nodecount~0); {3636#false} is VALID [2018-11-23 13:03:26,300 INFO L273 TraceCheckUtils]: 48: Hoare triple {3636#false} ~i~0 := 0; {3636#false} is VALID [2018-11-23 13:03:26,301 INFO L273 TraceCheckUtils]: 49: Hoare triple {3636#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); {3636#false} is VALID [2018-11-23 13:03:26,301 INFO L273 TraceCheckUtils]: 50: Hoare triple {3636#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {3636#false} is VALID [2018-11-23 13:03:26,301 INFO L273 TraceCheckUtils]: 51: Hoare triple {3636#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3636#false} is VALID [2018-11-23 13:03:26,301 INFO L273 TraceCheckUtils]: 52: Hoare triple {3636#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); {3636#false} is VALID [2018-11-23 13:03:26,301 INFO L273 TraceCheckUtils]: 53: Hoare triple {3636#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {3636#false} is VALID [2018-11-23 13:03:26,301 INFO L273 TraceCheckUtils]: 54: Hoare triple {3636#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {3636#false} is VALID [2018-11-23 13:03:26,301 INFO L273 TraceCheckUtils]: 55: Hoare triple {3636#false} assume !(~i~0 < ~edgecount~0); {3636#false} is VALID [2018-11-23 13:03:26,301 INFO L273 TraceCheckUtils]: 56: Hoare triple {3636#false} ~i~0 := 0; {3636#false} is VALID [2018-11-23 13:03:26,302 INFO L273 TraceCheckUtils]: 57: Hoare triple {3636#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3636#false} is VALID [2018-11-23 13:03:26,302 INFO L256 TraceCheckUtils]: 58: Hoare triple {3636#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {3636#false} is VALID [2018-11-23 13:03:26,302 INFO L273 TraceCheckUtils]: 59: Hoare triple {3636#false} ~cond := #in~cond; {3636#false} is VALID [2018-11-23 13:03:26,302 INFO L273 TraceCheckUtils]: 60: Hoare triple {3636#false} assume 0 == ~cond; {3636#false} is VALID [2018-11-23 13:03:26,302 INFO L273 TraceCheckUtils]: 61: Hoare triple {3636#false} assume !false; {3636#false} is VALID [2018-11-23 13:03:26,304 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-23 13:03:26,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:03:26,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2018-11-23 13:03:26,325 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-11-23 13:03:26,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:26,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:03:26,377 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:26,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:03:26,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:03:26,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:03:26,378 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand 11 states. [2018-11-23 13:03:27,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:27,489 INFO L93 Difference]: Finished difference Result 160 states and 199 transitions. [2018-11-23 13:03:27,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:03:27,489 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-11-23 13:03:27,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:27,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:03:27,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2018-11-23 13:03:27,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:03:27,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2018-11-23 13:03:27,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 154 transitions. [2018-11-23 13:03:27,674 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:27,677 INFO L225 Difference]: With dead ends: 160 [2018-11-23 13:03:27,678 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 13:03:27,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:03:27,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 13:03:28,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 73. [2018-11-23 13:03:28,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:28,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 73 states. [2018-11-23 13:03:28,564 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 73 states. [2018-11-23 13:03:28,564 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 73 states. [2018-11-23 13:03:28,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:28,566 INFO L93 Difference]: Finished difference Result 104 states and 124 transitions. [2018-11-23 13:03:28,566 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 124 transitions. [2018-11-23 13:03:28,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:28,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:28,568 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 104 states. [2018-11-23 13:03:28,568 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 104 states. [2018-11-23 13:03:28,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:28,571 INFO L93 Difference]: Finished difference Result 104 states and 124 transitions. [2018-11-23 13:03:28,572 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 124 transitions. [2018-11-23 13:03:28,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:28,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:28,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:28,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:28,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 13:03:28,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 86 transitions. [2018-11-23 13:03:28,575 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 86 transitions. Word has length 62 [2018-11-23 13:03:28,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:28,576 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 86 transitions. [2018-11-23 13:03:28,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:03:28,576 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2018-11-23 13:03:28,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 13:03:28,577 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:28,577 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:28,577 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:28,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:28,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1323956546, now seen corresponding path program 2 times [2018-11-23 13:03:28,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:28,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:28,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:28,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:28,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:29,131 INFO L256 TraceCheckUtils]: 0: Hoare triple {4383#true} call ULTIMATE.init(); {4383#true} is VALID [2018-11-23 13:03:29,131 INFO L273 TraceCheckUtils]: 1: Hoare triple {4383#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {4383#true} is VALID [2018-11-23 13:03:29,131 INFO L273 TraceCheckUtils]: 2: Hoare triple {4383#true} assume true; {4383#true} is VALID [2018-11-23 13:03:29,132 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4383#true} {4383#true} #103#return; {4383#true} is VALID [2018-11-23 13:03:29,132 INFO L256 TraceCheckUtils]: 4: Hoare triple {4383#true} call #t~ret18 := main(); {4383#true} is VALID [2018-11-23 13:03:29,134 INFO L273 TraceCheckUtils]: 5: Hoare triple {4383#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,135 INFO L273 TraceCheckUtils]: 6: Hoare triple {4385#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,135 INFO L273 TraceCheckUtils]: 7: Hoare triple {4385#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,136 INFO L273 TraceCheckUtils]: 8: Hoare triple {4385#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,136 INFO L273 TraceCheckUtils]: 9: Hoare triple {4385#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,137 INFO L273 TraceCheckUtils]: 10: Hoare triple {4385#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,138 INFO L273 TraceCheckUtils]: 11: Hoare triple {4385#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,138 INFO L273 TraceCheckUtils]: 12: Hoare triple {4385#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,139 INFO L273 TraceCheckUtils]: 13: Hoare triple {4385#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,139 INFO L273 TraceCheckUtils]: 14: Hoare triple {4385#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,140 INFO L273 TraceCheckUtils]: 15: Hoare triple {4385#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,140 INFO L273 TraceCheckUtils]: 16: Hoare triple {4385#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,141 INFO L273 TraceCheckUtils]: 17: Hoare triple {4385#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,141 INFO L273 TraceCheckUtils]: 18: Hoare triple {4385#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,142 INFO L273 TraceCheckUtils]: 19: Hoare triple {4385#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,142 INFO L273 TraceCheckUtils]: 20: Hoare triple {4385#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,143 INFO L273 TraceCheckUtils]: 21: Hoare triple {4385#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,143 INFO L273 TraceCheckUtils]: 22: Hoare triple {4385#(<= 20 main_~edgecount~0)} ~i~0 := 0; {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,144 INFO L273 TraceCheckUtils]: 23: Hoare triple {4385#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4386#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} is VALID [2018-11-23 13:03:29,145 INFO L273 TraceCheckUtils]: 24: Hoare triple {4386#(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); {4386#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} is VALID [2018-11-23 13:03:29,146 INFO L273 TraceCheckUtils]: 25: Hoare triple {4386#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {4386#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} is VALID [2018-11-23 13:03:29,147 INFO L273 TraceCheckUtils]: 26: Hoare triple {4386#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {4387#(<= (+ main_~j~0 19) main_~edgecount~0)} is VALID [2018-11-23 13:03:29,148 INFO L273 TraceCheckUtils]: 27: Hoare triple {4387#(<= (+ main_~j~0 19) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {4384#false} is VALID [2018-11-23 13:03:29,148 INFO L273 TraceCheckUtils]: 28: Hoare triple {4384#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4384#false} is VALID [2018-11-23 13:03:29,148 INFO L273 TraceCheckUtils]: 29: Hoare triple {4384#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4384#false} is VALID [2018-11-23 13:03:29,148 INFO L273 TraceCheckUtils]: 30: Hoare triple {4384#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); {4384#false} is VALID [2018-11-23 13:03:29,149 INFO L273 TraceCheckUtils]: 31: Hoare triple {4384#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {4384#false} is VALID [2018-11-23 13:03:29,149 INFO L273 TraceCheckUtils]: 32: Hoare triple {4384#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {4384#false} is VALID [2018-11-23 13:03:29,149 INFO L273 TraceCheckUtils]: 33: Hoare triple {4384#false} assume !(~j~0 < ~edgecount~0); {4384#false} is VALID [2018-11-23 13:03:29,149 INFO L273 TraceCheckUtils]: 34: Hoare triple {4384#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4384#false} is VALID [2018-11-23 13:03:29,150 INFO L273 TraceCheckUtils]: 35: Hoare triple {4384#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4384#false} is VALID [2018-11-23 13:03:29,150 INFO L273 TraceCheckUtils]: 36: Hoare triple {4384#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); {4384#false} is VALID [2018-11-23 13:03:29,150 INFO L273 TraceCheckUtils]: 37: Hoare triple {4384#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {4384#false} is VALID [2018-11-23 13:03:29,150 INFO L273 TraceCheckUtils]: 38: Hoare triple {4384#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {4384#false} is VALID [2018-11-23 13:03:29,150 INFO L273 TraceCheckUtils]: 39: Hoare triple {4384#false} assume !(~j~0 < ~edgecount~0); {4384#false} is VALID [2018-11-23 13:03:29,150 INFO L273 TraceCheckUtils]: 40: Hoare triple {4384#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4384#false} is VALID [2018-11-23 13:03:29,151 INFO L273 TraceCheckUtils]: 41: Hoare triple {4384#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4384#false} is VALID [2018-11-23 13:03:29,151 INFO L273 TraceCheckUtils]: 42: Hoare triple {4384#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); {4384#false} is VALID [2018-11-23 13:03:29,151 INFO L273 TraceCheckUtils]: 43: Hoare triple {4384#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {4384#false} is VALID [2018-11-23 13:03:29,151 INFO L273 TraceCheckUtils]: 44: Hoare triple {4384#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {4384#false} is VALID [2018-11-23 13:03:29,151 INFO L273 TraceCheckUtils]: 45: Hoare triple {4384#false} assume !(~j~0 < ~edgecount~0); {4384#false} is VALID [2018-11-23 13:03:29,151 INFO L273 TraceCheckUtils]: 46: Hoare triple {4384#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4384#false} is VALID [2018-11-23 13:03:29,151 INFO L273 TraceCheckUtils]: 47: Hoare triple {4384#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4384#false} is VALID [2018-11-23 13:03:29,152 INFO L273 TraceCheckUtils]: 48: Hoare triple {4384#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); {4384#false} is VALID [2018-11-23 13:03:29,152 INFO L273 TraceCheckUtils]: 49: Hoare triple {4384#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {4384#false} is VALID [2018-11-23 13:03:29,152 INFO L273 TraceCheckUtils]: 50: Hoare triple {4384#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {4384#false} is VALID [2018-11-23 13:03:29,152 INFO L273 TraceCheckUtils]: 51: Hoare triple {4384#false} assume !(~j~0 < ~edgecount~0); {4384#false} is VALID [2018-11-23 13:03:29,152 INFO L273 TraceCheckUtils]: 52: Hoare triple {4384#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4384#false} is VALID [2018-11-23 13:03:29,152 INFO L273 TraceCheckUtils]: 53: Hoare triple {4384#false} assume !(~i~0 < ~nodecount~0); {4384#false} is VALID [2018-11-23 13:03:29,153 INFO L273 TraceCheckUtils]: 54: Hoare triple {4384#false} ~i~0 := 0; {4384#false} is VALID [2018-11-23 13:03:29,153 INFO L273 TraceCheckUtils]: 55: Hoare triple {4384#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); {4384#false} is VALID [2018-11-23 13:03:29,153 INFO L273 TraceCheckUtils]: 56: Hoare triple {4384#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {4384#false} is VALID [2018-11-23 13:03:29,153 INFO L273 TraceCheckUtils]: 57: Hoare triple {4384#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4384#false} is VALID [2018-11-23 13:03:29,153 INFO L273 TraceCheckUtils]: 58: Hoare triple {4384#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); {4384#false} is VALID [2018-11-23 13:03:29,154 INFO L273 TraceCheckUtils]: 59: Hoare triple {4384#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {4384#false} is VALID [2018-11-23 13:03:29,154 INFO L273 TraceCheckUtils]: 60: Hoare triple {4384#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4384#false} is VALID [2018-11-23 13:03:29,154 INFO L273 TraceCheckUtils]: 61: Hoare triple {4384#false} assume !(~i~0 < ~edgecount~0); {4384#false} is VALID [2018-11-23 13:03:29,154 INFO L273 TraceCheckUtils]: 62: Hoare triple {4384#false} ~i~0 := 0; {4384#false} is VALID [2018-11-23 13:03:29,154 INFO L273 TraceCheckUtils]: 63: Hoare triple {4384#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4384#false} is VALID [2018-11-23 13:03:29,154 INFO L256 TraceCheckUtils]: 64: Hoare triple {4384#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {4384#false} is VALID [2018-11-23 13:03:29,155 INFO L273 TraceCheckUtils]: 65: Hoare triple {4384#false} ~cond := #in~cond; {4384#false} is VALID [2018-11-23 13:03:29,155 INFO L273 TraceCheckUtils]: 66: Hoare triple {4384#false} assume 0 == ~cond; {4384#false} is VALID [2018-11-23 13:03:29,155 INFO L273 TraceCheckUtils]: 67: Hoare triple {4384#false} assume !false; {4384#false} is VALID [2018-11-23 13:03:29,158 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 13:03:29,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:29,159 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-23 13:03:29,176 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:03:29,237 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:03:29,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:29,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:29,419 INFO L256 TraceCheckUtils]: 0: Hoare triple {4383#true} call ULTIMATE.init(); {4383#true} is VALID [2018-11-23 13:03:29,420 INFO L273 TraceCheckUtils]: 1: Hoare triple {4383#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {4383#true} is VALID [2018-11-23 13:03:29,420 INFO L273 TraceCheckUtils]: 2: Hoare triple {4383#true} assume true; {4383#true} is VALID [2018-11-23 13:03:29,420 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4383#true} {4383#true} #103#return; {4383#true} is VALID [2018-11-23 13:03:29,420 INFO L256 TraceCheckUtils]: 4: Hoare triple {4383#true} call #t~ret18 := main(); {4383#true} is VALID [2018-11-23 13:03:29,424 INFO L273 TraceCheckUtils]: 5: Hoare triple {4383#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,425 INFO L273 TraceCheckUtils]: 6: Hoare triple {4385#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,425 INFO L273 TraceCheckUtils]: 7: Hoare triple {4385#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,426 INFO L273 TraceCheckUtils]: 8: Hoare triple {4385#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,426 INFO L273 TraceCheckUtils]: 9: Hoare triple {4385#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,427 INFO L273 TraceCheckUtils]: 10: Hoare triple {4385#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,428 INFO L273 TraceCheckUtils]: 11: Hoare triple {4385#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,428 INFO L273 TraceCheckUtils]: 12: Hoare triple {4385#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,429 INFO L273 TraceCheckUtils]: 13: Hoare triple {4385#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,429 INFO L273 TraceCheckUtils]: 14: Hoare triple {4385#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,430 INFO L273 TraceCheckUtils]: 15: Hoare triple {4385#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,430 INFO L273 TraceCheckUtils]: 16: Hoare triple {4385#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,431 INFO L273 TraceCheckUtils]: 17: Hoare triple {4385#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,431 INFO L273 TraceCheckUtils]: 18: Hoare triple {4385#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,432 INFO L273 TraceCheckUtils]: 19: Hoare triple {4385#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,432 INFO L273 TraceCheckUtils]: 20: Hoare triple {4385#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,433 INFO L273 TraceCheckUtils]: 21: Hoare triple {4385#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,433 INFO L273 TraceCheckUtils]: 22: Hoare triple {4385#(<= 20 main_~edgecount~0)} ~i~0 := 0; {4385#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:29,434 INFO L273 TraceCheckUtils]: 23: Hoare triple {4385#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4460#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-23 13:03:29,435 INFO L273 TraceCheckUtils]: 24: Hoare triple {4460#(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); {4460#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-23 13:03:29,436 INFO L273 TraceCheckUtils]: 25: Hoare triple {4460#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {4460#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-23 13:03:29,437 INFO L273 TraceCheckUtils]: 26: Hoare triple {4460#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {4470#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-23 13:03:29,438 INFO L273 TraceCheckUtils]: 27: Hoare triple {4470#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume !(~j~0 < ~edgecount~0); {4384#false} is VALID [2018-11-23 13:03:29,438 INFO L273 TraceCheckUtils]: 28: Hoare triple {4384#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4384#false} is VALID [2018-11-23 13:03:29,438 INFO L273 TraceCheckUtils]: 29: Hoare triple {4384#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4384#false} is VALID [2018-11-23 13:03:29,439 INFO L273 TraceCheckUtils]: 30: Hoare triple {4384#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); {4384#false} is VALID [2018-11-23 13:03:29,439 INFO L273 TraceCheckUtils]: 31: Hoare triple {4384#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {4384#false} is VALID [2018-11-23 13:03:29,439 INFO L273 TraceCheckUtils]: 32: Hoare triple {4384#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {4384#false} is VALID [2018-11-23 13:03:29,439 INFO L273 TraceCheckUtils]: 33: Hoare triple {4384#false} assume !(~j~0 < ~edgecount~0); {4384#false} is VALID [2018-11-23 13:03:29,439 INFO L273 TraceCheckUtils]: 34: Hoare triple {4384#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4384#false} is VALID [2018-11-23 13:03:29,440 INFO L273 TraceCheckUtils]: 35: Hoare triple {4384#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4384#false} is VALID [2018-11-23 13:03:29,440 INFO L273 TraceCheckUtils]: 36: Hoare triple {4384#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); {4384#false} is VALID [2018-11-23 13:03:29,440 INFO L273 TraceCheckUtils]: 37: Hoare triple {4384#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {4384#false} is VALID [2018-11-23 13:03:29,440 INFO L273 TraceCheckUtils]: 38: Hoare triple {4384#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {4384#false} is VALID [2018-11-23 13:03:29,440 INFO L273 TraceCheckUtils]: 39: Hoare triple {4384#false} assume !(~j~0 < ~edgecount~0); {4384#false} is VALID [2018-11-23 13:03:29,441 INFO L273 TraceCheckUtils]: 40: Hoare triple {4384#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4384#false} is VALID [2018-11-23 13:03:29,441 INFO L273 TraceCheckUtils]: 41: Hoare triple {4384#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4384#false} is VALID [2018-11-23 13:03:29,441 INFO L273 TraceCheckUtils]: 42: Hoare triple {4384#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); {4384#false} is VALID [2018-11-23 13:03:29,441 INFO L273 TraceCheckUtils]: 43: Hoare triple {4384#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {4384#false} is VALID [2018-11-23 13:03:29,441 INFO L273 TraceCheckUtils]: 44: Hoare triple {4384#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {4384#false} is VALID [2018-11-23 13:03:29,441 INFO L273 TraceCheckUtils]: 45: Hoare triple {4384#false} assume !(~j~0 < ~edgecount~0); {4384#false} is VALID [2018-11-23 13:03:29,441 INFO L273 TraceCheckUtils]: 46: Hoare triple {4384#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4384#false} is VALID [2018-11-23 13:03:29,442 INFO L273 TraceCheckUtils]: 47: Hoare triple {4384#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4384#false} is VALID [2018-11-23 13:03:29,442 INFO L273 TraceCheckUtils]: 48: Hoare triple {4384#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); {4384#false} is VALID [2018-11-23 13:03:29,442 INFO L273 TraceCheckUtils]: 49: Hoare triple {4384#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {4384#false} is VALID [2018-11-23 13:03:29,442 INFO L273 TraceCheckUtils]: 50: Hoare triple {4384#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {4384#false} is VALID [2018-11-23 13:03:29,442 INFO L273 TraceCheckUtils]: 51: Hoare triple {4384#false} assume !(~j~0 < ~edgecount~0); {4384#false} is VALID [2018-11-23 13:03:29,442 INFO L273 TraceCheckUtils]: 52: Hoare triple {4384#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4384#false} is VALID [2018-11-23 13:03:29,442 INFO L273 TraceCheckUtils]: 53: Hoare triple {4384#false} assume !(~i~0 < ~nodecount~0); {4384#false} is VALID [2018-11-23 13:03:29,442 INFO L273 TraceCheckUtils]: 54: Hoare triple {4384#false} ~i~0 := 0; {4384#false} is VALID [2018-11-23 13:03:29,443 INFO L273 TraceCheckUtils]: 55: Hoare triple {4384#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); {4384#false} is VALID [2018-11-23 13:03:29,443 INFO L273 TraceCheckUtils]: 56: Hoare triple {4384#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {4384#false} is VALID [2018-11-23 13:03:29,443 INFO L273 TraceCheckUtils]: 57: Hoare triple {4384#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4384#false} is VALID [2018-11-23 13:03:29,443 INFO L273 TraceCheckUtils]: 58: Hoare triple {4384#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); {4384#false} is VALID [2018-11-23 13:03:29,443 INFO L273 TraceCheckUtils]: 59: Hoare triple {4384#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {4384#false} is VALID [2018-11-23 13:03:29,443 INFO L273 TraceCheckUtils]: 60: Hoare triple {4384#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {4384#false} is VALID [2018-11-23 13:03:29,443 INFO L273 TraceCheckUtils]: 61: Hoare triple {4384#false} assume !(~i~0 < ~edgecount~0); {4384#false} is VALID [2018-11-23 13:03:29,443 INFO L273 TraceCheckUtils]: 62: Hoare triple {4384#false} ~i~0 := 0; {4384#false} is VALID [2018-11-23 13:03:29,444 INFO L273 TraceCheckUtils]: 63: Hoare triple {4384#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4384#false} is VALID [2018-11-23 13:03:29,444 INFO L256 TraceCheckUtils]: 64: Hoare triple {4384#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {4384#false} is VALID [2018-11-23 13:03:29,444 INFO L273 TraceCheckUtils]: 65: Hoare triple {4384#false} ~cond := #in~cond; {4384#false} is VALID [2018-11-23 13:03:29,444 INFO L273 TraceCheckUtils]: 66: Hoare triple {4384#false} assume 0 == ~cond; {4384#false} is VALID [2018-11-23 13:03:29,444 INFO L273 TraceCheckUtils]: 67: Hoare triple {4384#false} assume !false; {4384#false} is VALID [2018-11-23 13:03:29,447 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 13:03:29,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:29,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-23 13:03:29,466 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2018-11-23 13:03:29,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:29,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:03:29,509 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:29,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:03:29,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:03:29,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:03:29,510 INFO L87 Difference]: Start difference. First operand 73 states and 86 transitions. Second operand 7 states. [2018-11-23 13:03:29,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:29,962 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2018-11-23 13:03:29,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:03:29,962 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2018-11-23 13:03:29,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:29,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:03:29,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2018-11-23 13:03:29,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:03:29,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2018-11-23 13:03:29,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2018-11-23 13:03:30,043 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:30,046 INFO L225 Difference]: With dead ends: 143 [2018-11-23 13:03:30,046 INFO L226 Difference]: Without dead ends: 98 [2018-11-23 13:03:30,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:03:30,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-23 13:03:30,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2018-11-23 13:03:30,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:30,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 88 states. [2018-11-23 13:03:30,425 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 88 states. [2018-11-23 13:03:30,425 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 88 states. [2018-11-23 13:03:30,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:30,428 INFO L93 Difference]: Finished difference Result 98 states and 121 transitions. [2018-11-23 13:03:30,428 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2018-11-23 13:03:30,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:30,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:30,428 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 98 states. [2018-11-23 13:03:30,428 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 98 states. [2018-11-23 13:03:30,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:30,431 INFO L93 Difference]: Finished difference Result 98 states and 121 transitions. [2018-11-23 13:03:30,431 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2018-11-23 13:03:30,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:30,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:30,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:30,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:30,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 13:03:30,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2018-11-23 13:03:30,434 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 68 [2018-11-23 13:03:30,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:30,434 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2018-11-23 13:03:30,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:03:30,435 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2018-11-23 13:03:30,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 13:03:30,435 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:30,436 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:30,436 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:30,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:30,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1614763058, now seen corresponding path program 3 times [2018-11-23 13:03:30,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:30,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:30,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:30,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:03:30,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:31,179 INFO L256 TraceCheckUtils]: 0: Hoare triple {5113#true} call ULTIMATE.init(); {5113#true} is VALID [2018-11-23 13:03:31,180 INFO L273 TraceCheckUtils]: 1: Hoare triple {5113#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {5113#true} is VALID [2018-11-23 13:03:31,180 INFO L273 TraceCheckUtils]: 2: Hoare triple {5113#true} assume true; {5113#true} is VALID [2018-11-23 13:03:31,180 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5113#true} {5113#true} #103#return; {5113#true} is VALID [2018-11-23 13:03:31,181 INFO L256 TraceCheckUtils]: 4: Hoare triple {5113#true} call #t~ret18 := main(); {5113#true} is VALID [2018-11-23 13:03:31,185 INFO L273 TraceCheckUtils]: 5: Hoare triple {5113#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,185 INFO L273 TraceCheckUtils]: 6: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,186 INFO L273 TraceCheckUtils]: 7: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,186 INFO L273 TraceCheckUtils]: 8: Hoare triple {5115#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,187 INFO L273 TraceCheckUtils]: 9: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,187 INFO L273 TraceCheckUtils]: 10: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,188 INFO L273 TraceCheckUtils]: 11: Hoare triple {5115#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,188 INFO L273 TraceCheckUtils]: 12: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,189 INFO L273 TraceCheckUtils]: 13: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,190 INFO L273 TraceCheckUtils]: 14: Hoare triple {5115#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,190 INFO L273 TraceCheckUtils]: 15: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,191 INFO L273 TraceCheckUtils]: 16: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,191 INFO L273 TraceCheckUtils]: 17: Hoare triple {5115#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,192 INFO L273 TraceCheckUtils]: 18: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,196 INFO L273 TraceCheckUtils]: 19: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,197 INFO L273 TraceCheckUtils]: 20: Hoare triple {5115#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,197 INFO L273 TraceCheckUtils]: 21: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,197 INFO L273 TraceCheckUtils]: 22: Hoare triple {5115#(<= 20 main_~edgecount~0)} ~i~0 := 0; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,215 INFO L273 TraceCheckUtils]: 23: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5116#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} is VALID [2018-11-23 13:03:31,231 INFO L273 TraceCheckUtils]: 24: Hoare triple {5116#(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); {5116#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} is VALID [2018-11-23 13:03:31,247 INFO L273 TraceCheckUtils]: 25: Hoare triple {5116#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {5116#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} is VALID [2018-11-23 13:03:31,262 INFO L273 TraceCheckUtils]: 26: Hoare triple {5116#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5117#(<= (+ main_~j~0 19) main_~edgecount~0)} is VALID [2018-11-23 13:03:31,270 INFO L273 TraceCheckUtils]: 27: Hoare triple {5117#(<= (+ main_~j~0 19) 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); {5117#(<= (+ main_~j~0 19) main_~edgecount~0)} is VALID [2018-11-23 13:03:31,270 INFO L273 TraceCheckUtils]: 28: Hoare triple {5117#(<= (+ main_~j~0 19) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {5117#(<= (+ main_~j~0 19) main_~edgecount~0)} is VALID [2018-11-23 13:03:31,271 INFO L273 TraceCheckUtils]: 29: Hoare triple {5117#(<= (+ main_~j~0 19) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5118#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2018-11-23 13:03:31,272 INFO L273 TraceCheckUtils]: 30: Hoare triple {5118#(<= (+ main_~j~0 18) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {5114#false} is VALID [2018-11-23 13:03:31,272 INFO L273 TraceCheckUtils]: 31: Hoare triple {5114#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5114#false} is VALID [2018-11-23 13:03:31,272 INFO L273 TraceCheckUtils]: 32: Hoare triple {5114#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5114#false} is VALID [2018-11-23 13:03:31,272 INFO L273 TraceCheckUtils]: 33: Hoare triple {5114#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); {5114#false} is VALID [2018-11-23 13:03:31,272 INFO L273 TraceCheckUtils]: 34: Hoare triple {5114#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {5114#false} is VALID [2018-11-23 13:03:31,273 INFO L273 TraceCheckUtils]: 35: Hoare triple {5114#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5114#false} is VALID [2018-11-23 13:03:31,273 INFO L273 TraceCheckUtils]: 36: Hoare triple {5114#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); {5114#false} is VALID [2018-11-23 13:03:31,273 INFO L273 TraceCheckUtils]: 37: Hoare triple {5114#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {5114#false} is VALID [2018-11-23 13:03:31,273 INFO L273 TraceCheckUtils]: 38: Hoare triple {5114#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5114#false} is VALID [2018-11-23 13:03:31,273 INFO L273 TraceCheckUtils]: 39: Hoare triple {5114#false} assume !(~j~0 < ~edgecount~0); {5114#false} is VALID [2018-11-23 13:03:31,273 INFO L273 TraceCheckUtils]: 40: Hoare triple {5114#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5114#false} is VALID [2018-11-23 13:03:31,274 INFO L273 TraceCheckUtils]: 41: Hoare triple {5114#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5114#false} is VALID [2018-11-23 13:03:31,274 INFO L273 TraceCheckUtils]: 42: Hoare triple {5114#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); {5114#false} is VALID [2018-11-23 13:03:31,274 INFO L273 TraceCheckUtils]: 43: Hoare triple {5114#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {5114#false} is VALID [2018-11-23 13:03:31,274 INFO L273 TraceCheckUtils]: 44: Hoare triple {5114#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5114#false} is VALID [2018-11-23 13:03:31,274 INFO L273 TraceCheckUtils]: 45: Hoare triple {5114#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); {5114#false} is VALID [2018-11-23 13:03:31,275 INFO L273 TraceCheckUtils]: 46: Hoare triple {5114#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {5114#false} is VALID [2018-11-23 13:03:31,275 INFO L273 TraceCheckUtils]: 47: Hoare triple {5114#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5114#false} is VALID [2018-11-23 13:03:31,275 INFO L273 TraceCheckUtils]: 48: Hoare triple {5114#false} assume !(~j~0 < ~edgecount~0); {5114#false} is VALID [2018-11-23 13:03:31,275 INFO L273 TraceCheckUtils]: 49: Hoare triple {5114#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5114#false} is VALID [2018-11-23 13:03:31,275 INFO L273 TraceCheckUtils]: 50: Hoare triple {5114#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5114#false} is VALID [2018-11-23 13:03:31,275 INFO L273 TraceCheckUtils]: 51: Hoare triple {5114#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); {5114#false} is VALID [2018-11-23 13:03:31,276 INFO L273 TraceCheckUtils]: 52: Hoare triple {5114#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {5114#false} is VALID [2018-11-23 13:03:31,276 INFO L273 TraceCheckUtils]: 53: Hoare triple {5114#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5114#false} is VALID [2018-11-23 13:03:31,276 INFO L273 TraceCheckUtils]: 54: Hoare triple {5114#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); {5114#false} is VALID [2018-11-23 13:03:31,276 INFO L273 TraceCheckUtils]: 55: Hoare triple {5114#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {5114#false} is VALID [2018-11-23 13:03:31,276 INFO L273 TraceCheckUtils]: 56: Hoare triple {5114#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5114#false} is VALID [2018-11-23 13:03:31,276 INFO L273 TraceCheckUtils]: 57: Hoare triple {5114#false} assume !(~j~0 < ~edgecount~0); {5114#false} is VALID [2018-11-23 13:03:31,277 INFO L273 TraceCheckUtils]: 58: Hoare triple {5114#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5114#false} is VALID [2018-11-23 13:03:31,277 INFO L273 TraceCheckUtils]: 59: Hoare triple {5114#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5114#false} is VALID [2018-11-23 13:03:31,277 INFO L273 TraceCheckUtils]: 60: Hoare triple {5114#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); {5114#false} is VALID [2018-11-23 13:03:31,277 INFO L273 TraceCheckUtils]: 61: Hoare triple {5114#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {5114#false} is VALID [2018-11-23 13:03:31,277 INFO L273 TraceCheckUtils]: 62: Hoare triple {5114#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5114#false} is VALID [2018-11-23 13:03:31,277 INFO L273 TraceCheckUtils]: 63: Hoare triple {5114#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); {5114#false} is VALID [2018-11-23 13:03:31,278 INFO L273 TraceCheckUtils]: 64: Hoare triple {5114#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {5114#false} is VALID [2018-11-23 13:03:31,278 INFO L273 TraceCheckUtils]: 65: Hoare triple {5114#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5114#false} is VALID [2018-11-23 13:03:31,278 INFO L273 TraceCheckUtils]: 66: Hoare triple {5114#false} assume !(~j~0 < ~edgecount~0); {5114#false} is VALID [2018-11-23 13:03:31,278 INFO L273 TraceCheckUtils]: 67: Hoare triple {5114#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5114#false} is VALID [2018-11-23 13:03:31,278 INFO L273 TraceCheckUtils]: 68: Hoare triple {5114#false} assume !(~i~0 < ~nodecount~0); {5114#false} is VALID [2018-11-23 13:03:31,278 INFO L273 TraceCheckUtils]: 69: Hoare triple {5114#false} ~i~0 := 0; {5114#false} is VALID [2018-11-23 13:03:31,279 INFO L273 TraceCheckUtils]: 70: Hoare triple {5114#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); {5114#false} is VALID [2018-11-23 13:03:31,279 INFO L273 TraceCheckUtils]: 71: Hoare triple {5114#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {5114#false} is VALID [2018-11-23 13:03:31,279 INFO L273 TraceCheckUtils]: 72: Hoare triple {5114#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5114#false} is VALID [2018-11-23 13:03:31,279 INFO L273 TraceCheckUtils]: 73: Hoare triple {5114#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); {5114#false} is VALID [2018-11-23 13:03:31,279 INFO L273 TraceCheckUtils]: 74: Hoare triple {5114#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {5114#false} is VALID [2018-11-23 13:03:31,280 INFO L273 TraceCheckUtils]: 75: Hoare triple {5114#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5114#false} is VALID [2018-11-23 13:03:31,280 INFO L273 TraceCheckUtils]: 76: Hoare triple {5114#false} assume !(~i~0 < ~edgecount~0); {5114#false} is VALID [2018-11-23 13:03:31,280 INFO L273 TraceCheckUtils]: 77: Hoare triple {5114#false} ~i~0 := 0; {5114#false} is VALID [2018-11-23 13:03:31,280 INFO L273 TraceCheckUtils]: 78: Hoare triple {5114#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5114#false} is VALID [2018-11-23 13:03:31,280 INFO L256 TraceCheckUtils]: 79: Hoare triple {5114#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {5114#false} is VALID [2018-11-23 13:03:31,280 INFO L273 TraceCheckUtils]: 80: Hoare triple {5114#false} ~cond := #in~cond; {5114#false} is VALID [2018-11-23 13:03:31,281 INFO L273 TraceCheckUtils]: 81: Hoare triple {5114#false} assume 0 == ~cond; {5114#false} is VALID [2018-11-23 13:03:31,281 INFO L273 TraceCheckUtils]: 82: Hoare triple {5114#false} assume !false; {5114#false} is VALID [2018-11-23 13:03:31,286 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 73 proven. 5 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-11-23 13:03:31,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:31,286 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-23 13:03:31,304 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:03:31,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 13:03:31,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:31,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:31,530 INFO L256 TraceCheckUtils]: 0: Hoare triple {5113#true} call ULTIMATE.init(); {5113#true} is VALID [2018-11-23 13:03:31,531 INFO L273 TraceCheckUtils]: 1: Hoare triple {5113#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {5113#true} is VALID [2018-11-23 13:03:31,531 INFO L273 TraceCheckUtils]: 2: Hoare triple {5113#true} assume true; {5113#true} is VALID [2018-11-23 13:03:31,531 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5113#true} {5113#true} #103#return; {5113#true} is VALID [2018-11-23 13:03:31,531 INFO L256 TraceCheckUtils]: 4: Hoare triple {5113#true} call #t~ret18 := main(); {5113#true} is VALID [2018-11-23 13:03:31,535 INFO L273 TraceCheckUtils]: 5: Hoare triple {5113#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,536 INFO L273 TraceCheckUtils]: 6: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,536 INFO L273 TraceCheckUtils]: 7: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,537 INFO L273 TraceCheckUtils]: 8: Hoare triple {5115#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,537 INFO L273 TraceCheckUtils]: 9: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,538 INFO L273 TraceCheckUtils]: 10: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,538 INFO L273 TraceCheckUtils]: 11: Hoare triple {5115#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,539 INFO L273 TraceCheckUtils]: 12: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,539 INFO L273 TraceCheckUtils]: 13: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,540 INFO L273 TraceCheckUtils]: 14: Hoare triple {5115#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,541 INFO L273 TraceCheckUtils]: 15: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,541 INFO L273 TraceCheckUtils]: 16: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,542 INFO L273 TraceCheckUtils]: 17: Hoare triple {5115#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,542 INFO L273 TraceCheckUtils]: 18: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,543 INFO L273 TraceCheckUtils]: 19: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,543 INFO L273 TraceCheckUtils]: 20: Hoare triple {5115#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,544 INFO L273 TraceCheckUtils]: 21: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,544 INFO L273 TraceCheckUtils]: 22: Hoare triple {5115#(<= 20 main_~edgecount~0)} ~i~0 := 0; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,545 INFO L273 TraceCheckUtils]: 23: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,545 INFO L273 TraceCheckUtils]: 24: Hoare triple {5115#(<= 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); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,546 INFO L273 TraceCheckUtils]: 25: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,546 INFO L273 TraceCheckUtils]: 26: Hoare triple {5115#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,547 INFO L273 TraceCheckUtils]: 27: Hoare triple {5115#(<= 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); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,547 INFO L273 TraceCheckUtils]: 28: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,548 INFO L273 TraceCheckUtils]: 29: Hoare triple {5115#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,548 INFO L273 TraceCheckUtils]: 30: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,549 INFO L273 TraceCheckUtils]: 31: Hoare triple {5115#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,550 INFO L273 TraceCheckUtils]: 32: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,550 INFO L273 TraceCheckUtils]: 33: Hoare triple {5115#(<= 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); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,551 INFO L273 TraceCheckUtils]: 34: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,551 INFO L273 TraceCheckUtils]: 35: Hoare triple {5115#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,552 INFO L273 TraceCheckUtils]: 36: Hoare triple {5115#(<= 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); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,552 INFO L273 TraceCheckUtils]: 37: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,553 INFO L273 TraceCheckUtils]: 38: Hoare triple {5115#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,553 INFO L273 TraceCheckUtils]: 39: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,554 INFO L273 TraceCheckUtils]: 40: Hoare triple {5115#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,554 INFO L273 TraceCheckUtils]: 41: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,555 INFO L273 TraceCheckUtils]: 42: Hoare triple {5115#(<= 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); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,555 INFO L273 TraceCheckUtils]: 43: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,556 INFO L273 TraceCheckUtils]: 44: Hoare triple {5115#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,556 INFO L273 TraceCheckUtils]: 45: Hoare triple {5115#(<= 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); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,557 INFO L273 TraceCheckUtils]: 46: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,557 INFO L273 TraceCheckUtils]: 47: Hoare triple {5115#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,558 INFO L273 TraceCheckUtils]: 48: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,559 INFO L273 TraceCheckUtils]: 49: Hoare triple {5115#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,559 INFO L273 TraceCheckUtils]: 50: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,560 INFO L273 TraceCheckUtils]: 51: Hoare triple {5115#(<= 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); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,560 INFO L273 TraceCheckUtils]: 52: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,561 INFO L273 TraceCheckUtils]: 53: Hoare triple {5115#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,561 INFO L273 TraceCheckUtils]: 54: Hoare triple {5115#(<= 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); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,562 INFO L273 TraceCheckUtils]: 55: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,562 INFO L273 TraceCheckUtils]: 56: Hoare triple {5115#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,563 INFO L273 TraceCheckUtils]: 57: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,563 INFO L273 TraceCheckUtils]: 58: Hoare triple {5115#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,564 INFO L273 TraceCheckUtils]: 59: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,564 INFO L273 TraceCheckUtils]: 60: Hoare triple {5115#(<= 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); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,565 INFO L273 TraceCheckUtils]: 61: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,565 INFO L273 TraceCheckUtils]: 62: Hoare triple {5115#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,566 INFO L273 TraceCheckUtils]: 63: Hoare triple {5115#(<= 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); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,566 INFO L273 TraceCheckUtils]: 64: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,567 INFO L273 TraceCheckUtils]: 65: Hoare triple {5115#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,567 INFO L273 TraceCheckUtils]: 66: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,568 INFO L273 TraceCheckUtils]: 67: Hoare triple {5115#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,568 INFO L273 TraceCheckUtils]: 68: Hoare triple {5115#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {5115#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:31,569 INFO L273 TraceCheckUtils]: 69: Hoare triple {5115#(<= 20 main_~edgecount~0)} ~i~0 := 0; {5329#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:03:31,570 INFO L273 TraceCheckUtils]: 70: Hoare triple {5329#(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); {5329#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:03:31,570 INFO L273 TraceCheckUtils]: 71: Hoare triple {5329#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {5329#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:03:31,571 INFO L273 TraceCheckUtils]: 72: Hoare triple {5329#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5339#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:03:31,572 INFO L273 TraceCheckUtils]: 73: Hoare triple {5339#(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); {5339#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:03:31,573 INFO L273 TraceCheckUtils]: 74: Hoare triple {5339#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {5339#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:03:31,574 INFO L273 TraceCheckUtils]: 75: Hoare triple {5339#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {5349#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:03:31,574 INFO L273 TraceCheckUtils]: 76: Hoare triple {5349#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} assume !(~i~0 < ~edgecount~0); {5114#false} is VALID [2018-11-23 13:03:31,575 INFO L273 TraceCheckUtils]: 77: Hoare triple {5114#false} ~i~0 := 0; {5114#false} is VALID [2018-11-23 13:03:31,575 INFO L273 TraceCheckUtils]: 78: Hoare triple {5114#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5114#false} is VALID [2018-11-23 13:03:31,575 INFO L256 TraceCheckUtils]: 79: Hoare triple {5114#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {5114#false} is VALID [2018-11-23 13:03:31,575 INFO L273 TraceCheckUtils]: 80: Hoare triple {5114#false} ~cond := #in~cond; {5114#false} is VALID [2018-11-23 13:03:31,575 INFO L273 TraceCheckUtils]: 81: Hoare triple {5114#false} assume 0 == ~cond; {5114#false} is VALID [2018-11-23 13:03:31,576 INFO L273 TraceCheckUtils]: 82: Hoare triple {5114#false} assume !false; {5114#false} is VALID [2018-11-23 13:03:31,582 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2018-11-23 13:03:31,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:31,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-23 13:03:31,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2018-11-23 13:03:31,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:31,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:03:31,655 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:31,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:03:31,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:03:31,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:03:31,656 INFO L87 Difference]: Start difference. First operand 88 states and 106 transitions. Second operand 9 states. [2018-11-23 13:03:33,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:33,169 INFO L93 Difference]: Finished difference Result 187 states and 238 transitions. [2018-11-23 13:03:33,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 13:03:33,169 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2018-11-23 13:03:33,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:33,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:03:33,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 166 transitions. [2018-11-23 13:03:33,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:03:33,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 166 transitions. [2018-11-23 13:03:33,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 166 transitions. [2018-11-23 13:03:33,797 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:33,800 INFO L225 Difference]: With dead ends: 187 [2018-11-23 13:03:33,800 INFO L226 Difference]: Without dead ends: 130 [2018-11-23 13:03:33,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=238, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:03:33,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-23 13:03:34,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 106. [2018-11-23 13:03:34,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:34,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand 106 states. [2018-11-23 13:03:34,121 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 106 states. [2018-11-23 13:03:34,121 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 106 states. [2018-11-23 13:03:34,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:34,125 INFO L93 Difference]: Finished difference Result 130 states and 161 transitions. [2018-11-23 13:03:34,125 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2018-11-23 13:03:34,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:34,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:34,126 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 130 states. [2018-11-23 13:03:34,126 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 130 states. [2018-11-23 13:03:34,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:34,129 INFO L93 Difference]: Finished difference Result 130 states and 161 transitions. [2018-11-23 13:03:34,129 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2018-11-23 13:03:34,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:34,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:34,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:34,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:34,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 13:03:34,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 129 transitions. [2018-11-23 13:03:34,133 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 129 transitions. Word has length 83 [2018-11-23 13:03:34,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:34,134 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 129 transitions. [2018-11-23 13:03:34,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:03:34,134 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 129 transitions. [2018-11-23 13:03:34,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-23 13:03:34,135 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:34,136 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 5, 5, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:34,136 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:34,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:34,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1570085165, now seen corresponding path program 4 times [2018-11-23 13:03:34,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:34,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:34,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:34,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:03:34,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:34,649 INFO L256 TraceCheckUtils]: 0: Hoare triple {6060#true} call ULTIMATE.init(); {6060#true} is VALID [2018-11-23 13:03:34,650 INFO L273 TraceCheckUtils]: 1: Hoare triple {6060#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {6060#true} is VALID [2018-11-23 13:03:34,650 INFO L273 TraceCheckUtils]: 2: Hoare triple {6060#true} assume true; {6060#true} is VALID [2018-11-23 13:03:34,650 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6060#true} {6060#true} #103#return; {6060#true} is VALID [2018-11-23 13:03:34,650 INFO L256 TraceCheckUtils]: 4: Hoare triple {6060#true} call #t~ret18 := main(); {6060#true} is VALID [2018-11-23 13:03:34,654 INFO L273 TraceCheckUtils]: 5: Hoare triple {6060#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:34,654 INFO L273 TraceCheckUtils]: 6: Hoare triple {6062#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:34,655 INFO L273 TraceCheckUtils]: 7: Hoare triple {6062#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:34,655 INFO L273 TraceCheckUtils]: 8: Hoare triple {6062#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:34,656 INFO L273 TraceCheckUtils]: 9: Hoare triple {6062#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:34,656 INFO L273 TraceCheckUtils]: 10: Hoare triple {6062#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:34,657 INFO L273 TraceCheckUtils]: 11: Hoare triple {6062#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:34,657 INFO L273 TraceCheckUtils]: 12: Hoare triple {6062#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:34,658 INFO L273 TraceCheckUtils]: 13: Hoare triple {6062#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:34,658 INFO L273 TraceCheckUtils]: 14: Hoare triple {6062#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:34,659 INFO L273 TraceCheckUtils]: 15: Hoare triple {6062#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:34,659 INFO L273 TraceCheckUtils]: 16: Hoare triple {6062#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:34,660 INFO L273 TraceCheckUtils]: 17: Hoare triple {6062#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:34,660 INFO L273 TraceCheckUtils]: 18: Hoare triple {6062#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:34,661 INFO L273 TraceCheckUtils]: 19: Hoare triple {6062#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:34,661 INFO L273 TraceCheckUtils]: 20: Hoare triple {6062#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:34,662 INFO L273 TraceCheckUtils]: 21: Hoare triple {6062#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:34,662 INFO L273 TraceCheckUtils]: 22: Hoare triple {6062#(<= 20 main_~edgecount~0)} ~i~0 := 0; {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:34,663 INFO L273 TraceCheckUtils]: 23: Hoare triple {6062#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6063#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} is VALID [2018-11-23 13:03:34,664 INFO L273 TraceCheckUtils]: 24: Hoare triple {6063#(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); {6063#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} is VALID [2018-11-23 13:03:34,665 INFO L273 TraceCheckUtils]: 25: Hoare triple {6063#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {6063#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} is VALID [2018-11-23 13:03:34,666 INFO L273 TraceCheckUtils]: 26: Hoare triple {6063#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6064#(<= (+ main_~j~0 19) main_~edgecount~0)} is VALID [2018-11-23 13:03:34,666 INFO L273 TraceCheckUtils]: 27: Hoare triple {6064#(<= (+ main_~j~0 19) 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); {6064#(<= (+ main_~j~0 19) main_~edgecount~0)} is VALID [2018-11-23 13:03:34,667 INFO L273 TraceCheckUtils]: 28: Hoare triple {6064#(<= (+ main_~j~0 19) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {6064#(<= (+ main_~j~0 19) main_~edgecount~0)} is VALID [2018-11-23 13:03:34,667 INFO L273 TraceCheckUtils]: 29: Hoare triple {6064#(<= (+ main_~j~0 19) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6065#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2018-11-23 13:03:34,668 INFO L273 TraceCheckUtils]: 30: Hoare triple {6065#(<= (+ main_~j~0 18) 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); {6065#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2018-11-23 13:03:34,669 INFO L273 TraceCheckUtils]: 31: Hoare triple {6065#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {6065#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2018-11-23 13:03:34,669 INFO L273 TraceCheckUtils]: 32: Hoare triple {6065#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6066#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2018-11-23 13:03:34,670 INFO L273 TraceCheckUtils]: 33: Hoare triple {6066#(<= (+ main_~j~0 17) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {6061#false} is VALID [2018-11-23 13:03:34,670 INFO L273 TraceCheckUtils]: 34: Hoare triple {6061#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6061#false} is VALID [2018-11-23 13:03:34,671 INFO L273 TraceCheckUtils]: 35: Hoare triple {6061#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6061#false} is VALID [2018-11-23 13:03:34,671 INFO L273 TraceCheckUtils]: 36: Hoare triple {6061#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); {6061#false} is VALID [2018-11-23 13:03:34,671 INFO L273 TraceCheckUtils]: 37: Hoare triple {6061#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {6061#false} is VALID [2018-11-23 13:03:34,671 INFO L273 TraceCheckUtils]: 38: Hoare triple {6061#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6061#false} is VALID [2018-11-23 13:03:34,672 INFO L273 TraceCheckUtils]: 39: Hoare triple {6061#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); {6061#false} is VALID [2018-11-23 13:03:34,672 INFO L273 TraceCheckUtils]: 40: Hoare triple {6061#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {6061#false} is VALID [2018-11-23 13:03:34,672 INFO L273 TraceCheckUtils]: 41: Hoare triple {6061#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6061#false} is VALID [2018-11-23 13:03:34,672 INFO L273 TraceCheckUtils]: 42: Hoare triple {6061#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); {6061#false} is VALID [2018-11-23 13:03:34,673 INFO L273 TraceCheckUtils]: 43: Hoare triple {6061#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {6061#false} is VALID [2018-11-23 13:03:34,673 INFO L273 TraceCheckUtils]: 44: Hoare triple {6061#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6061#false} is VALID [2018-11-23 13:03:34,673 INFO L273 TraceCheckUtils]: 45: Hoare triple {6061#false} assume !(~j~0 < ~edgecount~0); {6061#false} is VALID [2018-11-23 13:03:34,673 INFO L273 TraceCheckUtils]: 46: Hoare triple {6061#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6061#false} is VALID [2018-11-23 13:03:34,673 INFO L273 TraceCheckUtils]: 47: Hoare triple {6061#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6061#false} is VALID [2018-11-23 13:03:34,674 INFO L273 TraceCheckUtils]: 48: Hoare triple {6061#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); {6061#false} is VALID [2018-11-23 13:03:34,674 INFO L273 TraceCheckUtils]: 49: Hoare triple {6061#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {6061#false} is VALID [2018-11-23 13:03:34,674 INFO L273 TraceCheckUtils]: 50: Hoare triple {6061#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6061#false} is VALID [2018-11-23 13:03:34,674 INFO L273 TraceCheckUtils]: 51: Hoare triple {6061#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); {6061#false} is VALID [2018-11-23 13:03:34,674 INFO L273 TraceCheckUtils]: 52: Hoare triple {6061#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {6061#false} is VALID [2018-11-23 13:03:34,674 INFO L273 TraceCheckUtils]: 53: Hoare triple {6061#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6061#false} is VALID [2018-11-23 13:03:34,674 INFO L273 TraceCheckUtils]: 54: Hoare triple {6061#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); {6061#false} is VALID [2018-11-23 13:03:34,674 INFO L273 TraceCheckUtils]: 55: Hoare triple {6061#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {6061#false} is VALID [2018-11-23 13:03:34,675 INFO L273 TraceCheckUtils]: 56: Hoare triple {6061#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6061#false} is VALID [2018-11-23 13:03:34,675 INFO L273 TraceCheckUtils]: 57: Hoare triple {6061#false} assume !(~j~0 < ~edgecount~0); {6061#false} is VALID [2018-11-23 13:03:34,675 INFO L273 TraceCheckUtils]: 58: Hoare triple {6061#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6061#false} is VALID [2018-11-23 13:03:34,675 INFO L273 TraceCheckUtils]: 59: Hoare triple {6061#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6061#false} is VALID [2018-11-23 13:03:34,675 INFO L273 TraceCheckUtils]: 60: Hoare triple {6061#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); {6061#false} is VALID [2018-11-23 13:03:34,675 INFO L273 TraceCheckUtils]: 61: Hoare triple {6061#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {6061#false} is VALID [2018-11-23 13:03:34,675 INFO L273 TraceCheckUtils]: 62: Hoare triple {6061#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6061#false} is VALID [2018-11-23 13:03:34,675 INFO L273 TraceCheckUtils]: 63: Hoare triple {6061#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); {6061#false} is VALID [2018-11-23 13:03:34,676 INFO L273 TraceCheckUtils]: 64: Hoare triple {6061#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {6061#false} is VALID [2018-11-23 13:03:34,676 INFO L273 TraceCheckUtils]: 65: Hoare triple {6061#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6061#false} is VALID [2018-11-23 13:03:34,676 INFO L273 TraceCheckUtils]: 66: Hoare triple {6061#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); {6061#false} is VALID [2018-11-23 13:03:34,676 INFO L273 TraceCheckUtils]: 67: Hoare triple {6061#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {6061#false} is VALID [2018-11-23 13:03:34,676 INFO L273 TraceCheckUtils]: 68: Hoare triple {6061#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6061#false} is VALID [2018-11-23 13:03:34,676 INFO L273 TraceCheckUtils]: 69: Hoare triple {6061#false} assume !(~j~0 < ~edgecount~0); {6061#false} is VALID [2018-11-23 13:03:34,676 INFO L273 TraceCheckUtils]: 70: Hoare triple {6061#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6061#false} is VALID [2018-11-23 13:03:34,676 INFO L273 TraceCheckUtils]: 71: Hoare triple {6061#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6061#false} is VALID [2018-11-23 13:03:34,676 INFO L273 TraceCheckUtils]: 72: Hoare triple {6061#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); {6061#false} is VALID [2018-11-23 13:03:34,677 INFO L273 TraceCheckUtils]: 73: Hoare triple {6061#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {6061#false} is VALID [2018-11-23 13:03:34,677 INFO L273 TraceCheckUtils]: 74: Hoare triple {6061#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6061#false} is VALID [2018-11-23 13:03:34,677 INFO L273 TraceCheckUtils]: 75: Hoare triple {6061#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); {6061#false} is VALID [2018-11-23 13:03:34,677 INFO L273 TraceCheckUtils]: 76: Hoare triple {6061#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {6061#false} is VALID [2018-11-23 13:03:34,677 INFO L273 TraceCheckUtils]: 77: Hoare triple {6061#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6061#false} is VALID [2018-11-23 13:03:34,677 INFO L273 TraceCheckUtils]: 78: Hoare triple {6061#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); {6061#false} is VALID [2018-11-23 13:03:34,677 INFO L273 TraceCheckUtils]: 79: Hoare triple {6061#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {6061#false} is VALID [2018-11-23 13:03:34,677 INFO L273 TraceCheckUtils]: 80: Hoare triple {6061#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6061#false} is VALID [2018-11-23 13:03:34,678 INFO L273 TraceCheckUtils]: 81: Hoare triple {6061#false} assume !(~j~0 < ~edgecount~0); {6061#false} is VALID [2018-11-23 13:03:34,678 INFO L273 TraceCheckUtils]: 82: Hoare triple {6061#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6061#false} is VALID [2018-11-23 13:03:34,678 INFO L273 TraceCheckUtils]: 83: Hoare triple {6061#false} assume !(~i~0 < ~nodecount~0); {6061#false} is VALID [2018-11-23 13:03:34,678 INFO L273 TraceCheckUtils]: 84: Hoare triple {6061#false} ~i~0 := 0; {6061#false} is VALID [2018-11-23 13:03:34,678 INFO L273 TraceCheckUtils]: 85: Hoare triple {6061#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); {6061#false} is VALID [2018-11-23 13:03:34,678 INFO L273 TraceCheckUtils]: 86: Hoare triple {6061#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {6061#false} is VALID [2018-11-23 13:03:34,678 INFO L273 TraceCheckUtils]: 87: Hoare triple {6061#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6061#false} is VALID [2018-11-23 13:03:34,678 INFO L273 TraceCheckUtils]: 88: Hoare triple {6061#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); {6061#false} is VALID [2018-11-23 13:03:34,678 INFO L273 TraceCheckUtils]: 89: Hoare triple {6061#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {6061#false} is VALID [2018-11-23 13:03:34,679 INFO L273 TraceCheckUtils]: 90: Hoare triple {6061#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6061#false} is VALID [2018-11-23 13:03:34,679 INFO L273 TraceCheckUtils]: 91: Hoare triple {6061#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); {6061#false} is VALID [2018-11-23 13:03:34,679 INFO L273 TraceCheckUtils]: 92: Hoare triple {6061#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {6061#false} is VALID [2018-11-23 13:03:34,679 INFO L273 TraceCheckUtils]: 93: Hoare triple {6061#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6061#false} is VALID [2018-11-23 13:03:34,679 INFO L273 TraceCheckUtils]: 94: Hoare triple {6061#false} assume !(~i~0 < ~edgecount~0); {6061#false} is VALID [2018-11-23 13:03:34,679 INFO L273 TraceCheckUtils]: 95: Hoare triple {6061#false} ~i~0 := 0; {6061#false} is VALID [2018-11-23 13:03:34,679 INFO L273 TraceCheckUtils]: 96: Hoare triple {6061#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6061#false} is VALID [2018-11-23 13:03:34,679 INFO L256 TraceCheckUtils]: 97: Hoare triple {6061#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {6061#false} is VALID [2018-11-23 13:03:34,680 INFO L273 TraceCheckUtils]: 98: Hoare triple {6061#false} ~cond := #in~cond; {6061#false} is VALID [2018-11-23 13:03:34,680 INFO L273 TraceCheckUtils]: 99: Hoare triple {6061#false} assume 0 == ~cond; {6061#false} is VALID [2018-11-23 13:03:34,680 INFO L273 TraceCheckUtils]: 100: Hoare triple {6061#false} assume !false; {6061#false} is VALID [2018-11-23 13:03:34,685 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 141 proven. 12 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2018-11-23 13:03:34,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:34,686 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-23 13:03:34,696 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:03:38,710 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:03:38,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:38,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:38,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:39,029 INFO L256 TraceCheckUtils]: 0: Hoare triple {6060#true} call ULTIMATE.init(); {6060#true} is VALID [2018-11-23 13:03:39,030 INFO L273 TraceCheckUtils]: 1: Hoare triple {6060#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {6060#true} is VALID [2018-11-23 13:03:39,030 INFO L273 TraceCheckUtils]: 2: Hoare triple {6060#true} assume true; {6060#true} is VALID [2018-11-23 13:03:39,030 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6060#true} {6060#true} #103#return; {6060#true} is VALID [2018-11-23 13:03:39,031 INFO L256 TraceCheckUtils]: 4: Hoare triple {6060#true} call #t~ret18 := main(); {6060#true} is VALID [2018-11-23 13:03:39,033 INFO L273 TraceCheckUtils]: 5: Hoare triple {6060#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:39,034 INFO L273 TraceCheckUtils]: 6: Hoare triple {6062#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:39,034 INFO L273 TraceCheckUtils]: 7: Hoare triple {6062#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:39,035 INFO L273 TraceCheckUtils]: 8: Hoare triple {6062#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:39,035 INFO L273 TraceCheckUtils]: 9: Hoare triple {6062#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:39,036 INFO L273 TraceCheckUtils]: 10: Hoare triple {6062#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:39,036 INFO L273 TraceCheckUtils]: 11: Hoare triple {6062#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:39,037 INFO L273 TraceCheckUtils]: 12: Hoare triple {6062#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:39,037 INFO L273 TraceCheckUtils]: 13: Hoare triple {6062#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:39,038 INFO L273 TraceCheckUtils]: 14: Hoare triple {6062#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:39,038 INFO L273 TraceCheckUtils]: 15: Hoare triple {6062#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:39,039 INFO L273 TraceCheckUtils]: 16: Hoare triple {6062#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:39,039 INFO L273 TraceCheckUtils]: 17: Hoare triple {6062#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:39,040 INFO L273 TraceCheckUtils]: 18: Hoare triple {6062#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:39,040 INFO L273 TraceCheckUtils]: 19: Hoare triple {6062#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:39,041 INFO L273 TraceCheckUtils]: 20: Hoare triple {6062#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:39,041 INFO L273 TraceCheckUtils]: 21: Hoare triple {6062#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:39,042 INFO L273 TraceCheckUtils]: 22: Hoare triple {6062#(<= 20 main_~edgecount~0)} ~i~0 := 0; {6062#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:39,042 INFO L273 TraceCheckUtils]: 23: Hoare triple {6062#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6139#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-23 13:03:39,043 INFO L273 TraceCheckUtils]: 24: Hoare triple {6139#(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); {6139#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-23 13:03:39,044 INFO L273 TraceCheckUtils]: 25: Hoare triple {6139#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {6139#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-23 13:03:39,045 INFO L273 TraceCheckUtils]: 26: Hoare triple {6139#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6149#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-23 13:03:39,046 INFO L273 TraceCheckUtils]: 27: Hoare triple {6149#(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); {6149#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-23 13:03:39,047 INFO L273 TraceCheckUtils]: 28: Hoare triple {6149#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {6149#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-23 13:03:39,048 INFO L273 TraceCheckUtils]: 29: Hoare triple {6149#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6159#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-23 13:03:39,049 INFO L273 TraceCheckUtils]: 30: Hoare triple {6159#(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); {6159#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-23 13:03:39,050 INFO L273 TraceCheckUtils]: 31: Hoare triple {6159#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {6159#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-23 13:03:39,051 INFO L273 TraceCheckUtils]: 32: Hoare triple {6159#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6169#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-23 13:03:39,051 INFO L273 TraceCheckUtils]: 33: Hoare triple {6169#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume !(~j~0 < ~edgecount~0); {6061#false} is VALID [2018-11-23 13:03:39,052 INFO L273 TraceCheckUtils]: 34: Hoare triple {6061#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6061#false} is VALID [2018-11-23 13:03:39,052 INFO L273 TraceCheckUtils]: 35: Hoare triple {6061#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6061#false} is VALID [2018-11-23 13:03:39,052 INFO L273 TraceCheckUtils]: 36: Hoare triple {6061#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); {6061#false} is VALID [2018-11-23 13:03:39,052 INFO L273 TraceCheckUtils]: 37: Hoare triple {6061#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {6061#false} is VALID [2018-11-23 13:03:39,052 INFO L273 TraceCheckUtils]: 38: Hoare triple {6061#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6061#false} is VALID [2018-11-23 13:03:39,053 INFO L273 TraceCheckUtils]: 39: Hoare triple {6061#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); {6061#false} is VALID [2018-11-23 13:03:39,053 INFO L273 TraceCheckUtils]: 40: Hoare triple {6061#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {6061#false} is VALID [2018-11-23 13:03:39,053 INFO L273 TraceCheckUtils]: 41: Hoare triple {6061#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6061#false} is VALID [2018-11-23 13:03:39,053 INFO L273 TraceCheckUtils]: 42: Hoare triple {6061#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); {6061#false} is VALID [2018-11-23 13:03:39,053 INFO L273 TraceCheckUtils]: 43: Hoare triple {6061#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {6061#false} is VALID [2018-11-23 13:03:39,054 INFO L273 TraceCheckUtils]: 44: Hoare triple {6061#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6061#false} is VALID [2018-11-23 13:03:39,054 INFO L273 TraceCheckUtils]: 45: Hoare triple {6061#false} assume !(~j~0 < ~edgecount~0); {6061#false} is VALID [2018-11-23 13:03:39,054 INFO L273 TraceCheckUtils]: 46: Hoare triple {6061#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6061#false} is VALID [2018-11-23 13:03:39,054 INFO L273 TraceCheckUtils]: 47: Hoare triple {6061#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6061#false} is VALID [2018-11-23 13:03:39,054 INFO L273 TraceCheckUtils]: 48: Hoare triple {6061#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); {6061#false} is VALID [2018-11-23 13:03:39,054 INFO L273 TraceCheckUtils]: 49: Hoare triple {6061#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {6061#false} is VALID [2018-11-23 13:03:39,055 INFO L273 TraceCheckUtils]: 50: Hoare triple {6061#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6061#false} is VALID [2018-11-23 13:03:39,055 INFO L273 TraceCheckUtils]: 51: Hoare triple {6061#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); {6061#false} is VALID [2018-11-23 13:03:39,055 INFO L273 TraceCheckUtils]: 52: Hoare triple {6061#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {6061#false} is VALID [2018-11-23 13:03:39,055 INFO L273 TraceCheckUtils]: 53: Hoare triple {6061#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6061#false} is VALID [2018-11-23 13:03:39,055 INFO L273 TraceCheckUtils]: 54: Hoare triple {6061#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); {6061#false} is VALID [2018-11-23 13:03:39,055 INFO L273 TraceCheckUtils]: 55: Hoare triple {6061#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {6061#false} is VALID [2018-11-23 13:03:39,055 INFO L273 TraceCheckUtils]: 56: Hoare triple {6061#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6061#false} is VALID [2018-11-23 13:03:39,055 INFO L273 TraceCheckUtils]: 57: Hoare triple {6061#false} assume !(~j~0 < ~edgecount~0); {6061#false} is VALID [2018-11-23 13:03:39,056 INFO L273 TraceCheckUtils]: 58: Hoare triple {6061#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6061#false} is VALID [2018-11-23 13:03:39,056 INFO L273 TraceCheckUtils]: 59: Hoare triple {6061#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6061#false} is VALID [2018-11-23 13:03:39,056 INFO L273 TraceCheckUtils]: 60: Hoare triple {6061#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); {6061#false} is VALID [2018-11-23 13:03:39,056 INFO L273 TraceCheckUtils]: 61: Hoare triple {6061#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {6061#false} is VALID [2018-11-23 13:03:39,056 INFO L273 TraceCheckUtils]: 62: Hoare triple {6061#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6061#false} is VALID [2018-11-23 13:03:39,056 INFO L273 TraceCheckUtils]: 63: Hoare triple {6061#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); {6061#false} is VALID [2018-11-23 13:03:39,056 INFO L273 TraceCheckUtils]: 64: Hoare triple {6061#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {6061#false} is VALID [2018-11-23 13:03:39,056 INFO L273 TraceCheckUtils]: 65: Hoare triple {6061#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6061#false} is VALID [2018-11-23 13:03:39,056 INFO L273 TraceCheckUtils]: 66: Hoare triple {6061#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); {6061#false} is VALID [2018-11-23 13:03:39,057 INFO L273 TraceCheckUtils]: 67: Hoare triple {6061#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {6061#false} is VALID [2018-11-23 13:03:39,057 INFO L273 TraceCheckUtils]: 68: Hoare triple {6061#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6061#false} is VALID [2018-11-23 13:03:39,057 INFO L273 TraceCheckUtils]: 69: Hoare triple {6061#false} assume !(~j~0 < ~edgecount~0); {6061#false} is VALID [2018-11-23 13:03:39,057 INFO L273 TraceCheckUtils]: 70: Hoare triple {6061#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6061#false} is VALID [2018-11-23 13:03:39,057 INFO L273 TraceCheckUtils]: 71: Hoare triple {6061#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6061#false} is VALID [2018-11-23 13:03:39,057 INFO L273 TraceCheckUtils]: 72: Hoare triple {6061#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); {6061#false} is VALID [2018-11-23 13:03:39,057 INFO L273 TraceCheckUtils]: 73: Hoare triple {6061#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {6061#false} is VALID [2018-11-23 13:03:39,057 INFO L273 TraceCheckUtils]: 74: Hoare triple {6061#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6061#false} is VALID [2018-11-23 13:03:39,058 INFO L273 TraceCheckUtils]: 75: Hoare triple {6061#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); {6061#false} is VALID [2018-11-23 13:03:39,058 INFO L273 TraceCheckUtils]: 76: Hoare triple {6061#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {6061#false} is VALID [2018-11-23 13:03:39,058 INFO L273 TraceCheckUtils]: 77: Hoare triple {6061#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6061#false} is VALID [2018-11-23 13:03:39,058 INFO L273 TraceCheckUtils]: 78: Hoare triple {6061#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); {6061#false} is VALID [2018-11-23 13:03:39,058 INFO L273 TraceCheckUtils]: 79: Hoare triple {6061#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {6061#false} is VALID [2018-11-23 13:03:39,058 INFO L273 TraceCheckUtils]: 80: Hoare triple {6061#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {6061#false} is VALID [2018-11-23 13:03:39,058 INFO L273 TraceCheckUtils]: 81: Hoare triple {6061#false} assume !(~j~0 < ~edgecount~0); {6061#false} is VALID [2018-11-23 13:03:39,058 INFO L273 TraceCheckUtils]: 82: Hoare triple {6061#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6061#false} is VALID [2018-11-23 13:03:39,058 INFO L273 TraceCheckUtils]: 83: Hoare triple {6061#false} assume !(~i~0 < ~nodecount~0); {6061#false} is VALID [2018-11-23 13:03:39,059 INFO L273 TraceCheckUtils]: 84: Hoare triple {6061#false} ~i~0 := 0; {6061#false} is VALID [2018-11-23 13:03:39,059 INFO L273 TraceCheckUtils]: 85: Hoare triple {6061#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); {6061#false} is VALID [2018-11-23 13:03:39,059 INFO L273 TraceCheckUtils]: 86: Hoare triple {6061#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {6061#false} is VALID [2018-11-23 13:03:39,059 INFO L273 TraceCheckUtils]: 87: Hoare triple {6061#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6061#false} is VALID [2018-11-23 13:03:39,059 INFO L273 TraceCheckUtils]: 88: Hoare triple {6061#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); {6061#false} is VALID [2018-11-23 13:03:39,059 INFO L273 TraceCheckUtils]: 89: Hoare triple {6061#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {6061#false} is VALID [2018-11-23 13:03:39,059 INFO L273 TraceCheckUtils]: 90: Hoare triple {6061#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6061#false} is VALID [2018-11-23 13:03:39,059 INFO L273 TraceCheckUtils]: 91: Hoare triple {6061#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); {6061#false} is VALID [2018-11-23 13:03:39,060 INFO L273 TraceCheckUtils]: 92: Hoare triple {6061#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {6061#false} is VALID [2018-11-23 13:03:39,060 INFO L273 TraceCheckUtils]: 93: Hoare triple {6061#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {6061#false} is VALID [2018-11-23 13:03:39,060 INFO L273 TraceCheckUtils]: 94: Hoare triple {6061#false} assume !(~i~0 < ~edgecount~0); {6061#false} is VALID [2018-11-23 13:03:39,060 INFO L273 TraceCheckUtils]: 95: Hoare triple {6061#false} ~i~0 := 0; {6061#false} is VALID [2018-11-23 13:03:39,060 INFO L273 TraceCheckUtils]: 96: Hoare triple {6061#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6061#false} is VALID [2018-11-23 13:03:39,060 INFO L256 TraceCheckUtils]: 97: Hoare triple {6061#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {6061#false} is VALID [2018-11-23 13:03:39,060 INFO L273 TraceCheckUtils]: 98: Hoare triple {6061#false} ~cond := #in~cond; {6061#false} is VALID [2018-11-23 13:03:39,060 INFO L273 TraceCheckUtils]: 99: Hoare triple {6061#false} assume 0 == ~cond; {6061#false} is VALID [2018-11-23 13:03:39,060 INFO L273 TraceCheckUtils]: 100: Hoare triple {6061#false} assume !false; {6061#false} is VALID [2018-11-23 13:03:39,066 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 141 proven. 12 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2018-11-23 13:03:39,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:39,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-23 13:03:39,088 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 101 [2018-11-23 13:03:39,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:39,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:03:39,143 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:39,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:03:39,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:03:39,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:03:39,144 INFO L87 Difference]: Start difference. First operand 106 states and 129 transitions. Second operand 11 states. [2018-11-23 13:03:40,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:40,055 INFO L93 Difference]: Finished difference Result 203 states and 259 transitions. [2018-11-23 13:03:40,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:03:40,056 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 101 [2018-11-23 13:03:40,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:40,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:03:40,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2018-11-23 13:03:40,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:03:40,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2018-11-23 13:03:40,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 77 transitions. [2018-11-23 13:03:40,544 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:40,547 INFO L225 Difference]: With dead ends: 203 [2018-11-23 13:03:40,547 INFO L226 Difference]: Without dead ends: 131 [2018-11-23 13:03:40,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:03:40,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-23 13:03:40,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 121. [2018-11-23 13:03:40,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:40,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand 121 states. [2018-11-23 13:03:40,775 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 121 states. [2018-11-23 13:03:40,775 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 121 states. [2018-11-23 13:03:40,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:40,779 INFO L93 Difference]: Finished difference Result 131 states and 164 transitions. [2018-11-23 13:03:40,780 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 164 transitions. [2018-11-23 13:03:40,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:40,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:40,780 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 131 states. [2018-11-23 13:03:40,781 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 131 states. [2018-11-23 13:03:40,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:40,783 INFO L93 Difference]: Finished difference Result 131 states and 164 transitions. [2018-11-23 13:03:40,783 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 164 transitions. [2018-11-23 13:03:40,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:40,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:40,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:40,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:40,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-23 13:03:40,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 149 transitions. [2018-11-23 13:03:40,787 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 149 transitions. Word has length 101 [2018-11-23 13:03:40,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:40,787 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 149 transitions. [2018-11-23 13:03:40,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:03:40,788 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 149 transitions. [2018-11-23 13:03:40,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-23 13:03:40,789 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:40,789 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 5, 5, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:40,789 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:40,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:40,790 INFO L82 PathProgramCache]: Analyzing trace with hash -83309763, now seen corresponding path program 5 times [2018-11-23 13:03:40,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:40,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:40,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:40,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:03:40,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:41,397 INFO L256 TraceCheckUtils]: 0: Hoare triple {7083#true} call ULTIMATE.init(); {7083#true} is VALID [2018-11-23 13:03:41,397 INFO L273 TraceCheckUtils]: 1: Hoare triple {7083#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {7083#true} is VALID [2018-11-23 13:03:41,397 INFO L273 TraceCheckUtils]: 2: Hoare triple {7083#true} assume true; {7083#true} is VALID [2018-11-23 13:03:41,398 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7083#true} {7083#true} #103#return; {7083#true} is VALID [2018-11-23 13:03:41,398 INFO L256 TraceCheckUtils]: 4: Hoare triple {7083#true} call #t~ret18 := main(); {7083#true} is VALID [2018-11-23 13:03:41,401 INFO L273 TraceCheckUtils]: 5: Hoare triple {7083#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:41,401 INFO L273 TraceCheckUtils]: 6: Hoare triple {7085#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:41,401 INFO L273 TraceCheckUtils]: 7: Hoare triple {7085#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:41,402 INFO L273 TraceCheckUtils]: 8: Hoare triple {7085#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:41,402 INFO L273 TraceCheckUtils]: 9: Hoare triple {7085#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:41,403 INFO L273 TraceCheckUtils]: 10: Hoare triple {7085#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:41,403 INFO L273 TraceCheckUtils]: 11: Hoare triple {7085#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:41,404 INFO L273 TraceCheckUtils]: 12: Hoare triple {7085#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:41,404 INFO L273 TraceCheckUtils]: 13: Hoare triple {7085#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:41,405 INFO L273 TraceCheckUtils]: 14: Hoare triple {7085#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:41,405 INFO L273 TraceCheckUtils]: 15: Hoare triple {7085#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:41,406 INFO L273 TraceCheckUtils]: 16: Hoare triple {7085#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:41,407 INFO L273 TraceCheckUtils]: 17: Hoare triple {7085#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:41,407 INFO L273 TraceCheckUtils]: 18: Hoare triple {7085#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:41,408 INFO L273 TraceCheckUtils]: 19: Hoare triple {7085#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:41,408 INFO L273 TraceCheckUtils]: 20: Hoare triple {7085#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:41,409 INFO L273 TraceCheckUtils]: 21: Hoare triple {7085#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:41,409 INFO L273 TraceCheckUtils]: 22: Hoare triple {7085#(<= 20 main_~edgecount~0)} ~i~0 := 0; {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:03:41,410 INFO L273 TraceCheckUtils]: 23: Hoare triple {7085#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7086#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} is VALID [2018-11-23 13:03:41,411 INFO L273 TraceCheckUtils]: 24: Hoare triple {7086#(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); {7086#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} is VALID [2018-11-23 13:03:41,412 INFO L273 TraceCheckUtils]: 25: Hoare triple {7086#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7086#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} is VALID [2018-11-23 13:03:41,412 INFO L273 TraceCheckUtils]: 26: Hoare triple {7086#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7087#(<= (+ main_~j~0 19) main_~edgecount~0)} is VALID [2018-11-23 13:03:41,413 INFO L273 TraceCheckUtils]: 27: Hoare triple {7087#(<= (+ main_~j~0 19) 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); {7087#(<= (+ main_~j~0 19) main_~edgecount~0)} is VALID [2018-11-23 13:03:41,413 INFO L273 TraceCheckUtils]: 28: Hoare triple {7087#(<= (+ main_~j~0 19) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7087#(<= (+ main_~j~0 19) main_~edgecount~0)} is VALID [2018-11-23 13:03:41,414 INFO L273 TraceCheckUtils]: 29: Hoare triple {7087#(<= (+ main_~j~0 19) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7088#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2018-11-23 13:03:41,415 INFO L273 TraceCheckUtils]: 30: Hoare triple {7088#(<= (+ main_~j~0 18) 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); {7088#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2018-11-23 13:03:41,415 INFO L273 TraceCheckUtils]: 31: Hoare triple {7088#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7088#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2018-11-23 13:03:41,416 INFO L273 TraceCheckUtils]: 32: Hoare triple {7088#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7089#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2018-11-23 13:03:41,416 INFO L273 TraceCheckUtils]: 33: Hoare triple {7089#(<= (+ main_~j~0 17) 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); {7089#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2018-11-23 13:03:41,417 INFO L273 TraceCheckUtils]: 34: Hoare triple {7089#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7089#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2018-11-23 13:03:41,418 INFO L273 TraceCheckUtils]: 35: Hoare triple {7089#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7090#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2018-11-23 13:03:41,418 INFO L273 TraceCheckUtils]: 36: Hoare triple {7090#(<= (+ main_~j~0 16) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {7084#false} is VALID [2018-11-23 13:03:41,419 INFO L273 TraceCheckUtils]: 37: Hoare triple {7084#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7084#false} is VALID [2018-11-23 13:03:41,419 INFO L273 TraceCheckUtils]: 38: Hoare triple {7084#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7084#false} is VALID [2018-11-23 13:03:41,419 INFO L273 TraceCheckUtils]: 39: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:03:41,420 INFO L273 TraceCheckUtils]: 40: Hoare triple {7084#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7084#false} is VALID [2018-11-23 13:03:41,420 INFO L273 TraceCheckUtils]: 41: Hoare triple {7084#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7084#false} is VALID [2018-11-23 13:03:41,420 INFO L273 TraceCheckUtils]: 42: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:03:41,420 INFO L273 TraceCheckUtils]: 43: Hoare triple {7084#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7084#false} is VALID [2018-11-23 13:03:41,420 INFO L273 TraceCheckUtils]: 44: Hoare triple {7084#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7084#false} is VALID [2018-11-23 13:03:41,421 INFO L273 TraceCheckUtils]: 45: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:03:41,421 INFO L273 TraceCheckUtils]: 46: Hoare triple {7084#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7084#false} is VALID [2018-11-23 13:03:41,421 INFO L273 TraceCheckUtils]: 47: Hoare triple {7084#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7084#false} is VALID [2018-11-23 13:03:41,421 INFO L273 TraceCheckUtils]: 48: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:03:41,421 INFO L273 TraceCheckUtils]: 49: Hoare triple {7084#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7084#false} is VALID [2018-11-23 13:03:41,422 INFO L273 TraceCheckUtils]: 50: Hoare triple {7084#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7084#false} is VALID [2018-11-23 13:03:41,422 INFO L273 TraceCheckUtils]: 51: Hoare triple {7084#false} assume !(~j~0 < ~edgecount~0); {7084#false} is VALID [2018-11-23 13:03:41,422 INFO L273 TraceCheckUtils]: 52: Hoare triple {7084#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7084#false} is VALID [2018-11-23 13:03:41,422 INFO L273 TraceCheckUtils]: 53: Hoare triple {7084#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7084#false} is VALID [2018-11-23 13:03:41,422 INFO L273 TraceCheckUtils]: 54: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:03:41,423 INFO L273 TraceCheckUtils]: 55: Hoare triple {7084#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7084#false} is VALID [2018-11-23 13:03:41,423 INFO L273 TraceCheckUtils]: 56: Hoare triple {7084#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7084#false} is VALID [2018-11-23 13:03:41,423 INFO L273 TraceCheckUtils]: 57: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:03:41,423 INFO L273 TraceCheckUtils]: 58: Hoare triple {7084#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7084#false} is VALID [2018-11-23 13:03:41,423 INFO L273 TraceCheckUtils]: 59: Hoare triple {7084#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7084#false} is VALID [2018-11-23 13:03:41,423 INFO L273 TraceCheckUtils]: 60: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:03:41,423 INFO L273 TraceCheckUtils]: 61: Hoare triple {7084#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7084#false} is VALID [2018-11-23 13:03:41,423 INFO L273 TraceCheckUtils]: 62: Hoare triple {7084#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7084#false} is VALID [2018-11-23 13:03:41,424 INFO L273 TraceCheckUtils]: 63: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:03:41,424 INFO L273 TraceCheckUtils]: 64: Hoare triple {7084#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7084#false} is VALID [2018-11-23 13:03:41,424 INFO L273 TraceCheckUtils]: 65: Hoare triple {7084#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7084#false} is VALID [2018-11-23 13:03:41,424 INFO L273 TraceCheckUtils]: 66: Hoare triple {7084#false} assume !(~j~0 < ~edgecount~0); {7084#false} is VALID [2018-11-23 13:03:41,424 INFO L273 TraceCheckUtils]: 67: Hoare triple {7084#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7084#false} is VALID [2018-11-23 13:03:41,424 INFO L273 TraceCheckUtils]: 68: Hoare triple {7084#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7084#false} is VALID [2018-11-23 13:03:41,424 INFO L273 TraceCheckUtils]: 69: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:03:41,424 INFO L273 TraceCheckUtils]: 70: Hoare triple {7084#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7084#false} is VALID [2018-11-23 13:03:41,425 INFO L273 TraceCheckUtils]: 71: Hoare triple {7084#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7084#false} is VALID [2018-11-23 13:03:41,425 INFO L273 TraceCheckUtils]: 72: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:03:41,425 INFO L273 TraceCheckUtils]: 73: Hoare triple {7084#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7084#false} is VALID [2018-11-23 13:03:41,425 INFO L273 TraceCheckUtils]: 74: Hoare triple {7084#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7084#false} is VALID [2018-11-23 13:03:41,425 INFO L273 TraceCheckUtils]: 75: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:03:41,425 INFO L273 TraceCheckUtils]: 76: Hoare triple {7084#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7084#false} is VALID [2018-11-23 13:03:41,425 INFO L273 TraceCheckUtils]: 77: Hoare triple {7084#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7084#false} is VALID [2018-11-23 13:03:41,425 INFO L273 TraceCheckUtils]: 78: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:03:41,426 INFO L273 TraceCheckUtils]: 79: Hoare triple {7084#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7084#false} is VALID [2018-11-23 13:03:41,426 INFO L273 TraceCheckUtils]: 80: Hoare triple {7084#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7084#false} is VALID [2018-11-23 13:03:41,426 INFO L273 TraceCheckUtils]: 81: Hoare triple {7084#false} assume !(~j~0 < ~edgecount~0); {7084#false} is VALID [2018-11-23 13:03:41,426 INFO L273 TraceCheckUtils]: 82: Hoare triple {7084#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7084#false} is VALID [2018-11-23 13:03:41,426 INFO L273 TraceCheckUtils]: 83: Hoare triple {7084#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7084#false} is VALID [2018-11-23 13:03:41,426 INFO L273 TraceCheckUtils]: 84: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:03:41,426 INFO L273 TraceCheckUtils]: 85: Hoare triple {7084#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7084#false} is VALID [2018-11-23 13:03:41,426 INFO L273 TraceCheckUtils]: 86: Hoare triple {7084#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7084#false} is VALID [2018-11-23 13:03:41,426 INFO L273 TraceCheckUtils]: 87: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:03:41,427 INFO L273 TraceCheckUtils]: 88: Hoare triple {7084#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7084#false} is VALID [2018-11-23 13:03:41,427 INFO L273 TraceCheckUtils]: 89: Hoare triple {7084#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7084#false} is VALID [2018-11-23 13:03:41,427 INFO L273 TraceCheckUtils]: 90: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:03:41,427 INFO L273 TraceCheckUtils]: 91: Hoare triple {7084#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7084#false} is VALID [2018-11-23 13:03:41,427 INFO L273 TraceCheckUtils]: 92: Hoare triple {7084#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7084#false} is VALID [2018-11-23 13:03:41,427 INFO L273 TraceCheckUtils]: 93: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:03:41,427 INFO L273 TraceCheckUtils]: 94: Hoare triple {7084#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7084#false} is VALID [2018-11-23 13:03:41,427 INFO L273 TraceCheckUtils]: 95: Hoare triple {7084#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7084#false} is VALID [2018-11-23 13:03:41,428 INFO L273 TraceCheckUtils]: 96: Hoare triple {7084#false} assume !(~j~0 < ~edgecount~0); {7084#false} is VALID [2018-11-23 13:03:41,428 INFO L273 TraceCheckUtils]: 97: Hoare triple {7084#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7084#false} is VALID [2018-11-23 13:03:41,428 INFO L273 TraceCheckUtils]: 98: Hoare triple {7084#false} assume !(~i~0 < ~nodecount~0); {7084#false} is VALID [2018-11-23 13:03:41,428 INFO L273 TraceCheckUtils]: 99: Hoare triple {7084#false} ~i~0 := 0; {7084#false} is VALID [2018-11-23 13:03:41,428 INFO L273 TraceCheckUtils]: 100: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:03:41,428 INFO L273 TraceCheckUtils]: 101: Hoare triple {7084#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {7084#false} is VALID [2018-11-23 13:03:41,428 INFO L273 TraceCheckUtils]: 102: Hoare triple {7084#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7084#false} is VALID [2018-11-23 13:03:41,428 INFO L273 TraceCheckUtils]: 103: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:03:41,429 INFO L273 TraceCheckUtils]: 104: Hoare triple {7084#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {7084#false} is VALID [2018-11-23 13:03:41,429 INFO L273 TraceCheckUtils]: 105: Hoare triple {7084#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7084#false} is VALID [2018-11-23 13:03:41,429 INFO L273 TraceCheckUtils]: 106: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:03:41,429 INFO L273 TraceCheckUtils]: 107: Hoare triple {7084#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {7084#false} is VALID [2018-11-23 13:03:41,429 INFO L273 TraceCheckUtils]: 108: Hoare triple {7084#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7084#false} is VALID [2018-11-23 13:03:41,429 INFO L273 TraceCheckUtils]: 109: Hoare triple {7084#false} assume !(~i~0 < ~edgecount~0); {7084#false} is VALID [2018-11-23 13:03:41,429 INFO L273 TraceCheckUtils]: 110: Hoare triple {7084#false} ~i~0 := 0; {7084#false} is VALID [2018-11-23 13:03:41,429 INFO L273 TraceCheckUtils]: 111: Hoare triple {7084#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7084#false} is VALID [2018-11-23 13:03:41,429 INFO L256 TraceCheckUtils]: 112: Hoare triple {7084#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {7084#false} is VALID [2018-11-23 13:03:41,430 INFO L273 TraceCheckUtils]: 113: Hoare triple {7084#false} ~cond := #in~cond; {7084#false} is VALID [2018-11-23 13:03:41,430 INFO L273 TraceCheckUtils]: 114: Hoare triple {7084#false} assume 0 == ~cond; {7084#false} is VALID [2018-11-23 13:03:41,430 INFO L273 TraceCheckUtils]: 115: Hoare triple {7084#false} assume !false; {7084#false} is VALID [2018-11-23 13:03:41,436 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 233 proven. 22 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2018-11-23 13:03:41,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:41,437 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-23 13:03:41,445 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:04:41,365 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2018-11-23 13:04:41,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:41,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:41,895 INFO L256 TraceCheckUtils]: 0: Hoare triple {7083#true} call ULTIMATE.init(); {7083#true} is VALID [2018-11-23 13:04:41,896 INFO L273 TraceCheckUtils]: 1: Hoare triple {7083#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {7083#true} is VALID [2018-11-23 13:04:41,896 INFO L273 TraceCheckUtils]: 2: Hoare triple {7083#true} assume true; {7083#true} is VALID [2018-11-23 13:04:41,896 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7083#true} {7083#true} #103#return; {7083#true} is VALID [2018-11-23 13:04:41,896 INFO L256 TraceCheckUtils]: 4: Hoare triple {7083#true} call #t~ret18 := main(); {7083#true} is VALID [2018-11-23 13:04:41,900 INFO L273 TraceCheckUtils]: 5: Hoare triple {7083#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:41,901 INFO L273 TraceCheckUtils]: 6: Hoare triple {7085#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:41,901 INFO L273 TraceCheckUtils]: 7: Hoare triple {7085#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:41,902 INFO L273 TraceCheckUtils]: 8: Hoare triple {7085#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:41,902 INFO L273 TraceCheckUtils]: 9: Hoare triple {7085#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:41,903 INFO L273 TraceCheckUtils]: 10: Hoare triple {7085#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:41,903 INFO L273 TraceCheckUtils]: 11: Hoare triple {7085#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:41,904 INFO L273 TraceCheckUtils]: 12: Hoare triple {7085#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:41,904 INFO L273 TraceCheckUtils]: 13: Hoare triple {7085#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:41,905 INFO L273 TraceCheckUtils]: 14: Hoare triple {7085#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:41,905 INFO L273 TraceCheckUtils]: 15: Hoare triple {7085#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:41,906 INFO L273 TraceCheckUtils]: 16: Hoare triple {7085#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:41,906 INFO L273 TraceCheckUtils]: 17: Hoare triple {7085#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:41,907 INFO L273 TraceCheckUtils]: 18: Hoare triple {7085#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:41,907 INFO L273 TraceCheckUtils]: 19: Hoare triple {7085#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:41,908 INFO L273 TraceCheckUtils]: 20: Hoare triple {7085#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:41,908 INFO L273 TraceCheckUtils]: 21: Hoare triple {7085#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:41,909 INFO L273 TraceCheckUtils]: 22: Hoare triple {7085#(<= 20 main_~edgecount~0)} ~i~0 := 0; {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:41,910 INFO L273 TraceCheckUtils]: 23: Hoare triple {7085#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:41,910 INFO L273 TraceCheckUtils]: 24: Hoare triple {7085#(<= 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); {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:41,911 INFO L273 TraceCheckUtils]: 25: Hoare triple {7085#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:41,911 INFO L273 TraceCheckUtils]: 26: Hoare triple {7085#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:41,912 INFO L273 TraceCheckUtils]: 27: Hoare triple {7085#(<= 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); {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:41,912 INFO L273 TraceCheckUtils]: 28: Hoare triple {7085#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:41,913 INFO L273 TraceCheckUtils]: 29: Hoare triple {7085#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:41,913 INFO L273 TraceCheckUtils]: 30: Hoare triple {7085#(<= 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); {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:41,914 INFO L273 TraceCheckUtils]: 31: Hoare triple {7085#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:41,914 INFO L273 TraceCheckUtils]: 32: Hoare triple {7085#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:41,915 INFO L273 TraceCheckUtils]: 33: Hoare triple {7085#(<= 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); {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:41,915 INFO L273 TraceCheckUtils]: 34: Hoare triple {7085#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:41,916 INFO L273 TraceCheckUtils]: 35: Hoare triple {7085#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:41,916 INFO L273 TraceCheckUtils]: 36: Hoare triple {7085#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:41,917 INFO L273 TraceCheckUtils]: 37: Hoare triple {7085#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7085#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:41,918 INFO L273 TraceCheckUtils]: 38: Hoare triple {7085#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7208#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-23 13:04:41,919 INFO L273 TraceCheckUtils]: 39: Hoare triple {7208#(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); {7208#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-23 13:04:41,919 INFO L273 TraceCheckUtils]: 40: Hoare triple {7208#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7208#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-23 13:04:41,922 INFO L273 TraceCheckUtils]: 41: Hoare triple {7208#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7218#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-23 13:04:41,923 INFO L273 TraceCheckUtils]: 42: Hoare triple {7218#(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); {7218#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-23 13:04:41,924 INFO L273 TraceCheckUtils]: 43: Hoare triple {7218#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7218#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-23 13:04:41,924 INFO L273 TraceCheckUtils]: 44: Hoare triple {7218#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7228#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-23 13:04:41,925 INFO L273 TraceCheckUtils]: 45: Hoare triple {7228#(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); {7228#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-23 13:04:41,926 INFO L273 TraceCheckUtils]: 46: Hoare triple {7228#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7228#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-23 13:04:41,927 INFO L273 TraceCheckUtils]: 47: Hoare triple {7228#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7238#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-23 13:04:41,928 INFO L273 TraceCheckUtils]: 48: Hoare triple {7238#(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); {7238#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-23 13:04:41,929 INFO L273 TraceCheckUtils]: 49: Hoare triple {7238#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7238#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-23 13:04:41,929 INFO L273 TraceCheckUtils]: 50: Hoare triple {7238#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7248#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-23 13:04:41,930 INFO L273 TraceCheckUtils]: 51: Hoare triple {7248#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume !(~j~0 < ~edgecount~0); {7084#false} is VALID [2018-11-23 13:04:41,930 INFO L273 TraceCheckUtils]: 52: Hoare triple {7084#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7084#false} is VALID [2018-11-23 13:04:41,931 INFO L273 TraceCheckUtils]: 53: Hoare triple {7084#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7084#false} is VALID [2018-11-23 13:04:41,931 INFO L273 TraceCheckUtils]: 54: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:04:41,931 INFO L273 TraceCheckUtils]: 55: Hoare triple {7084#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7084#false} is VALID [2018-11-23 13:04:41,931 INFO L273 TraceCheckUtils]: 56: Hoare triple {7084#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7084#false} is VALID [2018-11-23 13:04:41,931 INFO L273 TraceCheckUtils]: 57: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:04:41,932 INFO L273 TraceCheckUtils]: 58: Hoare triple {7084#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7084#false} is VALID [2018-11-23 13:04:41,932 INFO L273 TraceCheckUtils]: 59: Hoare triple {7084#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7084#false} is VALID [2018-11-23 13:04:41,932 INFO L273 TraceCheckUtils]: 60: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:04:41,932 INFO L273 TraceCheckUtils]: 61: Hoare triple {7084#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7084#false} is VALID [2018-11-23 13:04:41,932 INFO L273 TraceCheckUtils]: 62: Hoare triple {7084#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7084#false} is VALID [2018-11-23 13:04:41,933 INFO L273 TraceCheckUtils]: 63: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:04:41,933 INFO L273 TraceCheckUtils]: 64: Hoare triple {7084#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7084#false} is VALID [2018-11-23 13:04:41,933 INFO L273 TraceCheckUtils]: 65: Hoare triple {7084#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7084#false} is VALID [2018-11-23 13:04:41,933 INFO L273 TraceCheckUtils]: 66: Hoare triple {7084#false} assume !(~j~0 < ~edgecount~0); {7084#false} is VALID [2018-11-23 13:04:41,934 INFO L273 TraceCheckUtils]: 67: Hoare triple {7084#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7084#false} is VALID [2018-11-23 13:04:41,934 INFO L273 TraceCheckUtils]: 68: Hoare triple {7084#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7084#false} is VALID [2018-11-23 13:04:41,934 INFO L273 TraceCheckUtils]: 69: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:04:41,934 INFO L273 TraceCheckUtils]: 70: Hoare triple {7084#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7084#false} is VALID [2018-11-23 13:04:41,934 INFO L273 TraceCheckUtils]: 71: Hoare triple {7084#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7084#false} is VALID [2018-11-23 13:04:41,935 INFO L273 TraceCheckUtils]: 72: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:04:41,935 INFO L273 TraceCheckUtils]: 73: Hoare triple {7084#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7084#false} is VALID [2018-11-23 13:04:41,935 INFO L273 TraceCheckUtils]: 74: Hoare triple {7084#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7084#false} is VALID [2018-11-23 13:04:41,935 INFO L273 TraceCheckUtils]: 75: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:04:41,935 INFO L273 TraceCheckUtils]: 76: Hoare triple {7084#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7084#false} is VALID [2018-11-23 13:04:41,936 INFO L273 TraceCheckUtils]: 77: Hoare triple {7084#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7084#false} is VALID [2018-11-23 13:04:41,936 INFO L273 TraceCheckUtils]: 78: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:04:41,936 INFO L273 TraceCheckUtils]: 79: Hoare triple {7084#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7084#false} is VALID [2018-11-23 13:04:41,936 INFO L273 TraceCheckUtils]: 80: Hoare triple {7084#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7084#false} is VALID [2018-11-23 13:04:41,936 INFO L273 TraceCheckUtils]: 81: Hoare triple {7084#false} assume !(~j~0 < ~edgecount~0); {7084#false} is VALID [2018-11-23 13:04:41,936 INFO L273 TraceCheckUtils]: 82: Hoare triple {7084#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7084#false} is VALID [2018-11-23 13:04:41,936 INFO L273 TraceCheckUtils]: 83: Hoare triple {7084#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7084#false} is VALID [2018-11-23 13:04:41,937 INFO L273 TraceCheckUtils]: 84: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:04:41,937 INFO L273 TraceCheckUtils]: 85: Hoare triple {7084#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7084#false} is VALID [2018-11-23 13:04:41,937 INFO L273 TraceCheckUtils]: 86: Hoare triple {7084#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7084#false} is VALID [2018-11-23 13:04:41,937 INFO L273 TraceCheckUtils]: 87: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:04:41,937 INFO L273 TraceCheckUtils]: 88: Hoare triple {7084#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7084#false} is VALID [2018-11-23 13:04:41,937 INFO L273 TraceCheckUtils]: 89: Hoare triple {7084#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7084#false} is VALID [2018-11-23 13:04:41,937 INFO L273 TraceCheckUtils]: 90: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:04:41,937 INFO L273 TraceCheckUtils]: 91: Hoare triple {7084#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7084#false} is VALID [2018-11-23 13:04:41,937 INFO L273 TraceCheckUtils]: 92: Hoare triple {7084#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7084#false} is VALID [2018-11-23 13:04:41,938 INFO L273 TraceCheckUtils]: 93: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:04:41,938 INFO L273 TraceCheckUtils]: 94: Hoare triple {7084#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {7084#false} is VALID [2018-11-23 13:04:41,938 INFO L273 TraceCheckUtils]: 95: Hoare triple {7084#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {7084#false} is VALID [2018-11-23 13:04:41,938 INFO L273 TraceCheckUtils]: 96: Hoare triple {7084#false} assume !(~j~0 < ~edgecount~0); {7084#false} is VALID [2018-11-23 13:04:41,938 INFO L273 TraceCheckUtils]: 97: Hoare triple {7084#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7084#false} is VALID [2018-11-23 13:04:41,938 INFO L273 TraceCheckUtils]: 98: Hoare triple {7084#false} assume !(~i~0 < ~nodecount~0); {7084#false} is VALID [2018-11-23 13:04:41,938 INFO L273 TraceCheckUtils]: 99: Hoare triple {7084#false} ~i~0 := 0; {7084#false} is VALID [2018-11-23 13:04:41,938 INFO L273 TraceCheckUtils]: 100: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:04:41,938 INFO L273 TraceCheckUtils]: 101: Hoare triple {7084#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {7084#false} is VALID [2018-11-23 13:04:41,939 INFO L273 TraceCheckUtils]: 102: Hoare triple {7084#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7084#false} is VALID [2018-11-23 13:04:41,939 INFO L273 TraceCheckUtils]: 103: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:04:41,939 INFO L273 TraceCheckUtils]: 104: Hoare triple {7084#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {7084#false} is VALID [2018-11-23 13:04:41,939 INFO L273 TraceCheckUtils]: 105: Hoare triple {7084#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7084#false} is VALID [2018-11-23 13:04:41,939 INFO L273 TraceCheckUtils]: 106: Hoare triple {7084#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); {7084#false} is VALID [2018-11-23 13:04:41,939 INFO L273 TraceCheckUtils]: 107: Hoare triple {7084#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {7084#false} is VALID [2018-11-23 13:04:41,939 INFO L273 TraceCheckUtils]: 108: Hoare triple {7084#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {7084#false} is VALID [2018-11-23 13:04:41,940 INFO L273 TraceCheckUtils]: 109: Hoare triple {7084#false} assume !(~i~0 < ~edgecount~0); {7084#false} is VALID [2018-11-23 13:04:41,940 INFO L273 TraceCheckUtils]: 110: Hoare triple {7084#false} ~i~0 := 0; {7084#false} is VALID [2018-11-23 13:04:41,940 INFO L273 TraceCheckUtils]: 111: Hoare triple {7084#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7084#false} is VALID [2018-11-23 13:04:41,940 INFO L256 TraceCheckUtils]: 112: Hoare triple {7084#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {7084#false} is VALID [2018-11-23 13:04:41,940 INFO L273 TraceCheckUtils]: 113: Hoare triple {7084#false} ~cond := #in~cond; {7084#false} is VALID [2018-11-23 13:04:41,941 INFO L273 TraceCheckUtils]: 114: Hoare triple {7084#false} assume 0 == ~cond; {7084#false} is VALID [2018-11-23 13:04:41,941 INFO L273 TraceCheckUtils]: 115: Hoare triple {7084#false} assume !false; {7084#false} is VALID [2018-11-23 13:04:41,951 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 411 proven. 22 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2018-11-23 13:04:41,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:41,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-23 13:04:41,979 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 116 [2018-11-23 13:04:41,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:41,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 13:04:42,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:42,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:04:42,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:04:42,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:04:42,050 INFO L87 Difference]: Start difference. First operand 121 states and 149 transitions. Second operand 13 states. [2018-11-23 13:04:42,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:42,733 INFO L93 Difference]: Finished difference Result 230 states and 295 transitions. [2018-11-23 13:04:42,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:04:42,734 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 116 [2018-11-23 13:04:42,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:42,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:04:42,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2018-11-23 13:04:42,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:04:42,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2018-11-23 13:04:42,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 81 transitions. [2018-11-23 13:04:42,817 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-23 13:04:42,820 INFO L225 Difference]: With dead ends: 230 [2018-11-23 13:04:42,820 INFO L226 Difference]: Without dead ends: 146 [2018-11-23 13:04:42,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:04:42,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-23 13:04:43,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 136. [2018-11-23 13:04:43,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:43,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand 136 states. [2018-11-23 13:04:43,167 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 136 states. [2018-11-23 13:04:43,167 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 136 states. [2018-11-23 13:04:43,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:43,171 INFO L93 Difference]: Finished difference Result 146 states and 184 transitions. [2018-11-23 13:04:43,171 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 184 transitions. [2018-11-23 13:04:43,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:43,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:43,172 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 146 states. [2018-11-23 13:04:43,172 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 146 states. [2018-11-23 13:04:43,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:43,175 INFO L93 Difference]: Finished difference Result 146 states and 184 transitions. [2018-11-23 13:04:43,175 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 184 transitions. [2018-11-23 13:04:43,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:43,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:43,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:43,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:43,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-23 13:04:43,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 169 transitions. [2018-11-23 13:04:43,179 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 169 transitions. Word has length 116 [2018-11-23 13:04:43,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:43,179 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 169 transitions. [2018-11-23 13:04:43,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:04:43,179 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 169 transitions. [2018-11-23 13:04:43,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-23 13:04:43,181 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:43,181 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 5, 5, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:43,181 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:43,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:43,181 INFO L82 PathProgramCache]: Analyzing trace with hash -954808531, now seen corresponding path program 6 times [2018-11-23 13:04:43,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:43,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:43,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:43,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:04:43,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:43,443 INFO L256 TraceCheckUtils]: 0: Hoare triple {8239#true} call ULTIMATE.init(); {8239#true} is VALID [2018-11-23 13:04:43,443 INFO L273 TraceCheckUtils]: 1: Hoare triple {8239#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {8239#true} is VALID [2018-11-23 13:04:43,443 INFO L273 TraceCheckUtils]: 2: Hoare triple {8239#true} assume true; {8239#true} is VALID [2018-11-23 13:04:43,444 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8239#true} {8239#true} #103#return; {8239#true} is VALID [2018-11-23 13:04:43,444 INFO L256 TraceCheckUtils]: 4: Hoare triple {8239#true} call #t~ret18 := main(); {8239#true} is VALID [2018-11-23 13:04:43,446 INFO L273 TraceCheckUtils]: 5: Hoare triple {8239#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:43,447 INFO L273 TraceCheckUtils]: 6: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:43,447 INFO L273 TraceCheckUtils]: 7: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:43,448 INFO L273 TraceCheckUtils]: 8: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:43,448 INFO L273 TraceCheckUtils]: 9: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:43,449 INFO L273 TraceCheckUtils]: 10: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:43,449 INFO L273 TraceCheckUtils]: 11: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:43,450 INFO L273 TraceCheckUtils]: 12: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:43,450 INFO L273 TraceCheckUtils]: 13: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:43,451 INFO L273 TraceCheckUtils]: 14: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:43,451 INFO L273 TraceCheckUtils]: 15: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:43,452 INFO L273 TraceCheckUtils]: 16: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:43,452 INFO L273 TraceCheckUtils]: 17: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:43,453 INFO L273 TraceCheckUtils]: 18: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:43,453 INFO L273 TraceCheckUtils]: 19: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:43,454 INFO L273 TraceCheckUtils]: 20: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:43,454 INFO L273 TraceCheckUtils]: 21: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:43,455 INFO L273 TraceCheckUtils]: 22: Hoare triple {8241#(<= 20 main_~edgecount~0)} ~i~0 := 0; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:43,456 INFO L273 TraceCheckUtils]: 23: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {8242#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} is VALID [2018-11-23 13:04:43,457 INFO L273 TraceCheckUtils]: 24: Hoare triple {8242#(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); {8242#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} is VALID [2018-11-23 13:04:43,458 INFO L273 TraceCheckUtils]: 25: Hoare triple {8242#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8242#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} is VALID [2018-11-23 13:04:43,458 INFO L273 TraceCheckUtils]: 26: Hoare triple {8242#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8243#(<= (+ main_~j~0 19) main_~edgecount~0)} is VALID [2018-11-23 13:04:43,478 INFO L273 TraceCheckUtils]: 27: Hoare triple {8243#(<= (+ main_~j~0 19) 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); {8243#(<= (+ main_~j~0 19) main_~edgecount~0)} is VALID [2018-11-23 13:04:43,481 INFO L273 TraceCheckUtils]: 28: Hoare triple {8243#(<= (+ main_~j~0 19) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8243#(<= (+ main_~j~0 19) main_~edgecount~0)} is VALID [2018-11-23 13:04:43,482 INFO L273 TraceCheckUtils]: 29: Hoare triple {8243#(<= (+ main_~j~0 19) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8244#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2018-11-23 13:04:43,482 INFO L273 TraceCheckUtils]: 30: Hoare triple {8244#(<= (+ main_~j~0 18) 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); {8244#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2018-11-23 13:04:43,482 INFO L273 TraceCheckUtils]: 31: Hoare triple {8244#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8244#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2018-11-23 13:04:43,483 INFO L273 TraceCheckUtils]: 32: Hoare triple {8244#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8245#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2018-11-23 13:04:43,483 INFO L273 TraceCheckUtils]: 33: Hoare triple {8245#(<= (+ main_~j~0 17) 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); {8245#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2018-11-23 13:04:43,483 INFO L273 TraceCheckUtils]: 34: Hoare triple {8245#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8245#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2018-11-23 13:04:43,484 INFO L273 TraceCheckUtils]: 35: Hoare triple {8245#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8246#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2018-11-23 13:04:43,484 INFO L273 TraceCheckUtils]: 36: Hoare triple {8246#(<= (+ main_~j~0 16) 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); {8246#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2018-11-23 13:04:43,485 INFO L273 TraceCheckUtils]: 37: Hoare triple {8246#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8246#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2018-11-23 13:04:43,485 INFO L273 TraceCheckUtils]: 38: Hoare triple {8246#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8247#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2018-11-23 13:04:43,486 INFO L273 TraceCheckUtils]: 39: Hoare triple {8247#(<= (+ main_~j~0 15) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {8240#false} is VALID [2018-11-23 13:04:43,486 INFO L273 TraceCheckUtils]: 40: Hoare triple {8240#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8240#false} is VALID [2018-11-23 13:04:43,486 INFO L273 TraceCheckUtils]: 41: Hoare triple {8240#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {8240#false} is VALID [2018-11-23 13:04:43,487 INFO L273 TraceCheckUtils]: 42: Hoare triple {8240#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); {8240#false} is VALID [2018-11-23 13:04:43,487 INFO L273 TraceCheckUtils]: 43: Hoare triple {8240#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8240#false} is VALID [2018-11-23 13:04:43,487 INFO L273 TraceCheckUtils]: 44: Hoare triple {8240#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8240#false} is VALID [2018-11-23 13:04:43,487 INFO L273 TraceCheckUtils]: 45: Hoare triple {8240#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); {8240#false} is VALID [2018-11-23 13:04:43,487 INFO L273 TraceCheckUtils]: 46: Hoare triple {8240#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8240#false} is VALID [2018-11-23 13:04:43,488 INFO L273 TraceCheckUtils]: 47: Hoare triple {8240#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8240#false} is VALID [2018-11-23 13:04:43,488 INFO L273 TraceCheckUtils]: 48: Hoare triple {8240#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); {8240#false} is VALID [2018-11-23 13:04:43,488 INFO L273 TraceCheckUtils]: 49: Hoare triple {8240#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8240#false} is VALID [2018-11-23 13:04:43,488 INFO L273 TraceCheckUtils]: 50: Hoare triple {8240#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8240#false} is VALID [2018-11-23 13:04:43,488 INFO L273 TraceCheckUtils]: 51: Hoare triple {8240#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); {8240#false} is VALID [2018-11-23 13:04:43,489 INFO L273 TraceCheckUtils]: 52: Hoare triple {8240#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8240#false} is VALID [2018-11-23 13:04:43,489 INFO L273 TraceCheckUtils]: 53: Hoare triple {8240#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8240#false} is VALID [2018-11-23 13:04:43,489 INFO L273 TraceCheckUtils]: 54: Hoare triple {8240#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); {8240#false} is VALID [2018-11-23 13:04:43,489 INFO L273 TraceCheckUtils]: 55: Hoare triple {8240#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8240#false} is VALID [2018-11-23 13:04:43,489 INFO L273 TraceCheckUtils]: 56: Hoare triple {8240#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8240#false} is VALID [2018-11-23 13:04:43,489 INFO L273 TraceCheckUtils]: 57: Hoare triple {8240#false} assume !(~j~0 < ~edgecount~0); {8240#false} is VALID [2018-11-23 13:04:43,489 INFO L273 TraceCheckUtils]: 58: Hoare triple {8240#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8240#false} is VALID [2018-11-23 13:04:43,490 INFO L273 TraceCheckUtils]: 59: Hoare triple {8240#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {8240#false} is VALID [2018-11-23 13:04:43,490 INFO L273 TraceCheckUtils]: 60: Hoare triple {8240#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); {8240#false} is VALID [2018-11-23 13:04:43,490 INFO L273 TraceCheckUtils]: 61: Hoare triple {8240#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8240#false} is VALID [2018-11-23 13:04:43,490 INFO L273 TraceCheckUtils]: 62: Hoare triple {8240#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8240#false} is VALID [2018-11-23 13:04:43,490 INFO L273 TraceCheckUtils]: 63: Hoare triple {8240#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); {8240#false} is VALID [2018-11-23 13:04:43,490 INFO L273 TraceCheckUtils]: 64: Hoare triple {8240#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8240#false} is VALID [2018-11-23 13:04:43,490 INFO L273 TraceCheckUtils]: 65: Hoare triple {8240#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8240#false} is VALID [2018-11-23 13:04:43,490 INFO L273 TraceCheckUtils]: 66: Hoare triple {8240#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); {8240#false} is VALID [2018-11-23 13:04:43,490 INFO L273 TraceCheckUtils]: 67: Hoare triple {8240#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8240#false} is VALID [2018-11-23 13:04:43,491 INFO L273 TraceCheckUtils]: 68: Hoare triple {8240#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8240#false} is VALID [2018-11-23 13:04:43,491 INFO L273 TraceCheckUtils]: 69: Hoare triple {8240#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); {8240#false} is VALID [2018-11-23 13:04:43,491 INFO L273 TraceCheckUtils]: 70: Hoare triple {8240#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8240#false} is VALID [2018-11-23 13:04:43,491 INFO L273 TraceCheckUtils]: 71: Hoare triple {8240#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8240#false} is VALID [2018-11-23 13:04:43,491 INFO L273 TraceCheckUtils]: 72: Hoare triple {8240#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); {8240#false} is VALID [2018-11-23 13:04:43,491 INFO L273 TraceCheckUtils]: 73: Hoare triple {8240#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8240#false} is VALID [2018-11-23 13:04:43,491 INFO L273 TraceCheckUtils]: 74: Hoare triple {8240#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8240#false} is VALID [2018-11-23 13:04:43,491 INFO L273 TraceCheckUtils]: 75: Hoare triple {8240#false} assume !(~j~0 < ~edgecount~0); {8240#false} is VALID [2018-11-23 13:04:43,492 INFO L273 TraceCheckUtils]: 76: Hoare triple {8240#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8240#false} is VALID [2018-11-23 13:04:43,492 INFO L273 TraceCheckUtils]: 77: Hoare triple {8240#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {8240#false} is VALID [2018-11-23 13:04:43,492 INFO L273 TraceCheckUtils]: 78: Hoare triple {8240#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); {8240#false} is VALID [2018-11-23 13:04:43,492 INFO L273 TraceCheckUtils]: 79: Hoare triple {8240#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8240#false} is VALID [2018-11-23 13:04:43,492 INFO L273 TraceCheckUtils]: 80: Hoare triple {8240#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8240#false} is VALID [2018-11-23 13:04:43,492 INFO L273 TraceCheckUtils]: 81: Hoare triple {8240#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); {8240#false} is VALID [2018-11-23 13:04:43,492 INFO L273 TraceCheckUtils]: 82: Hoare triple {8240#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8240#false} is VALID [2018-11-23 13:04:43,492 INFO L273 TraceCheckUtils]: 83: Hoare triple {8240#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8240#false} is VALID [2018-11-23 13:04:43,492 INFO L273 TraceCheckUtils]: 84: Hoare triple {8240#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); {8240#false} is VALID [2018-11-23 13:04:43,493 INFO L273 TraceCheckUtils]: 85: Hoare triple {8240#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8240#false} is VALID [2018-11-23 13:04:43,493 INFO L273 TraceCheckUtils]: 86: Hoare triple {8240#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8240#false} is VALID [2018-11-23 13:04:43,493 INFO L273 TraceCheckUtils]: 87: Hoare triple {8240#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); {8240#false} is VALID [2018-11-23 13:04:43,493 INFO L273 TraceCheckUtils]: 88: Hoare triple {8240#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8240#false} is VALID [2018-11-23 13:04:43,493 INFO L273 TraceCheckUtils]: 89: Hoare triple {8240#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8240#false} is VALID [2018-11-23 13:04:43,493 INFO L273 TraceCheckUtils]: 90: Hoare triple {8240#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); {8240#false} is VALID [2018-11-23 13:04:43,493 INFO L273 TraceCheckUtils]: 91: Hoare triple {8240#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8240#false} is VALID [2018-11-23 13:04:43,493 INFO L273 TraceCheckUtils]: 92: Hoare triple {8240#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8240#false} is VALID [2018-11-23 13:04:43,494 INFO L273 TraceCheckUtils]: 93: Hoare triple {8240#false} assume !(~j~0 < ~edgecount~0); {8240#false} is VALID [2018-11-23 13:04:43,494 INFO L273 TraceCheckUtils]: 94: Hoare triple {8240#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8240#false} is VALID [2018-11-23 13:04:43,494 INFO L273 TraceCheckUtils]: 95: Hoare triple {8240#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {8240#false} is VALID [2018-11-23 13:04:43,494 INFO L273 TraceCheckUtils]: 96: Hoare triple {8240#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); {8240#false} is VALID [2018-11-23 13:04:43,494 INFO L273 TraceCheckUtils]: 97: Hoare triple {8240#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8240#false} is VALID [2018-11-23 13:04:43,494 INFO L273 TraceCheckUtils]: 98: Hoare triple {8240#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8240#false} is VALID [2018-11-23 13:04:43,494 INFO L273 TraceCheckUtils]: 99: Hoare triple {8240#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); {8240#false} is VALID [2018-11-23 13:04:43,494 INFO L273 TraceCheckUtils]: 100: Hoare triple {8240#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8240#false} is VALID [2018-11-23 13:04:43,494 INFO L273 TraceCheckUtils]: 101: Hoare triple {8240#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8240#false} is VALID [2018-11-23 13:04:43,495 INFO L273 TraceCheckUtils]: 102: Hoare triple {8240#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); {8240#false} is VALID [2018-11-23 13:04:43,495 INFO L273 TraceCheckUtils]: 103: Hoare triple {8240#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8240#false} is VALID [2018-11-23 13:04:43,495 INFO L273 TraceCheckUtils]: 104: Hoare triple {8240#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8240#false} is VALID [2018-11-23 13:04:43,495 INFO L273 TraceCheckUtils]: 105: Hoare triple {8240#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); {8240#false} is VALID [2018-11-23 13:04:43,495 INFO L273 TraceCheckUtils]: 106: Hoare triple {8240#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8240#false} is VALID [2018-11-23 13:04:43,495 INFO L273 TraceCheckUtils]: 107: Hoare triple {8240#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8240#false} is VALID [2018-11-23 13:04:43,495 INFO L273 TraceCheckUtils]: 108: Hoare triple {8240#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); {8240#false} is VALID [2018-11-23 13:04:43,495 INFO L273 TraceCheckUtils]: 109: Hoare triple {8240#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8240#false} is VALID [2018-11-23 13:04:43,496 INFO L273 TraceCheckUtils]: 110: Hoare triple {8240#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8240#false} is VALID [2018-11-23 13:04:43,496 INFO L273 TraceCheckUtils]: 111: Hoare triple {8240#false} assume !(~j~0 < ~edgecount~0); {8240#false} is VALID [2018-11-23 13:04:43,496 INFO L273 TraceCheckUtils]: 112: Hoare triple {8240#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8240#false} is VALID [2018-11-23 13:04:43,496 INFO L273 TraceCheckUtils]: 113: Hoare triple {8240#false} assume !(~i~0 < ~nodecount~0); {8240#false} is VALID [2018-11-23 13:04:43,496 INFO L273 TraceCheckUtils]: 114: Hoare triple {8240#false} ~i~0 := 0; {8240#false} is VALID [2018-11-23 13:04:43,496 INFO L273 TraceCheckUtils]: 115: Hoare triple {8240#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); {8240#false} is VALID [2018-11-23 13:04:43,496 INFO L273 TraceCheckUtils]: 116: Hoare triple {8240#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {8240#false} is VALID [2018-11-23 13:04:43,496 INFO L273 TraceCheckUtils]: 117: Hoare triple {8240#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8240#false} is VALID [2018-11-23 13:04:43,496 INFO L273 TraceCheckUtils]: 118: Hoare triple {8240#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); {8240#false} is VALID [2018-11-23 13:04:43,497 INFO L273 TraceCheckUtils]: 119: Hoare triple {8240#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {8240#false} is VALID [2018-11-23 13:04:43,497 INFO L273 TraceCheckUtils]: 120: Hoare triple {8240#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8240#false} is VALID [2018-11-23 13:04:43,497 INFO L273 TraceCheckUtils]: 121: Hoare triple {8240#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); {8240#false} is VALID [2018-11-23 13:04:43,497 INFO L273 TraceCheckUtils]: 122: Hoare triple {8240#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {8240#false} is VALID [2018-11-23 13:04:43,497 INFO L273 TraceCheckUtils]: 123: Hoare triple {8240#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8240#false} is VALID [2018-11-23 13:04:43,497 INFO L273 TraceCheckUtils]: 124: Hoare triple {8240#false} assume !(~i~0 < ~edgecount~0); {8240#false} is VALID [2018-11-23 13:04:43,497 INFO L273 TraceCheckUtils]: 125: Hoare triple {8240#false} ~i~0 := 0; {8240#false} is VALID [2018-11-23 13:04:43,497 INFO L273 TraceCheckUtils]: 126: Hoare triple {8240#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8240#false} is VALID [2018-11-23 13:04:43,497 INFO L256 TraceCheckUtils]: 127: Hoare triple {8240#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {8240#false} is VALID [2018-11-23 13:04:43,498 INFO L273 TraceCheckUtils]: 128: Hoare triple {8240#false} ~cond := #in~cond; {8240#false} is VALID [2018-11-23 13:04:43,498 INFO L273 TraceCheckUtils]: 129: Hoare triple {8240#false} assume 0 == ~cond; {8240#false} is VALID [2018-11-23 13:04:43,498 INFO L273 TraceCheckUtils]: 130: Hoare triple {8240#false} assume !false; {8240#false} is VALID [2018-11-23 13:04:43,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 349 proven. 35 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2018-11-23 13:04:43,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:43,507 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-23 13:04:43,515 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:04:43,645 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 13:04:43,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:43,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:44,363 INFO L256 TraceCheckUtils]: 0: Hoare triple {8239#true} call ULTIMATE.init(); {8239#true} is VALID [2018-11-23 13:04:44,364 INFO L273 TraceCheckUtils]: 1: Hoare triple {8239#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {8239#true} is VALID [2018-11-23 13:04:44,364 INFO L273 TraceCheckUtils]: 2: Hoare triple {8239#true} assume true; {8239#true} is VALID [2018-11-23 13:04:44,364 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8239#true} {8239#true} #103#return; {8239#true} is VALID [2018-11-23 13:04:44,364 INFO L256 TraceCheckUtils]: 4: Hoare triple {8239#true} call #t~ret18 := main(); {8239#true} is VALID [2018-11-23 13:04:44,368 INFO L273 TraceCheckUtils]: 5: Hoare triple {8239#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,369 INFO L273 TraceCheckUtils]: 6: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,369 INFO L273 TraceCheckUtils]: 7: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,370 INFO L273 TraceCheckUtils]: 8: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,370 INFO L273 TraceCheckUtils]: 9: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,371 INFO L273 TraceCheckUtils]: 10: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,371 INFO L273 TraceCheckUtils]: 11: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,372 INFO L273 TraceCheckUtils]: 12: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,372 INFO L273 TraceCheckUtils]: 13: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,373 INFO L273 TraceCheckUtils]: 14: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,373 INFO L273 TraceCheckUtils]: 15: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,374 INFO L273 TraceCheckUtils]: 16: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,374 INFO L273 TraceCheckUtils]: 17: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,375 INFO L273 TraceCheckUtils]: 18: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,375 INFO L273 TraceCheckUtils]: 19: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,394 INFO L273 TraceCheckUtils]: 20: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,403 INFO L273 TraceCheckUtils]: 21: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,416 INFO L273 TraceCheckUtils]: 22: Hoare triple {8241#(<= 20 main_~edgecount~0)} ~i~0 := 0; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,424 INFO L273 TraceCheckUtils]: 23: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,429 INFO L273 TraceCheckUtils]: 24: Hoare triple {8241#(<= 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); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,430 INFO L273 TraceCheckUtils]: 25: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,430 INFO L273 TraceCheckUtils]: 26: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,430 INFO L273 TraceCheckUtils]: 27: Hoare triple {8241#(<= 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); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,431 INFO L273 TraceCheckUtils]: 28: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,431 INFO L273 TraceCheckUtils]: 29: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,431 INFO L273 TraceCheckUtils]: 30: Hoare triple {8241#(<= 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); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,431 INFO L273 TraceCheckUtils]: 31: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,432 INFO L273 TraceCheckUtils]: 32: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,432 INFO L273 TraceCheckUtils]: 33: Hoare triple {8241#(<= 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); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,432 INFO L273 TraceCheckUtils]: 34: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,433 INFO L273 TraceCheckUtils]: 35: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,433 INFO L273 TraceCheckUtils]: 36: Hoare triple {8241#(<= 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); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,433 INFO L273 TraceCheckUtils]: 37: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,434 INFO L273 TraceCheckUtils]: 38: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,434 INFO L273 TraceCheckUtils]: 39: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,435 INFO L273 TraceCheckUtils]: 40: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,435 INFO L273 TraceCheckUtils]: 41: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,436 INFO L273 TraceCheckUtils]: 42: Hoare triple {8241#(<= 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); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,436 INFO L273 TraceCheckUtils]: 43: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,437 INFO L273 TraceCheckUtils]: 44: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,437 INFO L273 TraceCheckUtils]: 45: Hoare triple {8241#(<= 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); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,438 INFO L273 TraceCheckUtils]: 46: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,438 INFO L273 TraceCheckUtils]: 47: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,439 INFO L273 TraceCheckUtils]: 48: Hoare triple {8241#(<= 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); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,439 INFO L273 TraceCheckUtils]: 49: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,440 INFO L273 TraceCheckUtils]: 50: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,440 INFO L273 TraceCheckUtils]: 51: Hoare triple {8241#(<= 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); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,441 INFO L273 TraceCheckUtils]: 52: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,441 INFO L273 TraceCheckUtils]: 53: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,442 INFO L273 TraceCheckUtils]: 54: Hoare triple {8241#(<= 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); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,442 INFO L273 TraceCheckUtils]: 55: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,443 INFO L273 TraceCheckUtils]: 56: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,443 INFO L273 TraceCheckUtils]: 57: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,444 INFO L273 TraceCheckUtils]: 58: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,444 INFO L273 TraceCheckUtils]: 59: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,445 INFO L273 TraceCheckUtils]: 60: Hoare triple {8241#(<= 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); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,445 INFO L273 TraceCheckUtils]: 61: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,446 INFO L273 TraceCheckUtils]: 62: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,446 INFO L273 TraceCheckUtils]: 63: Hoare triple {8241#(<= 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); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,447 INFO L273 TraceCheckUtils]: 64: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,447 INFO L273 TraceCheckUtils]: 65: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,448 INFO L273 TraceCheckUtils]: 66: Hoare triple {8241#(<= 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); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,448 INFO L273 TraceCheckUtils]: 67: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,449 INFO L273 TraceCheckUtils]: 68: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,449 INFO L273 TraceCheckUtils]: 69: Hoare triple {8241#(<= 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); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,450 INFO L273 TraceCheckUtils]: 70: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,450 INFO L273 TraceCheckUtils]: 71: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,451 INFO L273 TraceCheckUtils]: 72: Hoare triple {8241#(<= 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); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,451 INFO L273 TraceCheckUtils]: 73: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,452 INFO L273 TraceCheckUtils]: 74: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,452 INFO L273 TraceCheckUtils]: 75: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,453 INFO L273 TraceCheckUtils]: 76: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,453 INFO L273 TraceCheckUtils]: 77: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,454 INFO L273 TraceCheckUtils]: 78: Hoare triple {8241#(<= 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); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,454 INFO L273 TraceCheckUtils]: 79: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,455 INFO L273 TraceCheckUtils]: 80: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,455 INFO L273 TraceCheckUtils]: 81: Hoare triple {8241#(<= 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); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,456 INFO L273 TraceCheckUtils]: 82: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,456 INFO L273 TraceCheckUtils]: 83: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,457 INFO L273 TraceCheckUtils]: 84: Hoare triple {8241#(<= 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); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,457 INFO L273 TraceCheckUtils]: 85: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,458 INFO L273 TraceCheckUtils]: 86: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,458 INFO L273 TraceCheckUtils]: 87: Hoare triple {8241#(<= 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); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,459 INFO L273 TraceCheckUtils]: 88: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,459 INFO L273 TraceCheckUtils]: 89: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,460 INFO L273 TraceCheckUtils]: 90: Hoare triple {8241#(<= 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); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,461 INFO L273 TraceCheckUtils]: 91: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,461 INFO L273 TraceCheckUtils]: 92: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,462 INFO L273 TraceCheckUtils]: 93: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,462 INFO L273 TraceCheckUtils]: 94: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,463 INFO L273 TraceCheckUtils]: 95: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,463 INFO L273 TraceCheckUtils]: 96: Hoare triple {8241#(<= 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); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,464 INFO L273 TraceCheckUtils]: 97: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,464 INFO L273 TraceCheckUtils]: 98: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,465 INFO L273 TraceCheckUtils]: 99: Hoare triple {8241#(<= 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); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,465 INFO L273 TraceCheckUtils]: 100: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,466 INFO L273 TraceCheckUtils]: 101: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,466 INFO L273 TraceCheckUtils]: 102: Hoare triple {8241#(<= 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); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,467 INFO L273 TraceCheckUtils]: 103: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,467 INFO L273 TraceCheckUtils]: 104: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,468 INFO L273 TraceCheckUtils]: 105: Hoare triple {8241#(<= 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); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,468 INFO L273 TraceCheckUtils]: 106: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,469 INFO L273 TraceCheckUtils]: 107: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,469 INFO L273 TraceCheckUtils]: 108: Hoare triple {8241#(<= 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); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,470 INFO L273 TraceCheckUtils]: 109: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,470 INFO L273 TraceCheckUtils]: 110: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,471 INFO L273 TraceCheckUtils]: 111: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,471 INFO L273 TraceCheckUtils]: 112: Hoare triple {8241#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,472 INFO L273 TraceCheckUtils]: 113: Hoare triple {8241#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {8241#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:44,472 INFO L273 TraceCheckUtils]: 114: Hoare triple {8241#(<= 20 main_~edgecount~0)} ~i~0 := 0; {8593#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:04:44,473 INFO L273 TraceCheckUtils]: 115: Hoare triple {8593#(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); {8593#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:04:44,474 INFO L273 TraceCheckUtils]: 116: Hoare triple {8593#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {8593#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:04:44,475 INFO L273 TraceCheckUtils]: 117: Hoare triple {8593#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8603#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:04:44,476 INFO L273 TraceCheckUtils]: 118: Hoare triple {8603#(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); {8603#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:04:44,477 INFO L273 TraceCheckUtils]: 119: Hoare triple {8603#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {8603#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:04:44,477 INFO L273 TraceCheckUtils]: 120: Hoare triple {8603#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8613#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:04:44,479 INFO L273 TraceCheckUtils]: 121: Hoare triple {8613#(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); {8613#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:04:44,479 INFO L273 TraceCheckUtils]: 122: Hoare triple {8613#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {8613#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:04:44,480 INFO L273 TraceCheckUtils]: 123: Hoare triple {8613#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {8623#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2018-11-23 13:04:44,481 INFO L273 TraceCheckUtils]: 124: Hoare triple {8623#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} assume !(~i~0 < ~edgecount~0); {8240#false} is VALID [2018-11-23 13:04:44,481 INFO L273 TraceCheckUtils]: 125: Hoare triple {8240#false} ~i~0 := 0; {8240#false} is VALID [2018-11-23 13:04:44,481 INFO L273 TraceCheckUtils]: 126: Hoare triple {8240#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8240#false} is VALID [2018-11-23 13:04:44,481 INFO L256 TraceCheckUtils]: 127: Hoare triple {8240#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {8240#false} is VALID [2018-11-23 13:04:44,482 INFO L273 TraceCheckUtils]: 128: Hoare triple {8240#false} ~cond := #in~cond; {8240#false} is VALID [2018-11-23 13:04:44,482 INFO L273 TraceCheckUtils]: 129: Hoare triple {8240#false} assume 0 == ~cond; {8240#false} is VALID [2018-11-23 13:04:44,482 INFO L273 TraceCheckUtils]: 130: Hoare triple {8240#false} assume !false; {8240#false} is VALID [2018-11-23 13:04:44,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1095 trivial. 0 not checked. [2018-11-23 13:04:44,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:44,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2018-11-23 13:04:44,516 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 131 [2018-11-23 13:04:44,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:44,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 13:04:44,586 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:44,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:04:44,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:04:44,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:04:44,587 INFO L87 Difference]: Start difference. First operand 136 states and 169 transitions. Second operand 13 states. [2018-11-23 13:04:46,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:46,966 INFO L93 Difference]: Finished difference Result 278 states and 357 transitions. [2018-11-23 13:04:46,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 13:04:46,966 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 131 [2018-11-23 13:04:46,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:46,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:04:46,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 257 transitions. [2018-11-23 13:04:46,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:04:46,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 257 transitions. [2018-11-23 13:04:46,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 257 transitions. [2018-11-23 13:04:47,399 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:47,404 INFO L225 Difference]: With dead ends: 278 [2018-11-23 13:04:47,404 INFO L226 Difference]: Without dead ends: 182 [2018-11-23 13:04:47,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=576, Invalid=1146, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 13:04:47,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-23 13:04:47,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 154. [2018-11-23 13:04:47,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:47,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand 154 states. [2018-11-23 13:04:47,757 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand 154 states. [2018-11-23 13:04:47,758 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 154 states. [2018-11-23 13:04:47,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:47,763 INFO L93 Difference]: Finished difference Result 182 states and 229 transitions. [2018-11-23 13:04:47,763 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 229 transitions. [2018-11-23 13:04:47,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:47,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:47,764 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand 182 states. [2018-11-23 13:04:47,764 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 182 states. [2018-11-23 13:04:47,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:47,768 INFO L93 Difference]: Finished difference Result 182 states and 229 transitions. [2018-11-23 13:04:47,768 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 229 transitions. [2018-11-23 13:04:47,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:47,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:47,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:47,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:47,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-23 13:04:47,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 192 transitions. [2018-11-23 13:04:47,771 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 192 transitions. Word has length 131 [2018-11-23 13:04:47,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:47,772 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 192 transitions. [2018-11-23 13:04:47,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:04:47,772 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 192 transitions. [2018-11-23 13:04:47,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-23 13:04:47,773 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:47,773 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 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] [2018-11-23 13:04:47,774 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:47,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:47,774 INFO L82 PathProgramCache]: Analyzing trace with hash -760229294, now seen corresponding path program 7 times [2018-11-23 13:04:47,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:47,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:47,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:47,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:04:47,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:48,146 INFO L256 TraceCheckUtils]: 0: Hoare triple {9660#true} call ULTIMATE.init(); {9660#true} is VALID [2018-11-23 13:04:48,146 INFO L273 TraceCheckUtils]: 1: Hoare triple {9660#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {9660#true} is VALID [2018-11-23 13:04:48,147 INFO L273 TraceCheckUtils]: 2: Hoare triple {9660#true} assume true; {9660#true} is VALID [2018-11-23 13:04:48,147 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9660#true} {9660#true} #103#return; {9660#true} is VALID [2018-11-23 13:04:48,147 INFO L256 TraceCheckUtils]: 4: Hoare triple {9660#true} call #t~ret18 := main(); {9660#true} is VALID [2018-11-23 13:04:48,151 INFO L273 TraceCheckUtils]: 5: Hoare triple {9660#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,151 INFO L273 TraceCheckUtils]: 6: Hoare triple {9662#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,152 INFO L273 TraceCheckUtils]: 7: Hoare triple {9662#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,152 INFO L273 TraceCheckUtils]: 8: Hoare triple {9662#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,153 INFO L273 TraceCheckUtils]: 9: Hoare triple {9662#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,153 INFO L273 TraceCheckUtils]: 10: Hoare triple {9662#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,154 INFO L273 TraceCheckUtils]: 11: Hoare triple {9662#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,154 INFO L273 TraceCheckUtils]: 12: Hoare triple {9662#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,155 INFO L273 TraceCheckUtils]: 13: Hoare triple {9662#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,156 INFO L273 TraceCheckUtils]: 14: Hoare triple {9662#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,156 INFO L273 TraceCheckUtils]: 15: Hoare triple {9662#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,157 INFO L273 TraceCheckUtils]: 16: Hoare triple {9662#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,157 INFO L273 TraceCheckUtils]: 17: Hoare triple {9662#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,158 INFO L273 TraceCheckUtils]: 18: Hoare triple {9662#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,158 INFO L273 TraceCheckUtils]: 19: Hoare triple {9662#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,159 INFO L273 TraceCheckUtils]: 20: Hoare triple {9662#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,159 INFO L273 TraceCheckUtils]: 21: Hoare triple {9662#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,160 INFO L273 TraceCheckUtils]: 22: Hoare triple {9662#(<= 20 main_~edgecount~0)} ~i~0 := 0; {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,160 INFO L273 TraceCheckUtils]: 23: Hoare triple {9662#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9663#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} is VALID [2018-11-23 13:04:48,161 INFO L273 TraceCheckUtils]: 24: Hoare triple {9663#(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); {9663#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} is VALID [2018-11-23 13:04:48,162 INFO L273 TraceCheckUtils]: 25: Hoare triple {9663#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9663#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} is VALID [2018-11-23 13:04:48,163 INFO L273 TraceCheckUtils]: 26: Hoare triple {9663#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9664#(<= (+ main_~j~0 19) main_~edgecount~0)} is VALID [2018-11-23 13:04:48,164 INFO L273 TraceCheckUtils]: 27: Hoare triple {9664#(<= (+ main_~j~0 19) 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); {9664#(<= (+ main_~j~0 19) main_~edgecount~0)} is VALID [2018-11-23 13:04:48,164 INFO L273 TraceCheckUtils]: 28: Hoare triple {9664#(<= (+ main_~j~0 19) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9664#(<= (+ main_~j~0 19) main_~edgecount~0)} is VALID [2018-11-23 13:04:48,165 INFO L273 TraceCheckUtils]: 29: Hoare triple {9664#(<= (+ main_~j~0 19) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9665#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2018-11-23 13:04:48,166 INFO L273 TraceCheckUtils]: 30: Hoare triple {9665#(<= (+ main_~j~0 18) 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); {9665#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2018-11-23 13:04:48,166 INFO L273 TraceCheckUtils]: 31: Hoare triple {9665#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9665#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2018-11-23 13:04:48,167 INFO L273 TraceCheckUtils]: 32: Hoare triple {9665#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9666#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2018-11-23 13:04:48,168 INFO L273 TraceCheckUtils]: 33: Hoare triple {9666#(<= (+ main_~j~0 17) 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); {9666#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2018-11-23 13:04:48,168 INFO L273 TraceCheckUtils]: 34: Hoare triple {9666#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9666#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2018-11-23 13:04:48,169 INFO L273 TraceCheckUtils]: 35: Hoare triple {9666#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9667#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2018-11-23 13:04:48,169 INFO L273 TraceCheckUtils]: 36: Hoare triple {9667#(<= (+ main_~j~0 16) 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); {9667#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2018-11-23 13:04:48,170 INFO L273 TraceCheckUtils]: 37: Hoare triple {9667#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9667#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2018-11-23 13:04:48,171 INFO L273 TraceCheckUtils]: 38: Hoare triple {9667#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9668#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2018-11-23 13:04:48,171 INFO L273 TraceCheckUtils]: 39: Hoare triple {9668#(<= (+ main_~j~0 15) 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); {9668#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2018-11-23 13:04:48,172 INFO L273 TraceCheckUtils]: 40: Hoare triple {9668#(<= (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9668#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2018-11-23 13:04:48,173 INFO L273 TraceCheckUtils]: 41: Hoare triple {9668#(<= (+ main_~j~0 15) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9669#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2018-11-23 13:04:48,173 INFO L273 TraceCheckUtils]: 42: Hoare triple {9669#(<= (+ main_~j~0 14) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {9661#false} is VALID [2018-11-23 13:04:48,174 INFO L273 TraceCheckUtils]: 43: Hoare triple {9661#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9661#false} is VALID [2018-11-23 13:04:48,174 INFO L273 TraceCheckUtils]: 44: Hoare triple {9661#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9661#false} is VALID [2018-11-23 13:04:48,174 INFO L273 TraceCheckUtils]: 45: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,174 INFO L273 TraceCheckUtils]: 46: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,174 INFO L273 TraceCheckUtils]: 47: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,175 INFO L273 TraceCheckUtils]: 48: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,175 INFO L273 TraceCheckUtils]: 49: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,175 INFO L273 TraceCheckUtils]: 50: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,175 INFO L273 TraceCheckUtils]: 51: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,175 INFO L273 TraceCheckUtils]: 52: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,176 INFO L273 TraceCheckUtils]: 53: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,176 INFO L273 TraceCheckUtils]: 54: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,176 INFO L273 TraceCheckUtils]: 55: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,176 INFO L273 TraceCheckUtils]: 56: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,176 INFO L273 TraceCheckUtils]: 57: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,177 INFO L273 TraceCheckUtils]: 58: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,177 INFO L273 TraceCheckUtils]: 59: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,177 INFO L273 TraceCheckUtils]: 60: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,177 INFO L273 TraceCheckUtils]: 61: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,177 INFO L273 TraceCheckUtils]: 62: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,177 INFO L273 TraceCheckUtils]: 63: Hoare triple {9661#false} assume !(~j~0 < ~edgecount~0); {9661#false} is VALID [2018-11-23 13:04:48,177 INFO L273 TraceCheckUtils]: 64: Hoare triple {9661#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9661#false} is VALID [2018-11-23 13:04:48,177 INFO L273 TraceCheckUtils]: 65: Hoare triple {9661#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9661#false} is VALID [2018-11-23 13:04:48,178 INFO L273 TraceCheckUtils]: 66: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,178 INFO L273 TraceCheckUtils]: 67: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,178 INFO L273 TraceCheckUtils]: 68: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,178 INFO L273 TraceCheckUtils]: 69: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,178 INFO L273 TraceCheckUtils]: 70: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,178 INFO L273 TraceCheckUtils]: 71: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,178 INFO L273 TraceCheckUtils]: 72: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,178 INFO L273 TraceCheckUtils]: 73: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,179 INFO L273 TraceCheckUtils]: 74: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,179 INFO L273 TraceCheckUtils]: 75: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,179 INFO L273 TraceCheckUtils]: 76: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,179 INFO L273 TraceCheckUtils]: 77: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,179 INFO L273 TraceCheckUtils]: 78: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,179 INFO L273 TraceCheckUtils]: 79: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,179 INFO L273 TraceCheckUtils]: 80: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,180 INFO L273 TraceCheckUtils]: 81: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,180 INFO L273 TraceCheckUtils]: 82: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,180 INFO L273 TraceCheckUtils]: 83: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,180 INFO L273 TraceCheckUtils]: 84: Hoare triple {9661#false} assume !(~j~0 < ~edgecount~0); {9661#false} is VALID [2018-11-23 13:04:48,180 INFO L273 TraceCheckUtils]: 85: Hoare triple {9661#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9661#false} is VALID [2018-11-23 13:04:48,180 INFO L273 TraceCheckUtils]: 86: Hoare triple {9661#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9661#false} is VALID [2018-11-23 13:04:48,181 INFO L273 TraceCheckUtils]: 87: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,181 INFO L273 TraceCheckUtils]: 88: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,181 INFO L273 TraceCheckUtils]: 89: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,181 INFO L273 TraceCheckUtils]: 90: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,181 INFO L273 TraceCheckUtils]: 91: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,181 INFO L273 TraceCheckUtils]: 92: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,182 INFO L273 TraceCheckUtils]: 93: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,182 INFO L273 TraceCheckUtils]: 94: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,182 INFO L273 TraceCheckUtils]: 95: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,182 INFO L273 TraceCheckUtils]: 96: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,182 INFO L273 TraceCheckUtils]: 97: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,182 INFO L273 TraceCheckUtils]: 98: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,183 INFO L273 TraceCheckUtils]: 99: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,183 INFO L273 TraceCheckUtils]: 100: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,183 INFO L273 TraceCheckUtils]: 101: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,183 INFO L273 TraceCheckUtils]: 102: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,183 INFO L273 TraceCheckUtils]: 103: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,183 INFO L273 TraceCheckUtils]: 104: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,184 INFO L273 TraceCheckUtils]: 105: Hoare triple {9661#false} assume !(~j~0 < ~edgecount~0); {9661#false} is VALID [2018-11-23 13:04:48,184 INFO L273 TraceCheckUtils]: 106: Hoare triple {9661#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9661#false} is VALID [2018-11-23 13:04:48,184 INFO L273 TraceCheckUtils]: 107: Hoare triple {9661#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9661#false} is VALID [2018-11-23 13:04:48,184 INFO L273 TraceCheckUtils]: 108: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,184 INFO L273 TraceCheckUtils]: 109: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,184 INFO L273 TraceCheckUtils]: 110: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,185 INFO L273 TraceCheckUtils]: 111: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,185 INFO L273 TraceCheckUtils]: 112: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,185 INFO L273 TraceCheckUtils]: 113: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,185 INFO L273 TraceCheckUtils]: 114: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,185 INFO L273 TraceCheckUtils]: 115: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,185 INFO L273 TraceCheckUtils]: 116: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,185 INFO L273 TraceCheckUtils]: 117: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,186 INFO L273 TraceCheckUtils]: 118: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,186 INFO L273 TraceCheckUtils]: 119: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,186 INFO L273 TraceCheckUtils]: 120: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,186 INFO L273 TraceCheckUtils]: 121: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,186 INFO L273 TraceCheckUtils]: 122: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,186 INFO L273 TraceCheckUtils]: 123: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,187 INFO L273 TraceCheckUtils]: 124: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,187 INFO L273 TraceCheckUtils]: 125: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,187 INFO L273 TraceCheckUtils]: 126: Hoare triple {9661#false} assume !(~j~0 < ~edgecount~0); {9661#false} is VALID [2018-11-23 13:04:48,187 INFO L273 TraceCheckUtils]: 127: Hoare triple {9661#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9661#false} is VALID [2018-11-23 13:04:48,187 INFO L273 TraceCheckUtils]: 128: Hoare triple {9661#false} assume !(~i~0 < ~nodecount~0); {9661#false} is VALID [2018-11-23 13:04:48,187 INFO L273 TraceCheckUtils]: 129: Hoare triple {9661#false} ~i~0 := 0; {9661#false} is VALID [2018-11-23 13:04:48,188 INFO L273 TraceCheckUtils]: 130: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,188 INFO L273 TraceCheckUtils]: 131: Hoare triple {9661#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {9661#false} is VALID [2018-11-23 13:04:48,188 INFO L273 TraceCheckUtils]: 132: Hoare triple {9661#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9661#false} is VALID [2018-11-23 13:04:48,188 INFO L273 TraceCheckUtils]: 133: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,188 INFO L273 TraceCheckUtils]: 134: Hoare triple {9661#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {9661#false} is VALID [2018-11-23 13:04:48,188 INFO L273 TraceCheckUtils]: 135: Hoare triple {9661#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9661#false} is VALID [2018-11-23 13:04:48,188 INFO L273 TraceCheckUtils]: 136: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,189 INFO L273 TraceCheckUtils]: 137: Hoare triple {9661#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {9661#false} is VALID [2018-11-23 13:04:48,189 INFO L273 TraceCheckUtils]: 138: Hoare triple {9661#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9661#false} is VALID [2018-11-23 13:04:48,189 INFO L273 TraceCheckUtils]: 139: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,189 INFO L273 TraceCheckUtils]: 140: Hoare triple {9661#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {9661#false} is VALID [2018-11-23 13:04:48,189 INFO L273 TraceCheckUtils]: 141: Hoare triple {9661#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9661#false} is VALID [2018-11-23 13:04:48,189 INFO L273 TraceCheckUtils]: 142: Hoare triple {9661#false} assume !(~i~0 < ~edgecount~0); {9661#false} is VALID [2018-11-23 13:04:48,190 INFO L273 TraceCheckUtils]: 143: Hoare triple {9661#false} ~i~0 := 0; {9661#false} is VALID [2018-11-23 13:04:48,190 INFO L273 TraceCheckUtils]: 144: Hoare triple {9661#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9661#false} is VALID [2018-11-23 13:04:48,190 INFO L256 TraceCheckUtils]: 145: Hoare triple {9661#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {9661#false} is VALID [2018-11-23 13:04:48,190 INFO L273 TraceCheckUtils]: 146: Hoare triple {9661#false} ~cond := #in~cond; {9661#false} is VALID [2018-11-23 13:04:48,190 INFO L273 TraceCheckUtils]: 147: Hoare triple {9661#false} assume 0 == ~cond; {9661#false} is VALID [2018-11-23 13:04:48,190 INFO L273 TraceCheckUtils]: 148: Hoare triple {9661#false} assume !false; {9661#false} is VALID [2018-11-23 13:04:48,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1547 backedges. 489 proven. 51 refuted. 0 times theorem prover too weak. 1007 trivial. 0 not checked. [2018-11-23 13:04:48,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:48,202 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-23 13:04:48,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:48,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:48,638 INFO L256 TraceCheckUtils]: 0: Hoare triple {9660#true} call ULTIMATE.init(); {9660#true} is VALID [2018-11-23 13:04:48,638 INFO L273 TraceCheckUtils]: 1: Hoare triple {9660#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {9660#true} is VALID [2018-11-23 13:04:48,638 INFO L273 TraceCheckUtils]: 2: Hoare triple {9660#true} assume true; {9660#true} is VALID [2018-11-23 13:04:48,639 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9660#true} {9660#true} #103#return; {9660#true} is VALID [2018-11-23 13:04:48,639 INFO L256 TraceCheckUtils]: 4: Hoare triple {9660#true} call #t~ret18 := main(); {9660#true} is VALID [2018-11-23 13:04:48,642 INFO L273 TraceCheckUtils]: 5: Hoare triple {9660#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,642 INFO L273 TraceCheckUtils]: 6: Hoare triple {9662#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,642 INFO L273 TraceCheckUtils]: 7: Hoare triple {9662#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,643 INFO L273 TraceCheckUtils]: 8: Hoare triple {9662#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,643 INFO L273 TraceCheckUtils]: 9: Hoare triple {9662#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,644 INFO L273 TraceCheckUtils]: 10: Hoare triple {9662#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,644 INFO L273 TraceCheckUtils]: 11: Hoare triple {9662#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,645 INFO L273 TraceCheckUtils]: 12: Hoare triple {9662#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,645 INFO L273 TraceCheckUtils]: 13: Hoare triple {9662#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,646 INFO L273 TraceCheckUtils]: 14: Hoare triple {9662#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,646 INFO L273 TraceCheckUtils]: 15: Hoare triple {9662#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,647 INFO L273 TraceCheckUtils]: 16: Hoare triple {9662#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,647 INFO L273 TraceCheckUtils]: 17: Hoare triple {9662#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,648 INFO L273 TraceCheckUtils]: 18: Hoare triple {9662#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,648 INFO L273 TraceCheckUtils]: 19: Hoare triple {9662#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,649 INFO L273 TraceCheckUtils]: 20: Hoare triple {9662#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,649 INFO L273 TraceCheckUtils]: 21: Hoare triple {9662#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,650 INFO L273 TraceCheckUtils]: 22: Hoare triple {9662#(<= 20 main_~edgecount~0)} ~i~0 := 0; {9662#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:48,651 INFO L273 TraceCheckUtils]: 23: Hoare triple {9662#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9742#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-23 13:04:48,652 INFO L273 TraceCheckUtils]: 24: Hoare triple {9742#(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); {9742#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-23 13:04:48,653 INFO L273 TraceCheckUtils]: 25: Hoare triple {9742#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9742#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-23 13:04:48,654 INFO L273 TraceCheckUtils]: 26: Hoare triple {9742#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9752#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-23 13:04:48,655 INFO L273 TraceCheckUtils]: 27: Hoare triple {9752#(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); {9752#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-23 13:04:48,655 INFO L273 TraceCheckUtils]: 28: Hoare triple {9752#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9752#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-23 13:04:48,656 INFO L273 TraceCheckUtils]: 29: Hoare triple {9752#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9762#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-23 13:04:48,657 INFO L273 TraceCheckUtils]: 30: Hoare triple {9762#(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); {9762#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-23 13:04:48,658 INFO L273 TraceCheckUtils]: 31: Hoare triple {9762#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9762#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-23 13:04:48,659 INFO L273 TraceCheckUtils]: 32: Hoare triple {9762#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9772#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-23 13:04:48,660 INFO L273 TraceCheckUtils]: 33: Hoare triple {9772#(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); {9772#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-23 13:04:48,661 INFO L273 TraceCheckUtils]: 34: Hoare triple {9772#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9772#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-23 13:04:48,662 INFO L273 TraceCheckUtils]: 35: Hoare triple {9772#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9782#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-23 13:04:48,663 INFO L273 TraceCheckUtils]: 36: Hoare triple {9782#(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); {9782#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-23 13:04:48,664 INFO L273 TraceCheckUtils]: 37: Hoare triple {9782#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9782#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-23 13:04:48,665 INFO L273 TraceCheckUtils]: 38: Hoare triple {9782#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9792#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2018-11-23 13:04:48,666 INFO L273 TraceCheckUtils]: 39: Hoare triple {9792#(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); {9792#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2018-11-23 13:04:48,667 INFO L273 TraceCheckUtils]: 40: Hoare triple {9792#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9792#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2018-11-23 13:04:48,668 INFO L273 TraceCheckUtils]: 41: Hoare triple {9792#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9802#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} is VALID [2018-11-23 13:04:48,668 INFO L273 TraceCheckUtils]: 42: Hoare triple {9802#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} assume !(~j~0 < ~edgecount~0); {9661#false} is VALID [2018-11-23 13:04:48,669 INFO L273 TraceCheckUtils]: 43: Hoare triple {9661#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9661#false} is VALID [2018-11-23 13:04:48,669 INFO L273 TraceCheckUtils]: 44: Hoare triple {9661#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9661#false} is VALID [2018-11-23 13:04:48,669 INFO L273 TraceCheckUtils]: 45: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,669 INFO L273 TraceCheckUtils]: 46: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,669 INFO L273 TraceCheckUtils]: 47: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,670 INFO L273 TraceCheckUtils]: 48: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,670 INFO L273 TraceCheckUtils]: 49: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,670 INFO L273 TraceCheckUtils]: 50: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,670 INFO L273 TraceCheckUtils]: 51: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,670 INFO L273 TraceCheckUtils]: 52: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,671 INFO L273 TraceCheckUtils]: 53: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,671 INFO L273 TraceCheckUtils]: 54: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,671 INFO L273 TraceCheckUtils]: 55: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,671 INFO L273 TraceCheckUtils]: 56: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,671 INFO L273 TraceCheckUtils]: 57: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,671 INFO L273 TraceCheckUtils]: 58: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,671 INFO L273 TraceCheckUtils]: 59: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,671 INFO L273 TraceCheckUtils]: 60: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,671 INFO L273 TraceCheckUtils]: 61: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,672 INFO L273 TraceCheckUtils]: 62: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,672 INFO L273 TraceCheckUtils]: 63: Hoare triple {9661#false} assume !(~j~0 < ~edgecount~0); {9661#false} is VALID [2018-11-23 13:04:48,672 INFO L273 TraceCheckUtils]: 64: Hoare triple {9661#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9661#false} is VALID [2018-11-23 13:04:48,672 INFO L273 TraceCheckUtils]: 65: Hoare triple {9661#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9661#false} is VALID [2018-11-23 13:04:48,672 INFO L273 TraceCheckUtils]: 66: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,672 INFO L273 TraceCheckUtils]: 67: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,672 INFO L273 TraceCheckUtils]: 68: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,672 INFO L273 TraceCheckUtils]: 69: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,673 INFO L273 TraceCheckUtils]: 70: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,673 INFO L273 TraceCheckUtils]: 71: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,673 INFO L273 TraceCheckUtils]: 72: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,673 INFO L273 TraceCheckUtils]: 73: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,673 INFO L273 TraceCheckUtils]: 74: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,673 INFO L273 TraceCheckUtils]: 75: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,673 INFO L273 TraceCheckUtils]: 76: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,673 INFO L273 TraceCheckUtils]: 77: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,673 INFO L273 TraceCheckUtils]: 78: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,674 INFO L273 TraceCheckUtils]: 79: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,674 INFO L273 TraceCheckUtils]: 80: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,674 INFO L273 TraceCheckUtils]: 81: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,674 INFO L273 TraceCheckUtils]: 82: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,674 INFO L273 TraceCheckUtils]: 83: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,674 INFO L273 TraceCheckUtils]: 84: Hoare triple {9661#false} assume !(~j~0 < ~edgecount~0); {9661#false} is VALID [2018-11-23 13:04:48,674 INFO L273 TraceCheckUtils]: 85: Hoare triple {9661#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9661#false} is VALID [2018-11-23 13:04:48,674 INFO L273 TraceCheckUtils]: 86: Hoare triple {9661#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9661#false} is VALID [2018-11-23 13:04:48,675 INFO L273 TraceCheckUtils]: 87: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,675 INFO L273 TraceCheckUtils]: 88: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,675 INFO L273 TraceCheckUtils]: 89: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,675 INFO L273 TraceCheckUtils]: 90: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,675 INFO L273 TraceCheckUtils]: 91: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,675 INFO L273 TraceCheckUtils]: 92: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,675 INFO L273 TraceCheckUtils]: 93: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,675 INFO L273 TraceCheckUtils]: 94: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,675 INFO L273 TraceCheckUtils]: 95: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,676 INFO L273 TraceCheckUtils]: 96: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,676 INFO L273 TraceCheckUtils]: 97: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,676 INFO L273 TraceCheckUtils]: 98: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,676 INFO L273 TraceCheckUtils]: 99: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,676 INFO L273 TraceCheckUtils]: 100: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,676 INFO L273 TraceCheckUtils]: 101: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,676 INFO L273 TraceCheckUtils]: 102: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,676 INFO L273 TraceCheckUtils]: 103: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,677 INFO L273 TraceCheckUtils]: 104: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,677 INFO L273 TraceCheckUtils]: 105: Hoare triple {9661#false} assume !(~j~0 < ~edgecount~0); {9661#false} is VALID [2018-11-23 13:04:48,677 INFO L273 TraceCheckUtils]: 106: Hoare triple {9661#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9661#false} is VALID [2018-11-23 13:04:48,677 INFO L273 TraceCheckUtils]: 107: Hoare triple {9661#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9661#false} is VALID [2018-11-23 13:04:48,677 INFO L273 TraceCheckUtils]: 108: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,677 INFO L273 TraceCheckUtils]: 109: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,677 INFO L273 TraceCheckUtils]: 110: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,677 INFO L273 TraceCheckUtils]: 111: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,677 INFO L273 TraceCheckUtils]: 112: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,678 INFO L273 TraceCheckUtils]: 113: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,678 INFO L273 TraceCheckUtils]: 114: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,678 INFO L273 TraceCheckUtils]: 115: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,678 INFO L273 TraceCheckUtils]: 116: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,678 INFO L273 TraceCheckUtils]: 117: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,678 INFO L273 TraceCheckUtils]: 118: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,678 INFO L273 TraceCheckUtils]: 119: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,678 INFO L273 TraceCheckUtils]: 120: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,678 INFO L273 TraceCheckUtils]: 121: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,679 INFO L273 TraceCheckUtils]: 122: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,679 INFO L273 TraceCheckUtils]: 123: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,679 INFO L273 TraceCheckUtils]: 124: Hoare triple {9661#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {9661#false} is VALID [2018-11-23 13:04:48,679 INFO L273 TraceCheckUtils]: 125: Hoare triple {9661#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {9661#false} is VALID [2018-11-23 13:04:48,679 INFO L273 TraceCheckUtils]: 126: Hoare triple {9661#false} assume !(~j~0 < ~edgecount~0); {9661#false} is VALID [2018-11-23 13:04:48,679 INFO L273 TraceCheckUtils]: 127: Hoare triple {9661#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9661#false} is VALID [2018-11-23 13:04:48,679 INFO L273 TraceCheckUtils]: 128: Hoare triple {9661#false} assume !(~i~0 < ~nodecount~0); {9661#false} is VALID [2018-11-23 13:04:48,679 INFO L273 TraceCheckUtils]: 129: Hoare triple {9661#false} ~i~0 := 0; {9661#false} is VALID [2018-11-23 13:04:48,680 INFO L273 TraceCheckUtils]: 130: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,680 INFO L273 TraceCheckUtils]: 131: Hoare triple {9661#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {9661#false} is VALID [2018-11-23 13:04:48,680 INFO L273 TraceCheckUtils]: 132: Hoare triple {9661#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9661#false} is VALID [2018-11-23 13:04:48,680 INFO L273 TraceCheckUtils]: 133: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,680 INFO L273 TraceCheckUtils]: 134: Hoare triple {9661#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {9661#false} is VALID [2018-11-23 13:04:48,680 INFO L273 TraceCheckUtils]: 135: Hoare triple {9661#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9661#false} is VALID [2018-11-23 13:04:48,680 INFO L273 TraceCheckUtils]: 136: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,680 INFO L273 TraceCheckUtils]: 137: Hoare triple {9661#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {9661#false} is VALID [2018-11-23 13:04:48,680 INFO L273 TraceCheckUtils]: 138: Hoare triple {9661#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9661#false} is VALID [2018-11-23 13:04:48,681 INFO L273 TraceCheckUtils]: 139: Hoare triple {9661#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); {9661#false} is VALID [2018-11-23 13:04:48,681 INFO L273 TraceCheckUtils]: 140: Hoare triple {9661#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {9661#false} is VALID [2018-11-23 13:04:48,681 INFO L273 TraceCheckUtils]: 141: Hoare triple {9661#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {9661#false} is VALID [2018-11-23 13:04:48,681 INFO L273 TraceCheckUtils]: 142: Hoare triple {9661#false} assume !(~i~0 < ~edgecount~0); {9661#false} is VALID [2018-11-23 13:04:48,681 INFO L273 TraceCheckUtils]: 143: Hoare triple {9661#false} ~i~0 := 0; {9661#false} is VALID [2018-11-23 13:04:48,681 INFO L273 TraceCheckUtils]: 144: Hoare triple {9661#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9661#false} is VALID [2018-11-23 13:04:48,681 INFO L256 TraceCheckUtils]: 145: Hoare triple {9661#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {9661#false} is VALID [2018-11-23 13:04:48,681 INFO L273 TraceCheckUtils]: 146: Hoare triple {9661#false} ~cond := #in~cond; {9661#false} is VALID [2018-11-23 13:04:48,681 INFO L273 TraceCheckUtils]: 147: Hoare triple {9661#false} assume 0 == ~cond; {9661#false} is VALID [2018-11-23 13:04:48,682 INFO L273 TraceCheckUtils]: 148: Hoare triple {9661#false} assume !false; {9661#false} is VALID [2018-11-23 13:04:48,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1547 backedges. 489 proven. 51 refuted. 0 times theorem prover too weak. 1007 trivial. 0 not checked. [2018-11-23 13:04:48,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:48,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-11-23 13:04:48,716 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 149 [2018-11-23 13:04:48,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:48,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 13:04:48,813 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:48,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 13:04:48,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:04:48,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:04:48,815 INFO L87 Difference]: Start difference. First operand 154 states and 192 transitions. Second operand 17 states. [2018-11-23 13:04:49,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:49,672 INFO L93 Difference]: Finished difference Result 290 states and 373 transitions. [2018-11-23 13:04:49,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:04:49,672 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 149 [2018-11-23 13:04:49,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:49,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:04:49,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 89 transitions. [2018-11-23 13:04:49,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:04:49,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 89 transitions. [2018-11-23 13:04:49,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 89 transitions. [2018-11-23 13:04:49,854 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:49,858 INFO L225 Difference]: With dead ends: 290 [2018-11-23 13:04:49,858 INFO L226 Difference]: Without dead ends: 179 [2018-11-23 13:04:49,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:04:49,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-23 13:04:50,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 169. [2018-11-23 13:04:50,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:50,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand 169 states. [2018-11-23 13:04:50,413 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand 169 states. [2018-11-23 13:04:50,413 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 169 states. [2018-11-23 13:04:50,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:50,417 INFO L93 Difference]: Finished difference Result 179 states and 227 transitions. [2018-11-23 13:04:50,417 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 227 transitions. [2018-11-23 13:04:50,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:50,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:50,418 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand 179 states. [2018-11-23 13:04:50,418 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 179 states. [2018-11-23 13:04:50,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:50,422 INFO L93 Difference]: Finished difference Result 179 states and 227 transitions. [2018-11-23 13:04:50,422 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 227 transitions. [2018-11-23 13:04:50,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:50,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:50,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:50,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:50,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-11-23 13:04:50,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 212 transitions. [2018-11-23 13:04:50,426 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 212 transitions. Word has length 149 [2018-11-23 13:04:50,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:50,427 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 212 transitions. [2018-11-23 13:04:50,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 13:04:50,427 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 212 transitions. [2018-11-23 13:04:50,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-23 13:04:50,428 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:50,428 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 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] [2018-11-23 13:04:50,429 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:50,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:50,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1405394078, now seen corresponding path program 8 times [2018-11-23 13:04:50,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:50,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:50,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:50,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:50,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:51,096 INFO L256 TraceCheckUtils]: 0: Hoare triple {11109#true} call ULTIMATE.init(); {11109#true} is VALID [2018-11-23 13:04:51,096 INFO L273 TraceCheckUtils]: 1: Hoare triple {11109#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {11109#true} is VALID [2018-11-23 13:04:51,097 INFO L273 TraceCheckUtils]: 2: Hoare triple {11109#true} assume true; {11109#true} is VALID [2018-11-23 13:04:51,097 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11109#true} {11109#true} #103#return; {11109#true} is VALID [2018-11-23 13:04:51,097 INFO L256 TraceCheckUtils]: 4: Hoare triple {11109#true} call #t~ret18 := main(); {11109#true} is VALID [2018-11-23 13:04:51,101 INFO L273 TraceCheckUtils]: 5: Hoare triple {11109#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,101 INFO L273 TraceCheckUtils]: 6: Hoare triple {11111#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,102 INFO L273 TraceCheckUtils]: 7: Hoare triple {11111#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,102 INFO L273 TraceCheckUtils]: 8: Hoare triple {11111#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,103 INFO L273 TraceCheckUtils]: 9: Hoare triple {11111#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,103 INFO L273 TraceCheckUtils]: 10: Hoare triple {11111#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,104 INFO L273 TraceCheckUtils]: 11: Hoare triple {11111#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,104 INFO L273 TraceCheckUtils]: 12: Hoare triple {11111#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,105 INFO L273 TraceCheckUtils]: 13: Hoare triple {11111#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,105 INFO L273 TraceCheckUtils]: 14: Hoare triple {11111#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,106 INFO L273 TraceCheckUtils]: 15: Hoare triple {11111#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,106 INFO L273 TraceCheckUtils]: 16: Hoare triple {11111#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,107 INFO L273 TraceCheckUtils]: 17: Hoare triple {11111#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,107 INFO L273 TraceCheckUtils]: 18: Hoare triple {11111#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,108 INFO L273 TraceCheckUtils]: 19: Hoare triple {11111#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,109 INFO L273 TraceCheckUtils]: 20: Hoare triple {11111#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,109 INFO L273 TraceCheckUtils]: 21: Hoare triple {11111#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,110 INFO L273 TraceCheckUtils]: 22: Hoare triple {11111#(<= 20 main_~edgecount~0)} ~i~0 := 0; {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,110 INFO L273 TraceCheckUtils]: 23: Hoare triple {11111#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11112#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} is VALID [2018-11-23 13:04:51,111 INFO L273 TraceCheckUtils]: 24: Hoare triple {11112#(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); {11112#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} is VALID [2018-11-23 13:04:51,112 INFO L273 TraceCheckUtils]: 25: Hoare triple {11112#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11112#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} is VALID [2018-11-23 13:04:51,113 INFO L273 TraceCheckUtils]: 26: Hoare triple {11112#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11113#(<= (+ main_~j~0 19) main_~edgecount~0)} is VALID [2018-11-23 13:04:51,113 INFO L273 TraceCheckUtils]: 27: Hoare triple {11113#(<= (+ main_~j~0 19) 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); {11113#(<= (+ main_~j~0 19) main_~edgecount~0)} is VALID [2018-11-23 13:04:51,114 INFO L273 TraceCheckUtils]: 28: Hoare triple {11113#(<= (+ main_~j~0 19) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11113#(<= (+ main_~j~0 19) main_~edgecount~0)} is VALID [2018-11-23 13:04:51,115 INFO L273 TraceCheckUtils]: 29: Hoare triple {11113#(<= (+ main_~j~0 19) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11114#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2018-11-23 13:04:51,115 INFO L273 TraceCheckUtils]: 30: Hoare triple {11114#(<= (+ main_~j~0 18) 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); {11114#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2018-11-23 13:04:51,116 INFO L273 TraceCheckUtils]: 31: Hoare triple {11114#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11114#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2018-11-23 13:04:51,117 INFO L273 TraceCheckUtils]: 32: Hoare triple {11114#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11115#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2018-11-23 13:04:51,117 INFO L273 TraceCheckUtils]: 33: Hoare triple {11115#(<= (+ main_~j~0 17) 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); {11115#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2018-11-23 13:04:51,118 INFO L273 TraceCheckUtils]: 34: Hoare triple {11115#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11115#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2018-11-23 13:04:51,118 INFO L273 TraceCheckUtils]: 35: Hoare triple {11115#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11116#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2018-11-23 13:04:51,119 INFO L273 TraceCheckUtils]: 36: Hoare triple {11116#(<= (+ main_~j~0 16) 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); {11116#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2018-11-23 13:04:51,120 INFO L273 TraceCheckUtils]: 37: Hoare triple {11116#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11116#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2018-11-23 13:04:51,120 INFO L273 TraceCheckUtils]: 38: Hoare triple {11116#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11117#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2018-11-23 13:04:51,121 INFO L273 TraceCheckUtils]: 39: Hoare triple {11117#(<= (+ main_~j~0 15) 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); {11117#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2018-11-23 13:04:51,121 INFO L273 TraceCheckUtils]: 40: Hoare triple {11117#(<= (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11117#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2018-11-23 13:04:51,122 INFO L273 TraceCheckUtils]: 41: Hoare triple {11117#(<= (+ main_~j~0 15) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11118#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2018-11-23 13:04:51,123 INFO L273 TraceCheckUtils]: 42: Hoare triple {11118#(<= (+ main_~j~0 14) 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); {11118#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2018-11-23 13:04:51,123 INFO L273 TraceCheckUtils]: 43: Hoare triple {11118#(<= (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11118#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2018-11-23 13:04:51,124 INFO L273 TraceCheckUtils]: 44: Hoare triple {11118#(<= (+ main_~j~0 14) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11119#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2018-11-23 13:04:51,125 INFO L273 TraceCheckUtils]: 45: Hoare triple {11119#(<= (+ main_~j~0 13) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {11110#false} is VALID [2018-11-23 13:04:51,125 INFO L273 TraceCheckUtils]: 46: Hoare triple {11110#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11110#false} is VALID [2018-11-23 13:04:51,125 INFO L273 TraceCheckUtils]: 47: Hoare triple {11110#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11110#false} is VALID [2018-11-23 13:04:51,125 INFO L273 TraceCheckUtils]: 48: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,126 INFO L273 TraceCheckUtils]: 49: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,126 INFO L273 TraceCheckUtils]: 50: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,126 INFO L273 TraceCheckUtils]: 51: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,126 INFO L273 TraceCheckUtils]: 52: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,126 INFO L273 TraceCheckUtils]: 53: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,127 INFO L273 TraceCheckUtils]: 54: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,127 INFO L273 TraceCheckUtils]: 55: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,127 INFO L273 TraceCheckUtils]: 56: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,127 INFO L273 TraceCheckUtils]: 57: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,127 INFO L273 TraceCheckUtils]: 58: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,128 INFO L273 TraceCheckUtils]: 59: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,128 INFO L273 TraceCheckUtils]: 60: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,128 INFO L273 TraceCheckUtils]: 61: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,128 INFO L273 TraceCheckUtils]: 62: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,128 INFO L273 TraceCheckUtils]: 63: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,128 INFO L273 TraceCheckUtils]: 64: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,128 INFO L273 TraceCheckUtils]: 65: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,128 INFO L273 TraceCheckUtils]: 66: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,128 INFO L273 TraceCheckUtils]: 67: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,129 INFO L273 TraceCheckUtils]: 68: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,129 INFO L273 TraceCheckUtils]: 69: Hoare triple {11110#false} assume !(~j~0 < ~edgecount~0); {11110#false} is VALID [2018-11-23 13:04:51,129 INFO L273 TraceCheckUtils]: 70: Hoare triple {11110#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11110#false} is VALID [2018-11-23 13:04:51,129 INFO L273 TraceCheckUtils]: 71: Hoare triple {11110#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11110#false} is VALID [2018-11-23 13:04:51,129 INFO L273 TraceCheckUtils]: 72: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,129 INFO L273 TraceCheckUtils]: 73: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,129 INFO L273 TraceCheckUtils]: 74: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,129 INFO L273 TraceCheckUtils]: 75: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,130 INFO L273 TraceCheckUtils]: 76: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,130 INFO L273 TraceCheckUtils]: 77: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,130 INFO L273 TraceCheckUtils]: 78: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,130 INFO L273 TraceCheckUtils]: 79: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,130 INFO L273 TraceCheckUtils]: 80: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,130 INFO L273 TraceCheckUtils]: 81: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,131 INFO L273 TraceCheckUtils]: 82: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,131 INFO L273 TraceCheckUtils]: 83: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,131 INFO L273 TraceCheckUtils]: 84: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,131 INFO L273 TraceCheckUtils]: 85: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,131 INFO L273 TraceCheckUtils]: 86: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,131 INFO L273 TraceCheckUtils]: 87: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,131 INFO L273 TraceCheckUtils]: 88: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,131 INFO L273 TraceCheckUtils]: 89: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,132 INFO L273 TraceCheckUtils]: 90: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,132 INFO L273 TraceCheckUtils]: 91: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,132 INFO L273 TraceCheckUtils]: 92: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,132 INFO L273 TraceCheckUtils]: 93: Hoare triple {11110#false} assume !(~j~0 < ~edgecount~0); {11110#false} is VALID [2018-11-23 13:04:51,132 INFO L273 TraceCheckUtils]: 94: Hoare triple {11110#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11110#false} is VALID [2018-11-23 13:04:51,132 INFO L273 TraceCheckUtils]: 95: Hoare triple {11110#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11110#false} is VALID [2018-11-23 13:04:51,132 INFO L273 TraceCheckUtils]: 96: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,132 INFO L273 TraceCheckUtils]: 97: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,132 INFO L273 TraceCheckUtils]: 98: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,133 INFO L273 TraceCheckUtils]: 99: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,133 INFO L273 TraceCheckUtils]: 100: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,133 INFO L273 TraceCheckUtils]: 101: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,133 INFO L273 TraceCheckUtils]: 102: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,133 INFO L273 TraceCheckUtils]: 103: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,133 INFO L273 TraceCheckUtils]: 104: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,133 INFO L273 TraceCheckUtils]: 105: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,133 INFO L273 TraceCheckUtils]: 106: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,133 INFO L273 TraceCheckUtils]: 107: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,134 INFO L273 TraceCheckUtils]: 108: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,134 INFO L273 TraceCheckUtils]: 109: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,134 INFO L273 TraceCheckUtils]: 110: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,134 INFO L273 TraceCheckUtils]: 111: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,134 INFO L273 TraceCheckUtils]: 112: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,134 INFO L273 TraceCheckUtils]: 113: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,134 INFO L273 TraceCheckUtils]: 114: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,134 INFO L273 TraceCheckUtils]: 115: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,135 INFO L273 TraceCheckUtils]: 116: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,135 INFO L273 TraceCheckUtils]: 117: Hoare triple {11110#false} assume !(~j~0 < ~edgecount~0); {11110#false} is VALID [2018-11-23 13:04:51,135 INFO L273 TraceCheckUtils]: 118: Hoare triple {11110#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11110#false} is VALID [2018-11-23 13:04:51,135 INFO L273 TraceCheckUtils]: 119: Hoare triple {11110#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11110#false} is VALID [2018-11-23 13:04:51,135 INFO L273 TraceCheckUtils]: 120: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,135 INFO L273 TraceCheckUtils]: 121: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,135 INFO L273 TraceCheckUtils]: 122: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,135 INFO L273 TraceCheckUtils]: 123: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,135 INFO L273 TraceCheckUtils]: 124: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,136 INFO L273 TraceCheckUtils]: 125: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,136 INFO L273 TraceCheckUtils]: 126: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,136 INFO L273 TraceCheckUtils]: 127: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,136 INFO L273 TraceCheckUtils]: 128: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,136 INFO L273 TraceCheckUtils]: 129: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,136 INFO L273 TraceCheckUtils]: 130: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,136 INFO L273 TraceCheckUtils]: 131: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,136 INFO L273 TraceCheckUtils]: 132: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,136 INFO L273 TraceCheckUtils]: 133: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,137 INFO L273 TraceCheckUtils]: 134: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,137 INFO L273 TraceCheckUtils]: 135: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,137 INFO L273 TraceCheckUtils]: 136: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,137 INFO L273 TraceCheckUtils]: 137: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,137 INFO L273 TraceCheckUtils]: 138: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,137 INFO L273 TraceCheckUtils]: 139: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,137 INFO L273 TraceCheckUtils]: 140: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,137 INFO L273 TraceCheckUtils]: 141: Hoare triple {11110#false} assume !(~j~0 < ~edgecount~0); {11110#false} is VALID [2018-11-23 13:04:51,138 INFO L273 TraceCheckUtils]: 142: Hoare triple {11110#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11110#false} is VALID [2018-11-23 13:04:51,138 INFO L273 TraceCheckUtils]: 143: Hoare triple {11110#false} assume !(~i~0 < ~nodecount~0); {11110#false} is VALID [2018-11-23 13:04:51,138 INFO L273 TraceCheckUtils]: 144: Hoare triple {11110#false} ~i~0 := 0; {11110#false} is VALID [2018-11-23 13:04:51,138 INFO L273 TraceCheckUtils]: 145: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,138 INFO L273 TraceCheckUtils]: 146: Hoare triple {11110#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {11110#false} is VALID [2018-11-23 13:04:51,138 INFO L273 TraceCheckUtils]: 147: Hoare triple {11110#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11110#false} is VALID [2018-11-23 13:04:51,138 INFO L273 TraceCheckUtils]: 148: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,138 INFO L273 TraceCheckUtils]: 149: Hoare triple {11110#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {11110#false} is VALID [2018-11-23 13:04:51,138 INFO L273 TraceCheckUtils]: 150: Hoare triple {11110#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11110#false} is VALID [2018-11-23 13:04:51,139 INFO L273 TraceCheckUtils]: 151: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,139 INFO L273 TraceCheckUtils]: 152: Hoare triple {11110#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {11110#false} is VALID [2018-11-23 13:04:51,139 INFO L273 TraceCheckUtils]: 153: Hoare triple {11110#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11110#false} is VALID [2018-11-23 13:04:51,139 INFO L273 TraceCheckUtils]: 154: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,139 INFO L273 TraceCheckUtils]: 155: Hoare triple {11110#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {11110#false} is VALID [2018-11-23 13:04:51,139 INFO L273 TraceCheckUtils]: 156: Hoare triple {11110#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11110#false} is VALID [2018-11-23 13:04:51,139 INFO L273 TraceCheckUtils]: 157: Hoare triple {11110#false} assume !(~i~0 < ~edgecount~0); {11110#false} is VALID [2018-11-23 13:04:51,139 INFO L273 TraceCheckUtils]: 158: Hoare triple {11110#false} ~i~0 := 0; {11110#false} is VALID [2018-11-23 13:04:51,139 INFO L273 TraceCheckUtils]: 159: Hoare triple {11110#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11110#false} is VALID [2018-11-23 13:04:51,140 INFO L256 TraceCheckUtils]: 160: Hoare triple {11110#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {11110#false} is VALID [2018-11-23 13:04:51,140 INFO L273 TraceCheckUtils]: 161: Hoare triple {11110#false} ~cond := #in~cond; {11110#false} is VALID [2018-11-23 13:04:51,140 INFO L273 TraceCheckUtils]: 162: Hoare triple {11110#false} assume 0 == ~cond; {11110#false} is VALID [2018-11-23 13:04:51,140 INFO L273 TraceCheckUtils]: 163: Hoare triple {11110#false} assume !false; {11110#false} is VALID [2018-11-23 13:04:51,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2052 backedges. 653 proven. 70 refuted. 0 times theorem prover too weak. 1329 trivial. 0 not checked. [2018-11-23 13:04:51,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:51,162 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-23 13:04:51,172 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:04:51,342 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:04:51,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:51,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:51,768 INFO L256 TraceCheckUtils]: 0: Hoare triple {11109#true} call ULTIMATE.init(); {11109#true} is VALID [2018-11-23 13:04:51,769 INFO L273 TraceCheckUtils]: 1: Hoare triple {11109#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {11109#true} is VALID [2018-11-23 13:04:51,769 INFO L273 TraceCheckUtils]: 2: Hoare triple {11109#true} assume true; {11109#true} is VALID [2018-11-23 13:04:51,769 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11109#true} {11109#true} #103#return; {11109#true} is VALID [2018-11-23 13:04:51,769 INFO L256 TraceCheckUtils]: 4: Hoare triple {11109#true} call #t~ret18 := main(); {11109#true} is VALID [2018-11-23 13:04:51,772 INFO L273 TraceCheckUtils]: 5: Hoare triple {11109#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,772 INFO L273 TraceCheckUtils]: 6: Hoare triple {11111#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,773 INFO L273 TraceCheckUtils]: 7: Hoare triple {11111#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,773 INFO L273 TraceCheckUtils]: 8: Hoare triple {11111#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,774 INFO L273 TraceCheckUtils]: 9: Hoare triple {11111#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,774 INFO L273 TraceCheckUtils]: 10: Hoare triple {11111#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,775 INFO L273 TraceCheckUtils]: 11: Hoare triple {11111#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,775 INFO L273 TraceCheckUtils]: 12: Hoare triple {11111#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,776 INFO L273 TraceCheckUtils]: 13: Hoare triple {11111#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,776 INFO L273 TraceCheckUtils]: 14: Hoare triple {11111#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,777 INFO L273 TraceCheckUtils]: 15: Hoare triple {11111#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,777 INFO L273 TraceCheckUtils]: 16: Hoare triple {11111#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,778 INFO L273 TraceCheckUtils]: 17: Hoare triple {11111#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,779 INFO L273 TraceCheckUtils]: 18: Hoare triple {11111#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,779 INFO L273 TraceCheckUtils]: 19: Hoare triple {11111#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,780 INFO L273 TraceCheckUtils]: 20: Hoare triple {11111#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,780 INFO L273 TraceCheckUtils]: 21: Hoare triple {11111#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,781 INFO L273 TraceCheckUtils]: 22: Hoare triple {11111#(<= 20 main_~edgecount~0)} ~i~0 := 0; {11111#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:51,781 INFO L273 TraceCheckUtils]: 23: Hoare triple {11111#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11192#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-23 13:04:51,782 INFO L273 TraceCheckUtils]: 24: Hoare triple {11192#(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); {11192#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-23 13:04:51,783 INFO L273 TraceCheckUtils]: 25: Hoare triple {11192#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11192#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2018-11-23 13:04:51,784 INFO L273 TraceCheckUtils]: 26: Hoare triple {11192#(and (<= 20 main_~edgecount~0) (<= main_~j~0 0))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11202#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-23 13:04:51,785 INFO L273 TraceCheckUtils]: 27: Hoare triple {11202#(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); {11202#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-23 13:04:51,786 INFO L273 TraceCheckUtils]: 28: Hoare triple {11202#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11202#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2018-11-23 13:04:51,787 INFO L273 TraceCheckUtils]: 29: Hoare triple {11202#(and (<= 20 main_~edgecount~0) (<= main_~j~0 1))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11212#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-23 13:04:51,788 INFO L273 TraceCheckUtils]: 30: Hoare triple {11212#(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); {11212#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-23 13:04:51,789 INFO L273 TraceCheckUtils]: 31: Hoare triple {11212#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11212#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} is VALID [2018-11-23 13:04:51,790 INFO L273 TraceCheckUtils]: 32: Hoare triple {11212#(and (<= 20 main_~edgecount~0) (<= main_~j~0 2))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11222#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-23 13:04:51,791 INFO L273 TraceCheckUtils]: 33: Hoare triple {11222#(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); {11222#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-23 13:04:51,791 INFO L273 TraceCheckUtils]: 34: Hoare triple {11222#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11222#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} is VALID [2018-11-23 13:04:51,792 INFO L273 TraceCheckUtils]: 35: Hoare triple {11222#(and (<= 20 main_~edgecount~0) (<= main_~j~0 3))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11232#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-23 13:04:51,793 INFO L273 TraceCheckUtils]: 36: Hoare triple {11232#(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); {11232#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-23 13:04:51,794 INFO L273 TraceCheckUtils]: 37: Hoare triple {11232#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11232#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} is VALID [2018-11-23 13:04:51,795 INFO L273 TraceCheckUtils]: 38: Hoare triple {11232#(and (<= 20 main_~edgecount~0) (<= main_~j~0 4))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11242#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2018-11-23 13:04:51,796 INFO L273 TraceCheckUtils]: 39: Hoare triple {11242#(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); {11242#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2018-11-23 13:04:51,797 INFO L273 TraceCheckUtils]: 40: Hoare triple {11242#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11242#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} is VALID [2018-11-23 13:04:51,798 INFO L273 TraceCheckUtils]: 41: Hoare triple {11242#(and (<= 20 main_~edgecount~0) (<= main_~j~0 5))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11252#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} is VALID [2018-11-23 13:04:51,799 INFO L273 TraceCheckUtils]: 42: Hoare triple {11252#(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); {11252#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} is VALID [2018-11-23 13:04:51,800 INFO L273 TraceCheckUtils]: 43: Hoare triple {11252#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11252#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} is VALID [2018-11-23 13:04:51,800 INFO L273 TraceCheckUtils]: 44: Hoare triple {11252#(and (<= 20 main_~edgecount~0) (<= main_~j~0 6))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11262#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} is VALID [2018-11-23 13:04:51,801 INFO L273 TraceCheckUtils]: 45: Hoare triple {11262#(and (<= 20 main_~edgecount~0) (<= main_~j~0 7))} assume !(~j~0 < ~edgecount~0); {11110#false} is VALID [2018-11-23 13:04:51,801 INFO L273 TraceCheckUtils]: 46: Hoare triple {11110#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11110#false} is VALID [2018-11-23 13:04:51,802 INFO L273 TraceCheckUtils]: 47: Hoare triple {11110#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11110#false} is VALID [2018-11-23 13:04:51,802 INFO L273 TraceCheckUtils]: 48: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,802 INFO L273 TraceCheckUtils]: 49: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,802 INFO L273 TraceCheckUtils]: 50: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,803 INFO L273 TraceCheckUtils]: 51: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,803 INFO L273 TraceCheckUtils]: 52: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,803 INFO L273 TraceCheckUtils]: 53: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,803 INFO L273 TraceCheckUtils]: 54: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,803 INFO L273 TraceCheckUtils]: 55: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,804 INFO L273 TraceCheckUtils]: 56: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,804 INFO L273 TraceCheckUtils]: 57: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,804 INFO L273 TraceCheckUtils]: 58: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,804 INFO L273 TraceCheckUtils]: 59: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,804 INFO L273 TraceCheckUtils]: 60: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,804 INFO L273 TraceCheckUtils]: 61: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,804 INFO L273 TraceCheckUtils]: 62: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,804 INFO L273 TraceCheckUtils]: 63: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,804 INFO L273 TraceCheckUtils]: 64: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,805 INFO L273 TraceCheckUtils]: 65: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,805 INFO L273 TraceCheckUtils]: 66: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,805 INFO L273 TraceCheckUtils]: 67: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,805 INFO L273 TraceCheckUtils]: 68: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,805 INFO L273 TraceCheckUtils]: 69: Hoare triple {11110#false} assume !(~j~0 < ~edgecount~0); {11110#false} is VALID [2018-11-23 13:04:51,805 INFO L273 TraceCheckUtils]: 70: Hoare triple {11110#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11110#false} is VALID [2018-11-23 13:04:51,805 INFO L273 TraceCheckUtils]: 71: Hoare triple {11110#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11110#false} is VALID [2018-11-23 13:04:51,805 INFO L273 TraceCheckUtils]: 72: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,806 INFO L273 TraceCheckUtils]: 73: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,806 INFO L273 TraceCheckUtils]: 74: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,806 INFO L273 TraceCheckUtils]: 75: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,806 INFO L273 TraceCheckUtils]: 76: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,806 INFO L273 TraceCheckUtils]: 77: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,806 INFO L273 TraceCheckUtils]: 78: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,806 INFO L273 TraceCheckUtils]: 79: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,806 INFO L273 TraceCheckUtils]: 80: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,806 INFO L273 TraceCheckUtils]: 81: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,807 INFO L273 TraceCheckUtils]: 82: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,807 INFO L273 TraceCheckUtils]: 83: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,807 INFO L273 TraceCheckUtils]: 84: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,807 INFO L273 TraceCheckUtils]: 85: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,807 INFO L273 TraceCheckUtils]: 86: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,807 INFO L273 TraceCheckUtils]: 87: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,807 INFO L273 TraceCheckUtils]: 88: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,807 INFO L273 TraceCheckUtils]: 89: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,807 INFO L273 TraceCheckUtils]: 90: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,808 INFO L273 TraceCheckUtils]: 91: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,808 INFO L273 TraceCheckUtils]: 92: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,808 INFO L273 TraceCheckUtils]: 93: Hoare triple {11110#false} assume !(~j~0 < ~edgecount~0); {11110#false} is VALID [2018-11-23 13:04:51,808 INFO L273 TraceCheckUtils]: 94: Hoare triple {11110#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11110#false} is VALID [2018-11-23 13:04:51,808 INFO L273 TraceCheckUtils]: 95: Hoare triple {11110#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11110#false} is VALID [2018-11-23 13:04:51,808 INFO L273 TraceCheckUtils]: 96: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,808 INFO L273 TraceCheckUtils]: 97: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,808 INFO L273 TraceCheckUtils]: 98: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,809 INFO L273 TraceCheckUtils]: 99: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,809 INFO L273 TraceCheckUtils]: 100: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,809 INFO L273 TraceCheckUtils]: 101: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,809 INFO L273 TraceCheckUtils]: 102: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,809 INFO L273 TraceCheckUtils]: 103: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,809 INFO L273 TraceCheckUtils]: 104: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,809 INFO L273 TraceCheckUtils]: 105: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,809 INFO L273 TraceCheckUtils]: 106: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,810 INFO L273 TraceCheckUtils]: 107: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,810 INFO L273 TraceCheckUtils]: 108: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,810 INFO L273 TraceCheckUtils]: 109: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,810 INFO L273 TraceCheckUtils]: 110: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,810 INFO L273 TraceCheckUtils]: 111: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,810 INFO L273 TraceCheckUtils]: 112: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,810 INFO L273 TraceCheckUtils]: 113: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,810 INFO L273 TraceCheckUtils]: 114: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,810 INFO L273 TraceCheckUtils]: 115: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,811 INFO L273 TraceCheckUtils]: 116: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,811 INFO L273 TraceCheckUtils]: 117: Hoare triple {11110#false} assume !(~j~0 < ~edgecount~0); {11110#false} is VALID [2018-11-23 13:04:51,811 INFO L273 TraceCheckUtils]: 118: Hoare triple {11110#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11110#false} is VALID [2018-11-23 13:04:51,811 INFO L273 TraceCheckUtils]: 119: Hoare triple {11110#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11110#false} is VALID [2018-11-23 13:04:51,811 INFO L273 TraceCheckUtils]: 120: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,811 INFO L273 TraceCheckUtils]: 121: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,811 INFO L273 TraceCheckUtils]: 122: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,811 INFO L273 TraceCheckUtils]: 123: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,811 INFO L273 TraceCheckUtils]: 124: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,812 INFO L273 TraceCheckUtils]: 125: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,812 INFO L273 TraceCheckUtils]: 126: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,812 INFO L273 TraceCheckUtils]: 127: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,812 INFO L273 TraceCheckUtils]: 128: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,812 INFO L273 TraceCheckUtils]: 129: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,812 INFO L273 TraceCheckUtils]: 130: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,812 INFO L273 TraceCheckUtils]: 131: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,812 INFO L273 TraceCheckUtils]: 132: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,813 INFO L273 TraceCheckUtils]: 133: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,813 INFO L273 TraceCheckUtils]: 134: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,813 INFO L273 TraceCheckUtils]: 135: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,813 INFO L273 TraceCheckUtils]: 136: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,813 INFO L273 TraceCheckUtils]: 137: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,813 INFO L273 TraceCheckUtils]: 138: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,813 INFO L273 TraceCheckUtils]: 139: Hoare triple {11110#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {11110#false} is VALID [2018-11-23 13:04:51,813 INFO L273 TraceCheckUtils]: 140: Hoare triple {11110#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {11110#false} is VALID [2018-11-23 13:04:51,813 INFO L273 TraceCheckUtils]: 141: Hoare triple {11110#false} assume !(~j~0 < ~edgecount~0); {11110#false} is VALID [2018-11-23 13:04:51,814 INFO L273 TraceCheckUtils]: 142: Hoare triple {11110#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11110#false} is VALID [2018-11-23 13:04:51,814 INFO L273 TraceCheckUtils]: 143: Hoare triple {11110#false} assume !(~i~0 < ~nodecount~0); {11110#false} is VALID [2018-11-23 13:04:51,814 INFO L273 TraceCheckUtils]: 144: Hoare triple {11110#false} ~i~0 := 0; {11110#false} is VALID [2018-11-23 13:04:51,814 INFO L273 TraceCheckUtils]: 145: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,814 INFO L273 TraceCheckUtils]: 146: Hoare triple {11110#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {11110#false} is VALID [2018-11-23 13:04:51,814 INFO L273 TraceCheckUtils]: 147: Hoare triple {11110#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11110#false} is VALID [2018-11-23 13:04:51,814 INFO L273 TraceCheckUtils]: 148: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,814 INFO L273 TraceCheckUtils]: 149: Hoare triple {11110#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {11110#false} is VALID [2018-11-23 13:04:51,815 INFO L273 TraceCheckUtils]: 150: Hoare triple {11110#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11110#false} is VALID [2018-11-23 13:04:51,815 INFO L273 TraceCheckUtils]: 151: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,815 INFO L273 TraceCheckUtils]: 152: Hoare triple {11110#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {11110#false} is VALID [2018-11-23 13:04:51,815 INFO L273 TraceCheckUtils]: 153: Hoare triple {11110#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11110#false} is VALID [2018-11-23 13:04:51,815 INFO L273 TraceCheckUtils]: 154: Hoare triple {11110#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); {11110#false} is VALID [2018-11-23 13:04:51,815 INFO L273 TraceCheckUtils]: 155: Hoare triple {11110#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {11110#false} is VALID [2018-11-23 13:04:51,815 INFO L273 TraceCheckUtils]: 156: Hoare triple {11110#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {11110#false} is VALID [2018-11-23 13:04:51,815 INFO L273 TraceCheckUtils]: 157: Hoare triple {11110#false} assume !(~i~0 < ~edgecount~0); {11110#false} is VALID [2018-11-23 13:04:51,815 INFO L273 TraceCheckUtils]: 158: Hoare triple {11110#false} ~i~0 := 0; {11110#false} is VALID [2018-11-23 13:04:51,816 INFO L273 TraceCheckUtils]: 159: Hoare triple {11110#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11110#false} is VALID [2018-11-23 13:04:51,816 INFO L256 TraceCheckUtils]: 160: Hoare triple {11110#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {11110#false} is VALID [2018-11-23 13:04:51,816 INFO L273 TraceCheckUtils]: 161: Hoare triple {11110#false} ~cond := #in~cond; {11110#false} is VALID [2018-11-23 13:04:51,816 INFO L273 TraceCheckUtils]: 162: Hoare triple {11110#false} assume 0 == ~cond; {11110#false} is VALID [2018-11-23 13:04:51,816 INFO L273 TraceCheckUtils]: 163: Hoare triple {11110#false} assume !false; {11110#false} is VALID [2018-11-23 13:04:51,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2052 backedges. 653 proven. 70 refuted. 0 times theorem prover too weak. 1329 trivial. 0 not checked. [2018-11-23 13:04:51,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:51,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-11-23 13:04:51,851 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 164 [2018-11-23 13:04:51,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:51,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 13:04:51,939 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-23 13:04:51,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 13:04:51,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 13:04:51,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:04:51,941 INFO L87 Difference]: Start difference. First operand 169 states and 212 transitions. Second operand 19 states. [2018-11-23 13:04:53,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:53,136 INFO L93 Difference]: Finished difference Result 317 states and 409 transitions. [2018-11-23 13:04:53,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:04:53,136 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 164 [2018-11-23 13:04:53,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:53,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:04:53,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 93 transitions. [2018-11-23 13:04:53,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:04:53,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 93 transitions. [2018-11-23 13:04:53,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 93 transitions. [2018-11-23 13:04:53,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:53,240 INFO L225 Difference]: With dead ends: 317 [2018-11-23 13:04:53,240 INFO L226 Difference]: Without dead ends: 194 [2018-11-23 13:04:53,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:04:53,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-23 13:04:53,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 184. [2018-11-23 13:04:53,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:53,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand 184 states. [2018-11-23 13:04:53,648 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 184 states. [2018-11-23 13:04:53,648 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 184 states. [2018-11-23 13:04:53,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:53,652 INFO L93 Difference]: Finished difference Result 194 states and 247 transitions. [2018-11-23 13:04:53,653 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 247 transitions. [2018-11-23 13:04:53,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:53,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:53,653 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 194 states. [2018-11-23 13:04:53,654 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 194 states. [2018-11-23 13:04:53,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:53,658 INFO L93 Difference]: Finished difference Result 194 states and 247 transitions. [2018-11-23 13:04:53,658 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 247 transitions. [2018-11-23 13:04:53,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:53,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:53,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:53,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:53,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-23 13:04:53,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 232 transitions. [2018-11-23 13:04:53,662 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 232 transitions. Word has length 164 [2018-11-23 13:04:53,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:53,663 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 232 transitions. [2018-11-23 13:04:53,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 13:04:53,663 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 232 transitions. [2018-11-23 13:04:53,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-23 13:04:53,664 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:53,664 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 40, 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] [2018-11-23 13:04:53,665 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:53,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:53,665 INFO L82 PathProgramCache]: Analyzing trace with hash -803794606, now seen corresponding path program 9 times [2018-11-23 13:04:53,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:53,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:53,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:53,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:04:53,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:54,600 INFO L256 TraceCheckUtils]: 0: Hoare triple {12691#true} call ULTIMATE.init(); {12691#true} is VALID [2018-11-23 13:04:54,600 INFO L273 TraceCheckUtils]: 1: Hoare triple {12691#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {12691#true} is VALID [2018-11-23 13:04:54,601 INFO L273 TraceCheckUtils]: 2: Hoare triple {12691#true} assume true; {12691#true} is VALID [2018-11-23 13:04:54,601 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12691#true} {12691#true} #103#return; {12691#true} is VALID [2018-11-23 13:04:54,601 INFO L256 TraceCheckUtils]: 4: Hoare triple {12691#true} call #t~ret18 := main(); {12691#true} is VALID [2018-11-23 13:04:54,604 INFO L273 TraceCheckUtils]: 5: Hoare triple {12691#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:54,604 INFO L273 TraceCheckUtils]: 6: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:54,604 INFO L273 TraceCheckUtils]: 7: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:54,605 INFO L273 TraceCheckUtils]: 8: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:54,605 INFO L273 TraceCheckUtils]: 9: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:54,606 INFO L273 TraceCheckUtils]: 10: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:54,606 INFO L273 TraceCheckUtils]: 11: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:54,607 INFO L273 TraceCheckUtils]: 12: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:54,607 INFO L273 TraceCheckUtils]: 13: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:54,608 INFO L273 TraceCheckUtils]: 14: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:54,608 INFO L273 TraceCheckUtils]: 15: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:54,609 INFO L273 TraceCheckUtils]: 16: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:54,609 INFO L273 TraceCheckUtils]: 17: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:54,610 INFO L273 TraceCheckUtils]: 18: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:54,610 INFO L273 TraceCheckUtils]: 19: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:54,611 INFO L273 TraceCheckUtils]: 20: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:54,611 INFO L273 TraceCheckUtils]: 21: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:54,612 INFO L273 TraceCheckUtils]: 22: Hoare triple {12693#(<= 20 main_~edgecount~0)} ~i~0 := 0; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:54,613 INFO L273 TraceCheckUtils]: 23: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {12694#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} is VALID [2018-11-23 13:04:54,614 INFO L273 TraceCheckUtils]: 24: Hoare triple {12694#(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); {12694#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} is VALID [2018-11-23 13:04:54,615 INFO L273 TraceCheckUtils]: 25: Hoare triple {12694#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12694#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} is VALID [2018-11-23 13:04:54,615 INFO L273 TraceCheckUtils]: 26: Hoare triple {12694#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12695#(<= (+ main_~j~0 19) main_~edgecount~0)} is VALID [2018-11-23 13:04:54,616 INFO L273 TraceCheckUtils]: 27: Hoare triple {12695#(<= (+ main_~j~0 19) 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); {12695#(<= (+ main_~j~0 19) main_~edgecount~0)} is VALID [2018-11-23 13:04:54,616 INFO L273 TraceCheckUtils]: 28: Hoare triple {12695#(<= (+ main_~j~0 19) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12695#(<= (+ main_~j~0 19) main_~edgecount~0)} is VALID [2018-11-23 13:04:54,617 INFO L273 TraceCheckUtils]: 29: Hoare triple {12695#(<= (+ main_~j~0 19) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12696#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2018-11-23 13:04:54,618 INFO L273 TraceCheckUtils]: 30: Hoare triple {12696#(<= (+ main_~j~0 18) 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); {12696#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2018-11-23 13:04:54,618 INFO L273 TraceCheckUtils]: 31: Hoare triple {12696#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12696#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2018-11-23 13:04:54,619 INFO L273 TraceCheckUtils]: 32: Hoare triple {12696#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12697#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2018-11-23 13:04:54,620 INFO L273 TraceCheckUtils]: 33: Hoare triple {12697#(<= (+ main_~j~0 17) 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); {12697#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2018-11-23 13:04:54,620 INFO L273 TraceCheckUtils]: 34: Hoare triple {12697#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12697#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2018-11-23 13:04:54,621 INFO L273 TraceCheckUtils]: 35: Hoare triple {12697#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12698#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2018-11-23 13:04:54,622 INFO L273 TraceCheckUtils]: 36: Hoare triple {12698#(<= (+ main_~j~0 16) 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); {12698#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2018-11-23 13:04:54,622 INFO L273 TraceCheckUtils]: 37: Hoare triple {12698#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12698#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2018-11-23 13:04:54,623 INFO L273 TraceCheckUtils]: 38: Hoare triple {12698#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12699#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2018-11-23 13:04:54,623 INFO L273 TraceCheckUtils]: 39: Hoare triple {12699#(<= (+ main_~j~0 15) 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); {12699#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2018-11-23 13:04:54,624 INFO L273 TraceCheckUtils]: 40: Hoare triple {12699#(<= (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12699#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2018-11-23 13:04:54,625 INFO L273 TraceCheckUtils]: 41: Hoare triple {12699#(<= (+ main_~j~0 15) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12700#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2018-11-23 13:04:54,625 INFO L273 TraceCheckUtils]: 42: Hoare triple {12700#(<= (+ main_~j~0 14) 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); {12700#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2018-11-23 13:04:54,626 INFO L273 TraceCheckUtils]: 43: Hoare triple {12700#(<= (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12700#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2018-11-23 13:04:54,627 INFO L273 TraceCheckUtils]: 44: Hoare triple {12700#(<= (+ main_~j~0 14) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12701#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2018-11-23 13:04:54,627 INFO L273 TraceCheckUtils]: 45: Hoare triple {12701#(<= (+ main_~j~0 13) 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); {12701#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2018-11-23 13:04:54,628 INFO L273 TraceCheckUtils]: 46: Hoare triple {12701#(<= (+ main_~j~0 13) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12701#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2018-11-23 13:04:54,629 INFO L273 TraceCheckUtils]: 47: Hoare triple {12701#(<= (+ main_~j~0 13) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12702#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2018-11-23 13:04:54,629 INFO L273 TraceCheckUtils]: 48: Hoare triple {12702#(<= (+ main_~j~0 12) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {12692#false} is VALID [2018-11-23 13:04:54,630 INFO L273 TraceCheckUtils]: 49: Hoare triple {12692#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12692#false} is VALID [2018-11-23 13:04:54,630 INFO L273 TraceCheckUtils]: 50: Hoare triple {12692#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {12692#false} is VALID [2018-11-23 13:04:54,630 INFO L273 TraceCheckUtils]: 51: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,630 INFO L273 TraceCheckUtils]: 52: Hoare triple {12692#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12692#false} is VALID [2018-11-23 13:04:54,630 INFO L273 TraceCheckUtils]: 53: Hoare triple {12692#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12692#false} is VALID [2018-11-23 13:04:54,630 INFO L273 TraceCheckUtils]: 54: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,631 INFO L273 TraceCheckUtils]: 55: Hoare triple {12692#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12692#false} is VALID [2018-11-23 13:04:54,631 INFO L273 TraceCheckUtils]: 56: Hoare triple {12692#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12692#false} is VALID [2018-11-23 13:04:54,631 INFO L273 TraceCheckUtils]: 57: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,631 INFO L273 TraceCheckUtils]: 58: Hoare triple {12692#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12692#false} is VALID [2018-11-23 13:04:54,632 INFO L273 TraceCheckUtils]: 59: Hoare triple {12692#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12692#false} is VALID [2018-11-23 13:04:54,632 INFO L273 TraceCheckUtils]: 60: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,632 INFO L273 TraceCheckUtils]: 61: Hoare triple {12692#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12692#false} is VALID [2018-11-23 13:04:54,632 INFO L273 TraceCheckUtils]: 62: Hoare triple {12692#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12692#false} is VALID [2018-11-23 13:04:54,632 INFO L273 TraceCheckUtils]: 63: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,632 INFO L273 TraceCheckUtils]: 64: Hoare triple {12692#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12692#false} is VALID [2018-11-23 13:04:54,632 INFO L273 TraceCheckUtils]: 65: Hoare triple {12692#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12692#false} is VALID [2018-11-23 13:04:54,633 INFO L273 TraceCheckUtils]: 66: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,633 INFO L273 TraceCheckUtils]: 67: Hoare triple {12692#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12692#false} is VALID [2018-11-23 13:04:54,633 INFO L273 TraceCheckUtils]: 68: Hoare triple {12692#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12692#false} is VALID [2018-11-23 13:04:54,633 INFO L273 TraceCheckUtils]: 69: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,633 INFO L273 TraceCheckUtils]: 70: Hoare triple {12692#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12692#false} is VALID [2018-11-23 13:04:54,633 INFO L273 TraceCheckUtils]: 71: Hoare triple {12692#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12692#false} is VALID [2018-11-23 13:04:54,633 INFO L273 TraceCheckUtils]: 72: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,633 INFO L273 TraceCheckUtils]: 73: Hoare triple {12692#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12692#false} is VALID [2018-11-23 13:04:54,633 INFO L273 TraceCheckUtils]: 74: Hoare triple {12692#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12692#false} is VALID [2018-11-23 13:04:54,634 INFO L273 TraceCheckUtils]: 75: Hoare triple {12692#false} assume !(~j~0 < ~edgecount~0); {12692#false} is VALID [2018-11-23 13:04:54,634 INFO L273 TraceCheckUtils]: 76: Hoare triple {12692#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12692#false} is VALID [2018-11-23 13:04:54,634 INFO L273 TraceCheckUtils]: 77: Hoare triple {12692#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {12692#false} is VALID [2018-11-23 13:04:54,634 INFO L273 TraceCheckUtils]: 78: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,634 INFO L273 TraceCheckUtils]: 79: Hoare triple {12692#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12692#false} is VALID [2018-11-23 13:04:54,634 INFO L273 TraceCheckUtils]: 80: Hoare triple {12692#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12692#false} is VALID [2018-11-23 13:04:54,634 INFO L273 TraceCheckUtils]: 81: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,634 INFO L273 TraceCheckUtils]: 82: Hoare triple {12692#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12692#false} is VALID [2018-11-23 13:04:54,634 INFO L273 TraceCheckUtils]: 83: Hoare triple {12692#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12692#false} is VALID [2018-11-23 13:04:54,635 INFO L273 TraceCheckUtils]: 84: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,635 INFO L273 TraceCheckUtils]: 85: Hoare triple {12692#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12692#false} is VALID [2018-11-23 13:04:54,635 INFO L273 TraceCheckUtils]: 86: Hoare triple {12692#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12692#false} is VALID [2018-11-23 13:04:54,635 INFO L273 TraceCheckUtils]: 87: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,635 INFO L273 TraceCheckUtils]: 88: Hoare triple {12692#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12692#false} is VALID [2018-11-23 13:04:54,635 INFO L273 TraceCheckUtils]: 89: Hoare triple {12692#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12692#false} is VALID [2018-11-23 13:04:54,635 INFO L273 TraceCheckUtils]: 90: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,635 INFO L273 TraceCheckUtils]: 91: Hoare triple {12692#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12692#false} is VALID [2018-11-23 13:04:54,635 INFO L273 TraceCheckUtils]: 92: Hoare triple {12692#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12692#false} is VALID [2018-11-23 13:04:54,636 INFO L273 TraceCheckUtils]: 93: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,636 INFO L273 TraceCheckUtils]: 94: Hoare triple {12692#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12692#false} is VALID [2018-11-23 13:04:54,636 INFO L273 TraceCheckUtils]: 95: Hoare triple {12692#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12692#false} is VALID [2018-11-23 13:04:54,636 INFO L273 TraceCheckUtils]: 96: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,636 INFO L273 TraceCheckUtils]: 97: Hoare triple {12692#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12692#false} is VALID [2018-11-23 13:04:54,636 INFO L273 TraceCheckUtils]: 98: Hoare triple {12692#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12692#false} is VALID [2018-11-23 13:04:54,636 INFO L273 TraceCheckUtils]: 99: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,636 INFO L273 TraceCheckUtils]: 100: Hoare triple {12692#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12692#false} is VALID [2018-11-23 13:04:54,636 INFO L273 TraceCheckUtils]: 101: Hoare triple {12692#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12692#false} is VALID [2018-11-23 13:04:54,637 INFO L273 TraceCheckUtils]: 102: Hoare triple {12692#false} assume !(~j~0 < ~edgecount~0); {12692#false} is VALID [2018-11-23 13:04:54,637 INFO L273 TraceCheckUtils]: 103: Hoare triple {12692#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12692#false} is VALID [2018-11-23 13:04:54,637 INFO L273 TraceCheckUtils]: 104: Hoare triple {12692#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {12692#false} is VALID [2018-11-23 13:04:54,637 INFO L273 TraceCheckUtils]: 105: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,637 INFO L273 TraceCheckUtils]: 106: Hoare triple {12692#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12692#false} is VALID [2018-11-23 13:04:54,637 INFO L273 TraceCheckUtils]: 107: Hoare triple {12692#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12692#false} is VALID [2018-11-23 13:04:54,637 INFO L273 TraceCheckUtils]: 108: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,637 INFO L273 TraceCheckUtils]: 109: Hoare triple {12692#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12692#false} is VALID [2018-11-23 13:04:54,637 INFO L273 TraceCheckUtils]: 110: Hoare triple {12692#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12692#false} is VALID [2018-11-23 13:04:54,638 INFO L273 TraceCheckUtils]: 111: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,638 INFO L273 TraceCheckUtils]: 112: Hoare triple {12692#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12692#false} is VALID [2018-11-23 13:04:54,638 INFO L273 TraceCheckUtils]: 113: Hoare triple {12692#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12692#false} is VALID [2018-11-23 13:04:54,638 INFO L273 TraceCheckUtils]: 114: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,638 INFO L273 TraceCheckUtils]: 115: Hoare triple {12692#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12692#false} is VALID [2018-11-23 13:04:54,638 INFO L273 TraceCheckUtils]: 116: Hoare triple {12692#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12692#false} is VALID [2018-11-23 13:04:54,638 INFO L273 TraceCheckUtils]: 117: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,638 INFO L273 TraceCheckUtils]: 118: Hoare triple {12692#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12692#false} is VALID [2018-11-23 13:04:54,638 INFO L273 TraceCheckUtils]: 119: Hoare triple {12692#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12692#false} is VALID [2018-11-23 13:04:54,639 INFO L273 TraceCheckUtils]: 120: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,639 INFO L273 TraceCheckUtils]: 121: Hoare triple {12692#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12692#false} is VALID [2018-11-23 13:04:54,639 INFO L273 TraceCheckUtils]: 122: Hoare triple {12692#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12692#false} is VALID [2018-11-23 13:04:54,639 INFO L273 TraceCheckUtils]: 123: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,639 INFO L273 TraceCheckUtils]: 124: Hoare triple {12692#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12692#false} is VALID [2018-11-23 13:04:54,639 INFO L273 TraceCheckUtils]: 125: Hoare triple {12692#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12692#false} is VALID [2018-11-23 13:04:54,639 INFO L273 TraceCheckUtils]: 126: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,639 INFO L273 TraceCheckUtils]: 127: Hoare triple {12692#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12692#false} is VALID [2018-11-23 13:04:54,640 INFO L273 TraceCheckUtils]: 128: Hoare triple {12692#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12692#false} is VALID [2018-11-23 13:04:54,640 INFO L273 TraceCheckUtils]: 129: Hoare triple {12692#false} assume !(~j~0 < ~edgecount~0); {12692#false} is VALID [2018-11-23 13:04:54,640 INFO L273 TraceCheckUtils]: 130: Hoare triple {12692#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12692#false} is VALID [2018-11-23 13:04:54,640 INFO L273 TraceCheckUtils]: 131: Hoare triple {12692#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {12692#false} is VALID [2018-11-23 13:04:54,640 INFO L273 TraceCheckUtils]: 132: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,640 INFO L273 TraceCheckUtils]: 133: Hoare triple {12692#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12692#false} is VALID [2018-11-23 13:04:54,640 INFO L273 TraceCheckUtils]: 134: Hoare triple {12692#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12692#false} is VALID [2018-11-23 13:04:54,640 INFO L273 TraceCheckUtils]: 135: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,640 INFO L273 TraceCheckUtils]: 136: Hoare triple {12692#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12692#false} is VALID [2018-11-23 13:04:54,641 INFO L273 TraceCheckUtils]: 137: Hoare triple {12692#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12692#false} is VALID [2018-11-23 13:04:54,641 INFO L273 TraceCheckUtils]: 138: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,641 INFO L273 TraceCheckUtils]: 139: Hoare triple {12692#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12692#false} is VALID [2018-11-23 13:04:54,641 INFO L273 TraceCheckUtils]: 140: Hoare triple {12692#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12692#false} is VALID [2018-11-23 13:04:54,641 INFO L273 TraceCheckUtils]: 141: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,641 INFO L273 TraceCheckUtils]: 142: Hoare triple {12692#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12692#false} is VALID [2018-11-23 13:04:54,641 INFO L273 TraceCheckUtils]: 143: Hoare triple {12692#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12692#false} is VALID [2018-11-23 13:04:54,641 INFO L273 TraceCheckUtils]: 144: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,641 INFO L273 TraceCheckUtils]: 145: Hoare triple {12692#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12692#false} is VALID [2018-11-23 13:04:54,642 INFO L273 TraceCheckUtils]: 146: Hoare triple {12692#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12692#false} is VALID [2018-11-23 13:04:54,642 INFO L273 TraceCheckUtils]: 147: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,642 INFO L273 TraceCheckUtils]: 148: Hoare triple {12692#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12692#false} is VALID [2018-11-23 13:04:54,642 INFO L273 TraceCheckUtils]: 149: Hoare triple {12692#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12692#false} is VALID [2018-11-23 13:04:54,642 INFO L273 TraceCheckUtils]: 150: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,642 INFO L273 TraceCheckUtils]: 151: Hoare triple {12692#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12692#false} is VALID [2018-11-23 13:04:54,642 INFO L273 TraceCheckUtils]: 152: Hoare triple {12692#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12692#false} is VALID [2018-11-23 13:04:54,642 INFO L273 TraceCheckUtils]: 153: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,642 INFO L273 TraceCheckUtils]: 154: Hoare triple {12692#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12692#false} is VALID [2018-11-23 13:04:54,643 INFO L273 TraceCheckUtils]: 155: Hoare triple {12692#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12692#false} is VALID [2018-11-23 13:04:54,643 INFO L273 TraceCheckUtils]: 156: Hoare triple {12692#false} assume !(~j~0 < ~edgecount~0); {12692#false} is VALID [2018-11-23 13:04:54,643 INFO L273 TraceCheckUtils]: 157: Hoare triple {12692#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12692#false} is VALID [2018-11-23 13:04:54,643 INFO L273 TraceCheckUtils]: 158: Hoare triple {12692#false} assume !(~i~0 < ~nodecount~0); {12692#false} is VALID [2018-11-23 13:04:54,643 INFO L273 TraceCheckUtils]: 159: Hoare triple {12692#false} ~i~0 := 0; {12692#false} is VALID [2018-11-23 13:04:54,643 INFO L273 TraceCheckUtils]: 160: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,643 INFO L273 TraceCheckUtils]: 161: Hoare triple {12692#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {12692#false} is VALID [2018-11-23 13:04:54,643 INFO L273 TraceCheckUtils]: 162: Hoare triple {12692#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {12692#false} is VALID [2018-11-23 13:04:54,644 INFO L273 TraceCheckUtils]: 163: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,644 INFO L273 TraceCheckUtils]: 164: Hoare triple {12692#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {12692#false} is VALID [2018-11-23 13:04:54,644 INFO L273 TraceCheckUtils]: 165: Hoare triple {12692#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {12692#false} is VALID [2018-11-23 13:04:54,644 INFO L273 TraceCheckUtils]: 166: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,644 INFO L273 TraceCheckUtils]: 167: Hoare triple {12692#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {12692#false} is VALID [2018-11-23 13:04:54,644 INFO L273 TraceCheckUtils]: 168: Hoare triple {12692#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {12692#false} is VALID [2018-11-23 13:04:54,644 INFO L273 TraceCheckUtils]: 169: Hoare triple {12692#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); {12692#false} is VALID [2018-11-23 13:04:54,644 INFO L273 TraceCheckUtils]: 170: Hoare triple {12692#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {12692#false} is VALID [2018-11-23 13:04:54,644 INFO L273 TraceCheckUtils]: 171: Hoare triple {12692#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {12692#false} is VALID [2018-11-23 13:04:54,645 INFO L273 TraceCheckUtils]: 172: Hoare triple {12692#false} assume !(~i~0 < ~edgecount~0); {12692#false} is VALID [2018-11-23 13:04:54,645 INFO L273 TraceCheckUtils]: 173: Hoare triple {12692#false} ~i~0 := 0; {12692#false} is VALID [2018-11-23 13:04:54,645 INFO L273 TraceCheckUtils]: 174: Hoare triple {12692#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12692#false} is VALID [2018-11-23 13:04:54,645 INFO L256 TraceCheckUtils]: 175: Hoare triple {12692#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {12692#false} is VALID [2018-11-23 13:04:54,645 INFO L273 TraceCheckUtils]: 176: Hoare triple {12692#false} ~cond := #in~cond; {12692#false} is VALID [2018-11-23 13:04:54,645 INFO L273 TraceCheckUtils]: 177: Hoare triple {12692#false} assume 0 == ~cond; {12692#false} is VALID [2018-11-23 13:04:54,645 INFO L273 TraceCheckUtils]: 178: Hoare triple {12692#false} assume !false; {12692#false} is VALID [2018-11-23 13:04:54,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2632 backedges. 841 proven. 92 refuted. 0 times theorem prover too weak. 1699 trivial. 0 not checked. [2018-11-23 13:04:54,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:54,661 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-23 13:04:54,670 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:04:54,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 13:04:54,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:54,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:55,135 INFO L256 TraceCheckUtils]: 0: Hoare triple {12691#true} call ULTIMATE.init(); {12691#true} is VALID [2018-11-23 13:04:55,135 INFO L273 TraceCheckUtils]: 1: Hoare triple {12691#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {12691#true} is VALID [2018-11-23 13:04:55,135 INFO L273 TraceCheckUtils]: 2: Hoare triple {12691#true} assume true; {12691#true} is VALID [2018-11-23 13:04:55,135 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12691#true} {12691#true} #103#return; {12691#true} is VALID [2018-11-23 13:04:55,135 INFO L256 TraceCheckUtils]: 4: Hoare triple {12691#true} call #t~ret18 := main(); {12691#true} is VALID [2018-11-23 13:04:55,138 INFO L273 TraceCheckUtils]: 5: Hoare triple {12691#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,139 INFO L273 TraceCheckUtils]: 6: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,139 INFO L273 TraceCheckUtils]: 7: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,140 INFO L273 TraceCheckUtils]: 8: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,140 INFO L273 TraceCheckUtils]: 9: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,141 INFO L273 TraceCheckUtils]: 10: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,141 INFO L273 TraceCheckUtils]: 11: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,142 INFO L273 TraceCheckUtils]: 12: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,142 INFO L273 TraceCheckUtils]: 13: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,143 INFO L273 TraceCheckUtils]: 14: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,143 INFO L273 TraceCheckUtils]: 15: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,144 INFO L273 TraceCheckUtils]: 16: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,144 INFO L273 TraceCheckUtils]: 17: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,145 INFO L273 TraceCheckUtils]: 18: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,145 INFO L273 TraceCheckUtils]: 19: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,146 INFO L273 TraceCheckUtils]: 20: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,146 INFO L273 TraceCheckUtils]: 21: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,147 INFO L273 TraceCheckUtils]: 22: Hoare triple {12693#(<= 20 main_~edgecount~0)} ~i~0 := 0; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,147 INFO L273 TraceCheckUtils]: 23: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,148 INFO L273 TraceCheckUtils]: 24: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,148 INFO L273 TraceCheckUtils]: 25: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,149 INFO L273 TraceCheckUtils]: 26: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,149 INFO L273 TraceCheckUtils]: 27: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,150 INFO L273 TraceCheckUtils]: 28: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,150 INFO L273 TraceCheckUtils]: 29: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,151 INFO L273 TraceCheckUtils]: 30: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,151 INFO L273 TraceCheckUtils]: 31: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,152 INFO L273 TraceCheckUtils]: 32: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,152 INFO L273 TraceCheckUtils]: 33: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,153 INFO L273 TraceCheckUtils]: 34: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,153 INFO L273 TraceCheckUtils]: 35: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,154 INFO L273 TraceCheckUtils]: 36: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,154 INFO L273 TraceCheckUtils]: 37: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,155 INFO L273 TraceCheckUtils]: 38: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,155 INFO L273 TraceCheckUtils]: 39: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,156 INFO L273 TraceCheckUtils]: 40: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,156 INFO L273 TraceCheckUtils]: 41: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,157 INFO L273 TraceCheckUtils]: 42: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,158 INFO L273 TraceCheckUtils]: 43: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,158 INFO L273 TraceCheckUtils]: 44: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,159 INFO L273 TraceCheckUtils]: 45: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,159 INFO L273 TraceCheckUtils]: 46: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,160 INFO L273 TraceCheckUtils]: 47: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,160 INFO L273 TraceCheckUtils]: 48: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,161 INFO L273 TraceCheckUtils]: 49: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,161 INFO L273 TraceCheckUtils]: 50: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,162 INFO L273 TraceCheckUtils]: 51: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,162 INFO L273 TraceCheckUtils]: 52: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,163 INFO L273 TraceCheckUtils]: 53: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,163 INFO L273 TraceCheckUtils]: 54: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,164 INFO L273 TraceCheckUtils]: 55: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,164 INFO L273 TraceCheckUtils]: 56: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,165 INFO L273 TraceCheckUtils]: 57: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,165 INFO L273 TraceCheckUtils]: 58: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,166 INFO L273 TraceCheckUtils]: 59: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,166 INFO L273 TraceCheckUtils]: 60: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,167 INFO L273 TraceCheckUtils]: 61: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,167 INFO L273 TraceCheckUtils]: 62: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,168 INFO L273 TraceCheckUtils]: 63: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,168 INFO L273 TraceCheckUtils]: 64: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,169 INFO L273 TraceCheckUtils]: 65: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,169 INFO L273 TraceCheckUtils]: 66: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,170 INFO L273 TraceCheckUtils]: 67: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,170 INFO L273 TraceCheckUtils]: 68: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,171 INFO L273 TraceCheckUtils]: 69: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,171 INFO L273 TraceCheckUtils]: 70: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,172 INFO L273 TraceCheckUtils]: 71: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,172 INFO L273 TraceCheckUtils]: 72: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,173 INFO L273 TraceCheckUtils]: 73: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,173 INFO L273 TraceCheckUtils]: 74: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,174 INFO L273 TraceCheckUtils]: 75: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,174 INFO L273 TraceCheckUtils]: 76: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,175 INFO L273 TraceCheckUtils]: 77: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,175 INFO L273 TraceCheckUtils]: 78: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,176 INFO L273 TraceCheckUtils]: 79: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,177 INFO L273 TraceCheckUtils]: 80: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,177 INFO L273 TraceCheckUtils]: 81: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,178 INFO L273 TraceCheckUtils]: 82: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,178 INFO L273 TraceCheckUtils]: 83: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,179 INFO L273 TraceCheckUtils]: 84: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,179 INFO L273 TraceCheckUtils]: 85: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,180 INFO L273 TraceCheckUtils]: 86: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,180 INFO L273 TraceCheckUtils]: 87: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,181 INFO L273 TraceCheckUtils]: 88: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,181 INFO L273 TraceCheckUtils]: 89: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,182 INFO L273 TraceCheckUtils]: 90: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,182 INFO L273 TraceCheckUtils]: 91: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,183 INFO L273 TraceCheckUtils]: 92: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,183 INFO L273 TraceCheckUtils]: 93: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,184 INFO L273 TraceCheckUtils]: 94: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,184 INFO L273 TraceCheckUtils]: 95: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,185 INFO L273 TraceCheckUtils]: 96: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,185 INFO L273 TraceCheckUtils]: 97: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,186 INFO L273 TraceCheckUtils]: 98: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,186 INFO L273 TraceCheckUtils]: 99: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,187 INFO L273 TraceCheckUtils]: 100: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,187 INFO L273 TraceCheckUtils]: 101: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,188 INFO L273 TraceCheckUtils]: 102: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,188 INFO L273 TraceCheckUtils]: 103: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,189 INFO L273 TraceCheckUtils]: 104: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,189 INFO L273 TraceCheckUtils]: 105: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,190 INFO L273 TraceCheckUtils]: 106: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,190 INFO L273 TraceCheckUtils]: 107: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,191 INFO L273 TraceCheckUtils]: 108: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,191 INFO L273 TraceCheckUtils]: 109: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,192 INFO L273 TraceCheckUtils]: 110: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,192 INFO L273 TraceCheckUtils]: 111: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,193 INFO L273 TraceCheckUtils]: 112: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,193 INFO L273 TraceCheckUtils]: 113: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,194 INFO L273 TraceCheckUtils]: 114: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,194 INFO L273 TraceCheckUtils]: 115: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,195 INFO L273 TraceCheckUtils]: 116: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,195 INFO L273 TraceCheckUtils]: 117: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,196 INFO L273 TraceCheckUtils]: 118: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,196 INFO L273 TraceCheckUtils]: 119: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,197 INFO L273 TraceCheckUtils]: 120: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,197 INFO L273 TraceCheckUtils]: 121: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,198 INFO L273 TraceCheckUtils]: 122: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,199 INFO L273 TraceCheckUtils]: 123: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,199 INFO L273 TraceCheckUtils]: 124: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,200 INFO L273 TraceCheckUtils]: 125: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,200 INFO L273 TraceCheckUtils]: 126: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,201 INFO L273 TraceCheckUtils]: 127: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,201 INFO L273 TraceCheckUtils]: 128: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,202 INFO L273 TraceCheckUtils]: 129: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,202 INFO L273 TraceCheckUtils]: 130: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,203 INFO L273 TraceCheckUtils]: 131: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,203 INFO L273 TraceCheckUtils]: 132: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,204 INFO L273 TraceCheckUtils]: 133: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,204 INFO L273 TraceCheckUtils]: 134: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,205 INFO L273 TraceCheckUtils]: 135: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,205 INFO L273 TraceCheckUtils]: 136: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,206 INFO L273 TraceCheckUtils]: 137: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,206 INFO L273 TraceCheckUtils]: 138: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,207 INFO L273 TraceCheckUtils]: 139: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,207 INFO L273 TraceCheckUtils]: 140: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,208 INFO L273 TraceCheckUtils]: 141: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,208 INFO L273 TraceCheckUtils]: 142: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,209 INFO L273 TraceCheckUtils]: 143: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,209 INFO L273 TraceCheckUtils]: 144: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,210 INFO L273 TraceCheckUtils]: 145: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,210 INFO L273 TraceCheckUtils]: 146: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,211 INFO L273 TraceCheckUtils]: 147: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,211 INFO L273 TraceCheckUtils]: 148: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,212 INFO L273 TraceCheckUtils]: 149: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,212 INFO L273 TraceCheckUtils]: 150: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,213 INFO L273 TraceCheckUtils]: 151: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,213 INFO L273 TraceCheckUtils]: 152: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,214 INFO L273 TraceCheckUtils]: 153: Hoare triple {12693#(<= 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); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,214 INFO L273 TraceCheckUtils]: 154: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,215 INFO L273 TraceCheckUtils]: 155: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,215 INFO L273 TraceCheckUtils]: 156: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,216 INFO L273 TraceCheckUtils]: 157: Hoare triple {12693#(<= 20 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,216 INFO L273 TraceCheckUtils]: 158: Hoare triple {12693#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {12693#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:04:55,217 INFO L273 TraceCheckUtils]: 159: Hoare triple {12693#(<= 20 main_~edgecount~0)} ~i~0 := 0; {13183#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:04:55,218 INFO L273 TraceCheckUtils]: 160: Hoare triple {13183#(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); {13183#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:04:55,219 INFO L273 TraceCheckUtils]: 161: Hoare triple {13183#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {13183#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:04:55,220 INFO L273 TraceCheckUtils]: 162: Hoare triple {13183#(and (<= 20 main_~edgecount~0) (<= main_~i~0 0))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13193#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:04:55,221 INFO L273 TraceCheckUtils]: 163: Hoare triple {13193#(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); {13193#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:04:55,221 INFO L273 TraceCheckUtils]: 164: Hoare triple {13193#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {13193#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:04:55,222 INFO L273 TraceCheckUtils]: 165: Hoare triple {13193#(and (<= 20 main_~edgecount~0) (<= main_~i~0 1))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13203#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:04:55,223 INFO L273 TraceCheckUtils]: 166: Hoare triple {13203#(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); {13203#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:04:55,224 INFO L273 TraceCheckUtils]: 167: Hoare triple {13203#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {13203#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:04:55,225 INFO L273 TraceCheckUtils]: 168: Hoare triple {13203#(and (<= 20 main_~edgecount~0) (<= main_~i~0 2))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13213#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2018-11-23 13:04:55,226 INFO L273 TraceCheckUtils]: 169: Hoare triple {13213#(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); {13213#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2018-11-23 13:04:55,227 INFO L273 TraceCheckUtils]: 170: Hoare triple {13213#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {13213#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2018-11-23 13:04:55,228 INFO L273 TraceCheckUtils]: 171: Hoare triple {13213#(and (<= 20 main_~edgecount~0) (<= main_~i~0 3))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {13223#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:04:55,228 INFO L273 TraceCheckUtils]: 172: Hoare triple {13223#(and (<= 20 main_~edgecount~0) (<= main_~i~0 4))} assume !(~i~0 < ~edgecount~0); {12692#false} is VALID [2018-11-23 13:04:55,229 INFO L273 TraceCheckUtils]: 173: Hoare triple {12692#false} ~i~0 := 0; {12692#false} is VALID [2018-11-23 13:04:55,229 INFO L273 TraceCheckUtils]: 174: Hoare triple {12692#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {12692#false} is VALID [2018-11-23 13:04:55,229 INFO L256 TraceCheckUtils]: 175: Hoare triple {12692#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {12692#false} is VALID [2018-11-23 13:04:55,229 INFO L273 TraceCheckUtils]: 176: Hoare triple {12692#false} ~cond := #in~cond; {12692#false} is VALID [2018-11-23 13:04:55,229 INFO L273 TraceCheckUtils]: 177: Hoare triple {12692#false} assume 0 == ~cond; {12692#false} is VALID [2018-11-23 13:04:55,230 INFO L273 TraceCheckUtils]: 178: Hoare triple {12692#false} assume !false; {12692#false} is VALID [2018-11-23 13:04:55,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2632 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2610 trivial. 0 not checked. [2018-11-23 13:04:55,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:55,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2018-11-23 13:04:55,274 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 179 [2018-11-23 13:04:55,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:55,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 13:04:55,377 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:55,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 13:04:55,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:04:55,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:04:55,378 INFO L87 Difference]: Start difference. First operand 184 states and 232 transitions. Second operand 17 states. [2018-11-23 13:04:59,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:59,270 INFO L93 Difference]: Finished difference Result 402 states and 521 transitions. [2018-11-23 13:04:59,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-11-23 13:04:59,270 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 179 [2018-11-23 13:04:59,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:59,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:04:59,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 372 transitions. [2018-11-23 13:04:59,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:04:59,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 372 transitions. [2018-11-23 13:04:59,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states and 372 transitions. [2018-11-23 13:04:59,726 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 372 edges. 372 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:59,732 INFO L225 Difference]: With dead ends: 402 [2018-11-23 13:04:59,733 INFO L226 Difference]: Without dead ends: 267 [2018-11-23 13:04:59,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1466 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1524, Invalid=3306, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 13:04:59,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-23 13:05:00,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 202. [2018-11-23 13:05:00,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:00,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand 202 states. [2018-11-23 13:05:00,183 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand 202 states. [2018-11-23 13:05:00,183 INFO L87 Difference]: Start difference. First operand 267 states. Second operand 202 states. [2018-11-23 13:05:00,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:00,188 INFO L93 Difference]: Finished difference Result 267 states and 341 transitions. [2018-11-23 13:05:00,188 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 341 transitions. [2018-11-23 13:05:00,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:00,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:00,189 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 267 states. [2018-11-23 13:05:00,189 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 267 states. [2018-11-23 13:05:00,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:00,195 INFO L93 Difference]: Finished difference Result 267 states and 341 transitions. [2018-11-23 13:05:00,195 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 341 transitions. [2018-11-23 13:05:00,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:00,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:00,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:00,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:00,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-11-23 13:05:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 255 transitions. [2018-11-23 13:05:00,200 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 255 transitions. Word has length 179 [2018-11-23 13:05:00,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:00,200 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 255 transitions. [2018-11-23 13:05:00,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 13:05:00,200 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 255 transitions. [2018-11-23 13:05:00,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-23 13:05:00,201 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:00,201 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 45, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:00,202 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:00,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:00,202 INFO L82 PathProgramCache]: Analyzing trace with hash -95503603, now seen corresponding path program 10 times [2018-11-23 13:05:00,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:00,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:00,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:00,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:00,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:00,875 INFO L256 TraceCheckUtils]: 0: Hoare triple {14707#true} call ULTIMATE.init(); {14707#true} is VALID [2018-11-23 13:05:00,875 INFO L273 TraceCheckUtils]: 1: Hoare triple {14707#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {14707#true} is VALID [2018-11-23 13:05:00,875 INFO L273 TraceCheckUtils]: 2: Hoare triple {14707#true} assume true; {14707#true} is VALID [2018-11-23 13:05:00,875 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14707#true} {14707#true} #103#return; {14707#true} is VALID [2018-11-23 13:05:00,876 INFO L256 TraceCheckUtils]: 4: Hoare triple {14707#true} call #t~ret18 := main(); {14707#true} is VALID [2018-11-23 13:05:00,878 INFO L273 TraceCheckUtils]: 5: Hoare triple {14707#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {14709#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:00,879 INFO L273 TraceCheckUtils]: 6: Hoare triple {14709#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14709#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:00,879 INFO L273 TraceCheckUtils]: 7: Hoare triple {14709#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14709#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:00,881 INFO L273 TraceCheckUtils]: 8: Hoare triple {14709#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14709#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:00,881 INFO L273 TraceCheckUtils]: 9: Hoare triple {14709#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14709#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:00,883 INFO L273 TraceCheckUtils]: 10: Hoare triple {14709#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14709#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:00,883 INFO L273 TraceCheckUtils]: 11: Hoare triple {14709#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14709#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:00,886 INFO L273 TraceCheckUtils]: 12: Hoare triple {14709#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14709#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:00,886 INFO L273 TraceCheckUtils]: 13: Hoare triple {14709#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14709#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:00,888 INFO L273 TraceCheckUtils]: 14: Hoare triple {14709#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14709#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:00,888 INFO L273 TraceCheckUtils]: 15: Hoare triple {14709#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14709#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:00,890 INFO L273 TraceCheckUtils]: 16: Hoare triple {14709#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14709#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:00,890 INFO L273 TraceCheckUtils]: 17: Hoare triple {14709#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14709#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:00,893 INFO L273 TraceCheckUtils]: 18: Hoare triple {14709#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {14709#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:00,893 INFO L273 TraceCheckUtils]: 19: Hoare triple {14709#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14709#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:00,896 INFO L273 TraceCheckUtils]: 20: Hoare triple {14709#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14709#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:00,896 INFO L273 TraceCheckUtils]: 21: Hoare triple {14709#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {14709#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:00,898 INFO L273 TraceCheckUtils]: 22: Hoare triple {14709#(<= 20 main_~edgecount~0)} ~i~0 := 0; {14709#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:00,898 INFO L273 TraceCheckUtils]: 23: Hoare triple {14709#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14710#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} is VALID [2018-11-23 13:05:00,900 INFO L273 TraceCheckUtils]: 24: Hoare triple {14710#(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); {14710#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} is VALID [2018-11-23 13:05:00,902 INFO L273 TraceCheckUtils]: 25: Hoare triple {14710#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14710#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} is VALID [2018-11-23 13:05:00,902 INFO L273 TraceCheckUtils]: 26: Hoare triple {14710#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14711#(<= (+ main_~j~0 19) main_~edgecount~0)} is VALID [2018-11-23 13:05:00,905 INFO L273 TraceCheckUtils]: 27: Hoare triple {14711#(<= (+ main_~j~0 19) 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); {14711#(<= (+ main_~j~0 19) main_~edgecount~0)} is VALID [2018-11-23 13:05:00,905 INFO L273 TraceCheckUtils]: 28: Hoare triple {14711#(<= (+ main_~j~0 19) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14711#(<= (+ main_~j~0 19) main_~edgecount~0)} is VALID [2018-11-23 13:05:00,908 INFO L273 TraceCheckUtils]: 29: Hoare triple {14711#(<= (+ main_~j~0 19) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14712#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2018-11-23 13:05:00,908 INFO L273 TraceCheckUtils]: 30: Hoare triple {14712#(<= (+ main_~j~0 18) 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); {14712#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2018-11-23 13:05:00,910 INFO L273 TraceCheckUtils]: 31: Hoare triple {14712#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14712#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2018-11-23 13:05:00,910 INFO L273 TraceCheckUtils]: 32: Hoare triple {14712#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14713#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2018-11-23 13:05:00,913 INFO L273 TraceCheckUtils]: 33: Hoare triple {14713#(<= (+ main_~j~0 17) 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); {14713#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2018-11-23 13:05:00,913 INFO L273 TraceCheckUtils]: 34: Hoare triple {14713#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14713#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2018-11-23 13:05:00,915 INFO L273 TraceCheckUtils]: 35: Hoare triple {14713#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14714#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2018-11-23 13:05:00,915 INFO L273 TraceCheckUtils]: 36: Hoare triple {14714#(<= (+ main_~j~0 16) 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); {14714#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2018-11-23 13:05:00,917 INFO L273 TraceCheckUtils]: 37: Hoare triple {14714#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14714#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2018-11-23 13:05:00,917 INFO L273 TraceCheckUtils]: 38: Hoare triple {14714#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14715#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2018-11-23 13:05:00,920 INFO L273 TraceCheckUtils]: 39: Hoare triple {14715#(<= (+ main_~j~0 15) 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); {14715#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2018-11-23 13:05:00,920 INFO L273 TraceCheckUtils]: 40: Hoare triple {14715#(<= (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14715#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2018-11-23 13:05:00,922 INFO L273 TraceCheckUtils]: 41: Hoare triple {14715#(<= (+ main_~j~0 15) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14716#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2018-11-23 13:05:00,925 INFO L273 TraceCheckUtils]: 42: Hoare triple {14716#(<= (+ main_~j~0 14) 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); {14716#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2018-11-23 13:05:00,925 INFO L273 TraceCheckUtils]: 43: Hoare triple {14716#(<= (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14716#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2018-11-23 13:05:00,930 INFO L273 TraceCheckUtils]: 44: Hoare triple {14716#(<= (+ main_~j~0 14) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14717#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2018-11-23 13:05:00,931 INFO L273 TraceCheckUtils]: 45: Hoare triple {14717#(<= (+ main_~j~0 13) 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); {14717#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2018-11-23 13:05:00,931 INFO L273 TraceCheckUtils]: 46: Hoare triple {14717#(<= (+ main_~j~0 13) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14717#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2018-11-23 13:05:00,932 INFO L273 TraceCheckUtils]: 47: Hoare triple {14717#(<= (+ main_~j~0 13) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14718#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2018-11-23 13:05:00,932 INFO L273 TraceCheckUtils]: 48: Hoare triple {14718#(<= (+ main_~j~0 12) 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); {14718#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2018-11-23 13:05:00,932 INFO L273 TraceCheckUtils]: 49: Hoare triple {14718#(<= (+ main_~j~0 12) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14718#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2018-11-23 13:05:00,933 INFO L273 TraceCheckUtils]: 50: Hoare triple {14718#(<= (+ main_~j~0 12) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14719#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2018-11-23 13:05:00,933 INFO L273 TraceCheckUtils]: 51: Hoare triple {14719#(<= (+ main_~j~0 11) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {14708#false} is VALID [2018-11-23 13:05:00,933 INFO L273 TraceCheckUtils]: 52: Hoare triple {14708#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14708#false} is VALID [2018-11-23 13:05:00,933 INFO L273 TraceCheckUtils]: 53: Hoare triple {14708#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14708#false} is VALID [2018-11-23 13:05:00,934 INFO L273 TraceCheckUtils]: 54: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,934 INFO L273 TraceCheckUtils]: 55: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,934 INFO L273 TraceCheckUtils]: 56: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,934 INFO L273 TraceCheckUtils]: 57: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,934 INFO L273 TraceCheckUtils]: 58: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,934 INFO L273 TraceCheckUtils]: 59: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,934 INFO L273 TraceCheckUtils]: 60: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,935 INFO L273 TraceCheckUtils]: 61: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,935 INFO L273 TraceCheckUtils]: 62: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,935 INFO L273 TraceCheckUtils]: 63: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,935 INFO L273 TraceCheckUtils]: 64: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,935 INFO L273 TraceCheckUtils]: 65: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,936 INFO L273 TraceCheckUtils]: 66: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,936 INFO L273 TraceCheckUtils]: 67: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,936 INFO L273 TraceCheckUtils]: 68: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,936 INFO L273 TraceCheckUtils]: 69: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,936 INFO L273 TraceCheckUtils]: 70: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,937 INFO L273 TraceCheckUtils]: 71: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,937 INFO L273 TraceCheckUtils]: 72: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,937 INFO L273 TraceCheckUtils]: 73: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,937 INFO L273 TraceCheckUtils]: 74: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,937 INFO L273 TraceCheckUtils]: 75: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,937 INFO L273 TraceCheckUtils]: 76: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,937 INFO L273 TraceCheckUtils]: 77: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,938 INFO L273 TraceCheckUtils]: 78: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,938 INFO L273 TraceCheckUtils]: 79: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,938 INFO L273 TraceCheckUtils]: 80: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,938 INFO L273 TraceCheckUtils]: 81: Hoare triple {14708#false} assume !(~j~0 < ~edgecount~0); {14708#false} is VALID [2018-11-23 13:05:00,938 INFO L273 TraceCheckUtils]: 82: Hoare triple {14708#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14708#false} is VALID [2018-11-23 13:05:00,938 INFO L273 TraceCheckUtils]: 83: Hoare triple {14708#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14708#false} is VALID [2018-11-23 13:05:00,938 INFO L273 TraceCheckUtils]: 84: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,938 INFO L273 TraceCheckUtils]: 85: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,938 INFO L273 TraceCheckUtils]: 86: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,939 INFO L273 TraceCheckUtils]: 87: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,939 INFO L273 TraceCheckUtils]: 88: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,939 INFO L273 TraceCheckUtils]: 89: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,939 INFO L273 TraceCheckUtils]: 90: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,939 INFO L273 TraceCheckUtils]: 91: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,939 INFO L273 TraceCheckUtils]: 92: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,940 INFO L273 TraceCheckUtils]: 93: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,940 INFO L273 TraceCheckUtils]: 94: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,940 INFO L273 TraceCheckUtils]: 95: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,940 INFO L273 TraceCheckUtils]: 96: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,940 INFO L273 TraceCheckUtils]: 97: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,940 INFO L273 TraceCheckUtils]: 98: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,941 INFO L273 TraceCheckUtils]: 99: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,941 INFO L273 TraceCheckUtils]: 100: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,941 INFO L273 TraceCheckUtils]: 101: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,941 INFO L273 TraceCheckUtils]: 102: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,941 INFO L273 TraceCheckUtils]: 103: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,941 INFO L273 TraceCheckUtils]: 104: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,941 INFO L273 TraceCheckUtils]: 105: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,941 INFO L273 TraceCheckUtils]: 106: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,941 INFO L273 TraceCheckUtils]: 107: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,942 INFO L273 TraceCheckUtils]: 108: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,942 INFO L273 TraceCheckUtils]: 109: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,942 INFO L273 TraceCheckUtils]: 110: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,942 INFO L273 TraceCheckUtils]: 111: Hoare triple {14708#false} assume !(~j~0 < ~edgecount~0); {14708#false} is VALID [2018-11-23 13:05:00,942 INFO L273 TraceCheckUtils]: 112: Hoare triple {14708#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14708#false} is VALID [2018-11-23 13:05:00,942 INFO L273 TraceCheckUtils]: 113: Hoare triple {14708#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14708#false} is VALID [2018-11-23 13:05:00,942 INFO L273 TraceCheckUtils]: 114: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,942 INFO L273 TraceCheckUtils]: 115: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,942 INFO L273 TraceCheckUtils]: 116: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,943 INFO L273 TraceCheckUtils]: 117: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,943 INFO L273 TraceCheckUtils]: 118: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,943 INFO L273 TraceCheckUtils]: 119: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,943 INFO L273 TraceCheckUtils]: 120: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,943 INFO L273 TraceCheckUtils]: 121: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,943 INFO L273 TraceCheckUtils]: 122: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,943 INFO L273 TraceCheckUtils]: 123: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,943 INFO L273 TraceCheckUtils]: 124: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,944 INFO L273 TraceCheckUtils]: 125: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,944 INFO L273 TraceCheckUtils]: 126: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,944 INFO L273 TraceCheckUtils]: 127: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,944 INFO L273 TraceCheckUtils]: 128: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,944 INFO L273 TraceCheckUtils]: 129: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,944 INFO L273 TraceCheckUtils]: 130: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,944 INFO L273 TraceCheckUtils]: 131: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,944 INFO L273 TraceCheckUtils]: 132: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,945 INFO L273 TraceCheckUtils]: 133: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,945 INFO L273 TraceCheckUtils]: 134: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,945 INFO L273 TraceCheckUtils]: 135: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,945 INFO L273 TraceCheckUtils]: 136: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,945 INFO L273 TraceCheckUtils]: 137: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,945 INFO L273 TraceCheckUtils]: 138: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,945 INFO L273 TraceCheckUtils]: 139: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,945 INFO L273 TraceCheckUtils]: 140: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,945 INFO L273 TraceCheckUtils]: 141: Hoare triple {14708#false} assume !(~j~0 < ~edgecount~0); {14708#false} is VALID [2018-11-23 13:05:00,946 INFO L273 TraceCheckUtils]: 142: Hoare triple {14708#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14708#false} is VALID [2018-11-23 13:05:00,953 INFO L273 TraceCheckUtils]: 143: Hoare triple {14708#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14708#false} is VALID [2018-11-23 13:05:00,953 INFO L273 TraceCheckUtils]: 144: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,953 INFO L273 TraceCheckUtils]: 145: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,953 INFO L273 TraceCheckUtils]: 146: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,953 INFO L273 TraceCheckUtils]: 147: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,953 INFO L273 TraceCheckUtils]: 148: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,954 INFO L273 TraceCheckUtils]: 149: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,954 INFO L273 TraceCheckUtils]: 150: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,954 INFO L273 TraceCheckUtils]: 151: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,954 INFO L273 TraceCheckUtils]: 152: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,954 INFO L273 TraceCheckUtils]: 153: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,954 INFO L273 TraceCheckUtils]: 154: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,955 INFO L273 TraceCheckUtils]: 155: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,955 INFO L273 TraceCheckUtils]: 156: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,955 INFO L273 TraceCheckUtils]: 157: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,955 INFO L273 TraceCheckUtils]: 158: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,955 INFO L273 TraceCheckUtils]: 159: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,955 INFO L273 TraceCheckUtils]: 160: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,956 INFO L273 TraceCheckUtils]: 161: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,956 INFO L273 TraceCheckUtils]: 162: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,956 INFO L273 TraceCheckUtils]: 163: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,956 INFO L273 TraceCheckUtils]: 164: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,956 INFO L273 TraceCheckUtils]: 165: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,956 INFO L273 TraceCheckUtils]: 166: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,957 INFO L273 TraceCheckUtils]: 167: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,957 INFO L273 TraceCheckUtils]: 168: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,957 INFO L273 TraceCheckUtils]: 169: Hoare triple {14708#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14708#false} is VALID [2018-11-23 13:05:00,957 INFO L273 TraceCheckUtils]: 170: Hoare triple {14708#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14708#false} is VALID [2018-11-23 13:05:00,957 INFO L273 TraceCheckUtils]: 171: Hoare triple {14708#false} assume !(~j~0 < ~edgecount~0); {14708#false} is VALID [2018-11-23 13:05:00,957 INFO L273 TraceCheckUtils]: 172: Hoare triple {14708#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14708#false} is VALID [2018-11-23 13:05:00,958 INFO L273 TraceCheckUtils]: 173: Hoare triple {14708#false} assume !(~i~0 < ~nodecount~0); {14708#false} is VALID [2018-11-23 13:05:00,958 INFO L273 TraceCheckUtils]: 174: Hoare triple {14708#false} ~i~0 := 0; {14708#false} is VALID [2018-11-23 13:05:00,958 INFO L273 TraceCheckUtils]: 175: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,958 INFO L273 TraceCheckUtils]: 176: Hoare triple {14708#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {14708#false} is VALID [2018-11-23 13:05:00,958 INFO L273 TraceCheckUtils]: 177: Hoare triple {14708#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14708#false} is VALID [2018-11-23 13:05:00,958 INFO L273 TraceCheckUtils]: 178: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,959 INFO L273 TraceCheckUtils]: 179: Hoare triple {14708#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {14708#false} is VALID [2018-11-23 13:05:00,959 INFO L273 TraceCheckUtils]: 180: Hoare triple {14708#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14708#false} is VALID [2018-11-23 13:05:00,959 INFO L273 TraceCheckUtils]: 181: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,959 INFO L273 TraceCheckUtils]: 182: Hoare triple {14708#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {14708#false} is VALID [2018-11-23 13:05:00,959 INFO L273 TraceCheckUtils]: 183: Hoare triple {14708#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14708#false} is VALID [2018-11-23 13:05:00,959 INFO L273 TraceCheckUtils]: 184: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,960 INFO L273 TraceCheckUtils]: 185: Hoare triple {14708#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {14708#false} is VALID [2018-11-23 13:05:00,960 INFO L273 TraceCheckUtils]: 186: Hoare triple {14708#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14708#false} is VALID [2018-11-23 13:05:00,960 INFO L273 TraceCheckUtils]: 187: Hoare triple {14708#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); {14708#false} is VALID [2018-11-23 13:05:00,960 INFO L273 TraceCheckUtils]: 188: Hoare triple {14708#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {14708#false} is VALID [2018-11-23 13:05:00,960 INFO L273 TraceCheckUtils]: 189: Hoare triple {14708#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {14708#false} is VALID [2018-11-23 13:05:00,960 INFO L273 TraceCheckUtils]: 190: Hoare triple {14708#false} assume !(~i~0 < ~edgecount~0); {14708#false} is VALID [2018-11-23 13:05:00,961 INFO L273 TraceCheckUtils]: 191: Hoare triple {14708#false} ~i~0 := 0; {14708#false} is VALID [2018-11-23 13:05:00,961 INFO L273 TraceCheckUtils]: 192: Hoare triple {14708#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14708#false} is VALID [2018-11-23 13:05:00,961 INFO L256 TraceCheckUtils]: 193: Hoare triple {14708#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {14708#false} is VALID [2018-11-23 13:05:00,961 INFO L273 TraceCheckUtils]: 194: Hoare triple {14708#false} ~cond := #in~cond; {14708#false} is VALID [2018-11-23 13:05:00,961 INFO L273 TraceCheckUtils]: 195: Hoare triple {14708#false} assume 0 == ~cond; {14708#false} is VALID [2018-11-23 13:05:00,962 INFO L273 TraceCheckUtils]: 196: Hoare triple {14708#false} assume !false; {14708#false} is VALID [2018-11-23 13:05:00,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3300 backedges. 1053 proven. 117 refuted. 0 times theorem prover too weak. 2130 trivial. 0 not checked. [2018-11-23 13:05:00,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:00,988 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-23 13:05:01,002 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:05:01,156 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:05:01,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:01,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:02,484 INFO L256 TraceCheckUtils]: 0: Hoare triple {14707#true} call ULTIMATE.init(); {14707#true} is VALID [2018-11-23 13:05:02,484 INFO L273 TraceCheckUtils]: 1: Hoare triple {14707#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {14707#true} is VALID [2018-11-23 13:05:02,484 INFO L273 TraceCheckUtils]: 2: Hoare triple {14707#true} assume true; {14707#true} is VALID [2018-11-23 13:05:02,485 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14707#true} {14707#true} #103#return; {14707#true} is VALID [2018-11-23 13:05:02,485 INFO L256 TraceCheckUtils]: 4: Hoare triple {14707#true} call #t~ret18 := main(); {14707#true} is VALID [2018-11-23 13:05:02,485 INFO L273 TraceCheckUtils]: 5: Hoare triple {14707#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {14707#true} is VALID [2018-11-23 13:05:02,485 INFO L273 TraceCheckUtils]: 6: Hoare triple {14707#true} assume !!(~i~0 < ~nodecount~0); {14707#true} is VALID [2018-11-23 13:05:02,486 INFO L273 TraceCheckUtils]: 7: Hoare triple {14707#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14707#true} is VALID [2018-11-23 13:05:02,486 INFO L273 TraceCheckUtils]: 8: Hoare triple {14707#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14707#true} is VALID [2018-11-23 13:05:02,486 INFO L273 TraceCheckUtils]: 9: Hoare triple {14707#true} assume !!(~i~0 < ~nodecount~0); {14707#true} is VALID [2018-11-23 13:05:02,486 INFO L273 TraceCheckUtils]: 10: Hoare triple {14707#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14707#true} is VALID [2018-11-23 13:05:02,486 INFO L273 TraceCheckUtils]: 11: Hoare triple {14707#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14707#true} is VALID [2018-11-23 13:05:02,486 INFO L273 TraceCheckUtils]: 12: Hoare triple {14707#true} assume !!(~i~0 < ~nodecount~0); {14707#true} is VALID [2018-11-23 13:05:02,486 INFO L273 TraceCheckUtils]: 13: Hoare triple {14707#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14707#true} is VALID [2018-11-23 13:05:02,486 INFO L273 TraceCheckUtils]: 14: Hoare triple {14707#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14707#true} is VALID [2018-11-23 13:05:02,487 INFO L273 TraceCheckUtils]: 15: Hoare triple {14707#true} assume !!(~i~0 < ~nodecount~0); {14707#true} is VALID [2018-11-23 13:05:02,487 INFO L273 TraceCheckUtils]: 16: Hoare triple {14707#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14707#true} is VALID [2018-11-23 13:05:02,487 INFO L273 TraceCheckUtils]: 17: Hoare triple {14707#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14707#true} is VALID [2018-11-23 13:05:02,487 INFO L273 TraceCheckUtils]: 18: Hoare triple {14707#true} assume !!(~i~0 < ~nodecount~0); {14707#true} is VALID [2018-11-23 13:05:02,487 INFO L273 TraceCheckUtils]: 19: Hoare triple {14707#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14707#true} is VALID [2018-11-23 13:05:02,487 INFO L273 TraceCheckUtils]: 20: Hoare triple {14707#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14707#true} is VALID [2018-11-23 13:05:02,487 INFO L273 TraceCheckUtils]: 21: Hoare triple {14707#true} assume !(~i~0 < ~nodecount~0); {14707#true} is VALID [2018-11-23 13:05:02,487 INFO L273 TraceCheckUtils]: 22: Hoare triple {14707#true} ~i~0 := 0; {14707#true} is VALID [2018-11-23 13:05:02,488 INFO L273 TraceCheckUtils]: 23: Hoare triple {14707#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14792#(<= 0 main_~j~0)} is VALID [2018-11-23 13:05:02,488 INFO L273 TraceCheckUtils]: 24: Hoare triple {14792#(<= 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); {14792#(<= 0 main_~j~0)} is VALID [2018-11-23 13:05:02,488 INFO L273 TraceCheckUtils]: 25: Hoare triple {14792#(<= 0 main_~j~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14792#(<= 0 main_~j~0)} is VALID [2018-11-23 13:05:02,489 INFO L273 TraceCheckUtils]: 26: Hoare triple {14792#(<= 0 main_~j~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14802#(<= 1 main_~j~0)} is VALID [2018-11-23 13:05:02,489 INFO L273 TraceCheckUtils]: 27: Hoare triple {14802#(<= 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); {14802#(<= 1 main_~j~0)} is VALID [2018-11-23 13:05:02,490 INFO L273 TraceCheckUtils]: 28: Hoare triple {14802#(<= 1 main_~j~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14802#(<= 1 main_~j~0)} is VALID [2018-11-23 13:05:02,490 INFO L273 TraceCheckUtils]: 29: Hoare triple {14802#(<= 1 main_~j~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14812#(<= 2 main_~j~0)} is VALID [2018-11-23 13:05:02,490 INFO L273 TraceCheckUtils]: 30: Hoare triple {14812#(<= 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); {14812#(<= 2 main_~j~0)} is VALID [2018-11-23 13:05:02,491 INFO L273 TraceCheckUtils]: 31: Hoare triple {14812#(<= 2 main_~j~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14812#(<= 2 main_~j~0)} is VALID [2018-11-23 13:05:02,492 INFO L273 TraceCheckUtils]: 32: Hoare triple {14812#(<= 2 main_~j~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14822#(<= 3 main_~j~0)} is VALID [2018-11-23 13:05:02,492 INFO L273 TraceCheckUtils]: 33: Hoare triple {14822#(<= 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); {14822#(<= 3 main_~j~0)} is VALID [2018-11-23 13:05:02,493 INFO L273 TraceCheckUtils]: 34: Hoare triple {14822#(<= 3 main_~j~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14822#(<= 3 main_~j~0)} is VALID [2018-11-23 13:05:02,493 INFO L273 TraceCheckUtils]: 35: Hoare triple {14822#(<= 3 main_~j~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14832#(<= 4 main_~j~0)} is VALID [2018-11-23 13:05:02,494 INFO L273 TraceCheckUtils]: 36: Hoare triple {14832#(<= 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); {14832#(<= 4 main_~j~0)} is VALID [2018-11-23 13:05:02,494 INFO L273 TraceCheckUtils]: 37: Hoare triple {14832#(<= 4 main_~j~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14832#(<= 4 main_~j~0)} is VALID [2018-11-23 13:05:02,495 INFO L273 TraceCheckUtils]: 38: Hoare triple {14832#(<= 4 main_~j~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14842#(<= 5 main_~j~0)} is VALID [2018-11-23 13:05:02,496 INFO L273 TraceCheckUtils]: 39: Hoare triple {14842#(<= 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); {14842#(<= 5 main_~j~0)} is VALID [2018-11-23 13:05:02,496 INFO L273 TraceCheckUtils]: 40: Hoare triple {14842#(<= 5 main_~j~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14842#(<= 5 main_~j~0)} is VALID [2018-11-23 13:05:02,497 INFO L273 TraceCheckUtils]: 41: Hoare triple {14842#(<= 5 main_~j~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14852#(<= 6 main_~j~0)} is VALID [2018-11-23 13:05:02,498 INFO L273 TraceCheckUtils]: 42: Hoare triple {14852#(<= 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); {14852#(<= 6 main_~j~0)} is VALID [2018-11-23 13:05:02,498 INFO L273 TraceCheckUtils]: 43: Hoare triple {14852#(<= 6 main_~j~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14852#(<= 6 main_~j~0)} is VALID [2018-11-23 13:05:02,499 INFO L273 TraceCheckUtils]: 44: Hoare triple {14852#(<= 6 main_~j~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14862#(<= 7 main_~j~0)} is VALID [2018-11-23 13:05:02,499 INFO L273 TraceCheckUtils]: 45: Hoare triple {14862#(<= 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); {14862#(<= 7 main_~j~0)} is VALID [2018-11-23 13:05:02,500 INFO L273 TraceCheckUtils]: 46: Hoare triple {14862#(<= 7 main_~j~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14862#(<= 7 main_~j~0)} is VALID [2018-11-23 13:05:02,501 INFO L273 TraceCheckUtils]: 47: Hoare triple {14862#(<= 7 main_~j~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14872#(<= 8 main_~j~0)} is VALID [2018-11-23 13:05:02,502 INFO L273 TraceCheckUtils]: 48: Hoare triple {14872#(<= 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,503 INFO L273 TraceCheckUtils]: 49: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,503 INFO L273 TraceCheckUtils]: 50: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,504 INFO L273 TraceCheckUtils]: 51: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,504 INFO L273 TraceCheckUtils]: 52: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,505 INFO L273 TraceCheckUtils]: 53: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,505 INFO L273 TraceCheckUtils]: 54: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,506 INFO L273 TraceCheckUtils]: 55: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,506 INFO L273 TraceCheckUtils]: 56: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,507 INFO L273 TraceCheckUtils]: 57: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,507 INFO L273 TraceCheckUtils]: 58: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,508 INFO L273 TraceCheckUtils]: 59: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,508 INFO L273 TraceCheckUtils]: 60: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,509 INFO L273 TraceCheckUtils]: 61: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,509 INFO L273 TraceCheckUtils]: 62: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,510 INFO L273 TraceCheckUtils]: 63: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,510 INFO L273 TraceCheckUtils]: 64: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,511 INFO L273 TraceCheckUtils]: 65: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,511 INFO L273 TraceCheckUtils]: 66: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,512 INFO L273 TraceCheckUtils]: 67: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,512 INFO L273 TraceCheckUtils]: 68: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,513 INFO L273 TraceCheckUtils]: 69: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,513 INFO L273 TraceCheckUtils]: 70: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,514 INFO L273 TraceCheckUtils]: 71: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,514 INFO L273 TraceCheckUtils]: 72: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,515 INFO L273 TraceCheckUtils]: 73: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,515 INFO L273 TraceCheckUtils]: 74: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,516 INFO L273 TraceCheckUtils]: 75: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,516 INFO L273 TraceCheckUtils]: 76: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,517 INFO L273 TraceCheckUtils]: 77: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,517 INFO L273 TraceCheckUtils]: 78: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,518 INFO L273 TraceCheckUtils]: 79: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,518 INFO L273 TraceCheckUtils]: 80: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,519 INFO L273 TraceCheckUtils]: 81: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,519 INFO L273 TraceCheckUtils]: 82: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,520 INFO L273 TraceCheckUtils]: 83: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,520 INFO L273 TraceCheckUtils]: 84: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,521 INFO L273 TraceCheckUtils]: 85: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,521 INFO L273 TraceCheckUtils]: 86: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,522 INFO L273 TraceCheckUtils]: 87: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,523 INFO L273 TraceCheckUtils]: 88: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,523 INFO L273 TraceCheckUtils]: 89: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,524 INFO L273 TraceCheckUtils]: 90: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,524 INFO L273 TraceCheckUtils]: 91: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,525 INFO L273 TraceCheckUtils]: 92: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,525 INFO L273 TraceCheckUtils]: 93: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,526 INFO L273 TraceCheckUtils]: 94: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,526 INFO L273 TraceCheckUtils]: 95: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,527 INFO L273 TraceCheckUtils]: 96: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,527 INFO L273 TraceCheckUtils]: 97: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,528 INFO L273 TraceCheckUtils]: 98: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,528 INFO L273 TraceCheckUtils]: 99: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,529 INFO L273 TraceCheckUtils]: 100: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,529 INFO L273 TraceCheckUtils]: 101: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,530 INFO L273 TraceCheckUtils]: 102: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,530 INFO L273 TraceCheckUtils]: 103: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,531 INFO L273 TraceCheckUtils]: 104: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,531 INFO L273 TraceCheckUtils]: 105: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,532 INFO L273 TraceCheckUtils]: 106: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,532 INFO L273 TraceCheckUtils]: 107: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,533 INFO L273 TraceCheckUtils]: 108: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,533 INFO L273 TraceCheckUtils]: 109: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,534 INFO L273 TraceCheckUtils]: 110: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,534 INFO L273 TraceCheckUtils]: 111: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,535 INFO L273 TraceCheckUtils]: 112: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,535 INFO L273 TraceCheckUtils]: 113: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,536 INFO L273 TraceCheckUtils]: 114: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,536 INFO L273 TraceCheckUtils]: 115: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,537 INFO L273 TraceCheckUtils]: 116: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,537 INFO L273 TraceCheckUtils]: 117: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,538 INFO L273 TraceCheckUtils]: 118: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,538 INFO L273 TraceCheckUtils]: 119: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,539 INFO L273 TraceCheckUtils]: 120: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,539 INFO L273 TraceCheckUtils]: 121: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,540 INFO L273 TraceCheckUtils]: 122: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,540 INFO L273 TraceCheckUtils]: 123: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,541 INFO L273 TraceCheckUtils]: 124: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,541 INFO L273 TraceCheckUtils]: 125: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,542 INFO L273 TraceCheckUtils]: 126: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,542 INFO L273 TraceCheckUtils]: 127: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,543 INFO L273 TraceCheckUtils]: 128: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,543 INFO L273 TraceCheckUtils]: 129: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,544 INFO L273 TraceCheckUtils]: 130: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,544 INFO L273 TraceCheckUtils]: 131: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,545 INFO L273 TraceCheckUtils]: 132: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,545 INFO L273 TraceCheckUtils]: 133: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,546 INFO L273 TraceCheckUtils]: 134: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,546 INFO L273 TraceCheckUtils]: 135: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,547 INFO L273 TraceCheckUtils]: 136: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,547 INFO L273 TraceCheckUtils]: 137: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,548 INFO L273 TraceCheckUtils]: 138: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,548 INFO L273 TraceCheckUtils]: 139: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,549 INFO L273 TraceCheckUtils]: 140: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,550 INFO L273 TraceCheckUtils]: 141: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,550 INFO L273 TraceCheckUtils]: 142: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,551 INFO L273 TraceCheckUtils]: 143: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,551 INFO L273 TraceCheckUtils]: 144: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,552 INFO L273 TraceCheckUtils]: 145: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,552 INFO L273 TraceCheckUtils]: 146: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,553 INFO L273 TraceCheckUtils]: 147: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,553 INFO L273 TraceCheckUtils]: 148: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,554 INFO L273 TraceCheckUtils]: 149: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,554 INFO L273 TraceCheckUtils]: 150: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,555 INFO L273 TraceCheckUtils]: 151: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,555 INFO L273 TraceCheckUtils]: 152: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,556 INFO L273 TraceCheckUtils]: 153: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,556 INFO L273 TraceCheckUtils]: 154: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,557 INFO L273 TraceCheckUtils]: 155: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,557 INFO L273 TraceCheckUtils]: 156: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,558 INFO L273 TraceCheckUtils]: 157: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,558 INFO L273 TraceCheckUtils]: 158: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,559 INFO L273 TraceCheckUtils]: 159: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,559 INFO L273 TraceCheckUtils]: 160: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,560 INFO L273 TraceCheckUtils]: 161: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,560 INFO L273 TraceCheckUtils]: 162: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,561 INFO L273 TraceCheckUtils]: 163: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,561 INFO L273 TraceCheckUtils]: 164: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,562 INFO L273 TraceCheckUtils]: 165: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,562 INFO L273 TraceCheckUtils]: 166: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,563 INFO L273 TraceCheckUtils]: 167: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,563 INFO L273 TraceCheckUtils]: 168: Hoare triple {14876#(<= 9 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); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,564 INFO L273 TraceCheckUtils]: 169: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,564 INFO L273 TraceCheckUtils]: 170: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,565 INFO L273 TraceCheckUtils]: 171: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,565 INFO L273 TraceCheckUtils]: 172: Hoare triple {14876#(<= 9 main_~edgecount~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,566 INFO L273 TraceCheckUtils]: 173: Hoare triple {14876#(<= 9 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {14876#(<= 9 main_~edgecount~0)} is VALID [2018-11-23 13:05:02,567 INFO L273 TraceCheckUtils]: 174: Hoare triple {14876#(<= 9 main_~edgecount~0)} ~i~0 := 0; {15255#(and (<= 9 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:05:02,568 INFO L273 TraceCheckUtils]: 175: Hoare triple {15255#(and (<= 9 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); {15255#(and (<= 9 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:05:02,568 INFO L273 TraceCheckUtils]: 176: Hoare triple {15255#(and (<= 9 main_~edgecount~0) (<= main_~i~0 0))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {15255#(and (<= 9 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2018-11-23 13:05:02,569 INFO L273 TraceCheckUtils]: 177: Hoare triple {15255#(and (<= 9 main_~edgecount~0) (<= main_~i~0 0))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15265#(and (<= 9 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:05:02,570 INFO L273 TraceCheckUtils]: 178: Hoare triple {15265#(and (<= 9 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); {15265#(and (<= 9 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:05:02,571 INFO L273 TraceCheckUtils]: 179: Hoare triple {15265#(and (<= 9 main_~edgecount~0) (<= main_~i~0 1))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {15265#(and (<= 9 main_~edgecount~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:05:02,572 INFO L273 TraceCheckUtils]: 180: Hoare triple {15265#(and (<= 9 main_~edgecount~0) (<= main_~i~0 1))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15275#(and (<= 9 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:05:02,573 INFO L273 TraceCheckUtils]: 181: Hoare triple {15275#(and (<= 9 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); {15275#(and (<= 9 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:05:02,573 INFO L273 TraceCheckUtils]: 182: Hoare triple {15275#(and (<= 9 main_~edgecount~0) (<= main_~i~0 2))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {15275#(and (<= 9 main_~edgecount~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:05:02,574 INFO L273 TraceCheckUtils]: 183: Hoare triple {15275#(and (<= 9 main_~edgecount~0) (<= main_~i~0 2))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15285#(and (<= main_~i~0 3) (<= 9 main_~edgecount~0))} is VALID [2018-11-23 13:05:02,575 INFO L273 TraceCheckUtils]: 184: Hoare triple {15285#(and (<= main_~i~0 3) (<= 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); {15285#(and (<= main_~i~0 3) (<= 9 main_~edgecount~0))} is VALID [2018-11-23 13:05:02,576 INFO L273 TraceCheckUtils]: 185: Hoare triple {15285#(and (<= main_~i~0 3) (<= 9 main_~edgecount~0))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {15285#(and (<= main_~i~0 3) (<= 9 main_~edgecount~0))} is VALID [2018-11-23 13:05:02,577 INFO L273 TraceCheckUtils]: 186: Hoare triple {15285#(and (<= main_~i~0 3) (<= 9 main_~edgecount~0))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15295#(and (<= 9 main_~edgecount~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:05:02,578 INFO L273 TraceCheckUtils]: 187: Hoare triple {15295#(and (<= 9 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); {15295#(and (<= 9 main_~edgecount~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:05:02,579 INFO L273 TraceCheckUtils]: 188: Hoare triple {15295#(and (<= 9 main_~edgecount~0) (<= main_~i~0 4))} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {15295#(and (<= 9 main_~edgecount~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:05:02,580 INFO L273 TraceCheckUtils]: 189: Hoare triple {15295#(and (<= 9 main_~edgecount~0) (<= main_~i~0 4))} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {15305#(and (<= 9 main_~edgecount~0) (<= main_~i~0 5))} is VALID [2018-11-23 13:05:02,580 INFO L273 TraceCheckUtils]: 190: Hoare triple {15305#(and (<= 9 main_~edgecount~0) (<= main_~i~0 5))} assume !(~i~0 < ~edgecount~0); {14708#false} is VALID [2018-11-23 13:05:02,581 INFO L273 TraceCheckUtils]: 191: Hoare triple {14708#false} ~i~0 := 0; {14708#false} is VALID [2018-11-23 13:05:02,581 INFO L273 TraceCheckUtils]: 192: Hoare triple {14708#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14708#false} is VALID [2018-11-23 13:05:02,581 INFO L256 TraceCheckUtils]: 193: Hoare triple {14708#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {14708#false} is VALID [2018-11-23 13:05:02,581 INFO L273 TraceCheckUtils]: 194: Hoare triple {14708#false} ~cond := #in~cond; {14708#false} is VALID [2018-11-23 13:05:02,581 INFO L273 TraceCheckUtils]: 195: Hoare triple {14708#false} assume 0 == ~cond; {14708#false} is VALID [2018-11-23 13:05:02,582 INFO L273 TraceCheckUtils]: 196: Hoare triple {14708#false} assume !false; {14708#false} is VALID [2018-11-23 13:05:02,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3300 backedges. 97 proven. 996 refuted. 0 times theorem prover too weak. 2207 trivial. 0 not checked. [2018-11-23 13:05:02,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:02,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 29 [2018-11-23 13:05:02,632 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 197 [2018-11-23 13:05:02,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:02,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 13:05:02,780 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:02,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 13:05:02,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 13:05:02,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2018-11-23 13:05:02,781 INFO L87 Difference]: Start difference. First operand 202 states and 255 transitions. Second operand 29 states. [2018-11-23 13:05:07,882 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-11-23 13:05:11,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:11,843 INFO L93 Difference]: Finished difference Result 482 states and 627 transitions. [2018-11-23 13:05:11,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-11-23 13:05:11,843 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 197 [2018-11-23 13:05:11,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:11,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:05:11,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 459 transitions. [2018-11-23 13:05:11,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:05:11,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 459 transitions. [2018-11-23 13:05:11,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 86 states and 459 transitions. [2018-11-23 13:05:12,432 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 459 edges. 459 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:12,439 INFO L225 Difference]: With dead ends: 482 [2018-11-23 13:05:12,440 INFO L226 Difference]: Without dead ends: 332 [2018-11-23 13:05:12,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3752 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2111, Invalid=10099, Unknown=0, NotChecked=0, Total=12210 [2018-11-23 13:05:12,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-11-23 13:05:12,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 220. [2018-11-23 13:05:12,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:12,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 332 states. Second operand 220 states. [2018-11-23 13:05:12,920 INFO L74 IsIncluded]: Start isIncluded. First operand 332 states. Second operand 220 states. [2018-11-23 13:05:12,921 INFO L87 Difference]: Start difference. First operand 332 states. Second operand 220 states. [2018-11-23 13:05:12,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:12,927 INFO L93 Difference]: Finished difference Result 332 states and 427 transitions. [2018-11-23 13:05:12,927 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 427 transitions. [2018-11-23 13:05:12,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:12,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:12,928 INFO L74 IsIncluded]: Start isIncluded. First operand 220 states. Second operand 332 states. [2018-11-23 13:05:12,929 INFO L87 Difference]: Start difference. First operand 220 states. Second operand 332 states. [2018-11-23 13:05:12,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:12,936 INFO L93 Difference]: Finished difference Result 332 states and 427 transitions. [2018-11-23 13:05:12,937 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 427 transitions. [2018-11-23 13:05:12,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:12,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:12,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:12,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:12,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-11-23 13:05:12,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 278 transitions. [2018-11-23 13:05:12,942 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 278 transitions. Word has length 197 [2018-11-23 13:05:12,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:12,943 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 278 transitions. [2018-11-23 13:05:12,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 13:05:12,943 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 278 transitions. [2018-11-23 13:05:12,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-23 13:05:12,944 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:12,944 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 50, 6, 6, 6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:12,945 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:12,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:12,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1839613838, now seen corresponding path program 11 times [2018-11-23 13:05:12,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:12,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:12,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:12,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:12,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:13,254 INFO L256 TraceCheckUtils]: 0: Hoare triple {17108#true} call ULTIMATE.init(); {17108#true} is VALID [2018-11-23 13:05:13,254 INFO L273 TraceCheckUtils]: 1: Hoare triple {17108#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~INFINITY~0 := 899; {17108#true} is VALID [2018-11-23 13:05:13,254 INFO L273 TraceCheckUtils]: 2: Hoare triple {17108#true} assume true; {17108#true} is VALID [2018-11-23 13:05:13,255 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17108#true} {17108#true} #103#return; {17108#true} is VALID [2018-11-23 13:05:13,255 INFO L256 TraceCheckUtils]: 4: Hoare triple {17108#true} call #t~ret18 := main(); {17108#true} is VALID [2018-11-23 13:05:13,258 INFO L273 TraceCheckUtils]: 5: Hoare triple {17108#true} ~nodecount~0 := 5;~edgecount~0 := 20;~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.alloc(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.alloc(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~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; {17110#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:13,258 INFO L273 TraceCheckUtils]: 6: Hoare triple {17110#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17110#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:13,260 INFO L273 TraceCheckUtils]: 7: Hoare triple {17110#(<= 20 main_~edgecount~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17110#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:13,260 INFO L273 TraceCheckUtils]: 8: Hoare triple {17110#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17110#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:13,261 INFO L273 TraceCheckUtils]: 9: Hoare triple {17110#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17110#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:13,261 INFO L273 TraceCheckUtils]: 10: Hoare triple {17110#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17110#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:13,262 INFO L273 TraceCheckUtils]: 11: Hoare triple {17110#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17110#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:13,262 INFO L273 TraceCheckUtils]: 12: Hoare triple {17110#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17110#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:13,263 INFO L273 TraceCheckUtils]: 13: Hoare triple {17110#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17110#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:13,263 INFO L273 TraceCheckUtils]: 14: Hoare triple {17110#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17110#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:13,264 INFO L273 TraceCheckUtils]: 15: Hoare triple {17110#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17110#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:13,264 INFO L273 TraceCheckUtils]: 16: Hoare triple {17110#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17110#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:13,265 INFO L273 TraceCheckUtils]: 17: Hoare triple {17110#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17110#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:13,265 INFO L273 TraceCheckUtils]: 18: Hoare triple {17110#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0); {17110#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:13,266 INFO L273 TraceCheckUtils]: 19: Hoare triple {17110#(<= 20 main_~edgecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17110#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:13,266 INFO L273 TraceCheckUtils]: 20: Hoare triple {17110#(<= 20 main_~edgecount~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17110#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:13,267 INFO L273 TraceCheckUtils]: 21: Hoare triple {17110#(<= 20 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {17110#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:13,267 INFO L273 TraceCheckUtils]: 22: Hoare triple {17110#(<= 20 main_~edgecount~0)} ~i~0 := 0; {17110#(<= 20 main_~edgecount~0)} is VALID [2018-11-23 13:05:13,268 INFO L273 TraceCheckUtils]: 23: Hoare triple {17110#(<= 20 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {17111#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} is VALID [2018-11-23 13:05:13,269 INFO L273 TraceCheckUtils]: 24: Hoare triple {17111#(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); {17111#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} is VALID [2018-11-23 13:05:13,270 INFO L273 TraceCheckUtils]: 25: Hoare triple {17111#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17111#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} is VALID [2018-11-23 13:05:13,270 INFO L273 TraceCheckUtils]: 26: Hoare triple {17111#(and (<= 20 main_~edgecount~0) (= main_~j~0 0))} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17112#(<= (+ main_~j~0 19) main_~edgecount~0)} is VALID [2018-11-23 13:05:13,271 INFO L273 TraceCheckUtils]: 27: Hoare triple {17112#(<= (+ main_~j~0 19) 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); {17112#(<= (+ main_~j~0 19) main_~edgecount~0)} is VALID [2018-11-23 13:05:13,272 INFO L273 TraceCheckUtils]: 28: Hoare triple {17112#(<= (+ main_~j~0 19) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17112#(<= (+ main_~j~0 19) main_~edgecount~0)} is VALID [2018-11-23 13:05:13,272 INFO L273 TraceCheckUtils]: 29: Hoare triple {17112#(<= (+ main_~j~0 19) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17113#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2018-11-23 13:05:13,273 INFO L273 TraceCheckUtils]: 30: Hoare triple {17113#(<= (+ main_~j~0 18) 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); {17113#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2018-11-23 13:05:13,273 INFO L273 TraceCheckUtils]: 31: Hoare triple {17113#(<= (+ main_~j~0 18) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17113#(<= (+ main_~j~0 18) main_~edgecount~0)} is VALID [2018-11-23 13:05:13,274 INFO L273 TraceCheckUtils]: 32: Hoare triple {17113#(<= (+ main_~j~0 18) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17114#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2018-11-23 13:05:13,275 INFO L273 TraceCheckUtils]: 33: Hoare triple {17114#(<= (+ main_~j~0 17) 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); {17114#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2018-11-23 13:05:13,275 INFO L273 TraceCheckUtils]: 34: Hoare triple {17114#(<= (+ main_~j~0 17) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17114#(<= (+ main_~j~0 17) main_~edgecount~0)} is VALID [2018-11-23 13:05:13,276 INFO L273 TraceCheckUtils]: 35: Hoare triple {17114#(<= (+ main_~j~0 17) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17115#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2018-11-23 13:05:13,277 INFO L273 TraceCheckUtils]: 36: Hoare triple {17115#(<= (+ main_~j~0 16) 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); {17115#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2018-11-23 13:05:13,277 INFO L273 TraceCheckUtils]: 37: Hoare triple {17115#(<= (+ main_~j~0 16) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17115#(<= (+ main_~j~0 16) main_~edgecount~0)} is VALID [2018-11-23 13:05:13,278 INFO L273 TraceCheckUtils]: 38: Hoare triple {17115#(<= (+ main_~j~0 16) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17116#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2018-11-23 13:05:13,279 INFO L273 TraceCheckUtils]: 39: Hoare triple {17116#(<= (+ main_~j~0 15) 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); {17116#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2018-11-23 13:05:13,279 INFO L273 TraceCheckUtils]: 40: Hoare triple {17116#(<= (+ main_~j~0 15) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17116#(<= (+ main_~j~0 15) main_~edgecount~0)} is VALID [2018-11-23 13:05:13,280 INFO L273 TraceCheckUtils]: 41: Hoare triple {17116#(<= (+ main_~j~0 15) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17117#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2018-11-23 13:05:13,280 INFO L273 TraceCheckUtils]: 42: Hoare triple {17117#(<= (+ main_~j~0 14) 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); {17117#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2018-11-23 13:05:13,281 INFO L273 TraceCheckUtils]: 43: Hoare triple {17117#(<= (+ main_~j~0 14) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17117#(<= (+ main_~j~0 14) main_~edgecount~0)} is VALID [2018-11-23 13:05:13,282 INFO L273 TraceCheckUtils]: 44: Hoare triple {17117#(<= (+ main_~j~0 14) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17118#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2018-11-23 13:05:13,282 INFO L273 TraceCheckUtils]: 45: Hoare triple {17118#(<= (+ main_~j~0 13) 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); {17118#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2018-11-23 13:05:13,283 INFO L273 TraceCheckUtils]: 46: Hoare triple {17118#(<= (+ main_~j~0 13) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17118#(<= (+ main_~j~0 13) main_~edgecount~0)} is VALID [2018-11-23 13:05:13,284 INFO L273 TraceCheckUtils]: 47: Hoare triple {17118#(<= (+ main_~j~0 13) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17119#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2018-11-23 13:05:13,284 INFO L273 TraceCheckUtils]: 48: Hoare triple {17119#(<= (+ main_~j~0 12) 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); {17119#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2018-11-23 13:05:13,285 INFO L273 TraceCheckUtils]: 49: Hoare triple {17119#(<= (+ main_~j~0 12) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17119#(<= (+ main_~j~0 12) main_~edgecount~0)} is VALID [2018-11-23 13:05:13,286 INFO L273 TraceCheckUtils]: 50: Hoare triple {17119#(<= (+ main_~j~0 12) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17120#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2018-11-23 13:05:13,286 INFO L273 TraceCheckUtils]: 51: Hoare triple {17120#(<= (+ main_~j~0 11) 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); {17120#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2018-11-23 13:05:13,287 INFO L273 TraceCheckUtils]: 52: Hoare triple {17120#(<= (+ main_~j~0 11) main_~edgecount~0)} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17120#(<= (+ main_~j~0 11) main_~edgecount~0)} is VALID [2018-11-23 13:05:13,287 INFO L273 TraceCheckUtils]: 53: Hoare triple {17120#(<= (+ main_~j~0 11) main_~edgecount~0)} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17121#(<= (+ main_~j~0 10) main_~edgecount~0)} is VALID [2018-11-23 13:05:13,288 INFO L273 TraceCheckUtils]: 54: Hoare triple {17121#(<= (+ main_~j~0 10) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {17109#false} is VALID [2018-11-23 13:05:13,288 INFO L273 TraceCheckUtils]: 55: Hoare triple {17109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17109#false} is VALID [2018-11-23 13:05:13,289 INFO L273 TraceCheckUtils]: 56: Hoare triple {17109#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {17109#false} is VALID [2018-11-23 13:05:13,289 INFO L273 TraceCheckUtils]: 57: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,289 INFO L273 TraceCheckUtils]: 58: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,289 INFO L273 TraceCheckUtils]: 59: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,289 INFO L273 TraceCheckUtils]: 60: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,290 INFO L273 TraceCheckUtils]: 61: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,290 INFO L273 TraceCheckUtils]: 62: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,290 INFO L273 TraceCheckUtils]: 63: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,290 INFO L273 TraceCheckUtils]: 64: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,290 INFO L273 TraceCheckUtils]: 65: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,291 INFO L273 TraceCheckUtils]: 66: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,291 INFO L273 TraceCheckUtils]: 67: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,291 INFO L273 TraceCheckUtils]: 68: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,291 INFO L273 TraceCheckUtils]: 69: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,291 INFO L273 TraceCheckUtils]: 70: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,292 INFO L273 TraceCheckUtils]: 71: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,292 INFO L273 TraceCheckUtils]: 72: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,292 INFO L273 TraceCheckUtils]: 73: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,292 INFO L273 TraceCheckUtils]: 74: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,292 INFO L273 TraceCheckUtils]: 75: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,292 INFO L273 TraceCheckUtils]: 76: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,293 INFO L273 TraceCheckUtils]: 77: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,293 INFO L273 TraceCheckUtils]: 78: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,293 INFO L273 TraceCheckUtils]: 79: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,293 INFO L273 TraceCheckUtils]: 80: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,293 INFO L273 TraceCheckUtils]: 81: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,293 INFO L273 TraceCheckUtils]: 82: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,293 INFO L273 TraceCheckUtils]: 83: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,293 INFO L273 TraceCheckUtils]: 84: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,293 INFO L273 TraceCheckUtils]: 85: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,294 INFO L273 TraceCheckUtils]: 86: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,294 INFO L273 TraceCheckUtils]: 87: Hoare triple {17109#false} assume !(~j~0 < ~edgecount~0); {17109#false} is VALID [2018-11-23 13:05:13,294 INFO L273 TraceCheckUtils]: 88: Hoare triple {17109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17109#false} is VALID [2018-11-23 13:05:13,294 INFO L273 TraceCheckUtils]: 89: Hoare triple {17109#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {17109#false} is VALID [2018-11-23 13:05:13,294 INFO L273 TraceCheckUtils]: 90: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,294 INFO L273 TraceCheckUtils]: 91: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,294 INFO L273 TraceCheckUtils]: 92: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,295 INFO L273 TraceCheckUtils]: 93: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,295 INFO L273 TraceCheckUtils]: 94: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,295 INFO L273 TraceCheckUtils]: 95: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,295 INFO L273 TraceCheckUtils]: 96: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,295 INFO L273 TraceCheckUtils]: 97: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,295 INFO L273 TraceCheckUtils]: 98: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,295 INFO L273 TraceCheckUtils]: 99: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,295 INFO L273 TraceCheckUtils]: 100: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,295 INFO L273 TraceCheckUtils]: 101: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,296 INFO L273 TraceCheckUtils]: 102: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,296 INFO L273 TraceCheckUtils]: 103: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,296 INFO L273 TraceCheckUtils]: 104: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,296 INFO L273 TraceCheckUtils]: 105: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,296 INFO L273 TraceCheckUtils]: 106: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,296 INFO L273 TraceCheckUtils]: 107: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,296 INFO L273 TraceCheckUtils]: 108: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,296 INFO L273 TraceCheckUtils]: 109: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,296 INFO L273 TraceCheckUtils]: 110: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,297 INFO L273 TraceCheckUtils]: 111: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,297 INFO L273 TraceCheckUtils]: 112: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,297 INFO L273 TraceCheckUtils]: 113: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,297 INFO L273 TraceCheckUtils]: 114: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,297 INFO L273 TraceCheckUtils]: 115: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,297 INFO L273 TraceCheckUtils]: 116: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,297 INFO L273 TraceCheckUtils]: 117: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,297 INFO L273 TraceCheckUtils]: 118: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,298 INFO L273 TraceCheckUtils]: 119: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,298 INFO L273 TraceCheckUtils]: 120: Hoare triple {17109#false} assume !(~j~0 < ~edgecount~0); {17109#false} is VALID [2018-11-23 13:05:13,298 INFO L273 TraceCheckUtils]: 121: Hoare triple {17109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17109#false} is VALID [2018-11-23 13:05:13,298 INFO L273 TraceCheckUtils]: 122: Hoare triple {17109#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {17109#false} is VALID [2018-11-23 13:05:13,298 INFO L273 TraceCheckUtils]: 123: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,298 INFO L273 TraceCheckUtils]: 124: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,298 INFO L273 TraceCheckUtils]: 125: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,298 INFO L273 TraceCheckUtils]: 126: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,298 INFO L273 TraceCheckUtils]: 127: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,298 INFO L273 TraceCheckUtils]: 128: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,299 INFO L273 TraceCheckUtils]: 129: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,299 INFO L273 TraceCheckUtils]: 130: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,299 INFO L273 TraceCheckUtils]: 131: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,299 INFO L273 TraceCheckUtils]: 132: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,299 INFO L273 TraceCheckUtils]: 133: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,299 INFO L273 TraceCheckUtils]: 134: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,299 INFO L273 TraceCheckUtils]: 135: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,299 INFO L273 TraceCheckUtils]: 136: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,299 INFO L273 TraceCheckUtils]: 137: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,300 INFO L273 TraceCheckUtils]: 138: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,300 INFO L273 TraceCheckUtils]: 139: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,300 INFO L273 TraceCheckUtils]: 140: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,300 INFO L273 TraceCheckUtils]: 141: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,300 INFO L273 TraceCheckUtils]: 142: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,300 INFO L273 TraceCheckUtils]: 143: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,300 INFO L273 TraceCheckUtils]: 144: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,300 INFO L273 TraceCheckUtils]: 145: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,300 INFO L273 TraceCheckUtils]: 146: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,301 INFO L273 TraceCheckUtils]: 147: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,301 INFO L273 TraceCheckUtils]: 148: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,301 INFO L273 TraceCheckUtils]: 149: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,301 INFO L273 TraceCheckUtils]: 150: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,301 INFO L273 TraceCheckUtils]: 151: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,301 INFO L273 TraceCheckUtils]: 152: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,301 INFO L273 TraceCheckUtils]: 153: Hoare triple {17109#false} assume !(~j~0 < ~edgecount~0); {17109#false} is VALID [2018-11-23 13:05:13,301 INFO L273 TraceCheckUtils]: 154: Hoare triple {17109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17109#false} is VALID [2018-11-23 13:05:13,301 INFO L273 TraceCheckUtils]: 155: Hoare triple {17109#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {17109#false} is VALID [2018-11-23 13:05:13,301 INFO L273 TraceCheckUtils]: 156: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,302 INFO L273 TraceCheckUtils]: 157: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,302 INFO L273 TraceCheckUtils]: 158: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,302 INFO L273 TraceCheckUtils]: 159: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,302 INFO L273 TraceCheckUtils]: 160: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,302 INFO L273 TraceCheckUtils]: 161: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,302 INFO L273 TraceCheckUtils]: 162: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,302 INFO L273 TraceCheckUtils]: 163: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,302 INFO L273 TraceCheckUtils]: 164: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,302 INFO L273 TraceCheckUtils]: 165: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,303 INFO L273 TraceCheckUtils]: 166: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,303 INFO L273 TraceCheckUtils]: 167: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,303 INFO L273 TraceCheckUtils]: 168: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,303 INFO L273 TraceCheckUtils]: 169: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,303 INFO L273 TraceCheckUtils]: 170: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,303 INFO L273 TraceCheckUtils]: 171: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,303 INFO L273 TraceCheckUtils]: 172: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,303 INFO L273 TraceCheckUtils]: 173: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,303 INFO L273 TraceCheckUtils]: 174: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,304 INFO L273 TraceCheckUtils]: 175: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,304 INFO L273 TraceCheckUtils]: 176: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,304 INFO L273 TraceCheckUtils]: 177: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,304 INFO L273 TraceCheckUtils]: 178: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,304 INFO L273 TraceCheckUtils]: 179: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,304 INFO L273 TraceCheckUtils]: 180: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,304 INFO L273 TraceCheckUtils]: 181: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,304 INFO L273 TraceCheckUtils]: 182: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,304 INFO L273 TraceCheckUtils]: 183: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,304 INFO L273 TraceCheckUtils]: 184: Hoare triple {17109#false} assume #t~mem7 > #t~mem5 + #t~mem6;havoc #t~mem6;havoc #t~mem7;havoc #t~mem5;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; {17109#false} is VALID [2018-11-23 13:05:13,305 INFO L273 TraceCheckUtils]: 185: Hoare triple {17109#false} #t~post2 := ~j~0;~j~0 := 1 + #t~post2;havoc #t~post2; {17109#false} is VALID [2018-11-23 13:05:13,305 INFO L273 TraceCheckUtils]: 186: Hoare triple {17109#false} assume !(~j~0 < ~edgecount~0); {17109#false} is VALID [2018-11-23 13:05:13,305 INFO L273 TraceCheckUtils]: 187: Hoare triple {17109#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17109#false} is VALID [2018-11-23 13:05:13,305 INFO L273 TraceCheckUtils]: 188: Hoare triple {17109#false} assume !(~i~0 < ~nodecount~0); {17109#false} is VALID [2018-11-23 13:05:13,305 INFO L273 TraceCheckUtils]: 189: Hoare triple {17109#false} ~i~0 := 0; {17109#false} is VALID [2018-11-23 13:05:13,305 INFO L273 TraceCheckUtils]: 190: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,305 INFO L273 TraceCheckUtils]: 191: Hoare triple {17109#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {17109#false} is VALID [2018-11-23 13:05:13,305 INFO L273 TraceCheckUtils]: 192: Hoare triple {17109#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {17109#false} is VALID [2018-11-23 13:05:13,306 INFO L273 TraceCheckUtils]: 193: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,306 INFO L273 TraceCheckUtils]: 194: Hoare triple {17109#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {17109#false} is VALID [2018-11-23 13:05:13,306 INFO L273 TraceCheckUtils]: 195: Hoare triple {17109#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {17109#false} is VALID [2018-11-23 13:05:13,306 INFO L273 TraceCheckUtils]: 196: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,306 INFO L273 TraceCheckUtils]: 197: Hoare triple {17109#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {17109#false} is VALID [2018-11-23 13:05:13,306 INFO L273 TraceCheckUtils]: 198: Hoare triple {17109#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {17109#false} is VALID [2018-11-23 13:05:13,306 INFO L273 TraceCheckUtils]: 199: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,306 INFO L273 TraceCheckUtils]: 200: Hoare triple {17109#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {17109#false} is VALID [2018-11-23 13:05:13,306 INFO L273 TraceCheckUtils]: 201: Hoare triple {17109#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {17109#false} is VALID [2018-11-23 13:05:13,307 INFO L273 TraceCheckUtils]: 202: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,307 INFO L273 TraceCheckUtils]: 203: Hoare triple {17109#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {17109#false} is VALID [2018-11-23 13:05:13,307 INFO L273 TraceCheckUtils]: 204: Hoare triple {17109#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {17109#false} is VALID [2018-11-23 13:05:13,307 INFO L273 TraceCheckUtils]: 205: Hoare triple {17109#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); {17109#false} is VALID [2018-11-23 13:05:13,307 INFO L273 TraceCheckUtils]: 206: Hoare triple {17109#false} assume !(#t~mem15 > #t~mem13 + #t~mem14);havoc #t~mem15;havoc #t~mem13;havoc #t~mem14; {17109#false} is VALID [2018-11-23 13:05:13,307 INFO L273 TraceCheckUtils]: 207: Hoare triple {17109#false} #t~post10 := ~i~0;~i~0 := 1 + #t~post10;havoc #t~post10; {17109#false} is VALID [2018-11-23 13:05:13,307 INFO L273 TraceCheckUtils]: 208: Hoare triple {17109#false} assume !(~i~0 < ~edgecount~0); {17109#false} is VALID [2018-11-23 13:05:13,308 INFO L273 TraceCheckUtils]: 209: Hoare triple {17109#false} ~i~0 := 0; {17109#false} is VALID [2018-11-23 13:05:13,308 INFO L273 TraceCheckUtils]: 210: Hoare triple {17109#false} assume !!(~i~0 < ~nodecount~0);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17109#false} is VALID [2018-11-23 13:05:13,308 INFO L256 TraceCheckUtils]: 211: Hoare triple {17109#false} call __VERIFIER_assert((if #t~mem17 >= 0 then 1 else 0)); {17109#false} is VALID [2018-11-23 13:05:13,308 INFO L273 TraceCheckUtils]: 212: Hoare triple {17109#false} ~cond := #in~cond; {17109#false} is VALID [2018-11-23 13:05:13,308 INFO L273 TraceCheckUtils]: 213: Hoare triple {17109#false} assume 0 == ~cond; {17109#false} is VALID [2018-11-23 13:05:13,308 INFO L273 TraceCheckUtils]: 214: Hoare triple {17109#false} assume !false; {17109#false} is VALID [2018-11-23 13:05:13,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4046 backedges. 1289 proven. 145 refuted. 0 times theorem prover too weak. 2612 trivial. 0 not checked. [2018-11-23 13:05:13,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:13,339 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:13,349 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1