/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/eureka_01-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:16:49,925 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:16:49,927 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:16:49,984 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:16:49,985 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:16:49,986 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:16:49,989 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:16:49,993 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:16:49,994 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:16:49,996 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:16:49,997 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:16:49,998 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:16:49,998 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:16:49,999 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:16:50,000 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:16:50,000 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:16:50,001 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:16:50,002 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:16:50,003 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:16:50,004 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:16:50,005 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:16:50,027 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:16:50,028 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:16:50,031 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:16:50,032 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:16:50,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:16:50,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:16:50,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:16:50,043 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:16:50,043 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:16:50,043 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:16:50,044 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:16:50,044 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:16:50,045 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:16:50,045 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:16:50,046 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:16:50,046 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:16:50,047 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:16:50,047 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:16:50,047 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:16:50,048 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:16:50,052 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:16:50,053 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:16:50,088 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:16:50,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:16:50,089 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:16:50,089 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:16:50,089 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:16:50,090 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:16:50,090 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:16:50,090 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:16:50,090 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:16:50,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:16:50,091 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:16:50,091 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:16:50,091 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:16:50,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:16:50,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:16:50,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:16:50,092 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:16:50,093 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:16:50,093 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:16:50,093 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:16:50,093 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:16:50,093 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:16:50,093 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:16:50,094 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:16:50,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:16:50,094 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:16:50,094 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:16:50,094 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:16:50,094 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:16:50,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:16:50,094 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:16:50,095 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:16:50,095 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:16:50,095 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 10:16:50,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:16:50,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:16:50,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:16:50,340 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:16:50,340 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:16:50,342 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_01-1.c [2022-04-27 10:16:50,400 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d7c90f94/079399ec07b64a9ab41e2c9f24a1d1fd/FLAGaf3170dab [2022-04-27 10:16:50,797 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:16:50,797 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01-1.c [2022-04-27 10:16:50,806 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d7c90f94/079399ec07b64a9ab41e2c9f24a1d1fd/FLAGaf3170dab [2022-04-27 10:16:51,190 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d7c90f94/079399ec07b64a9ab41e2c9f24a1d1fd [2022-04-27 10:16:51,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:16:51,193 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:16:51,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:16:51,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:16:51,196 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:16:51,197 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:16:51" (1/1) ... [2022-04-27 10:16:51,198 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e04199b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:51, skipping insertion in model container [2022-04-27 10:16:51,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:16:51" (1/1) ... [2022-04-27 10:16:51,203 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:16:51,214 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:16:51,347 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01-1.c[446,459] [2022-04-27 10:16:51,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:16:51,410 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:16:51,422 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01-1.c[446,459] [2022-04-27 10:16:51,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:16:51,460 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:16:51,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:51 WrapperNode [2022-04-27 10:16:51,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:16:51,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:16:51,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:16:51,461 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:16:51,475 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:51" (1/1) ... [2022-04-27 10:16:51,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:51" (1/1) ... [2022-04-27 10:16:51,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:51" (1/1) ... [2022-04-27 10:16:51,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:51" (1/1) ... [2022-04-27 10:16:51,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:51" (1/1) ... [2022-04-27 10:16:51,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:51" (1/1) ... [2022-04-27 10:16:51,530 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:51" (1/1) ... [2022-04-27 10:16:51,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:16:51,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:16:51,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:16:51,533 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:16:51,540 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:51" (1/1) ... [2022-04-27 10:16:51,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:16:51,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:16:51,566 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 10:16:51,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 10:16:51,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:16:51,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:16:51,598 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 10:16:51,598 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:16:51,599 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:16:51,599 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:16:51,599 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:16:51,599 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 10:16:51,600 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:16:51,600 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:16:51,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:16:51,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:16:51,604 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:16:51,604 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:16:51,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 10:16:51,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:16:51,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:16:51,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:16:51,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:16:51,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:16:51,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:16:51,665 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:16:51,667 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:16:52,103 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:16:52,109 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:16:52,110 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-27 10:16:52,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:16:52 BoogieIcfgContainer [2022-04-27 10:16:52,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:16:52,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:16:52,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:16:52,128 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:16:52,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:16:51" (1/3) ... [2022-04-27 10:16:52,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ccb386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:16:52, skipping insertion in model container [2022-04-27 10:16:52,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:51" (2/3) ... [2022-04-27 10:16:52,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ccb386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:16:52, skipping insertion in model container [2022-04-27 10:16:52,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:16:52" (3/3) ... [2022-04-27 10:16:52,130 INFO L111 eAbstractionObserver]: Analyzing ICFG eureka_01-1.c [2022-04-27 10:16:52,142 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:16:52,143 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:16:52,205 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:16:52,213 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3fc3789e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6c70974d [2022-04-27 10:16:52,213 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:16:52,220 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:52,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 10:16:52,230 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:52,231 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:52,231 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:52,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:52,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1703238628, now seen corresponding path program 1 times [2022-04-27 10:16:52,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:52,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502828402] [2022-04-27 10:16:52,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:52,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:52,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:52,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {40#true} is VALID [2022-04-27 10:16:52,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-27 10:16:52,497 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #123#return; {40#true} is VALID [2022-04-27 10:16:52,499 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {45#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:52,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {40#true} is VALID [2022-04-27 10:16:52,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-27 10:16:52,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #123#return; {40#true} is VALID [2022-04-27 10:16:52,500 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret22 := main(); {40#true} is VALID [2022-04-27 10:16:52,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {40#true} is VALID [2022-04-27 10:16:52,500 INFO L290 TraceCheckUtils]: 6: Hoare triple {40#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {40#true} is VALID [2022-04-27 10:16:52,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {40#true} is VALID [2022-04-27 10:16:52,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume !true; {41#false} is VALID [2022-04-27 10:16:52,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2022-04-27 10:16:52,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-27 10:16:52,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2022-04-27 10:16:52,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-27 10:16:52,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2022-04-27 10:16:52,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {41#false} is VALID [2022-04-27 10:16:52,503 INFO L272 TraceCheckUtils]: 15: Hoare triple {41#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {41#false} is VALID [2022-04-27 10:16:52,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-27 10:16:52,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-27 10:16:52,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-27 10:16:52,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:16:52,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:52,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502828402] [2022-04-27 10:16:52,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502828402] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:16:52,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:16:52,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:16:52,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210345452] [2022-04-27 10:16:52,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:16:52,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 10:16:52,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:52,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:52,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:52,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:16:52,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:52,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:16:52,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:16:52,574 INFO L87 Difference]: Start difference. First operand has 37 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:52,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:52,669 INFO L93 Difference]: Finished difference Result 63 states and 89 transitions. [2022-04-27 10:16:52,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:16:52,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 10:16:52,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:52,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:52,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2022-04-27 10:16:52,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:52,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2022-04-27 10:16:52,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 89 transitions. [2022-04-27 10:16:52,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:52,789 INFO L225 Difference]: With dead ends: 63 [2022-04-27 10:16:52,789 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 10:16:52,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:16:52,798 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 37 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:16:52,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 47 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:16:52,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 10:16:52,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 10:16:52,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:52,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:16:52,827 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:16:52,828 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:16:52,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:52,830 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-27 10:16:52,831 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-27 10:16:52,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:52,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:52,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 32 states. [2022-04-27 10:16:52,832 INFO L87 Difference]: Start difference. First operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 32 states. [2022-04-27 10:16:52,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:52,835 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-27 10:16:52,835 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-27 10:16:52,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:52,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:52,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:52,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:52,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:16:52,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-04-27 10:16:52,839 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 19 [2022-04-27 10:16:52,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:52,840 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-04-27 10:16:52,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:52,840 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-27 10:16:52,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 10:16:52,841 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:52,841 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:52,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:16:52,842 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:52,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:52,842 INFO L85 PathProgramCache]: Analyzing trace with hash -779965392, now seen corresponding path program 1 times [2022-04-27 10:16:52,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:52,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049793389] [2022-04-27 10:16:52,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:52,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:52,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:52,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {243#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {235#true} is VALID [2022-04-27 10:16:52,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {235#true} assume true; {235#true} is VALID [2022-04-27 10:16:52,972 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {235#true} {235#true} #123#return; {235#true} is VALID [2022-04-27 10:16:52,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {235#true} call ULTIMATE.init(); {243#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:52,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {243#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {235#true} is VALID [2022-04-27 10:16:52,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {235#true} assume true; {235#true} is VALID [2022-04-27 10:16:52,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {235#true} {235#true} #123#return; {235#true} is VALID [2022-04-27 10:16:52,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {235#true} call #t~ret22 := main(); {235#true} is VALID [2022-04-27 10:16:52,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {235#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {235#true} is VALID [2022-04-27 10:16:52,976 INFO L290 TraceCheckUtils]: 6: Hoare triple {235#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {235#true} is VALID [2022-04-27 10:16:52,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {235#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {240#(= main_~i~0 0)} is VALID [2022-04-27 10:16:52,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {240#(= main_~i~0 0)} assume !(~i~0 < ~nodecount~0); {241#(<= main_~nodecount~0 0)} is VALID [2022-04-27 10:16:52,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {241#(<= main_~nodecount~0 0)} ~i~0 := 0; {241#(<= main_~nodecount~0 0)} is VALID [2022-04-27 10:16:52,978 INFO L290 TraceCheckUtils]: 10: Hoare triple {241#(<= main_~nodecount~0 0)} assume !(~i~0 < ~nodecount~0); {241#(<= main_~nodecount~0 0)} is VALID [2022-04-27 10:16:52,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {241#(<= main_~nodecount~0 0)} ~i~0 := 0; {241#(<= main_~nodecount~0 0)} is VALID [2022-04-27 10:16:52,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {241#(<= main_~nodecount~0 0)} assume !(~i~0 < ~edgecount~0); {241#(<= main_~nodecount~0 0)} is VALID [2022-04-27 10:16:52,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {241#(<= main_~nodecount~0 0)} ~i~0 := 0; {242#(and (<= main_~nodecount~0 0) (= main_~i~0 0))} is VALID [2022-04-27 10:16:52,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {242#(and (<= main_~nodecount~0 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {236#false} is VALID [2022-04-27 10:16:52,981 INFO L272 TraceCheckUtils]: 15: Hoare triple {236#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {236#false} is VALID [2022-04-27 10:16:52,981 INFO L290 TraceCheckUtils]: 16: Hoare triple {236#false} ~cond := #in~cond; {236#false} is VALID [2022-04-27 10:16:52,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {236#false} assume 0 == ~cond; {236#false} is VALID [2022-04-27 10:16:52,981 INFO L290 TraceCheckUtils]: 18: Hoare triple {236#false} assume !false; {236#false} is VALID [2022-04-27 10:16:52,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:16:52,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:52,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049793389] [2022-04-27 10:16:52,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049793389] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:16:52,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:16:52,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:16:52,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450965573] [2022-04-27 10:16:52,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:16:52,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 10:16:52,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:52,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:53,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:53,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:16:53,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:53,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:16:53,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:16:53,007 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:53,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:53,309 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2022-04-27 10:16:53,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:16:53,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 10:16:53,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:53,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:53,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2022-04-27 10:16:53,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:53,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2022-04-27 10:16:53,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 100 transitions. [2022-04-27 10:16:53,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:53,424 INFO L225 Difference]: With dead ends: 80 [2022-04-27 10:16:53,424 INFO L226 Difference]: Without dead ends: 48 [2022-04-27 10:16:53,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-27 10:16:53,427 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 91 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:16:53,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 36 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:16:53,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-27 10:16:53,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2022-04-27 10:16:53,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:53,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 34 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:16:53,434 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 34 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:16:53,434 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 34 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:16:53,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:53,437 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-04-27 10:16:53,438 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2022-04-27 10:16:53,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:53,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:53,439 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 48 states. [2022-04-27 10:16:53,439 INFO L87 Difference]: Start difference. First operand has 34 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 48 states. [2022-04-27 10:16:53,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:53,442 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-04-27 10:16:53,442 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2022-04-27 10:16:53,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:53,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:53,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:53,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:53,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:16:53,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-04-27 10:16:53,445 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 19 [2022-04-27 10:16:53,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:53,445 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-04-27 10:16:53,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:53,445 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-04-27 10:16:53,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 10:16:53,446 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:53,446 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:53,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:16:53,446 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:53,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:53,447 INFO L85 PathProgramCache]: Analyzing trace with hash 470194446, now seen corresponding path program 1 times [2022-04-27 10:16:53,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:53,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775690140] [2022-04-27 10:16:53,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:53,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:53,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:53,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {513#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {502#true} is VALID [2022-04-27 10:16:53,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {502#true} assume true; {502#true} is VALID [2022-04-27 10:16:53,727 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {502#true} {502#true} #123#return; {502#true} is VALID [2022-04-27 10:16:53,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {502#true} call ULTIMATE.init(); {513#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:53,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {513#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {502#true} is VALID [2022-04-27 10:16:53,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {502#true} assume true; {502#true} is VALID [2022-04-27 10:16:53,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {502#true} {502#true} #123#return; {502#true} is VALID [2022-04-27 10:16:53,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {502#true} call #t~ret22 := main(); {502#true} is VALID [2022-04-27 10:16:53,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {502#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {502#true} is VALID [2022-04-27 10:16:53,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {502#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {502#true} is VALID [2022-04-27 10:16:53,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {502#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {507#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:16:53,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {507#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {507#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:16:53,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {507#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {508#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:16:53,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {508#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) 0) (= main_~i~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {509#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:16:53,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {509#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !(~i~0 < ~nodecount~0); {509#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:16:53,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {509#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} ~i~0 := 0; {509#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:16:53,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {509#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {509#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:16:53,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {509#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !(~j~0 < ~edgecount~0); {509#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:16:53,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {509#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {509#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:16:53,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {509#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !(~i~0 < ~nodecount~0); {509#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:16:53,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {509#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} ~i~0 := 0; {509#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:16:53,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {509#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !(~i~0 < ~edgecount~0); {509#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:16:53,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {509#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} ~i~0 := 0; {508#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:16:53,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {508#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {510#(= |main_#t~mem21| 0)} is VALID [2022-04-27 10:16:53,738 INFO L272 TraceCheckUtils]: 21: Hoare triple {510#(= |main_#t~mem21| 0)} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {511#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:16:53,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {511#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {512#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:16:53,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {512#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {503#false} is VALID [2022-04-27 10:16:53,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {503#false} assume !false; {503#false} is VALID [2022-04-27 10:16:53,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:16:53,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:53,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775690140] [2022-04-27 10:16:53,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775690140] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:16:53,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863847914] [2022-04-27 10:16:53,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:53,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:16:53,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:16:53,742 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:16:53,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 10:16:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:53,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 10:16:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:53,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:16:54,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-04-27 10:16:54,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-04-27 10:16:54,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {502#true} call ULTIMATE.init(); {502#true} is VALID [2022-04-27 10:16:54,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {502#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {502#true} is VALID [2022-04-27 10:16:54,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {502#true} assume true; {502#true} is VALID [2022-04-27 10:16:54,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {502#true} {502#true} #123#return; {502#true} is VALID [2022-04-27 10:16:54,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {502#true} call #t~ret22 := main(); {502#true} is VALID [2022-04-27 10:16:54,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {502#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {502#true} is VALID [2022-04-27 10:16:54,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {502#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {502#true} is VALID [2022-04-27 10:16:54,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {502#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {507#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:16:54,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {507#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {507#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:16:54,345 INFO L290 TraceCheckUtils]: 9: Hoare triple {507#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {544#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:16:54,345 INFO L290 TraceCheckUtils]: 10: Hoare triple {544#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {544#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:16:54,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {544#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~i~0 < ~nodecount~0); {544#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:16:54,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {544#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} ~i~0 := 0; {544#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:16:54,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {544#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {544#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:16:54,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {544#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~j~0 < ~edgecount~0); {544#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:16:54,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {544#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {544#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:16:54,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {544#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~i~0 < ~nodecount~0); {544#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:16:54,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {544#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} ~i~0 := 0; {544#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:16:54,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {544#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~i~0 < ~edgecount~0); {544#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:16:54,350 INFO L290 TraceCheckUtils]: 19: Hoare triple {544#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} ~i~0 := 0; {575#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:16:54,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {575#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {579#(<= 0 |main_#t~mem21|)} is VALID [2022-04-27 10:16:54,352 INFO L272 TraceCheckUtils]: 21: Hoare triple {579#(<= 0 |main_#t~mem21|)} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {583#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:16:54,352 INFO L290 TraceCheckUtils]: 22: Hoare triple {583#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {587#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:16:54,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {587#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {503#false} is VALID [2022-04-27 10:16:54,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {503#false} assume !false; {503#false} is VALID [2022-04-27 10:16:54,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:16:54,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:16:54,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-04-27 10:16:54,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-04-27 10:16:54,642 INFO L290 TraceCheckUtils]: 24: Hoare triple {503#false} assume !false; {503#false} is VALID [2022-04-27 10:16:54,642 INFO L290 TraceCheckUtils]: 23: Hoare triple {587#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {503#false} is VALID [2022-04-27 10:16:54,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {583#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {587#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:16:54,643 INFO L272 TraceCheckUtils]: 21: Hoare triple {579#(<= 0 |main_#t~mem21|)} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {583#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:16:54,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {606#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {579#(<= 0 |main_#t~mem21|)} is VALID [2022-04-27 10:16:54,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {610#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} ~i~0 := 0; {606#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))))} is VALID [2022-04-27 10:16:54,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {610#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !(~i~0 < ~edgecount~0); {610#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:16:54,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {610#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} ~i~0 := 0; {610#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:16:54,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {610#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !(~i~0 < ~nodecount~0); {610#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:16:54,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {610#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {610#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:16:54,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {610#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !(~j~0 < ~edgecount~0); {610#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:16:54,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {610#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {610#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:16:54,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {610#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} ~i~0 := 0; {610#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:16:54,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {610#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !(~i~0 < ~nodecount~0); {610#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:16:54,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {610#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {610#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:16:54,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {641#(= 0 (* main_~i~0 4))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {610#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:16:54,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {641#(= 0 (* main_~i~0 4))} assume !!(~i~0 < ~nodecount~0); {641#(= 0 (* main_~i~0 4))} is VALID [2022-04-27 10:16:54,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {502#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {641#(= 0 (* main_~i~0 4))} is VALID [2022-04-27 10:16:54,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {502#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {502#true} is VALID [2022-04-27 10:16:54,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {502#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {502#true} is VALID [2022-04-27 10:16:54,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {502#true} call #t~ret22 := main(); {502#true} is VALID [2022-04-27 10:16:54,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {502#true} {502#true} #123#return; {502#true} is VALID [2022-04-27 10:16:54,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {502#true} assume true; {502#true} is VALID [2022-04-27 10:16:54,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {502#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {502#true} is VALID [2022-04-27 10:16:54,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {502#true} call ULTIMATE.init(); {502#true} is VALID [2022-04-27 10:16:54,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:16:54,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863847914] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:16:54,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:16:54,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-27 10:16:54,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243560855] [2022-04-27 10:16:54,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:16:54,659 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 10:16:54,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:54,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:54,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:54,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 10:16:54,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:54,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 10:16:54,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-04-27 10:16:54,712 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:55,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:55,797 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2022-04-27 10:16:55,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 10:16:55,797 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 10:16:55,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:55,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:55,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 114 transitions. [2022-04-27 10:16:55,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:55,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 114 transitions. [2022-04-27 10:16:55,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 114 transitions. [2022-04-27 10:16:55,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:55,929 INFO L225 Difference]: With dead ends: 91 [2022-04-27 10:16:55,929 INFO L226 Difference]: Without dead ends: 89 [2022-04-27 10:16:55,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2022-04-27 10:16:55,930 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 158 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 10:16:55,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 68 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 10:16:55,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-27 10:16:55,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 55. [2022-04-27 10:16:55,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:55,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 55 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 48 states have internal predecessors, (60), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:55,942 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 55 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 48 states have internal predecessors, (60), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:55,943 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 55 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 48 states have internal predecessors, (60), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:55,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:55,946 INFO L93 Difference]: Finished difference Result 89 states and 112 transitions. [2022-04-27 10:16:55,946 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 112 transitions. [2022-04-27 10:16:55,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:55,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:55,959 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 48 states have internal predecessors, (60), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 89 states. [2022-04-27 10:16:55,960 INFO L87 Difference]: Start difference. First operand has 55 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 48 states have internal predecessors, (60), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 89 states. [2022-04-27 10:16:55,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:55,963 INFO L93 Difference]: Finished difference Result 89 states and 112 transitions. [2022-04-27 10:16:55,964 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 112 transitions. [2022-04-27 10:16:55,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:55,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:55,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:55,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:55,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 48 states have internal predecessors, (60), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:55,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2022-04-27 10:16:55,967 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 25 [2022-04-27 10:16:55,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:55,967 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2022-04-27 10:16:55,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:55,967 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2022-04-27 10:16:55,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 10:16:55,968 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:55,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:55,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 10:16:56,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:16:56,180 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:56,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:56,180 INFO L85 PathProgramCache]: Analyzing trace with hash -550873908, now seen corresponding path program 1 times [2022-04-27 10:16:56,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:56,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19819556] [2022-04-27 10:16:56,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:56,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:56,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:56,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {1072#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {1066#true} is VALID [2022-04-27 10:16:56,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {1066#true} assume true; {1066#true} is VALID [2022-04-27 10:16:56,234 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1066#true} {1066#true} #123#return; {1066#true} is VALID [2022-04-27 10:16:56,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {1066#true} call ULTIMATE.init(); {1072#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:56,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {1072#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {1066#true} is VALID [2022-04-27 10:16:56,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {1066#true} assume true; {1066#true} is VALID [2022-04-27 10:16:56,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1066#true} {1066#true} #123#return; {1066#true} is VALID [2022-04-27 10:16:56,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {1066#true} call #t~ret22 := main(); {1066#true} is VALID [2022-04-27 10:16:56,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {1066#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {1066#true} is VALID [2022-04-27 10:16:56,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {1066#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {1066#true} is VALID [2022-04-27 10:16:56,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {1066#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1071#(= main_~source~0 main_~i~0)} is VALID [2022-04-27 10:16:56,238 INFO L290 TraceCheckUtils]: 8: Hoare triple {1071#(= main_~source~0 main_~i~0)} assume !!(~i~0 < ~nodecount~0); {1071#(= main_~source~0 main_~i~0)} is VALID [2022-04-27 10:16:56,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {1071#(= main_~source~0 main_~i~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1067#false} is VALID [2022-04-27 10:16:56,239 INFO L290 TraceCheckUtils]: 10: Hoare triple {1067#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1067#false} is VALID [2022-04-27 10:16:56,239 INFO L290 TraceCheckUtils]: 11: Hoare triple {1067#false} assume !(~i~0 < ~nodecount~0); {1067#false} is VALID [2022-04-27 10:16:56,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {1067#false} ~i~0 := 0; {1067#false} is VALID [2022-04-27 10:16:56,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {1067#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1067#false} is VALID [2022-04-27 10:16:56,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {1067#false} assume !(~j~0 < ~edgecount~0); {1067#false} is VALID [2022-04-27 10:16:56,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {1067#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1067#false} is VALID [2022-04-27 10:16:56,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {1067#false} assume !(~i~0 < ~nodecount~0); {1067#false} is VALID [2022-04-27 10:16:56,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {1067#false} ~i~0 := 0; {1067#false} is VALID [2022-04-27 10:16:56,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {1067#false} assume !(~i~0 < ~edgecount~0); {1067#false} is VALID [2022-04-27 10:16:56,240 INFO L290 TraceCheckUtils]: 19: Hoare triple {1067#false} ~i~0 := 0; {1067#false} is VALID [2022-04-27 10:16:56,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {1067#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1067#false} is VALID [2022-04-27 10:16:56,240 INFO L272 TraceCheckUtils]: 21: Hoare triple {1067#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {1067#false} is VALID [2022-04-27 10:16:56,240 INFO L290 TraceCheckUtils]: 22: Hoare triple {1067#false} ~cond := #in~cond; {1067#false} is VALID [2022-04-27 10:16:56,241 INFO L290 TraceCheckUtils]: 23: Hoare triple {1067#false} assume 0 == ~cond; {1067#false} is VALID [2022-04-27 10:16:56,241 INFO L290 TraceCheckUtils]: 24: Hoare triple {1067#false} assume !false; {1067#false} is VALID [2022-04-27 10:16:56,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:16:56,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:56,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19819556] [2022-04-27 10:16:56,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19819556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:16:56,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:16:56,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:16:56,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494424844] [2022-04-27 10:16:56,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:16:56,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 10:16:56,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:56,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:56,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:56,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:16:56,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:56,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:16:56,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:16:56,261 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:56,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:56,370 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-27 10:16:56,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:16:56,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 10:16:56,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:56,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:56,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-04-27 10:16:56,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:56,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-04-27 10:16:56,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 72 transitions. [2022-04-27 10:16:56,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:56,441 INFO L225 Difference]: With dead ends: 82 [2022-04-27 10:16:56,441 INFO L226 Difference]: Without dead ends: 57 [2022-04-27 10:16:56,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:16:56,444 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 34 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:16:56,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 40 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:16:56,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-27 10:16:56,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2022-04-27 10:16:56,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:56,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 56 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 49 states have internal predecessors, (61), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:56,451 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 56 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 49 states have internal predecessors, (61), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:56,451 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 56 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 49 states have internal predecessors, (61), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:56,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:56,453 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2022-04-27 10:16:56,453 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2022-04-27 10:16:56,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:56,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:56,454 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 49 states have internal predecessors, (61), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 57 states. [2022-04-27 10:16:56,454 INFO L87 Difference]: Start difference. First operand has 56 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 49 states have internal predecessors, (61), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 57 states. [2022-04-27 10:16:56,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:56,456 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2022-04-27 10:16:56,456 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2022-04-27 10:16:56,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:56,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:56,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:56,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:56,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 49 states have internal predecessors, (61), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:56,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2022-04-27 10:16:56,459 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 25 [2022-04-27 10:16:56,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:56,459 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2022-04-27 10:16:56,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:56,459 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2022-04-27 10:16:56,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 10:16:56,460 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:56,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:56,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 10:16:56,460 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:56,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:56,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1439064257, now seen corresponding path program 1 times [2022-04-27 10:16:56,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:56,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966292575] [2022-04-27 10:16:56,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:56,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:56,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:56,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {1388#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {1379#true} is VALID [2022-04-27 10:16:56,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 10:16:56,544 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1379#true} {1379#true} #123#return; {1379#true} is VALID [2022-04-27 10:16:56,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {1379#true} call ULTIMATE.init(); {1388#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:56,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {1388#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {1379#true} is VALID [2022-04-27 10:16:56,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 10:16:56,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1379#true} {1379#true} #123#return; {1379#true} is VALID [2022-04-27 10:16:56,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {1379#true} call #t~ret22 := main(); {1379#true} is VALID [2022-04-27 10:16:56,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {1379#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {1379#true} is VALID [2022-04-27 10:16:56,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {1379#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {1379#true} is VALID [2022-04-27 10:16:56,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {1379#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1379#true} is VALID [2022-04-27 10:16:56,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {1379#true} assume !!(~i~0 < ~nodecount~0); {1379#true} is VALID [2022-04-27 10:16:56,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {1379#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1379#true} is VALID [2022-04-27 10:16:56,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {1379#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1379#true} is VALID [2022-04-27 10:16:56,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {1379#true} assume !(~i~0 < ~nodecount~0); {1379#true} is VALID [2022-04-27 10:16:56,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {1379#true} ~i~0 := 0; {1379#true} is VALID [2022-04-27 10:16:56,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {1379#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1384#(= main_~j~0 0)} is VALID [2022-04-27 10:16:56,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {1384#(= main_~j~0 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {1385#(and (= main_~j~0 0) (<= (+ main_~j~0 1) main_~edgecount~0))} is VALID [2022-04-27 10:16:56,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {1385#(and (= main_~j~0 0) (<= (+ main_~j~0 1) main_~edgecount~0))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {1385#(and (= main_~j~0 0) (<= (+ main_~j~0 1) main_~edgecount~0))} is VALID [2022-04-27 10:16:56,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {1385#(and (= main_~j~0 0) (<= (+ main_~j~0 1) main_~edgecount~0))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {1386#(<= 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,548 INFO L290 TraceCheckUtils]: 17: Hoare triple {1386#(<= 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {1386#(<= 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,549 INFO L290 TraceCheckUtils]: 18: Hoare triple {1386#(<= 1 main_~edgecount~0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1386#(<= 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {1386#(<= 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {1386#(<= 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,549 INFO L290 TraceCheckUtils]: 20: Hoare triple {1386#(<= 1 main_~edgecount~0)} ~i~0 := 0; {1387#(and (<= 1 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-27 10:16:56,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {1387#(and (<= 1 main_~edgecount~0) (= main_~i~0 0))} assume !(~i~0 < ~edgecount~0); {1380#false} is VALID [2022-04-27 10:16:56,550 INFO L290 TraceCheckUtils]: 22: Hoare triple {1380#false} ~i~0 := 0; {1380#false} is VALID [2022-04-27 10:16:56,550 INFO L290 TraceCheckUtils]: 23: Hoare triple {1380#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1380#false} is VALID [2022-04-27 10:16:56,550 INFO L272 TraceCheckUtils]: 24: Hoare triple {1380#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {1380#false} is VALID [2022-04-27 10:16:56,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {1380#false} ~cond := #in~cond; {1380#false} is VALID [2022-04-27 10:16:56,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {1380#false} assume 0 == ~cond; {1380#false} is VALID [2022-04-27 10:16:56,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2022-04-27 10:16:56,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:16:56,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:56,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966292575] [2022-04-27 10:16:56,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966292575] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:16:56,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149535793] [2022-04-27 10:16:56,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:56,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:16:56,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:16:56,552 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:16:56,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 10:16:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:56,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 10:16:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:56,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:16:56,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {1379#true} call ULTIMATE.init(); {1379#true} is VALID [2022-04-27 10:16:56,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {1379#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {1379#true} is VALID [2022-04-27 10:16:56,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 10:16:56,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1379#true} {1379#true} #123#return; {1379#true} is VALID [2022-04-27 10:16:56,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {1379#true} call #t~ret22 := main(); {1379#true} is VALID [2022-04-27 10:16:56,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {1379#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {1379#true} is VALID [2022-04-27 10:16:56,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {1379#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {1379#true} is VALID [2022-04-27 10:16:56,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {1379#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1379#true} is VALID [2022-04-27 10:16:56,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {1379#true} assume !!(~i~0 < ~nodecount~0); {1379#true} is VALID [2022-04-27 10:16:56,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {1379#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1379#true} is VALID [2022-04-27 10:16:56,779 INFO L290 TraceCheckUtils]: 10: Hoare triple {1379#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1379#true} is VALID [2022-04-27 10:16:56,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {1379#true} assume !(~i~0 < ~nodecount~0); {1379#true} is VALID [2022-04-27 10:16:56,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {1379#true} ~i~0 := 0; {1379#true} is VALID [2022-04-27 10:16:56,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {1379#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1431#(<= 0 main_~j~0)} is VALID [2022-04-27 10:16:56,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {1431#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {1386#(<= 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,781 INFO L290 TraceCheckUtils]: 15: Hoare triple {1386#(<= 1 main_~edgecount~0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {1386#(<= 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {1386#(<= 1 main_~edgecount~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {1386#(<= 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,781 INFO L290 TraceCheckUtils]: 17: Hoare triple {1386#(<= 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {1386#(<= 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,782 INFO L290 TraceCheckUtils]: 18: Hoare triple {1386#(<= 1 main_~edgecount~0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1386#(<= 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {1386#(<= 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {1386#(<= 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,783 INFO L290 TraceCheckUtils]: 20: Hoare triple {1386#(<= 1 main_~edgecount~0)} ~i~0 := 0; {1453#(and (<= 1 main_~edgecount~0) (<= main_~i~0 0))} is VALID [2022-04-27 10:16:56,784 INFO L290 TraceCheckUtils]: 21: Hoare triple {1453#(and (<= 1 main_~edgecount~0) (<= main_~i~0 0))} assume !(~i~0 < ~edgecount~0); {1380#false} is VALID [2022-04-27 10:16:56,784 INFO L290 TraceCheckUtils]: 22: Hoare triple {1380#false} ~i~0 := 0; {1380#false} is VALID [2022-04-27 10:16:56,784 INFO L290 TraceCheckUtils]: 23: Hoare triple {1380#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1380#false} is VALID [2022-04-27 10:16:56,784 INFO L272 TraceCheckUtils]: 24: Hoare triple {1380#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {1380#false} is VALID [2022-04-27 10:16:56,784 INFO L290 TraceCheckUtils]: 25: Hoare triple {1380#false} ~cond := #in~cond; {1380#false} is VALID [2022-04-27 10:16:56,784 INFO L290 TraceCheckUtils]: 26: Hoare triple {1380#false} assume 0 == ~cond; {1380#false} is VALID [2022-04-27 10:16:56,784 INFO L290 TraceCheckUtils]: 27: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2022-04-27 10:16:56,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:16:56,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:16:56,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2022-04-27 10:16:56,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {1380#false} assume 0 == ~cond; {1380#false} is VALID [2022-04-27 10:16:56,902 INFO L290 TraceCheckUtils]: 25: Hoare triple {1380#false} ~cond := #in~cond; {1380#false} is VALID [2022-04-27 10:16:56,903 INFO L272 TraceCheckUtils]: 24: Hoare triple {1380#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {1380#false} is VALID [2022-04-27 10:16:56,903 INFO L290 TraceCheckUtils]: 23: Hoare triple {1380#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1380#false} is VALID [2022-04-27 10:16:56,903 INFO L290 TraceCheckUtils]: 22: Hoare triple {1380#false} ~i~0 := 0; {1380#false} is VALID [2022-04-27 10:16:56,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {1493#(< main_~i~0 main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {1380#false} is VALID [2022-04-27 10:16:56,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {1386#(<= 1 main_~edgecount~0)} ~i~0 := 0; {1493#(< main_~i~0 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {1386#(<= 1 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {1386#(<= 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {1386#(<= 1 main_~edgecount~0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1386#(<= 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {1386#(<= 1 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {1386#(<= 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {1386#(<= 1 main_~edgecount~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {1386#(<= 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {1386#(<= 1 main_~edgecount~0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {1386#(<= 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {1431#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {1386#(<= 1 main_~edgecount~0)} is VALID [2022-04-27 10:16:56,907 INFO L290 TraceCheckUtils]: 13: Hoare triple {1379#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {1431#(<= 0 main_~j~0)} is VALID [2022-04-27 10:16:56,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {1379#true} ~i~0 := 0; {1379#true} is VALID [2022-04-27 10:16:56,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {1379#true} assume !(~i~0 < ~nodecount~0); {1379#true} is VALID [2022-04-27 10:16:56,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {1379#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1379#true} is VALID [2022-04-27 10:16:56,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {1379#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {1379#true} is VALID [2022-04-27 10:16:56,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {1379#true} assume !!(~i~0 < ~nodecount~0); {1379#true} is VALID [2022-04-27 10:16:56,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {1379#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {1379#true} is VALID [2022-04-27 10:16:56,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {1379#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {1379#true} is VALID [2022-04-27 10:16:56,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {1379#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {1379#true} is VALID [2022-04-27 10:16:56,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {1379#true} call #t~ret22 := main(); {1379#true} is VALID [2022-04-27 10:16:56,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1379#true} {1379#true} #123#return; {1379#true} is VALID [2022-04-27 10:16:56,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 10:16:56,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {1379#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {1379#true} is VALID [2022-04-27 10:16:56,908 INFO L272 TraceCheckUtils]: 0: Hoare triple {1379#true} call ULTIMATE.init(); {1379#true} is VALID [2022-04-27 10:16:56,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:16:56,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149535793] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:16:56,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:16:56,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2022-04-27 10:16:56,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905730757] [2022-04-27 10:16:56,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:16:56,910 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 10:16:56,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:56,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:56,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:56,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 10:16:56,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:56,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 10:16:56,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-04-27 10:16:56,942 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:57,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:57,497 INFO L93 Difference]: Finished difference Result 130 states and 165 transitions. [2022-04-27 10:16:57,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:16:57,498 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 10:16:57,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:57,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:57,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2022-04-27 10:16:57,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:57,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2022-04-27 10:16:57,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 93 transitions. [2022-04-27 10:16:57,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:57,593 INFO L225 Difference]: With dead ends: 130 [2022-04-27 10:16:57,593 INFO L226 Difference]: Without dead ends: 94 [2022-04-27 10:16:57,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-04-27 10:16:57,594 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 114 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:16:57,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 63 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:16:57,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-27 10:16:57,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 68. [2022-04-27 10:16:57,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:57,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 68 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 61 states have internal predecessors, (77), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:57,622 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 68 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 61 states have internal predecessors, (77), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:57,622 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 68 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 61 states have internal predecessors, (77), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:57,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:57,628 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2022-04-27 10:16:57,628 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 117 transitions. [2022-04-27 10:16:57,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:57,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:57,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 61 states have internal predecessors, (77), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 94 states. [2022-04-27 10:16:57,629 INFO L87 Difference]: Start difference. First operand has 68 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 61 states have internal predecessors, (77), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 94 states. [2022-04-27 10:16:57,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:57,634 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2022-04-27 10:16:57,634 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 117 transitions. [2022-04-27 10:16:57,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:57,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:57,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:57,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:57,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 61 states have internal predecessors, (77), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:57,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2022-04-27 10:16:57,637 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 28 [2022-04-27 10:16:57,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:57,637 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2022-04-27 10:16:57,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:57,637 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2022-04-27 10:16:57,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 10:16:57,638 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:57,638 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:57,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 10:16:57,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:16:57,861 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:57,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:57,862 INFO L85 PathProgramCache]: Analyzing trace with hash 244787668, now seen corresponding path program 1 times [2022-04-27 10:16:57,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:57,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74840885] [2022-04-27 10:16:57,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:57,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:57,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:57,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {2045#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {2035#true} is VALID [2022-04-27 10:16:57,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {2035#true} assume true; {2035#true} is VALID [2022-04-27 10:16:57,980 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2035#true} {2035#true} #123#return; {2035#true} is VALID [2022-04-27 10:16:57,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {2035#true} call ULTIMATE.init(); {2045#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:57,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {2045#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {2035#true} is VALID [2022-04-27 10:16:57,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {2035#true} assume true; {2035#true} is VALID [2022-04-27 10:16:57,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2035#true} {2035#true} #123#return; {2035#true} is VALID [2022-04-27 10:16:57,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {2035#true} call #t~ret22 := main(); {2035#true} is VALID [2022-04-27 10:16:57,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {2035#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {2035#true} is VALID [2022-04-27 10:16:57,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {2035#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {2035#true} is VALID [2022-04-27 10:16:57,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {2035#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2040#(= main_~i~0 0)} is VALID [2022-04-27 10:16:57,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {2040#(= main_~i~0 0)} assume !!(~i~0 < ~nodecount~0); {2040#(= main_~i~0 0)} is VALID [2022-04-27 10:16:57,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {2040#(= main_~i~0 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2040#(= main_~i~0 0)} is VALID [2022-04-27 10:16:57,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {2040#(= main_~i~0 0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2041#(<= 1 main_~i~0)} is VALID [2022-04-27 10:16:57,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {2041#(<= 1 main_~i~0)} assume !!(~i~0 < ~nodecount~0); {2042#(<= 2 main_~nodecount~0)} is VALID [2022-04-27 10:16:57,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {2042#(<= 2 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2042#(<= 2 main_~nodecount~0)} is VALID [2022-04-27 10:16:57,995 INFO L290 TraceCheckUtils]: 13: Hoare triple {2042#(<= 2 main_~nodecount~0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2042#(<= 2 main_~nodecount~0)} is VALID [2022-04-27 10:16:57,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {2042#(<= 2 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {2042#(<= 2 main_~nodecount~0)} is VALID [2022-04-27 10:16:57,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {2042#(<= 2 main_~nodecount~0)} ~i~0 := 0; {2043#(and (<= 2 main_~nodecount~0) (= main_~i~0 0))} is VALID [2022-04-27 10:16:57,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {2043#(and (<= 2 main_~nodecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2043#(and (<= 2 main_~nodecount~0) (= main_~i~0 0))} is VALID [2022-04-27 10:16:57,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {2043#(and (<= 2 main_~nodecount~0) (= main_~i~0 0))} assume !(~j~0 < ~edgecount~0); {2043#(and (<= 2 main_~nodecount~0) (= main_~i~0 0))} is VALID [2022-04-27 10:16:57,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {2043#(and (<= 2 main_~nodecount~0) (= main_~i~0 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2044#(<= (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:16:57,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {2044#(<= (+ main_~i~0 1) main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {2036#false} is VALID [2022-04-27 10:16:57,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {2036#false} ~i~0 := 0; {2036#false} is VALID [2022-04-27 10:16:57,999 INFO L290 TraceCheckUtils]: 21: Hoare triple {2036#false} assume !(~i~0 < ~edgecount~0); {2036#false} is VALID [2022-04-27 10:16:58,000 INFO L290 TraceCheckUtils]: 22: Hoare triple {2036#false} ~i~0 := 0; {2036#false} is VALID [2022-04-27 10:16:58,000 INFO L290 TraceCheckUtils]: 23: Hoare triple {2036#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2036#false} is VALID [2022-04-27 10:16:58,000 INFO L272 TraceCheckUtils]: 24: Hoare triple {2036#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {2036#false} is VALID [2022-04-27 10:16:58,000 INFO L290 TraceCheckUtils]: 25: Hoare triple {2036#false} ~cond := #in~cond; {2036#false} is VALID [2022-04-27 10:16:58,000 INFO L290 TraceCheckUtils]: 26: Hoare triple {2036#false} assume 0 == ~cond; {2036#false} is VALID [2022-04-27 10:16:58,000 INFO L290 TraceCheckUtils]: 27: Hoare triple {2036#false} assume !false; {2036#false} is VALID [2022-04-27 10:16:58,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:16:58,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:58,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74840885] [2022-04-27 10:16:58,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74840885] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:16:58,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971383588] [2022-04-27 10:16:58,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:58,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:16:58,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:16:58,004 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:16:58,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 10:16:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:58,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 10:16:58,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:58,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:16:58,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {2035#true} call ULTIMATE.init(); {2035#true} is VALID [2022-04-27 10:16:58,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {2035#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {2035#true} is VALID [2022-04-27 10:16:58,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {2035#true} assume true; {2035#true} is VALID [2022-04-27 10:16:58,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2035#true} {2035#true} #123#return; {2035#true} is VALID [2022-04-27 10:16:58,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {2035#true} call #t~ret22 := main(); {2035#true} is VALID [2022-04-27 10:16:58,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {2035#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {2035#true} is VALID [2022-04-27 10:16:58,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {2035#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {2035#true} is VALID [2022-04-27 10:16:58,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {2035#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2070#(<= 0 main_~i~0)} is VALID [2022-04-27 10:16:58,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {2070#(<= 0 main_~i~0)} assume !!(~i~0 < ~nodecount~0); {2070#(<= 0 main_~i~0)} is VALID [2022-04-27 10:16:58,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {2070#(<= 0 main_~i~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2070#(<= 0 main_~i~0)} is VALID [2022-04-27 10:16:58,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {2070#(<= 0 main_~i~0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2041#(<= 1 main_~i~0)} is VALID [2022-04-27 10:16:58,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {2041#(<= 1 main_~i~0)} assume !!(~i~0 < ~nodecount~0); {2042#(<= 2 main_~nodecount~0)} is VALID [2022-04-27 10:16:58,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {2042#(<= 2 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2042#(<= 2 main_~nodecount~0)} is VALID [2022-04-27 10:16:58,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {2042#(<= 2 main_~nodecount~0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2042#(<= 2 main_~nodecount~0)} is VALID [2022-04-27 10:16:58,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {2042#(<= 2 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {2042#(<= 2 main_~nodecount~0)} is VALID [2022-04-27 10:16:58,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {2042#(<= 2 main_~nodecount~0)} ~i~0 := 0; {2095#(and (<= main_~i~0 0) (<= 2 main_~nodecount~0))} is VALID [2022-04-27 10:16:58,298 INFO L290 TraceCheckUtils]: 16: Hoare triple {2095#(and (<= main_~i~0 0) (<= 2 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2095#(and (<= main_~i~0 0) (<= 2 main_~nodecount~0))} is VALID [2022-04-27 10:16:58,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {2095#(and (<= main_~i~0 0) (<= 2 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {2095#(and (<= main_~i~0 0) (<= 2 main_~nodecount~0))} is VALID [2022-04-27 10:16:58,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {2095#(and (<= main_~i~0 0) (<= 2 main_~nodecount~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2105#(and (<= main_~i~0 1) (<= 2 main_~nodecount~0))} is VALID [2022-04-27 10:16:58,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {2105#(and (<= main_~i~0 1) (<= 2 main_~nodecount~0))} assume !(~i~0 < ~nodecount~0); {2036#false} is VALID [2022-04-27 10:16:58,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {2036#false} ~i~0 := 0; {2036#false} is VALID [2022-04-27 10:16:58,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {2036#false} assume !(~i~0 < ~edgecount~0); {2036#false} is VALID [2022-04-27 10:16:58,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {2036#false} ~i~0 := 0; {2036#false} is VALID [2022-04-27 10:16:58,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {2036#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2036#false} is VALID [2022-04-27 10:16:58,300 INFO L272 TraceCheckUtils]: 24: Hoare triple {2036#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {2036#false} is VALID [2022-04-27 10:16:58,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {2036#false} ~cond := #in~cond; {2036#false} is VALID [2022-04-27 10:16:58,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {2036#false} assume 0 == ~cond; {2036#false} is VALID [2022-04-27 10:16:58,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {2036#false} assume !false; {2036#false} is VALID [2022-04-27 10:16:58,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:16:58,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:16:58,441 INFO L290 TraceCheckUtils]: 27: Hoare triple {2036#false} assume !false; {2036#false} is VALID [2022-04-27 10:16:58,441 INFO L290 TraceCheckUtils]: 26: Hoare triple {2036#false} assume 0 == ~cond; {2036#false} is VALID [2022-04-27 10:16:58,441 INFO L290 TraceCheckUtils]: 25: Hoare triple {2036#false} ~cond := #in~cond; {2036#false} is VALID [2022-04-27 10:16:58,441 INFO L272 TraceCheckUtils]: 24: Hoare triple {2036#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {2036#false} is VALID [2022-04-27 10:16:58,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {2036#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2036#false} is VALID [2022-04-27 10:16:58,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {2036#false} ~i~0 := 0; {2036#false} is VALID [2022-04-27 10:16:58,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {2036#false} assume !(~i~0 < ~edgecount~0); {2036#false} is VALID [2022-04-27 10:16:58,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {2036#false} ~i~0 := 0; {2036#false} is VALID [2022-04-27 10:16:58,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {2044#(<= (+ main_~i~0 1) main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {2036#false} is VALID [2022-04-27 10:16:58,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {2160#(<= (+ main_~i~0 2) main_~nodecount~0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2044#(<= (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:16:58,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {2160#(<= (+ main_~i~0 2) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {2160#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:16:58,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {2160#(<= (+ main_~i~0 2) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2160#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:16:58,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {2042#(<= 2 main_~nodecount~0)} ~i~0 := 0; {2160#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:16:58,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {2042#(<= 2 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {2042#(<= 2 main_~nodecount~0)} is VALID [2022-04-27 10:16:58,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {2042#(<= 2 main_~nodecount~0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2042#(<= 2 main_~nodecount~0)} is VALID [2022-04-27 10:16:58,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {2042#(<= 2 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2042#(<= 2 main_~nodecount~0)} is VALID [2022-04-27 10:16:58,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {2041#(<= 1 main_~i~0)} assume !!(~i~0 < ~nodecount~0); {2042#(<= 2 main_~nodecount~0)} is VALID [2022-04-27 10:16:58,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {2070#(<= 0 main_~i~0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2041#(<= 1 main_~i~0)} is VALID [2022-04-27 10:16:58,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {2070#(<= 0 main_~i~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2070#(<= 0 main_~i~0)} is VALID [2022-04-27 10:16:58,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {2070#(<= 0 main_~i~0)} assume !!(~i~0 < ~nodecount~0); {2070#(<= 0 main_~i~0)} is VALID [2022-04-27 10:16:58,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {2035#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2070#(<= 0 main_~i~0)} is VALID [2022-04-27 10:16:58,452 INFO L290 TraceCheckUtils]: 6: Hoare triple {2035#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {2035#true} is VALID [2022-04-27 10:16:58,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {2035#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {2035#true} is VALID [2022-04-27 10:16:58,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {2035#true} call #t~ret22 := main(); {2035#true} is VALID [2022-04-27 10:16:58,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2035#true} {2035#true} #123#return; {2035#true} is VALID [2022-04-27 10:16:58,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {2035#true} assume true; {2035#true} is VALID [2022-04-27 10:16:58,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {2035#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {2035#true} is VALID [2022-04-27 10:16:58,452 INFO L272 TraceCheckUtils]: 0: Hoare triple {2035#true} call ULTIMATE.init(); {2035#true} is VALID [2022-04-27 10:16:58,453 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:16:58,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971383588] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:16:58,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:16:58,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-04-27 10:16:58,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393831530] [2022-04-27 10:16:58,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:16:58,454 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 10:16:58,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:58,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:58,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:58,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 10:16:58,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:58,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 10:16:58,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:16:58,489 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:59,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:59,556 INFO L93 Difference]: Finished difference Result 195 states and 249 transitions. [2022-04-27 10:16:59,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 10:16:59,557 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 10:16:59,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:59,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:59,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2022-04-27 10:16:59,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:59,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2022-04-27 10:16:59,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 121 transitions. [2022-04-27 10:16:59,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:59,684 INFO L225 Difference]: With dead ends: 195 [2022-04-27 10:16:59,684 INFO L226 Difference]: Without dead ends: 165 [2022-04-27 10:16:59,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2022-04-27 10:16:59,685 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 125 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:16:59,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 90 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 10:16:59,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-27 10:16:59,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 87. [2022-04-27 10:16:59,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:59,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 87 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 80 states have internal predecessors, (103), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:59,768 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 87 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 80 states have internal predecessors, (103), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:59,768 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 87 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 80 states have internal predecessors, (103), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:59,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:59,772 INFO L93 Difference]: Finished difference Result 165 states and 213 transitions. [2022-04-27 10:16:59,772 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 213 transitions. [2022-04-27 10:16:59,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:59,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:59,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 80 states have internal predecessors, (103), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 165 states. [2022-04-27 10:16:59,774 INFO L87 Difference]: Start difference. First operand has 87 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 80 states have internal predecessors, (103), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 165 states. [2022-04-27 10:16:59,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:59,778 INFO L93 Difference]: Finished difference Result 165 states and 213 transitions. [2022-04-27 10:16:59,778 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 213 transitions. [2022-04-27 10:16:59,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:59,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:59,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:59,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 80 states have internal predecessors, (103), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:59,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2022-04-27 10:16:59,781 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 28 [2022-04-27 10:16:59,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:59,781 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2022-04-27 10:16:59,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:59,781 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2022-04-27 10:16:59,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 10:16:59,782 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:59,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:59,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 10:16:59,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:16:59,995 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:59,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:59,996 INFO L85 PathProgramCache]: Analyzing trace with hash 777875589, now seen corresponding path program 1 times [2022-04-27 10:16:59,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:59,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874524169] [2022-04-27 10:16:59,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:59,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:00,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:17:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:00,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {2976#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {2960#true} is VALID [2022-04-27 10:17:00,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {2960#true} assume true; {2960#true} is VALID [2022-04-27 10:17:00,442 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2960#true} {2960#true} #123#return; {2960#true} is VALID [2022-04-27 10:17:00,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {2960#true} call ULTIMATE.init(); {2976#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:17:00,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {2976#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {2960#true} is VALID [2022-04-27 10:17:00,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {2960#true} assume true; {2960#true} is VALID [2022-04-27 10:17:00,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2960#true} {2960#true} #123#return; {2960#true} is VALID [2022-04-27 10:17:00,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {2960#true} call #t~ret22 := main(); {2960#true} is VALID [2022-04-27 10:17:00,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {2960#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {2960#true} is VALID [2022-04-27 10:17:00,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {2960#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {2960#true} is VALID [2022-04-27 10:17:00,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {2960#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {2965#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:17:00,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {2965#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {2965#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:17:00,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {2965#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2966#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (<= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) 0) (= main_~i~0 0) (<= 0 |main_~#Dest~0.offset|))} is VALID [2022-04-27 10:17:00,453 INFO L290 TraceCheckUtils]: 10: Hoare triple {2966#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (<= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) 0) (= main_~i~0 0) (<= 0 |main_~#Dest~0.offset|))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2967#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:17:00,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {2967#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} assume !(~i~0 < ~nodecount~0); {2967#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:17:00,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {2967#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} ~i~0 := 0; {2967#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:17:00,454 INFO L290 TraceCheckUtils]: 13: Hoare triple {2967#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {2968#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 1) (= main_~j~0 0) (= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 0))} is VALID [2022-04-27 10:17:00,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {2968#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 1) (= main_~j~0 0) (= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {2969#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= main_~j~0 0) (= main_~x~0 1) (= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 0))} is VALID [2022-04-27 10:17:00,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {2969#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= main_~j~0 0) (= main_~x~0 1) (= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 0))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {2970#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= main_~j~0 0) (= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 0))} is VALID [2022-04-27 10:17:00,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {2970#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= main_~j~0 0) (= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 0))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {2971#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:17:00,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {2971#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !(~j~0 < ~edgecount~0); {2971#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:17:00,457 INFO L290 TraceCheckUtils]: 18: Hoare triple {2971#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2971#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:17:00,457 INFO L290 TraceCheckUtils]: 19: Hoare triple {2971#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !(~i~0 < ~nodecount~0); {2971#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:17:00,457 INFO L290 TraceCheckUtils]: 20: Hoare triple {2971#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} ~i~0 := 0; {2971#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:17:00,458 INFO L290 TraceCheckUtils]: 21: Hoare triple {2971#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {2971#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:17:00,459 INFO L290 TraceCheckUtils]: 22: Hoare triple {2971#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {2971#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:17:00,459 INFO L290 TraceCheckUtils]: 23: Hoare triple {2971#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2971#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:17:00,459 INFO L290 TraceCheckUtils]: 24: Hoare triple {2971#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !(~i~0 < ~edgecount~0); {2971#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:17:00,460 INFO L290 TraceCheckUtils]: 25: Hoare triple {2971#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} ~i~0 := 0; {2972#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:17:00,461 INFO L290 TraceCheckUtils]: 26: Hoare triple {2972#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {2973#(= |main_#t~mem21| 0)} is VALID [2022-04-27 10:17:00,461 INFO L272 TraceCheckUtils]: 27: Hoare triple {2973#(= |main_#t~mem21| 0)} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {2974#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:17:00,462 INFO L290 TraceCheckUtils]: 28: Hoare triple {2974#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2975#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:17:00,462 INFO L290 TraceCheckUtils]: 29: Hoare triple {2975#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2961#false} is VALID [2022-04-27 10:17:00,462 INFO L290 TraceCheckUtils]: 30: Hoare triple {2961#false} assume !false; {2961#false} is VALID [2022-04-27 10:17:00,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:17:00,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:00,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874524169] [2022-04-27 10:17:00,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874524169] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:17:00,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439762345] [2022-04-27 10:17:00,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:00,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:00,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:17:00,464 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:17:00,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 10:17:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:00,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 10:17:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:00,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:17:00,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 77 [2022-04-27 10:17:00,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-04-27 10:17:01,117 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-04-27 10:17:01,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-04-27 10:17:01,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-04-27 10:17:01,950 INFO L272 TraceCheckUtils]: 0: Hoare triple {2960#true} call ULTIMATE.init(); {2960#true} is VALID [2022-04-27 10:17:01,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {2960#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {2960#true} is VALID [2022-04-27 10:17:01,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {2960#true} assume true; {2960#true} is VALID [2022-04-27 10:17:01,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2960#true} {2960#true} #123#return; {2960#true} is VALID [2022-04-27 10:17:01,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {2960#true} call #t~ret22 := main(); {2960#true} is VALID [2022-04-27 10:17:01,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {2960#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {2960#true} is VALID [2022-04-27 10:17:01,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {2960#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {2960#true} is VALID [2022-04-27 10:17:01,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {2960#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {3001#(and (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)))} is VALID [2022-04-27 10:17:01,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {3001#(and (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)))} assume !!(~i~0 < ~nodecount~0); {3001#(and (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)))} is VALID [2022-04-27 10:17:01,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {3001#(and (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3008#(and (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:01,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {3008#(and (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3008#(and (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:01,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {3008#(and (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~i~0 < ~nodecount~0); {3008#(and (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:01,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {3008#(and (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} ~i~0 := 0; {3008#(and (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:01,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {3008#(and (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3021#(and (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:01,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {3021#(and (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {3025#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)) (<= (select (select |#memory_int| |main_~#Dest~0.base|) 0) main_~x~0))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:01,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {3025#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)) (<= (select (select |#memory_int| |main_~#Dest~0.base|) 0) main_~x~0))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {3029#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:01,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {3029#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3029#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:01,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {3029#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~j~0 < ~edgecount~0); {3029#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:01,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {3029#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3029#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:01,964 INFO L290 TraceCheckUtils]: 19: Hoare triple {3029#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~i~0 < ~nodecount~0); {3029#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:01,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {3029#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} ~i~0 := 0; {3029#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:01,968 INFO L290 TraceCheckUtils]: 21: Hoare triple {3029#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {3029#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:01,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {3029#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {3029#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:01,969 INFO L290 TraceCheckUtils]: 23: Hoare triple {3029#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3029#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:01,970 INFO L290 TraceCheckUtils]: 24: Hoare triple {3029#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~i~0 < ~edgecount~0); {3029#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:01,975 INFO L290 TraceCheckUtils]: 25: Hoare triple {3029#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} ~i~0 := 0; {3060#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (= main_~i~0 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:01,976 INFO L290 TraceCheckUtils]: 26: Hoare triple {3060#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (= main_~i~0 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3064#(<= 0 |main_#t~mem21|)} is VALID [2022-04-27 10:17:01,976 INFO L272 TraceCheckUtils]: 27: Hoare triple {3064#(<= 0 |main_#t~mem21|)} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {3068#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:17:01,977 INFO L290 TraceCheckUtils]: 28: Hoare triple {3068#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3072#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:17:01,977 INFO L290 TraceCheckUtils]: 29: Hoare triple {3072#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2961#false} is VALID [2022-04-27 10:17:01,977 INFO L290 TraceCheckUtils]: 30: Hoare triple {2961#false} assume !false; {2961#false} is VALID [2022-04-27 10:17:01,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:17:01,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:17:04,267 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~x~0_9 Int)) (or (forall ((v_ArrVal_192 Int)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_9 4) |c_main_~#distance~0.offset|) v_ArrVal_192) |c_main_~#distance~0.offset|))) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)) v_main_~x~0_9)))) is different from false [2022-04-27 10:17:04,792 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~x~0_9 Int) (v_ArrVal_192 Int)) (or (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_9)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_9 4) |c_main_~#distance~0.offset|) v_ArrVal_192) |c_main_~#distance~0.offset|)))) is different from false [2022-04-27 10:17:10,642 INFO L290 TraceCheckUtils]: 30: Hoare triple {2961#false} assume !false; {2961#false} is VALID [2022-04-27 10:17:10,643 INFO L290 TraceCheckUtils]: 29: Hoare triple {3072#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2961#false} is VALID [2022-04-27 10:17:10,643 INFO L290 TraceCheckUtils]: 28: Hoare triple {3068#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3072#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:17:10,643 INFO L272 TraceCheckUtils]: 27: Hoare triple {3064#(<= 0 |main_#t~mem21|)} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {3068#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:17:10,644 INFO L290 TraceCheckUtils]: 26: Hoare triple {3091#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3064#(<= 0 |main_#t~mem21|)} is VALID [2022-04-27 10:17:10,644 INFO L290 TraceCheckUtils]: 25: Hoare triple {3095#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} ~i~0 := 0; {3091#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))))} is VALID [2022-04-27 10:17:10,644 INFO L290 TraceCheckUtils]: 24: Hoare triple {3095#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !(~i~0 < ~edgecount~0); {3095#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:17:10,645 INFO L290 TraceCheckUtils]: 23: Hoare triple {3095#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3095#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:17:10,645 INFO L290 TraceCheckUtils]: 22: Hoare triple {3095#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {3095#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:17:10,647 INFO L290 TraceCheckUtils]: 21: Hoare triple {3095#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {3095#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:17:10,647 INFO L290 TraceCheckUtils]: 20: Hoare triple {3095#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} ~i~0 := 0; {3095#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:17:10,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {3095#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !(~i~0 < ~nodecount~0); {3095#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:17:10,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {3095#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3095#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:17:10,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {3095#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !(~j~0 < ~edgecount~0); {3095#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:17:10,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {3095#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {3095#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:17:10,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {3126#(forall ((v_ArrVal_192 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_192) |main_~#distance~0.offset|)))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {3095#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:17:10,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {3130#(forall ((v_main_~x~0_9 Int)) (or (forall ((v_ArrVal_192 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_9 4) |main_~#distance~0.offset|) v_ArrVal_192) |main_~#distance~0.offset|))) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) v_main_~x~0_9))))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {3126#(forall ((v_ArrVal_192 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_192) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:10,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {3134#(forall ((v_main_~x~0_9 Int) (v_ArrVal_192 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_9 4) |main_~#distance~0.offset|) v_ArrVal_192) |main_~#distance~0.offset|)) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_9))))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3130#(forall ((v_main_~x~0_9 Int)) (or (forall ((v_ArrVal_192 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_9 4) |main_~#distance~0.offset|) v_ArrVal_192) |main_~#distance~0.offset|))) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) v_main_~x~0_9))))} is VALID [2022-04-27 10:17:10,653 INFO L290 TraceCheckUtils]: 12: Hoare triple {3134#(forall ((v_main_~x~0_9 Int) (v_ArrVal_192 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_9 4) |main_~#distance~0.offset|) v_ArrVal_192) |main_~#distance~0.offset|)) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_9))))} ~i~0 := 0; {3134#(forall ((v_main_~x~0_9 Int) (v_ArrVal_192 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_9 4) |main_~#distance~0.offset|) v_ArrVal_192) |main_~#distance~0.offset|)) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_9))))} is VALID [2022-04-27 10:17:10,654 INFO L290 TraceCheckUtils]: 11: Hoare triple {3134#(forall ((v_main_~x~0_9 Int) (v_ArrVal_192 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_9 4) |main_~#distance~0.offset|) v_ArrVal_192) |main_~#distance~0.offset|)) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_9))))} assume !(~i~0 < ~nodecount~0); {3134#(forall ((v_main_~x~0_9 Int) (v_ArrVal_192 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_9 4) |main_~#distance~0.offset|) v_ArrVal_192) |main_~#distance~0.offset|)) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_9))))} is VALID [2022-04-27 10:17:10,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {3134#(forall ((v_main_~x~0_9 Int) (v_ArrVal_192 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_9 4) |main_~#distance~0.offset|) v_ArrVal_192) |main_~#distance~0.offset|)) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_9))))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3134#(forall ((v_main_~x~0_9 Int) (v_ArrVal_192 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_9 4) |main_~#distance~0.offset|) v_ArrVal_192) |main_~#distance~0.offset|)) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_9))))} is VALID [2022-04-27 10:17:10,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {3147#(forall ((v_main_~x~0_9 Int) (v_ArrVal_192 Int) (v_ArrVal_191 Int)) (or (not (<= (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_191)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_9)) (not (<= 0 v_ArrVal_191)) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_191) (+ (* v_main_~x~0_9 4) |main_~#distance~0.offset|) v_ArrVal_192) |main_~#distance~0.offset|))))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3134#(forall ((v_main_~x~0_9 Int) (v_ArrVal_192 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_9 4) |main_~#distance~0.offset|) v_ArrVal_192) |main_~#distance~0.offset|)) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_9))))} is VALID [2022-04-27 10:17:10,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {3147#(forall ((v_main_~x~0_9 Int) (v_ArrVal_192 Int) (v_ArrVal_191 Int)) (or (not (<= (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_191)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_9)) (not (<= 0 v_ArrVal_191)) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_191) (+ (* v_main_~x~0_9 4) |main_~#distance~0.offset|) v_ArrVal_192) |main_~#distance~0.offset|))))} assume !!(~i~0 < ~nodecount~0); {3147#(forall ((v_main_~x~0_9 Int) (v_ArrVal_192 Int) (v_ArrVal_191 Int)) (or (not (<= (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_191)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_9)) (not (<= 0 v_ArrVal_191)) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_191) (+ (* v_main_~x~0_9 4) |main_~#distance~0.offset|) v_ArrVal_192) |main_~#distance~0.offset|))))} is VALID [2022-04-27 10:17:10,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {2960#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {3147#(forall ((v_main_~x~0_9 Int) (v_ArrVal_192 Int) (v_ArrVal_191 Int)) (or (not (<= (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_191)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_9)) (not (<= 0 v_ArrVal_191)) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_191) (+ (* v_main_~x~0_9 4) |main_~#distance~0.offset|) v_ArrVal_192) |main_~#distance~0.offset|))))} is VALID [2022-04-27 10:17:10,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {2960#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {2960#true} is VALID [2022-04-27 10:17:10,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {2960#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {2960#true} is VALID [2022-04-27 10:17:10,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {2960#true} call #t~ret22 := main(); {2960#true} is VALID [2022-04-27 10:17:10,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2960#true} {2960#true} #123#return; {2960#true} is VALID [2022-04-27 10:17:10,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {2960#true} assume true; {2960#true} is VALID [2022-04-27 10:17:10,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {2960#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {2960#true} is VALID [2022-04-27 10:17:10,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {2960#true} call ULTIMATE.init(); {2960#true} is VALID [2022-04-27 10:17:10,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-04-27 10:17:10,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439762345] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:17:10,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:17:10,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 29 [2022-04-27 10:17:10,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221701566] [2022-04-27 10:17:10,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:17:10,662 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 10:17:10,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:10,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:10,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:10,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-27 10:17:10,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:10,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-27 10:17:10,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=597, Unknown=3, NotChecked=102, Total=812 [2022-04-27 10:17:10,737 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand has 29 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:11,241 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) 1) (= |c_main_~#distance~0.offset| 0) (= |c_old(~INFINITY~0)| c_~INFINITY~0) (forall ((v_main_~x~0_9 Int) (v_ArrVal_192 Int)) (or (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_9)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_9 4) |c_main_~#distance~0.offset|) v_ArrVal_192) |c_main_~#distance~0.offset|)))) (= c_main_~i~0 0) (= (select (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|)) 0) (<= |c_main_~#Dest~0.offset| 0) (<= 0 |c_main_~#Dest~0.offset|) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-04-27 10:17:11,614 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) 1) (= |c_main_~#distance~0.offset| 0) (forall ((v_main_~x~0_9 Int) (v_ArrVal_192 Int)) (or (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_9)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_9 4) |c_main_~#distance~0.offset|) v_ArrVal_192) |c_main_~#distance~0.offset|)))) (= |c_main_~#Dest~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#distance~0.base|) 0) 0)) is different from false [2022-04-27 10:17:13,659 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|))) (and (forall ((v_main_~x~0_9 Int)) (or (forall ((v_ArrVal_192 Int)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_9 4) |c_main_~#distance~0.offset|) v_ArrVal_192) |c_main_~#distance~0.offset|))) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)) v_main_~x~0_9)))) (= .cse0 0) (= |c_main_~#distance~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#distance~0.base|) 0) 0) (= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) .cse0) 1) (= c_main_~j~0 0))) is different from false [2022-04-27 10:17:14,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:14,384 INFO L93 Difference]: Finished difference Result 130 states and 164 transitions. [2022-04-27 10:17:14,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 10:17:14,385 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 10:17:14,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:14,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:14,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 77 transitions. [2022-04-27 10:17:14,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:14,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 77 transitions. [2022-04-27 10:17:14,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 77 transitions. [2022-04-27 10:17:14,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:14,464 INFO L225 Difference]: With dead ends: 130 [2022-04-27 10:17:14,464 INFO L226 Difference]: Without dead ends: 128 [2022-04-27 10:17:14,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=205, Invalid=1215, Unknown=6, NotChecked=380, Total=1806 [2022-04-27 10:17:14,466 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 42 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 240 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:17:14,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 136 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 244 Invalid, 0 Unknown, 240 Unchecked, 0.2s Time] [2022-04-27 10:17:14,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-27 10:17:14,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 94. [2022-04-27 10:17:14,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:17:14,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 94 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 87 states have internal predecessors, (114), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:14,564 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 94 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 87 states have internal predecessors, (114), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:14,565 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 94 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 87 states have internal predecessors, (114), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:14,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:14,568 INFO L93 Difference]: Finished difference Result 128 states and 162 transitions. [2022-04-27 10:17:14,568 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 162 transitions. [2022-04-27 10:17:14,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:14,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:14,569 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 87 states have internal predecessors, (114), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 128 states. [2022-04-27 10:17:14,569 INFO L87 Difference]: Start difference. First operand has 94 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 87 states have internal predecessors, (114), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 128 states. [2022-04-27 10:17:14,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:14,572 INFO L93 Difference]: Finished difference Result 128 states and 162 transitions. [2022-04-27 10:17:14,572 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 162 transitions. [2022-04-27 10:17:14,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:14,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:14,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:17:14,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:17:14,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 87 states have internal predecessors, (114), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:14,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 121 transitions. [2022-04-27 10:17:14,575 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 121 transitions. Word has length 31 [2022-04-27 10:17:14,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:17:14,575 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 121 transitions. [2022-04-27 10:17:14,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:14,576 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 121 transitions. [2022-04-27 10:17:14,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 10:17:14,576 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:14,576 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-04-27 10:17:14,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 10:17:14,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:14,791 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:14,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:14,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1819082994, now seen corresponding path program 2 times [2022-04-27 10:17:14,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:14,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004883816] [2022-04-27 10:17:14,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:14,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:14,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:17:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:14,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {3795#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {3782#true} is VALID [2022-04-27 10:17:14,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {3782#true} assume true; {3782#true} is VALID [2022-04-27 10:17:14,953 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3782#true} {3782#true} #123#return; {3782#true} is VALID [2022-04-27 10:17:14,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {3782#true} call ULTIMATE.init(); {3795#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:17:14,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {3795#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {3782#true} is VALID [2022-04-27 10:17:14,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {3782#true} assume true; {3782#true} is VALID [2022-04-27 10:17:14,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3782#true} {3782#true} #123#return; {3782#true} is VALID [2022-04-27 10:17:14,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {3782#true} call #t~ret22 := main(); {3782#true} is VALID [2022-04-27 10:17:14,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {3782#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {3782#true} is VALID [2022-04-27 10:17:14,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {3782#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {3782#true} is VALID [2022-04-27 10:17:14,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {3782#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {3787#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:17:14,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {3787#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {3787#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:17:14,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {3787#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3788#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:17:14,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {3788#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) 0) (= main_~i~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3789#(and (not (= (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:17:14,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {3789#(and (not (= (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !!(~i~0 < ~nodecount~0); {3789#(and (not (= (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:17:14,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {3789#(and (not (= (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3790#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:17:14,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {3790#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3790#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:17:14,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {3790#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !(~i~0 < ~nodecount~0); {3790#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:17:14,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {3790#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} ~i~0 := 0; {3790#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:17:14,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {3790#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3790#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:17:14,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {3790#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !(~j~0 < ~edgecount~0); {3790#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:17:14,966 INFO L290 TraceCheckUtils]: 18: Hoare triple {3790#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3790#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:17:14,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {3790#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3790#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:17:14,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {3790#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !(~j~0 < ~edgecount~0); {3790#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:17:14,968 INFO L290 TraceCheckUtils]: 21: Hoare triple {3790#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3790#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:17:14,969 INFO L290 TraceCheckUtils]: 22: Hoare triple {3790#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !(~i~0 < ~nodecount~0); {3790#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:17:14,969 INFO L290 TraceCheckUtils]: 23: Hoare triple {3790#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} ~i~0 := 0; {3790#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:17:14,970 INFO L290 TraceCheckUtils]: 24: Hoare triple {3790#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !(~i~0 < ~edgecount~0); {3790#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:17:14,970 INFO L290 TraceCheckUtils]: 25: Hoare triple {3790#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} ~i~0 := 0; {3791#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) 0))} is VALID [2022-04-27 10:17:14,971 INFO L290 TraceCheckUtils]: 26: Hoare triple {3791#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) 0))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3792#(= |main_#t~mem21| 0)} is VALID [2022-04-27 10:17:14,971 INFO L272 TraceCheckUtils]: 27: Hoare triple {3792#(= |main_#t~mem21| 0)} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {3793#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:17:14,972 INFO L290 TraceCheckUtils]: 28: Hoare triple {3793#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3794#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:17:14,972 INFO L290 TraceCheckUtils]: 29: Hoare triple {3794#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3783#false} is VALID [2022-04-27 10:17:14,972 INFO L290 TraceCheckUtils]: 30: Hoare triple {3783#false} assume !false; {3783#false} is VALID [2022-04-27 10:17:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 10:17:14,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:14,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004883816] [2022-04-27 10:17:14,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004883816] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:17:14,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366414175] [2022-04-27 10:17:14,973 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:17:14,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:14,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:17:14,976 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:17:14,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 10:17:15,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:17:15,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:17:15,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 10:17:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:15,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:17:15,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-27 10:17:15,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:17:15,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-04-27 10:17:15,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-04-27 10:17:15,407 INFO L272 TraceCheckUtils]: 0: Hoare triple {3782#true} call ULTIMATE.init(); {3782#true} is VALID [2022-04-27 10:17:15,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {3782#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {3782#true} is VALID [2022-04-27 10:17:15,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {3782#true} assume true; {3782#true} is VALID [2022-04-27 10:17:15,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3782#true} {3782#true} #123#return; {3782#true} is VALID [2022-04-27 10:17:15,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {3782#true} call #t~ret22 := main(); {3782#true} is VALID [2022-04-27 10:17:15,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {3782#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {3782#true} is VALID [2022-04-27 10:17:15,408 INFO L290 TraceCheckUtils]: 6: Hoare triple {3782#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {3782#true} is VALID [2022-04-27 10:17:15,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {3782#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {3787#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:17:15,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {3787#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {3787#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:17:15,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {3787#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3826#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)))) (= main_~i~0 0))} is VALID [2022-04-27 10:17:15,410 INFO L290 TraceCheckUtils]: 10: Hoare triple {3826#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)))) (= main_~i~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3830#(and (= |main_~#distance~0.offset| 0) (<= 1 main_~i~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:15,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {3830#(and (= |main_~#distance~0.offset| 0) (<= 1 main_~i~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~nodecount~0); {3830#(and (= |main_~#distance~0.offset| 0) (<= 1 main_~i~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:15,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {3830#(and (= |main_~#distance~0.offset| 0) (<= 1 main_~i~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3837#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:15,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {3837#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3837#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:15,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {3837#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~i~0 < ~nodecount~0); {3837#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:15,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {3837#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} ~i~0 := 0; {3837#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:15,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {3837#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3837#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:15,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {3837#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~j~0 < ~edgecount~0); {3837#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:15,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {3837#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3837#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:15,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {3837#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3837#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:15,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {3837#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~j~0 < ~edgecount~0); {3837#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:15,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {3837#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3837#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:15,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {3837#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~i~0 < ~nodecount~0); {3837#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:15,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {3837#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} ~i~0 := 0; {3837#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:15,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {3837#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~i~0 < ~edgecount~0); {3837#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:15,416 INFO L290 TraceCheckUtils]: 25: Hoare triple {3837#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} ~i~0 := 0; {3826#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)))) (= main_~i~0 0))} is VALID [2022-04-27 10:17:15,416 INFO L290 TraceCheckUtils]: 26: Hoare triple {3826#(and (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)))) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3880#(<= 0 |main_#t~mem21|)} is VALID [2022-04-27 10:17:15,417 INFO L272 TraceCheckUtils]: 27: Hoare triple {3880#(<= 0 |main_#t~mem21|)} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {3884#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:17:15,417 INFO L290 TraceCheckUtils]: 28: Hoare triple {3884#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3888#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:17:15,417 INFO L290 TraceCheckUtils]: 29: Hoare triple {3888#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3783#false} is VALID [2022-04-27 10:17:15,417 INFO L290 TraceCheckUtils]: 30: Hoare triple {3783#false} assume !false; {3783#false} is VALID [2022-04-27 10:17:15,417 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 10:17:15,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:17:17,672 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_56 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_56)) (forall ((v_ArrVal_233 Int)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* v_main_~i~0_56 4)) v_ArrVal_233) |c_main_~#distance~0.offset|))))) is different from false [2022-04-27 10:17:17,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2022-04-27 10:17:17,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 150 [2022-04-27 10:17:18,004 INFO L290 TraceCheckUtils]: 30: Hoare triple {3783#false} assume !false; {3783#false} is VALID [2022-04-27 10:17:18,005 INFO L290 TraceCheckUtils]: 29: Hoare triple {3888#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3783#false} is VALID [2022-04-27 10:17:18,005 INFO L290 TraceCheckUtils]: 28: Hoare triple {3884#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3888#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:17:18,006 INFO L272 TraceCheckUtils]: 27: Hoare triple {3880#(<= 0 |main_#t~mem21|)} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {3884#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:17:18,006 INFO L290 TraceCheckUtils]: 26: Hoare triple {3907#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3880#(<= 0 |main_#t~mem21|)} is VALID [2022-04-27 10:17:18,007 INFO L290 TraceCheckUtils]: 25: Hoare triple {3911#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} ~i~0 := 0; {3907#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))))} is VALID [2022-04-27 10:17:18,007 INFO L290 TraceCheckUtils]: 24: Hoare triple {3911#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !(~i~0 < ~edgecount~0); {3911#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:17:18,007 INFO L290 TraceCheckUtils]: 23: Hoare triple {3911#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} ~i~0 := 0; {3911#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:17:18,008 INFO L290 TraceCheckUtils]: 22: Hoare triple {3911#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !(~i~0 < ~nodecount~0); {3911#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:17:18,008 INFO L290 TraceCheckUtils]: 21: Hoare triple {3911#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3911#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:17:18,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {3911#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !(~j~0 < ~edgecount~0); {3911#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:17:18,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {3911#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3911#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:17:18,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {3911#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3911#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:17:18,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {3911#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !(~j~0 < ~edgecount~0); {3911#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:17:18,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {3911#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {3911#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:17:18,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {3911#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} ~i~0 := 0; {3911#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:17:18,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {3911#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !(~i~0 < ~nodecount~0); {3911#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:17:18,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {3911#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3911#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:17:18,011 INFO L290 TraceCheckUtils]: 12: Hoare triple {3951#(forall ((v_ArrVal_233 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_233) |main_~#distance~0.offset|)))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3911#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:17:18,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {3951#(forall ((v_ArrVal_233 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_233) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~nodecount~0); {3951#(forall ((v_ArrVal_233 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_233) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:18,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {3958#(forall ((v_main_~i~0_56 Int)) (or (forall ((v_ArrVal_233 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* v_main_~i~0_56 4)) v_ArrVal_233) |main_~#distance~0.offset|))) (not (<= (+ main_~i~0 1) v_main_~i~0_56))))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3951#(forall ((v_ArrVal_233 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_233) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:18,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {3962#(= 0 (* main_~i~0 4))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {3958#(forall ((v_main_~i~0_56 Int)) (or (forall ((v_ArrVal_233 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* v_main_~i~0_56 4)) v_ArrVal_233) |main_~#distance~0.offset|))) (not (<= (+ main_~i~0 1) v_main_~i~0_56))))} is VALID [2022-04-27 10:17:18,013 INFO L290 TraceCheckUtils]: 8: Hoare triple {3962#(= 0 (* main_~i~0 4))} assume !!(~i~0 < ~nodecount~0); {3962#(= 0 (* main_~i~0 4))} is VALID [2022-04-27 10:17:18,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {3782#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {3962#(= 0 (* main_~i~0 4))} is VALID [2022-04-27 10:17:18,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {3782#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {3782#true} is VALID [2022-04-27 10:17:18,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {3782#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {3782#true} is VALID [2022-04-27 10:17:18,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {3782#true} call #t~ret22 := main(); {3782#true} is VALID [2022-04-27 10:17:18,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3782#true} {3782#true} #123#return; {3782#true} is VALID [2022-04-27 10:17:18,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {3782#true} assume true; {3782#true} is VALID [2022-04-27 10:17:18,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {3782#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {3782#true} is VALID [2022-04-27 10:17:18,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {3782#true} call ULTIMATE.init(); {3782#true} is VALID [2022-04-27 10:17:18,016 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 1 not checked. [2022-04-27 10:17:18,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366414175] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:17:18,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:17:18,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 22 [2022-04-27 10:17:18,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322663497] [2022-04-27 10:17:18,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:17:18,017 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.95) internal successors, (59), 19 states have internal predecessors, (59), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 10:17:18,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:18,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 20 states have (on average 2.95) internal successors, (59), 19 states have internal predecessors, (59), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:18,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:18,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-27 10:17:18,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:18,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-27 10:17:18,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=353, Unknown=1, NotChecked=38, Total=462 [2022-04-27 10:17:18,069 INFO L87 Difference]: Start difference. First operand 94 states and 121 transitions. Second operand has 22 states, 20 states have (on average 2.95) internal successors, (59), 19 states have internal predecessors, (59), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:20,222 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= |c_main_~#distance~0.offset| 0) (= |c_old(~INFINITY~0)| c_~INFINITY~0) (= c_main_~i~0 0) (= (select (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|)) 0) (forall ((v_main_~i~0_56 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_56)) (forall ((v_ArrVal_233 Int)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* v_main_~i~0_56 4)) v_ArrVal_233) |c_main_~#distance~0.offset|))))) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-04-27 10:17:21,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:21,508 INFO L93 Difference]: Finished difference Result 163 states and 205 transitions. [2022-04-27 10:17:21,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 10:17:21,508 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.95) internal successors, (59), 19 states have internal predecessors, (59), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 10:17:21,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:21,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 2.95) internal successors, (59), 19 states have internal predecessors, (59), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:21,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 99 transitions. [2022-04-27 10:17:21,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 2.95) internal successors, (59), 19 states have internal predecessors, (59), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:21,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 99 transitions. [2022-04-27 10:17:21,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 99 transitions. [2022-04-27 10:17:21,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:21,600 INFO L225 Difference]: With dead ends: 163 [2022-04-27 10:17:21,600 INFO L226 Difference]: Without dead ends: 161 [2022-04-27 10:17:21,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=162, Invalid=774, Unknown=2, NotChecked=118, Total=1056 [2022-04-27 10:17:21,601 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 163 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 10:17:21,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 85 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 584 Invalid, 0 Unknown, 80 Unchecked, 0.6s Time] [2022-04-27 10:17:21,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-27 10:17:21,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 82. [2022-04-27 10:17:21,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:17:21,672 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 82 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 75 states have internal predecessors, (97), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:21,672 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 82 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 75 states have internal predecessors, (97), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:21,673 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 82 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 75 states have internal predecessors, (97), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:21,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:21,677 INFO L93 Difference]: Finished difference Result 161 states and 203 transitions. [2022-04-27 10:17:21,677 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 203 transitions. [2022-04-27 10:17:21,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:21,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:21,678 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 75 states have internal predecessors, (97), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 161 states. [2022-04-27 10:17:21,678 INFO L87 Difference]: Start difference. First operand has 82 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 75 states have internal predecessors, (97), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 161 states. [2022-04-27 10:17:21,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:21,682 INFO L93 Difference]: Finished difference Result 161 states and 203 transitions. [2022-04-27 10:17:21,683 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 203 transitions. [2022-04-27 10:17:21,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:21,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:21,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:17:21,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:17:21,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 75 states have internal predecessors, (97), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:21,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 104 transitions. [2022-04-27 10:17:21,685 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 104 transitions. Word has length 31 [2022-04-27 10:17:21,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:17:21,685 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 104 transitions. [2022-04-27 10:17:21,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.95) internal successors, (59), 19 states have internal predecessors, (59), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:21,686 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 104 transitions. [2022-04-27 10:17:21,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 10:17:21,686 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:21,686 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:17:21,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 10:17:21,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:21,899 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:21,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:21,900 INFO L85 PathProgramCache]: Analyzing trace with hash -12240024, now seen corresponding path program 1 times [2022-04-27 10:17:21,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:21,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391081628] [2022-04-27 10:17:21,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:21,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:21,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:17:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:21,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {4696#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {4682#true} is VALID [2022-04-27 10:17:21,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {4682#true} assume true; {4682#true} is VALID [2022-04-27 10:17:21,976 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4682#true} {4682#true} #123#return; {4682#true} is VALID [2022-04-27 10:17:21,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-27 10:17:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:21,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {4682#true} ~cond := #in~cond; {4682#true} is VALID [2022-04-27 10:17:21,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {4682#true} assume !(0 == ~cond); {4682#true} is VALID [2022-04-27 10:17:21,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {4682#true} assume true; {4682#true} is VALID [2022-04-27 10:17:21,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4682#true} {4690#(and (= main_~i~0 0) (<= main_~nodecount~0 1))} #121#return; {4690#(and (= main_~i~0 0) (<= main_~nodecount~0 1))} is VALID [2022-04-27 10:17:21,986 INFO L272 TraceCheckUtils]: 0: Hoare triple {4682#true} call ULTIMATE.init(); {4696#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:17:21,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {4696#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {4682#true} is VALID [2022-04-27 10:17:21,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {4682#true} assume true; {4682#true} is VALID [2022-04-27 10:17:21,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4682#true} {4682#true} #123#return; {4682#true} is VALID [2022-04-27 10:17:21,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {4682#true} call #t~ret22 := main(); {4682#true} is VALID [2022-04-27 10:17:21,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {4682#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {4682#true} is VALID [2022-04-27 10:17:21,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {4682#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {4682#true} is VALID [2022-04-27 10:17:21,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {4682#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {4687#(= main_~i~0 0)} is VALID [2022-04-27 10:17:21,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {4687#(= main_~i~0 0)} assume !!(~i~0 < ~nodecount~0); {4687#(= main_~i~0 0)} is VALID [2022-04-27 10:17:21,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {4687#(= main_~i~0 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4687#(= main_~i~0 0)} is VALID [2022-04-27 10:17:21,988 INFO L290 TraceCheckUtils]: 10: Hoare triple {4687#(= main_~i~0 0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4688#(<= main_~i~0 1)} is VALID [2022-04-27 10:17:21,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {4688#(<= main_~i~0 1)} assume !(~i~0 < ~nodecount~0); {4689#(<= main_~nodecount~0 1)} is VALID [2022-04-27 10:17:21,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {4689#(<= main_~nodecount~0 1)} ~i~0 := 0; {4689#(<= main_~nodecount~0 1)} is VALID [2022-04-27 10:17:21,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {4689#(<= main_~nodecount~0 1)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4689#(<= main_~nodecount~0 1)} is VALID [2022-04-27 10:17:21,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {4689#(<= main_~nodecount~0 1)} assume !(~j~0 < ~edgecount~0); {4689#(<= main_~nodecount~0 1)} is VALID [2022-04-27 10:17:21,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {4689#(<= main_~nodecount~0 1)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4689#(<= main_~nodecount~0 1)} is VALID [2022-04-27 10:17:21,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {4689#(<= main_~nodecount~0 1)} assume !(~i~0 < ~nodecount~0); {4689#(<= main_~nodecount~0 1)} is VALID [2022-04-27 10:17:21,990 INFO L290 TraceCheckUtils]: 17: Hoare triple {4689#(<= main_~nodecount~0 1)} ~i~0 := 0; {4689#(<= main_~nodecount~0 1)} is VALID [2022-04-27 10:17:21,990 INFO L290 TraceCheckUtils]: 18: Hoare triple {4689#(<= main_~nodecount~0 1)} assume !(~i~0 < ~edgecount~0); {4689#(<= main_~nodecount~0 1)} is VALID [2022-04-27 10:17:21,991 INFO L290 TraceCheckUtils]: 19: Hoare triple {4689#(<= main_~nodecount~0 1)} ~i~0 := 0; {4690#(and (= main_~i~0 0) (<= main_~nodecount~0 1))} is VALID [2022-04-27 10:17:21,991 INFO L290 TraceCheckUtils]: 20: Hoare triple {4690#(and (= main_~i~0 0) (<= main_~nodecount~0 1))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4690#(and (= main_~i~0 0) (<= main_~nodecount~0 1))} is VALID [2022-04-27 10:17:21,991 INFO L272 TraceCheckUtils]: 21: Hoare triple {4690#(and (= main_~i~0 0) (<= main_~nodecount~0 1))} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {4682#true} is VALID [2022-04-27 10:17:21,991 INFO L290 TraceCheckUtils]: 22: Hoare triple {4682#true} ~cond := #in~cond; {4682#true} is VALID [2022-04-27 10:17:21,991 INFO L290 TraceCheckUtils]: 23: Hoare triple {4682#true} assume !(0 == ~cond); {4682#true} is VALID [2022-04-27 10:17:21,991 INFO L290 TraceCheckUtils]: 24: Hoare triple {4682#true} assume true; {4682#true} is VALID [2022-04-27 10:17:21,992 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {4682#true} {4690#(and (= main_~i~0 0) (<= main_~nodecount~0 1))} #121#return; {4690#(and (= main_~i~0 0) (<= main_~nodecount~0 1))} is VALID [2022-04-27 10:17:21,992 INFO L290 TraceCheckUtils]: 26: Hoare triple {4690#(and (= main_~i~0 0) (<= main_~nodecount~0 1))} havoc #t~mem21; {4690#(and (= main_~i~0 0) (<= main_~nodecount~0 1))} is VALID [2022-04-27 10:17:21,993 INFO L290 TraceCheckUtils]: 27: Hoare triple {4690#(and (= main_~i~0 0) (<= main_~nodecount~0 1))} #t~post20 := ~i~0;~i~0 := 1 + #t~post20;havoc #t~post20; {4695#(<= main_~nodecount~0 main_~i~0)} is VALID [2022-04-27 10:17:21,993 INFO L290 TraceCheckUtils]: 28: Hoare triple {4695#(<= main_~nodecount~0 main_~i~0)} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4683#false} is VALID [2022-04-27 10:17:21,993 INFO L272 TraceCheckUtils]: 29: Hoare triple {4683#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {4683#false} is VALID [2022-04-27 10:17:21,993 INFO L290 TraceCheckUtils]: 30: Hoare triple {4683#false} ~cond := #in~cond; {4683#false} is VALID [2022-04-27 10:17:21,993 INFO L290 TraceCheckUtils]: 31: Hoare triple {4683#false} assume 0 == ~cond; {4683#false} is VALID [2022-04-27 10:17:21,993 INFO L290 TraceCheckUtils]: 32: Hoare triple {4683#false} assume !false; {4683#false} is VALID [2022-04-27 10:17:21,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:17:21,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:21,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391081628] [2022-04-27 10:17:21,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391081628] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:17:21,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251599496] [2022-04-27 10:17:21,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:21,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:21,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:17:21,995 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:17:21,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 10:17:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:22,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 10:17:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:22,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:17:22,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {4682#true} call ULTIMATE.init(); {4682#true} is VALID [2022-04-27 10:17:22,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {4682#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {4682#true} is VALID [2022-04-27 10:17:22,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {4682#true} assume true; {4682#true} is VALID [2022-04-27 10:17:22,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4682#true} {4682#true} #123#return; {4682#true} is VALID [2022-04-27 10:17:22,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {4682#true} call #t~ret22 := main(); {4682#true} is VALID [2022-04-27 10:17:22,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {4682#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {4682#true} is VALID [2022-04-27 10:17:22,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {4682#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {4682#true} is VALID [2022-04-27 10:17:22,255 INFO L290 TraceCheckUtils]: 7: Hoare triple {4682#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {4721#(<= main_~i~0 0)} is VALID [2022-04-27 10:17:22,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {4721#(<= main_~i~0 0)} assume !!(~i~0 < ~nodecount~0); {4721#(<= main_~i~0 0)} is VALID [2022-04-27 10:17:22,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {4721#(<= main_~i~0 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4721#(<= main_~i~0 0)} is VALID [2022-04-27 10:17:22,256 INFO L290 TraceCheckUtils]: 10: Hoare triple {4721#(<= main_~i~0 0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4688#(<= main_~i~0 1)} is VALID [2022-04-27 10:17:22,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {4688#(<= main_~i~0 1)} assume !(~i~0 < ~nodecount~0); {4689#(<= main_~nodecount~0 1)} is VALID [2022-04-27 10:17:22,256 INFO L290 TraceCheckUtils]: 12: Hoare triple {4689#(<= main_~nodecount~0 1)} ~i~0 := 0; {4689#(<= main_~nodecount~0 1)} is VALID [2022-04-27 10:17:22,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {4689#(<= main_~nodecount~0 1)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4689#(<= main_~nodecount~0 1)} is VALID [2022-04-27 10:17:22,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {4689#(<= main_~nodecount~0 1)} assume !(~j~0 < ~edgecount~0); {4689#(<= main_~nodecount~0 1)} is VALID [2022-04-27 10:17:22,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {4689#(<= main_~nodecount~0 1)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4689#(<= main_~nodecount~0 1)} is VALID [2022-04-27 10:17:22,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {4689#(<= main_~nodecount~0 1)} assume !(~i~0 < ~nodecount~0); {4689#(<= main_~nodecount~0 1)} is VALID [2022-04-27 10:17:22,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {4689#(<= main_~nodecount~0 1)} ~i~0 := 0; {4689#(<= main_~nodecount~0 1)} is VALID [2022-04-27 10:17:22,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {4689#(<= main_~nodecount~0 1)} assume !(~i~0 < ~edgecount~0); {4689#(<= main_~nodecount~0 1)} is VALID [2022-04-27 10:17:22,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {4689#(<= main_~nodecount~0 1)} ~i~0 := 0; {4758#(and (<= 0 main_~i~0) (<= main_~nodecount~0 1))} is VALID [2022-04-27 10:17:22,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {4758#(and (<= 0 main_~i~0) (<= main_~nodecount~0 1))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4758#(and (<= 0 main_~i~0) (<= main_~nodecount~0 1))} is VALID [2022-04-27 10:17:22,259 INFO L272 TraceCheckUtils]: 21: Hoare triple {4758#(and (<= 0 main_~i~0) (<= main_~nodecount~0 1))} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {4682#true} is VALID [2022-04-27 10:17:22,259 INFO L290 TraceCheckUtils]: 22: Hoare triple {4682#true} ~cond := #in~cond; {4682#true} is VALID [2022-04-27 10:17:22,259 INFO L290 TraceCheckUtils]: 23: Hoare triple {4682#true} assume !(0 == ~cond); {4682#true} is VALID [2022-04-27 10:17:22,259 INFO L290 TraceCheckUtils]: 24: Hoare triple {4682#true} assume true; {4682#true} is VALID [2022-04-27 10:17:22,259 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {4682#true} {4758#(and (<= 0 main_~i~0) (<= main_~nodecount~0 1))} #121#return; {4758#(and (<= 0 main_~i~0) (<= main_~nodecount~0 1))} is VALID [2022-04-27 10:17:22,260 INFO L290 TraceCheckUtils]: 26: Hoare triple {4758#(and (<= 0 main_~i~0) (<= main_~nodecount~0 1))} havoc #t~mem21; {4758#(and (<= 0 main_~i~0) (<= main_~nodecount~0 1))} is VALID [2022-04-27 10:17:22,260 INFO L290 TraceCheckUtils]: 27: Hoare triple {4758#(and (<= 0 main_~i~0) (<= main_~nodecount~0 1))} #t~post20 := ~i~0;~i~0 := 1 + #t~post20;havoc #t~post20; {4783#(and (<= main_~nodecount~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:17:22,260 INFO L290 TraceCheckUtils]: 28: Hoare triple {4783#(and (<= main_~nodecount~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4683#false} is VALID [2022-04-27 10:17:22,260 INFO L272 TraceCheckUtils]: 29: Hoare triple {4683#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {4683#false} is VALID [2022-04-27 10:17:22,261 INFO L290 TraceCheckUtils]: 30: Hoare triple {4683#false} ~cond := #in~cond; {4683#false} is VALID [2022-04-27 10:17:22,261 INFO L290 TraceCheckUtils]: 31: Hoare triple {4683#false} assume 0 == ~cond; {4683#false} is VALID [2022-04-27 10:17:22,261 INFO L290 TraceCheckUtils]: 32: Hoare triple {4683#false} assume !false; {4683#false} is VALID [2022-04-27 10:17:22,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:17:22,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:17:22,406 INFO L290 TraceCheckUtils]: 32: Hoare triple {4683#false} assume !false; {4683#false} is VALID [2022-04-27 10:17:22,406 INFO L290 TraceCheckUtils]: 31: Hoare triple {4683#false} assume 0 == ~cond; {4683#false} is VALID [2022-04-27 10:17:22,406 INFO L290 TraceCheckUtils]: 30: Hoare triple {4683#false} ~cond := #in~cond; {4683#false} is VALID [2022-04-27 10:17:22,407 INFO L272 TraceCheckUtils]: 29: Hoare triple {4683#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {4683#false} is VALID [2022-04-27 10:17:22,407 INFO L290 TraceCheckUtils]: 28: Hoare triple {4695#(<= main_~nodecount~0 main_~i~0)} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4683#false} is VALID [2022-04-27 10:17:22,408 INFO L290 TraceCheckUtils]: 27: Hoare triple {4814#(<= main_~nodecount~0 (+ main_~i~0 1))} #t~post20 := ~i~0;~i~0 := 1 + #t~post20;havoc #t~post20; {4695#(<= main_~nodecount~0 main_~i~0)} is VALID [2022-04-27 10:17:22,408 INFO L290 TraceCheckUtils]: 26: Hoare triple {4814#(<= main_~nodecount~0 (+ main_~i~0 1))} havoc #t~mem21; {4814#(<= main_~nodecount~0 (+ main_~i~0 1))} is VALID [2022-04-27 10:17:22,409 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {4682#true} {4814#(<= main_~nodecount~0 (+ main_~i~0 1))} #121#return; {4814#(<= main_~nodecount~0 (+ main_~i~0 1))} is VALID [2022-04-27 10:17:22,409 INFO L290 TraceCheckUtils]: 24: Hoare triple {4682#true} assume true; {4682#true} is VALID [2022-04-27 10:17:22,409 INFO L290 TraceCheckUtils]: 23: Hoare triple {4682#true} assume !(0 == ~cond); {4682#true} is VALID [2022-04-27 10:17:22,409 INFO L290 TraceCheckUtils]: 22: Hoare triple {4682#true} ~cond := #in~cond; {4682#true} is VALID [2022-04-27 10:17:22,409 INFO L272 TraceCheckUtils]: 21: Hoare triple {4814#(<= main_~nodecount~0 (+ main_~i~0 1))} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {4682#true} is VALID [2022-04-27 10:17:22,409 INFO L290 TraceCheckUtils]: 20: Hoare triple {4814#(<= main_~nodecount~0 (+ main_~i~0 1))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4814#(<= main_~nodecount~0 (+ main_~i~0 1))} is VALID [2022-04-27 10:17:22,410 INFO L290 TraceCheckUtils]: 19: Hoare triple {4689#(<= main_~nodecount~0 1)} ~i~0 := 0; {4814#(<= main_~nodecount~0 (+ main_~i~0 1))} is VALID [2022-04-27 10:17:22,410 INFO L290 TraceCheckUtils]: 18: Hoare triple {4689#(<= main_~nodecount~0 1)} assume !(~i~0 < ~edgecount~0); {4689#(<= main_~nodecount~0 1)} is VALID [2022-04-27 10:17:22,410 INFO L290 TraceCheckUtils]: 17: Hoare triple {4689#(<= main_~nodecount~0 1)} ~i~0 := 0; {4689#(<= main_~nodecount~0 1)} is VALID [2022-04-27 10:17:22,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {4689#(<= main_~nodecount~0 1)} assume !(~i~0 < ~nodecount~0); {4689#(<= main_~nodecount~0 1)} is VALID [2022-04-27 10:17:22,411 INFO L290 TraceCheckUtils]: 15: Hoare triple {4689#(<= main_~nodecount~0 1)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4689#(<= main_~nodecount~0 1)} is VALID [2022-04-27 10:17:22,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {4689#(<= main_~nodecount~0 1)} assume !(~j~0 < ~edgecount~0); {4689#(<= main_~nodecount~0 1)} is VALID [2022-04-27 10:17:22,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {4689#(<= main_~nodecount~0 1)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {4689#(<= main_~nodecount~0 1)} is VALID [2022-04-27 10:17:22,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {4689#(<= main_~nodecount~0 1)} ~i~0 := 0; {4689#(<= main_~nodecount~0 1)} is VALID [2022-04-27 10:17:22,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {4688#(<= main_~i~0 1)} assume !(~i~0 < ~nodecount~0); {4689#(<= main_~nodecount~0 1)} is VALID [2022-04-27 10:17:22,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {4721#(<= main_~i~0 0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4688#(<= main_~i~0 1)} is VALID [2022-04-27 10:17:22,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {4721#(<= main_~i~0 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {4721#(<= main_~i~0 0)} is VALID [2022-04-27 10:17:22,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {4721#(<= main_~i~0 0)} assume !!(~i~0 < ~nodecount~0); {4721#(<= main_~i~0 0)} is VALID [2022-04-27 10:17:22,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {4682#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {4721#(<= main_~i~0 0)} is VALID [2022-04-27 10:17:22,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {4682#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {4682#true} is VALID [2022-04-27 10:17:22,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {4682#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {4682#true} is VALID [2022-04-27 10:17:22,416 INFO L272 TraceCheckUtils]: 4: Hoare triple {4682#true} call #t~ret22 := main(); {4682#true} is VALID [2022-04-27 10:17:22,416 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4682#true} {4682#true} #123#return; {4682#true} is VALID [2022-04-27 10:17:22,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {4682#true} assume true; {4682#true} is VALID [2022-04-27 10:17:22,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {4682#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {4682#true} is VALID [2022-04-27 10:17:22,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {4682#true} call ULTIMATE.init(); {4682#true} is VALID [2022-04-27 10:17:22,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:17:22,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251599496] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:17:22,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:17:22,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-04-27 10:17:22,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191633149] [2022-04-27 10:17:22,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:17:22,418 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 33 [2022-04-27 10:17:22,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:22,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:17:22,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:22,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 10:17:22,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:22,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 10:17:22,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:17:22,460 INFO L87 Difference]: Start difference. First operand 82 states and 104 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:17:23,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:23,188 INFO L93 Difference]: Finished difference Result 208 states and 265 transitions. [2022-04-27 10:17:23,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 10:17:23,188 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 33 [2022-04-27 10:17:23,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:23,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:17:23,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2022-04-27 10:17:23,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:17:23,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2022-04-27 10:17:23,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 136 transitions. [2022-04-27 10:17:23,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:23,303 INFO L225 Difference]: With dead ends: 208 [2022-04-27 10:17:23,303 INFO L226 Difference]: Without dead ends: 138 [2022-04-27 10:17:23,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-04-27 10:17:23,304 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 186 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:17:23,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 48 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:17:23,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-04-27 10:17:23,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 96. [2022-04-27 10:17:23,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:17:23,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand has 96 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 89 states have internal predecessors, (111), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:23,402 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand has 96 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 89 states have internal predecessors, (111), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:23,402 INFO L87 Difference]: Start difference. First operand 138 states. Second operand has 96 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 89 states have internal predecessors, (111), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:23,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:23,406 INFO L93 Difference]: Finished difference Result 138 states and 173 transitions. [2022-04-27 10:17:23,406 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 173 transitions. [2022-04-27 10:17:23,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:23,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:23,407 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 89 states have internal predecessors, (111), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 138 states. [2022-04-27 10:17:23,407 INFO L87 Difference]: Start difference. First operand has 96 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 89 states have internal predecessors, (111), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 138 states. [2022-04-27 10:17:23,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:23,410 INFO L93 Difference]: Finished difference Result 138 states and 173 transitions. [2022-04-27 10:17:23,410 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 173 transitions. [2022-04-27 10:17:23,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:23,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:23,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:17:23,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:17:23,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 89 states have internal predecessors, (111), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:23,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 119 transitions. [2022-04-27 10:17:23,413 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 119 transitions. Word has length 33 [2022-04-27 10:17:23,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:17:23,414 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 119 transitions. [2022-04-27 10:17:23,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:17:23,414 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2022-04-27 10:17:23,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 10:17:23,414 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:23,414 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:17:23,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 10:17:23,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:23,636 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:23,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:23,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1882894858, now seen corresponding path program 2 times [2022-04-27 10:17:23,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:23,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896679153] [2022-04-27 10:17:23,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:23,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:23,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:17:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:23,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {5627#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {5617#true} is VALID [2022-04-27 10:17:23,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {5617#true} assume true; {5617#true} is VALID [2022-04-27 10:17:23,739 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5617#true} {5617#true} #123#return; {5617#true} is VALID [2022-04-27 10:17:23,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {5617#true} call ULTIMATE.init(); {5627#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:17:23,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {5627#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {5617#true} is VALID [2022-04-27 10:17:23,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {5617#true} assume true; {5617#true} is VALID [2022-04-27 10:17:23,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5617#true} {5617#true} #123#return; {5617#true} is VALID [2022-04-27 10:17:23,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {5617#true} call #t~ret22 := main(); {5617#true} is VALID [2022-04-27 10:17:23,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {5617#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {5617#true} is VALID [2022-04-27 10:17:23,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {5617#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {5617#true} is VALID [2022-04-27 10:17:23,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {5617#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {5617#true} is VALID [2022-04-27 10:17:23,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {5617#true} assume !!(~i~0 < ~nodecount~0); {5617#true} is VALID [2022-04-27 10:17:23,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {5617#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5617#true} is VALID [2022-04-27 10:17:23,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {5617#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5617#true} is VALID [2022-04-27 10:17:23,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {5617#true} assume !(~i~0 < ~nodecount~0); {5617#true} is VALID [2022-04-27 10:17:23,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {5617#true} ~i~0 := 0; {5617#true} is VALID [2022-04-27 10:17:23,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {5617#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5622#(= main_~j~0 0)} is VALID [2022-04-27 10:17:23,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {5622#(= main_~j~0 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5622#(= main_~j~0 0)} is VALID [2022-04-27 10:17:23,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {5622#(= main_~j~0 0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {5622#(= main_~j~0 0)} is VALID [2022-04-27 10:17:23,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {5622#(= main_~j~0 0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5623#(<= 1 main_~j~0)} is VALID [2022-04-27 10:17:23,742 INFO L290 TraceCheckUtils]: 17: Hoare triple {5623#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5624#(<= 2 main_~edgecount~0)} is VALID [2022-04-27 10:17:23,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {5624#(<= 2 main_~edgecount~0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {5624#(<= 2 main_~edgecount~0)} is VALID [2022-04-27 10:17:23,743 INFO L290 TraceCheckUtils]: 19: Hoare triple {5624#(<= 2 main_~edgecount~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5624#(<= 2 main_~edgecount~0)} is VALID [2022-04-27 10:17:23,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {5624#(<= 2 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {5624#(<= 2 main_~edgecount~0)} is VALID [2022-04-27 10:17:23,744 INFO L290 TraceCheckUtils]: 21: Hoare triple {5624#(<= 2 main_~edgecount~0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5624#(<= 2 main_~edgecount~0)} is VALID [2022-04-27 10:17:23,744 INFO L290 TraceCheckUtils]: 22: Hoare triple {5624#(<= 2 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {5624#(<= 2 main_~edgecount~0)} is VALID [2022-04-27 10:17:23,744 INFO L290 TraceCheckUtils]: 23: Hoare triple {5624#(<= 2 main_~edgecount~0)} ~i~0 := 0; {5625#(and (<= 2 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-27 10:17:23,745 INFO L290 TraceCheckUtils]: 24: Hoare triple {5625#(and (<= 2 main_~edgecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {5625#(and (<= 2 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-27 10:17:23,745 INFO L290 TraceCheckUtils]: 25: Hoare triple {5625#(and (<= 2 main_~edgecount~0) (= main_~i~0 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {5625#(and (<= 2 main_~edgecount~0) (= main_~i~0 0))} is VALID [2022-04-27 10:17:23,746 INFO L290 TraceCheckUtils]: 26: Hoare triple {5625#(and (<= 2 main_~edgecount~0) (= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5626#(<= (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-27 10:17:23,746 INFO L290 TraceCheckUtils]: 27: Hoare triple {5626#(<= (+ main_~i~0 1) main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {5618#false} is VALID [2022-04-27 10:17:23,746 INFO L290 TraceCheckUtils]: 28: Hoare triple {5618#false} ~i~0 := 0; {5618#false} is VALID [2022-04-27 10:17:23,746 INFO L290 TraceCheckUtils]: 29: Hoare triple {5618#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5618#false} is VALID [2022-04-27 10:17:23,747 INFO L272 TraceCheckUtils]: 30: Hoare triple {5618#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {5618#false} is VALID [2022-04-27 10:17:23,747 INFO L290 TraceCheckUtils]: 31: Hoare triple {5618#false} ~cond := #in~cond; {5618#false} is VALID [2022-04-27 10:17:23,747 INFO L290 TraceCheckUtils]: 32: Hoare triple {5618#false} assume 0 == ~cond; {5618#false} is VALID [2022-04-27 10:17:23,747 INFO L290 TraceCheckUtils]: 33: Hoare triple {5618#false} assume !false; {5618#false} is VALID [2022-04-27 10:17:23,747 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:17:23,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:23,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896679153] [2022-04-27 10:17:23,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896679153] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:17:23,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127456610] [2022-04-27 10:17:23,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:17:23,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:23,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:17:23,749 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:17:23,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 10:17:23,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:17:23,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:17:23,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 10:17:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:23,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:17:24,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {5617#true} call ULTIMATE.init(); {5617#true} is VALID [2022-04-27 10:17:24,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {5617#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {5617#true} is VALID [2022-04-27 10:17:24,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {5617#true} assume true; {5617#true} is VALID [2022-04-27 10:17:24,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5617#true} {5617#true} #123#return; {5617#true} is VALID [2022-04-27 10:17:24,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {5617#true} call #t~ret22 := main(); {5617#true} is VALID [2022-04-27 10:17:24,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {5617#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {5617#true} is VALID [2022-04-27 10:17:24,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {5617#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {5617#true} is VALID [2022-04-27 10:17:24,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {5617#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {5617#true} is VALID [2022-04-27 10:17:24,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {5617#true} assume !!(~i~0 < ~nodecount~0); {5617#true} is VALID [2022-04-27 10:17:24,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {5617#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5617#true} is VALID [2022-04-27 10:17:24,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {5617#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5617#true} is VALID [2022-04-27 10:17:24,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {5617#true} assume !(~i~0 < ~nodecount~0); {5617#true} is VALID [2022-04-27 10:17:24,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {5617#true} ~i~0 := 0; {5617#true} is VALID [2022-04-27 10:17:24,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {5617#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5670#(<= 0 main_~j~0)} is VALID [2022-04-27 10:17:24,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {5670#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5670#(<= 0 main_~j~0)} is VALID [2022-04-27 10:17:24,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {5670#(<= 0 main_~j~0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {5670#(<= 0 main_~j~0)} is VALID [2022-04-27 10:17:24,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {5670#(<= 0 main_~j~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5623#(<= 1 main_~j~0)} is VALID [2022-04-27 10:17:24,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {5623#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5624#(<= 2 main_~edgecount~0)} is VALID [2022-04-27 10:17:24,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {5624#(<= 2 main_~edgecount~0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {5624#(<= 2 main_~edgecount~0)} is VALID [2022-04-27 10:17:24,032 INFO L290 TraceCheckUtils]: 19: Hoare triple {5624#(<= 2 main_~edgecount~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5624#(<= 2 main_~edgecount~0)} is VALID [2022-04-27 10:17:24,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {5624#(<= 2 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {5624#(<= 2 main_~edgecount~0)} is VALID [2022-04-27 10:17:24,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {5624#(<= 2 main_~edgecount~0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5624#(<= 2 main_~edgecount~0)} is VALID [2022-04-27 10:17:24,033 INFO L290 TraceCheckUtils]: 22: Hoare triple {5624#(<= 2 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {5624#(<= 2 main_~edgecount~0)} is VALID [2022-04-27 10:17:24,033 INFO L290 TraceCheckUtils]: 23: Hoare triple {5624#(<= 2 main_~edgecount~0)} ~i~0 := 0; {5701#(and (<= main_~i~0 0) (<= 2 main_~edgecount~0))} is VALID [2022-04-27 10:17:24,034 INFO L290 TraceCheckUtils]: 24: Hoare triple {5701#(and (<= main_~i~0 0) (<= 2 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {5701#(and (<= main_~i~0 0) (<= 2 main_~edgecount~0))} is VALID [2022-04-27 10:17:24,034 INFO L290 TraceCheckUtils]: 25: Hoare triple {5701#(and (<= main_~i~0 0) (<= 2 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {5701#(and (<= main_~i~0 0) (<= 2 main_~edgecount~0))} is VALID [2022-04-27 10:17:24,034 INFO L290 TraceCheckUtils]: 26: Hoare triple {5701#(and (<= main_~i~0 0) (<= 2 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5711#(and (<= main_~i~0 1) (<= 2 main_~edgecount~0))} is VALID [2022-04-27 10:17:24,035 INFO L290 TraceCheckUtils]: 27: Hoare triple {5711#(and (<= main_~i~0 1) (<= 2 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {5618#false} is VALID [2022-04-27 10:17:24,035 INFO L290 TraceCheckUtils]: 28: Hoare triple {5618#false} ~i~0 := 0; {5618#false} is VALID [2022-04-27 10:17:24,035 INFO L290 TraceCheckUtils]: 29: Hoare triple {5618#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5618#false} is VALID [2022-04-27 10:17:24,035 INFO L272 TraceCheckUtils]: 30: Hoare triple {5618#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {5618#false} is VALID [2022-04-27 10:17:24,035 INFO L290 TraceCheckUtils]: 31: Hoare triple {5618#false} ~cond := #in~cond; {5618#false} is VALID [2022-04-27 10:17:24,035 INFO L290 TraceCheckUtils]: 32: Hoare triple {5618#false} assume 0 == ~cond; {5618#false} is VALID [2022-04-27 10:17:24,035 INFO L290 TraceCheckUtils]: 33: Hoare triple {5618#false} assume !false; {5618#false} is VALID [2022-04-27 10:17:24,036 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:17:24,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:17:24,185 INFO L290 TraceCheckUtils]: 33: Hoare triple {5618#false} assume !false; {5618#false} is VALID [2022-04-27 10:17:24,185 INFO L290 TraceCheckUtils]: 32: Hoare triple {5618#false} assume 0 == ~cond; {5618#false} is VALID [2022-04-27 10:17:24,185 INFO L290 TraceCheckUtils]: 31: Hoare triple {5618#false} ~cond := #in~cond; {5618#false} is VALID [2022-04-27 10:17:24,185 INFO L272 TraceCheckUtils]: 30: Hoare triple {5618#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {5618#false} is VALID [2022-04-27 10:17:24,185 INFO L290 TraceCheckUtils]: 29: Hoare triple {5618#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5618#false} is VALID [2022-04-27 10:17:24,185 INFO L290 TraceCheckUtils]: 28: Hoare triple {5618#false} ~i~0 := 0; {5618#false} is VALID [2022-04-27 10:17:24,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {5626#(<= (+ main_~i~0 1) main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {5618#false} is VALID [2022-04-27 10:17:24,187 INFO L290 TraceCheckUtils]: 26: Hoare triple {5754#(<= (+ main_~i~0 2) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {5626#(<= (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-27 10:17:24,187 INFO L290 TraceCheckUtils]: 25: Hoare triple {5754#(<= (+ main_~i~0 2) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {5754#(<= (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-27 10:17:24,187 INFO L290 TraceCheckUtils]: 24: Hoare triple {5754#(<= (+ main_~i~0 2) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {5754#(<= (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-27 10:17:24,188 INFO L290 TraceCheckUtils]: 23: Hoare triple {5624#(<= 2 main_~edgecount~0)} ~i~0 := 0; {5754#(<= (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-27 10:17:24,188 INFO L290 TraceCheckUtils]: 22: Hoare triple {5624#(<= 2 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {5624#(<= 2 main_~edgecount~0)} is VALID [2022-04-27 10:17:24,189 INFO L290 TraceCheckUtils]: 21: Hoare triple {5624#(<= 2 main_~edgecount~0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5624#(<= 2 main_~edgecount~0)} is VALID [2022-04-27 10:17:24,189 INFO L290 TraceCheckUtils]: 20: Hoare triple {5624#(<= 2 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {5624#(<= 2 main_~edgecount~0)} is VALID [2022-04-27 10:17:24,189 INFO L290 TraceCheckUtils]: 19: Hoare triple {5624#(<= 2 main_~edgecount~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5624#(<= 2 main_~edgecount~0)} is VALID [2022-04-27 10:17:24,190 INFO L290 TraceCheckUtils]: 18: Hoare triple {5624#(<= 2 main_~edgecount~0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {5624#(<= 2 main_~edgecount~0)} is VALID [2022-04-27 10:17:24,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {5623#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5624#(<= 2 main_~edgecount~0)} is VALID [2022-04-27 10:17:24,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {5670#(<= 0 main_~j~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {5623#(<= 1 main_~j~0)} is VALID [2022-04-27 10:17:24,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {5670#(<= 0 main_~j~0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {5670#(<= 0 main_~j~0)} is VALID [2022-04-27 10:17:24,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {5670#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {5670#(<= 0 main_~j~0)} is VALID [2022-04-27 10:17:24,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {5617#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {5670#(<= 0 main_~j~0)} is VALID [2022-04-27 10:17:24,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {5617#true} ~i~0 := 0; {5617#true} is VALID [2022-04-27 10:17:24,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {5617#true} assume !(~i~0 < ~nodecount~0); {5617#true} is VALID [2022-04-27 10:17:24,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {5617#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5617#true} is VALID [2022-04-27 10:17:24,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {5617#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {5617#true} is VALID [2022-04-27 10:17:24,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {5617#true} assume !!(~i~0 < ~nodecount~0); {5617#true} is VALID [2022-04-27 10:17:24,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {5617#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {5617#true} is VALID [2022-04-27 10:17:24,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {5617#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {5617#true} is VALID [2022-04-27 10:17:24,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {5617#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {5617#true} is VALID [2022-04-27 10:17:24,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {5617#true} call #t~ret22 := main(); {5617#true} is VALID [2022-04-27 10:17:24,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5617#true} {5617#true} #123#return; {5617#true} is VALID [2022-04-27 10:17:24,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {5617#true} assume true; {5617#true} is VALID [2022-04-27 10:17:24,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {5617#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {5617#true} is VALID [2022-04-27 10:17:24,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {5617#true} call ULTIMATE.init(); {5617#true} is VALID [2022-04-27 10:17:24,193 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:17:24,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127456610] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:17:24,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:17:24,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-04-27 10:17:24,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766087202] [2022-04-27 10:17:24,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:17:24,195 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-27 10:17:24,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:24,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:24,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:24,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 10:17:24,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:24,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 10:17:24,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:17:24,238 INFO L87 Difference]: Start difference. First operand 96 states and 119 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:25,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:25,041 INFO L93 Difference]: Finished difference Result 195 states and 241 transitions. [2022-04-27 10:17:25,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 10:17:25,042 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-27 10:17:25,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:25,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:25,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 106 transitions. [2022-04-27 10:17:25,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:25,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 106 transitions. [2022-04-27 10:17:25,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 106 transitions. [2022-04-27 10:17:25,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:25,148 INFO L225 Difference]: With dead ends: 195 [2022-04-27 10:17:25,148 INFO L226 Difference]: Without dead ends: 174 [2022-04-27 10:17:25,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-04-27 10:17:25,149 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 150 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:17:25,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 70 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:17:25,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-04-27 10:17:25,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 128. [2022-04-27 10:17:25,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:17:25,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 128 states, 119 states have (on average 1.2773109243697478) internal successors, (152), 121 states have internal predecessors, (152), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:25,318 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 128 states, 119 states have (on average 1.2773109243697478) internal successors, (152), 121 states have internal predecessors, (152), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:25,319 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 128 states, 119 states have (on average 1.2773109243697478) internal successors, (152), 121 states have internal predecessors, (152), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:25,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:25,322 INFO L93 Difference]: Finished difference Result 174 states and 217 transitions. [2022-04-27 10:17:25,322 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 217 transitions. [2022-04-27 10:17:25,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:25,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:25,323 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 119 states have (on average 1.2773109243697478) internal successors, (152), 121 states have internal predecessors, (152), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 174 states. [2022-04-27 10:17:25,323 INFO L87 Difference]: Start difference. First operand has 128 states, 119 states have (on average 1.2773109243697478) internal successors, (152), 121 states have internal predecessors, (152), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 174 states. [2022-04-27 10:17:25,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:25,326 INFO L93 Difference]: Finished difference Result 174 states and 217 transitions. [2022-04-27 10:17:25,326 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 217 transitions. [2022-04-27 10:17:25,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:25,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:25,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:17:25,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:17:25,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 119 states have (on average 1.2773109243697478) internal successors, (152), 121 states have internal predecessors, (152), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:25,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 160 transitions. [2022-04-27 10:17:25,329 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 160 transitions. Word has length 34 [2022-04-27 10:17:25,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:17:25,329 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 160 transitions. [2022-04-27 10:17:25,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:25,329 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 160 transitions. [2022-04-27 10:17:25,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 10:17:25,329 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:25,330 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:17:25,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 10:17:25,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:25,542 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:25,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:25,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1470221714, now seen corresponding path program 3 times [2022-04-27 10:17:25,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:25,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499636518] [2022-04-27 10:17:25,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:25,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:26,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:17:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:26,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {6680#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {6660#true} is VALID [2022-04-27 10:17:26,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {6660#true} assume true; {6660#true} is VALID [2022-04-27 10:17:26,324 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6660#true} {6660#true} #123#return; {6660#true} is VALID [2022-04-27 10:17:26,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {6660#true} call ULTIMATE.init(); {6680#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:17:26,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {6680#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {6660#true} is VALID [2022-04-27 10:17:26,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {6660#true} assume true; {6660#true} is VALID [2022-04-27 10:17:26,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6660#true} {6660#true} #123#return; {6660#true} is VALID [2022-04-27 10:17:26,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {6660#true} call #t~ret22 := main(); {6660#true} is VALID [2022-04-27 10:17:26,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {6660#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {6660#true} is VALID [2022-04-27 10:17:26,324 INFO L290 TraceCheckUtils]: 6: Hoare triple {6660#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {6660#true} is VALID [2022-04-27 10:17:26,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {6660#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {6665#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (<= 0 |main_~#Dest~0.offset|))} is VALID [2022-04-27 10:17:26,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {6665#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (<= 0 |main_~#Dest~0.offset|))} assume !!(~i~0 < ~nodecount~0); {6665#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (<= 0 |main_~#Dest~0.offset|))} is VALID [2022-04-27 10:17:26,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {6665#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (<= 0 |main_~#Dest~0.offset|))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6666#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (<= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) 0) (= main_~i~0 0) (<= 0 |main_~#Dest~0.offset|))} is VALID [2022-04-27 10:17:26,329 INFO L290 TraceCheckUtils]: 10: Hoare triple {6666#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (<= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) 0) (= main_~i~0 0) (<= 0 |main_~#Dest~0.offset|))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6667#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:17:26,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {6667#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} assume !(~i~0 < ~nodecount~0); {6667#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:17:26,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {6667#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} ~i~0 := 0; {6667#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:17:26,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {6667#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6668#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 1) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:17:26,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {6668#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 1) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6669#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= main_~x~0 1) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:17:26,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {6669#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= main_~x~0 1) (= |main_~#Dest~0.offset| 0))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {6670#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:17:26,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {6670#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {6671#(and (= 3 (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|))) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (+ 4 |main_~#Dest~0.offset|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:17:26,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {6671#(and (= 3 (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|))) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (+ 4 |main_~#Dest~0.offset|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) (= |main_~#Dest~0.offset| 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6672#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (+ 4 |main_~#Dest~0.offset|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) (= |main_~#Dest~0.offset| 0) (not (= (+ (* main_~x~0 4) |main_~#distance~0.offset|) 0)))} is VALID [2022-04-27 10:17:26,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {6672#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (+ 4 |main_~#Dest~0.offset|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) (= |main_~#Dest~0.offset| 0) (not (= (+ (* main_~x~0 4) |main_~#distance~0.offset|) 0)))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {6673#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (+ 4 |main_~#Dest~0.offset|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:17:26,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {6673#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (+ 4 |main_~#Dest~0.offset|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) (= |main_~#Dest~0.offset| 0))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {6674#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:17:26,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {6674#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} assume !(~j~0 < ~edgecount~0); {6674#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:17:26,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {6674#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6674#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:17:26,334 INFO L290 TraceCheckUtils]: 22: Hoare triple {6674#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} assume !(~i~0 < ~nodecount~0); {6674#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:17:26,335 INFO L290 TraceCheckUtils]: 23: Hoare triple {6674#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} ~i~0 := 0; {6674#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:17:26,335 INFO L290 TraceCheckUtils]: 24: Hoare triple {6674#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {6674#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:17:26,340 INFO L290 TraceCheckUtils]: 25: Hoare triple {6674#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {6674#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:17:26,347 INFO L290 TraceCheckUtils]: 26: Hoare triple {6674#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6674#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:17:26,348 INFO L290 TraceCheckUtils]: 27: Hoare triple {6674#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {6675#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:17:26,348 INFO L290 TraceCheckUtils]: 28: Hoare triple {6675#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {6675#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:17:26,349 INFO L290 TraceCheckUtils]: 29: Hoare triple {6675#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6675#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:17:26,350 INFO L290 TraceCheckUtils]: 30: Hoare triple {6675#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !(~i~0 < ~edgecount~0); {6675#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:17:26,351 INFO L290 TraceCheckUtils]: 31: Hoare triple {6675#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} ~i~0 := 0; {6676#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:17:26,351 INFO L290 TraceCheckUtils]: 32: Hoare triple {6676#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6677#(= |main_#t~mem21| 0)} is VALID [2022-04-27 10:17:26,352 INFO L272 TraceCheckUtils]: 33: Hoare triple {6677#(= |main_#t~mem21| 0)} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {6678#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:17:26,352 INFO L290 TraceCheckUtils]: 34: Hoare triple {6678#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6679#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:17:26,352 INFO L290 TraceCheckUtils]: 35: Hoare triple {6679#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6661#false} is VALID [2022-04-27 10:17:26,353 INFO L290 TraceCheckUtils]: 36: Hoare triple {6661#false} assume !false; {6661#false} is VALID [2022-04-27 10:17:26,353 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:17:26,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:26,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499636518] [2022-04-27 10:17:26,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499636518] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:17:26,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667426857] [2022-04-27 10:17:26,355 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 10:17:26,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:26,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:17:26,360 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:17:26,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 10:17:26,475 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 10:17:26,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:17:26,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-27 10:17:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:26,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:17:26,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-04-27 10:17:26,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:17:26,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:17:26,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:17:26,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-04-27 10:17:27,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:17:27,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:17:27,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:17:27,014 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-27 10:17:27,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:17:27,023 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-04-27 10:17:27,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 63 [2022-04-27 10:17:27,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:17:27,375 INFO L356 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-04-27 10:17:27,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 68 [2022-04-27 10:17:31,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2022-04-27 10:17:31,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {6660#true} call ULTIMATE.init(); {6660#true} is VALID [2022-04-27 10:17:31,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {6660#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {6660#true} is VALID [2022-04-27 10:17:31,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {6660#true} assume true; {6660#true} is VALID [2022-04-27 10:17:31,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6660#true} {6660#true} #123#return; {6660#true} is VALID [2022-04-27 10:17:31,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {6660#true} call #t~ret22 := main(); {6660#true} is VALID [2022-04-27 10:17:31,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {6660#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {6660#true} is VALID [2022-04-27 10:17:31,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {6660#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {6660#true} is VALID [2022-04-27 10:17:31,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {6660#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {6705#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)))} is VALID [2022-04-27 10:17:31,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {6705#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)))} assume !!(~i~0 < ~nodecount~0); {6705#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)))} is VALID [2022-04-27 10:17:31,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {6705#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6712#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:31,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {6712#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6712#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:31,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {6712#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~i~0 < ~nodecount~0); {6712#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:31,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {6712#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} ~i~0 := 0; {6712#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:31,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {6712#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6725#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:31,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {6725#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6729#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) main_~x~0) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:31,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {6729#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) main_~x~0) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {6725#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:31,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {6725#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {6736#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= main_~j~0 1) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:31,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {6736#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 4 |main_~#Dest~0.offset|)) 3) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= main_~j~0 1) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6740#(and (exists ((|main_~#Dest~0.base| Int)) (and (= (select (select |#memory_int| |main_~#Dest~0.base|) 8) 4) (= 3 (select (select |#memory_int| |main_~#Dest~0.base|) 4)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)) (= main_~x~0 (select (select |#memory_int| |main_~#Dest~0.base|) (* main_~j~0 4))))) (= |main_~#distance~0.offset| 0) (<= main_~j~0 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:31,387 INFO L290 TraceCheckUtils]: 18: Hoare triple {6740#(and (exists ((|main_~#Dest~0.base| Int)) (and (= (select (select |#memory_int| |main_~#Dest~0.base|) 8) 4) (= 3 (select (select |#memory_int| |main_~#Dest~0.base|) 4)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)) (= main_~x~0 (select (select |#memory_int| |main_~#Dest~0.base|) (* main_~j~0 4))))) (= |main_~#distance~0.offset| 0) (<= main_~j~0 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {6744#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (or (= |main_~#distance~0.offset| (+ |main_~#distance~0.offset| (* 4 (select (select |#memory_int| |main_~#Dest~0.base|) (* main_~j~0 4))))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))) (= (select (select |#memory_int| |main_~#Dest~0.base|) 8) 4) (= 3 (select (select |#memory_int| |main_~#Dest~0.base|) 4)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:31,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {6744#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (or (= |main_~#distance~0.offset| (+ |main_~#distance~0.offset| (* 4 (select (select |#memory_int| |main_~#Dest~0.base|) (* main_~j~0 4))))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))) (= (select (select |#memory_int| |main_~#Dest~0.base|) 8) 4) (= 3 (select (select |#memory_int| |main_~#Dest~0.base|) 4)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= main_~j~0 1))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {6748#(and (exists ((v_main_~j~0_26 Int) (|main_~#Dest~0.base| Int)) (and (= (select (select |#memory_int| |main_~#Dest~0.base|) 8) 4) (<= v_main_~j~0_26 1) (= 3 (select (select |#memory_int| |main_~#Dest~0.base|) 4)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (or (= |main_~#distance~0.offset| (+ (* 4 (select (select |#memory_int| |main_~#Dest~0.base|) (* v_main_~j~0_26 4))) |main_~#distance~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)) (<= main_~j~0 (+ v_main_~j~0_26 1)))) (= |main_~#distance~0.offset| 0))} is VALID [2022-04-27 10:17:31,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {6748#(and (exists ((v_main_~j~0_26 Int) (|main_~#Dest~0.base| Int)) (and (= (select (select |#memory_int| |main_~#Dest~0.base|) 8) 4) (<= v_main_~j~0_26 1) (= 3 (select (select |#memory_int| |main_~#Dest~0.base|) 4)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (or (= |main_~#distance~0.offset| (+ (* 4 (select (select |#memory_int| |main_~#Dest~0.base|) (* v_main_~j~0_26 4))) |main_~#distance~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)) (<= main_~j~0 (+ v_main_~j~0_26 1)))) (= |main_~#distance~0.offset| 0))} assume !(~j~0 < ~edgecount~0); {6752#(and (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_26 Int) (|main_~#Dest~0.base| Int)) (and (= (select (select |#memory_int| |main_~#Dest~0.base|) 8) 4) (<= v_main_~j~0_26 1) (= 3 (select (select |#memory_int| |main_~#Dest~0.base|) 4)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (or (= |main_~#distance~0.offset| (+ (* 4 (select (select |#memory_int| |main_~#Dest~0.base|) (* v_main_~j~0_26 4))) |main_~#distance~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)) (<= main_~edgecount~0 (+ v_main_~j~0_26 1)))))} is VALID [2022-04-27 10:17:31,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {6752#(and (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_26 Int) (|main_~#Dest~0.base| Int)) (and (= (select (select |#memory_int| |main_~#Dest~0.base|) 8) 4) (<= v_main_~j~0_26 1) (= 3 (select (select |#memory_int| |main_~#Dest~0.base|) 4)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (or (= |main_~#distance~0.offset| (+ (* 4 (select (select |#memory_int| |main_~#Dest~0.base|) (* v_main_~j~0_26 4))) |main_~#distance~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)) (<= main_~edgecount~0 (+ v_main_~j~0_26 1)))))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6752#(and (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_26 Int) (|main_~#Dest~0.base| Int)) (and (= (select (select |#memory_int| |main_~#Dest~0.base|) 8) 4) (<= v_main_~j~0_26 1) (= 3 (select (select |#memory_int| |main_~#Dest~0.base|) 4)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (or (= |main_~#distance~0.offset| (+ (* 4 (select (select |#memory_int| |main_~#Dest~0.base|) (* v_main_~j~0_26 4))) |main_~#distance~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)) (<= main_~edgecount~0 (+ v_main_~j~0_26 1)))))} is VALID [2022-04-27 10:17:31,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {6752#(and (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_26 Int) (|main_~#Dest~0.base| Int)) (and (= (select (select |#memory_int| |main_~#Dest~0.base|) 8) 4) (<= v_main_~j~0_26 1) (= 3 (select (select |#memory_int| |main_~#Dest~0.base|) 4)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (or (= |main_~#distance~0.offset| (+ (* 4 (select (select |#memory_int| |main_~#Dest~0.base|) (* v_main_~j~0_26 4))) |main_~#distance~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)) (<= main_~edgecount~0 (+ v_main_~j~0_26 1)))))} assume !(~i~0 < ~nodecount~0); {6752#(and (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_26 Int) (|main_~#Dest~0.base| Int)) (and (= (select (select |#memory_int| |main_~#Dest~0.base|) 8) 4) (<= v_main_~j~0_26 1) (= 3 (select (select |#memory_int| |main_~#Dest~0.base|) 4)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (or (= |main_~#distance~0.offset| (+ (* 4 (select (select |#memory_int| |main_~#Dest~0.base|) (* v_main_~j~0_26 4))) |main_~#distance~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)) (<= main_~edgecount~0 (+ v_main_~j~0_26 1)))))} is VALID [2022-04-27 10:17:31,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {6752#(and (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_26 Int) (|main_~#Dest~0.base| Int)) (and (= (select (select |#memory_int| |main_~#Dest~0.base|) 8) 4) (<= v_main_~j~0_26 1) (= 3 (select (select |#memory_int| |main_~#Dest~0.base|) 4)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (or (= |main_~#distance~0.offset| (+ (* 4 (select (select |#memory_int| |main_~#Dest~0.base|) (* v_main_~j~0_26 4))) |main_~#distance~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)) (<= main_~edgecount~0 (+ v_main_~j~0_26 1)))))} ~i~0 := 0; {6762#(and (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_26 Int) (|main_~#Dest~0.base| Int)) (and (= (select (select |#memory_int| |main_~#Dest~0.base|) 8) 4) (<= v_main_~j~0_26 1) (= 3 (select (select |#memory_int| |main_~#Dest~0.base|) 4)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (or (= |main_~#distance~0.offset| (+ (* 4 (select (select |#memory_int| |main_~#Dest~0.base|) (* v_main_~j~0_26 4))) |main_~#distance~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)) (<= main_~edgecount~0 (+ v_main_~j~0_26 1)))) (<= 0 main_~i~0))} is VALID [2022-04-27 10:17:31,394 INFO L290 TraceCheckUtils]: 24: Hoare triple {6762#(and (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_26 Int) (|main_~#Dest~0.base| Int)) (and (= (select (select |#memory_int| |main_~#Dest~0.base|) 8) 4) (<= v_main_~j~0_26 1) (= 3 (select (select |#memory_int| |main_~#Dest~0.base|) 4)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (or (= |main_~#distance~0.offset| (+ (* 4 (select (select |#memory_int| |main_~#Dest~0.base|) (* v_main_~j~0_26 4))) |main_~#distance~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)) (<= main_~edgecount~0 (+ v_main_~j~0_26 1)))) (<= 0 main_~i~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {6762#(and (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_26 Int) (|main_~#Dest~0.base| Int)) (and (= (select (select |#memory_int| |main_~#Dest~0.base|) 8) 4) (<= v_main_~j~0_26 1) (= 3 (select (select |#memory_int| |main_~#Dest~0.base|) 4)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (or (= |main_~#distance~0.offset| (+ (* 4 (select (select |#memory_int| |main_~#Dest~0.base|) (* v_main_~j~0_26 4))) |main_~#distance~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)) (<= main_~edgecount~0 (+ v_main_~j~0_26 1)))) (<= 0 main_~i~0))} is VALID [2022-04-27 10:17:31,396 INFO L290 TraceCheckUtils]: 25: Hoare triple {6762#(and (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_26 Int) (|main_~#Dest~0.base| Int)) (and (= (select (select |#memory_int| |main_~#Dest~0.base|) 8) 4) (<= v_main_~j~0_26 1) (= 3 (select (select |#memory_int| |main_~#Dest~0.base|) 4)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (or (= |main_~#distance~0.offset| (+ (* 4 (select (select |#memory_int| |main_~#Dest~0.base|) (* v_main_~j~0_26 4))) |main_~#distance~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)) (<= main_~edgecount~0 (+ v_main_~j~0_26 1)))) (<= 0 main_~i~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {6762#(and (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_26 Int) (|main_~#Dest~0.base| Int)) (and (= (select (select |#memory_int| |main_~#Dest~0.base|) 8) 4) (<= v_main_~j~0_26 1) (= 3 (select (select |#memory_int| |main_~#Dest~0.base|) 4)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (or (= |main_~#distance~0.offset| (+ (* 4 (select (select |#memory_int| |main_~#Dest~0.base|) (* v_main_~j~0_26 4))) |main_~#distance~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)) (<= main_~edgecount~0 (+ v_main_~j~0_26 1)))) (<= 0 main_~i~0))} is VALID [2022-04-27 10:17:31,397 INFO L290 TraceCheckUtils]: 26: Hoare triple {6762#(and (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_26 Int) (|main_~#Dest~0.base| Int)) (and (= (select (select |#memory_int| |main_~#Dest~0.base|) 8) 4) (<= v_main_~j~0_26 1) (= 3 (select (select |#memory_int| |main_~#Dest~0.base|) 4)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (or (= |main_~#distance~0.offset| (+ (* 4 (select (select |#memory_int| |main_~#Dest~0.base|) (* v_main_~j~0_26 4))) |main_~#distance~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)) (<= main_~edgecount~0 (+ v_main_~j~0_26 1)))) (<= 0 main_~i~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6772#(and (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_26 Int) (|main_~#Dest~0.base| Int)) (and (= (select (select |#memory_int| |main_~#Dest~0.base|) 8) 4) (<= v_main_~j~0_26 1) (= 3 (select (select |#memory_int| |main_~#Dest~0.base|) 4)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (or (= |main_~#distance~0.offset| (+ (* 4 (select (select |#memory_int| |main_~#Dest~0.base|) (* v_main_~j~0_26 4))) |main_~#distance~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)) (<= main_~edgecount~0 (+ v_main_~j~0_26 1)))) (<= 1 main_~i~0))} is VALID [2022-04-27 10:17:31,398 INFO L290 TraceCheckUtils]: 27: Hoare triple {6772#(and (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_26 Int) (|main_~#Dest~0.base| Int)) (and (= (select (select |#memory_int| |main_~#Dest~0.base|) 8) 4) (<= v_main_~j~0_26 1) (= 3 (select (select |#memory_int| |main_~#Dest~0.base|) 4)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (or (= |main_~#distance~0.offset| (+ (* 4 (select (select |#memory_int| |main_~#Dest~0.base|) (* v_main_~j~0_26 4))) |main_~#distance~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)) (<= main_~edgecount~0 (+ v_main_~j~0_26 1)))) (<= 1 main_~i~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {6776#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (= (select (select |#memory_int| |main_~#Dest~0.base|) 8) 4) (= 3 (select (select |#memory_int| |main_~#Dest~0.base|) 4)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:31,399 INFO L290 TraceCheckUtils]: 28: Hoare triple {6776#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (= (select (select |#memory_int| |main_~#Dest~0.base|) 8) 4) (= 3 (select (select |#memory_int| |main_~#Dest~0.base|) 4)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {6776#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (= (select (select |#memory_int| |main_~#Dest~0.base|) 8) 4) (= 3 (select (select |#memory_int| |main_~#Dest~0.base|) 4)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:31,400 INFO L290 TraceCheckUtils]: 29: Hoare triple {6776#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (= (select (select |#memory_int| |main_~#Dest~0.base|) 8) 4) (= 3 (select (select |#memory_int| |main_~#Dest~0.base|) 4)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6776#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (= (select (select |#memory_int| |main_~#Dest~0.base|) 8) 4) (= 3 (select (select |#memory_int| |main_~#Dest~0.base|) 4)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:31,400 INFO L290 TraceCheckUtils]: 30: Hoare triple {6776#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (= (select (select |#memory_int| |main_~#Dest~0.base|) 8) 4) (= 3 (select (select |#memory_int| |main_~#Dest~0.base|) 4)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~i~0 < ~edgecount~0); {6776#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (= (select (select |#memory_int| |main_~#Dest~0.base|) 8) 4) (= 3 (select (select |#memory_int| |main_~#Dest~0.base|) 4)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:31,401 INFO L290 TraceCheckUtils]: 31: Hoare triple {6776#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (= (select (select |#memory_int| |main_~#Dest~0.base|) 8) 4) (= 3 (select (select |#memory_int| |main_~#Dest~0.base|) 4)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} ~i~0 := 0; {6789#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0) (exists ((|main_~#Dest~0.base| Int)) (and (= (select (select |#memory_int| |main_~#Dest~0.base|) 8) 4) (= 3 (select (select |#memory_int| |main_~#Dest~0.base|) 4)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:17:31,401 INFO L290 TraceCheckUtils]: 32: Hoare triple {6789#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0) (exists ((|main_~#Dest~0.base| Int)) (and (= (select (select |#memory_int| |main_~#Dest~0.base|) 8) 4) (= 3 (select (select |#memory_int| |main_~#Dest~0.base|) 4)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6793#(<= 0 |main_#t~mem21|)} is VALID [2022-04-27 10:17:31,402 INFO L272 TraceCheckUtils]: 33: Hoare triple {6793#(<= 0 |main_#t~mem21|)} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {6797#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:17:31,402 INFO L290 TraceCheckUtils]: 34: Hoare triple {6797#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6801#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:17:31,402 INFO L290 TraceCheckUtils]: 35: Hoare triple {6801#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6661#false} is VALID [2022-04-27 10:17:31,403 INFO L290 TraceCheckUtils]: 36: Hoare triple {6661#false} assume !false; {6661#false} is VALID [2022-04-27 10:17:31,403 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:17:31,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:17:50,502 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~j~0_28 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int) (v_main_~x~0_19 Int)) (or (<= v_main_~j~0_28 0) (<= 0 (select (let ((.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351))) (store .cse0 (+ (* (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse0) |c_main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_353)) |c_main_~#distance~0.offset|)) (not (<= v_main_~j~0_28 1)) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_19)))) is different from false [2022-04-27 10:18:26,126 INFO L290 TraceCheckUtils]: 36: Hoare triple {6661#false} assume !false; {6661#false} is VALID [2022-04-27 10:18:26,127 INFO L290 TraceCheckUtils]: 35: Hoare triple {6801#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6661#false} is VALID [2022-04-27 10:18:26,127 INFO L290 TraceCheckUtils]: 34: Hoare triple {6797#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6801#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:18:26,128 INFO L272 TraceCheckUtils]: 33: Hoare triple {6793#(<= 0 |main_#t~mem21|)} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {6797#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:18:26,128 INFO L290 TraceCheckUtils]: 32: Hoare triple {6820#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6793#(<= 0 |main_#t~mem21|)} is VALID [2022-04-27 10:18:26,128 INFO L290 TraceCheckUtils]: 31: Hoare triple {6824#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} ~i~0 := 0; {6820#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))))} is VALID [2022-04-27 10:18:26,129 INFO L290 TraceCheckUtils]: 30: Hoare triple {6824#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !(~i~0 < ~edgecount~0); {6824#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:18:26,129 INFO L290 TraceCheckUtils]: 29: Hoare triple {6824#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6824#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:18:26,129 INFO L290 TraceCheckUtils]: 28: Hoare triple {6824#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {6824#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:18:26,130 INFO L290 TraceCheckUtils]: 27: Hoare triple {6837#(or (not (< main_~i~0 main_~edgecount~0)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {6824#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:18:26,130 INFO L290 TraceCheckUtils]: 26: Hoare triple {6841#(or (<= main_~edgecount~0 (+ main_~i~0 1)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6837#(or (not (< main_~i~0 main_~edgecount~0)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:18:26,131 INFO L290 TraceCheckUtils]: 25: Hoare triple {6841#(or (<= main_~edgecount~0 (+ main_~i~0 1)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {6841#(or (<= main_~edgecount~0 (+ main_~i~0 1)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:18:26,131 INFO L290 TraceCheckUtils]: 24: Hoare triple {6841#(or (<= main_~edgecount~0 (+ main_~i~0 1)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {6841#(or (<= main_~edgecount~0 (+ main_~i~0 1)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:18:26,131 INFO L290 TraceCheckUtils]: 23: Hoare triple {6851#(or (<= main_~edgecount~0 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} ~i~0 := 0; {6841#(or (<= main_~edgecount~0 (+ main_~i~0 1)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:18:26,132 INFO L290 TraceCheckUtils]: 22: Hoare triple {6851#(or (<= main_~edgecount~0 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~i~0 < ~nodecount~0); {6851#(or (<= main_~edgecount~0 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:18:26,132 INFO L290 TraceCheckUtils]: 21: Hoare triple {6851#(or (<= main_~edgecount~0 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6851#(or (<= main_~edgecount~0 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:18:26,132 INFO L290 TraceCheckUtils]: 20: Hoare triple {6861#(or (<= main_~j~0 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~j~0 < ~edgecount~0); {6851#(or (<= main_~edgecount~0 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:18:26,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {6865#(or (<= main_~j~0 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {6861#(or (<= main_~j~0 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:18:26,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {6869#(or (forall ((v_ArrVal_353 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_353) |main_~#distance~0.offset|))) (<= main_~j~0 0))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {6865#(or (<= main_~j~0 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:18:26,134 INFO L290 TraceCheckUtils]: 17: Hoare triple {6873#(or (forall ((v_ArrVal_353 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_353) |main_~#distance~0.offset|))) (<= main_~j~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6869#(or (forall ((v_ArrVal_353 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_353) |main_~#distance~0.offset|))) (<= main_~j~0 0))} is VALID [2022-04-27 10:18:26,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {6877#(forall ((v_main_~j~0_28 Int)) (or (<= v_main_~j~0_28 0) (not (<= v_main_~j~0_28 (+ main_~j~0 1))) (forall ((v_ArrVal_353 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |main_~#Dest~0.offset|)) 4) |main_~#distance~0.offset|) v_ArrVal_353) |main_~#distance~0.offset|)))))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {6873#(or (forall ((v_ArrVal_353 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_353) |main_~#distance~0.offset|))) (<= main_~j~0 0))} is VALID [2022-04-27 10:18:26,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {6881#(forall ((v_main_~j~0_28 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (<= v_main_~j~0_28 0) (not (<= v_main_~j~0_28 (+ main_~j~0 1))) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_351) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_351)) |main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_353) |main_~#distance~0.offset|))))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {6877#(forall ((v_main_~j~0_28 Int)) (or (<= v_main_~j~0_28 0) (not (<= v_main_~j~0_28 (+ main_~j~0 1))) (forall ((v_ArrVal_353 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |main_~#Dest~0.offset|)) 4) |main_~#distance~0.offset|) v_ArrVal_353) |main_~#distance~0.offset|)))))} is VALID [2022-04-27 10:18:26,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {6885#(forall ((v_main_~x~0_19 Int)) (or (forall ((v_main_~j~0_28 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351)) |main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |main_~#Dest~0.offset|)) 4) |main_~#distance~0.offset|) v_ArrVal_353) |main_~#distance~0.offset|)) (<= v_main_~j~0_28 0) (not (<= v_main_~j~0_28 (+ main_~j~0 1))))) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) v_main_~x~0_19))))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {6881#(forall ((v_main_~j~0_28 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (<= v_main_~j~0_28 0) (not (<= v_main_~j~0_28 (+ main_~j~0 1))) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_351) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_351)) |main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_353) |main_~#distance~0.offset|))))} is VALID [2022-04-27 10:18:26,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {6889#(forall ((v_main_~j~0_28 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int) (v_main_~x~0_19 Int)) (or (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351)) |main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |main_~#Dest~0.offset|)) 4) |main_~#distance~0.offset|) v_ArrVal_353) |main_~#distance~0.offset|)) (<= v_main_~j~0_28 0) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_19)) (not (<= v_main_~j~0_28 1))))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {6885#(forall ((v_main_~x~0_19 Int)) (or (forall ((v_main_~j~0_28 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351)) |main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |main_~#Dest~0.offset|)) 4) |main_~#distance~0.offset|) v_ArrVal_353) |main_~#distance~0.offset|)) (<= v_main_~j~0_28 0) (not (<= v_main_~j~0_28 (+ main_~j~0 1))))) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) v_main_~x~0_19))))} is VALID [2022-04-27 10:18:26,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {6889#(forall ((v_main_~j~0_28 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int) (v_main_~x~0_19 Int)) (or (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351)) |main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |main_~#Dest~0.offset|)) 4) |main_~#distance~0.offset|) v_ArrVal_353) |main_~#distance~0.offset|)) (<= v_main_~j~0_28 0) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_19)) (not (<= v_main_~j~0_28 1))))} ~i~0 := 0; {6889#(forall ((v_main_~j~0_28 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int) (v_main_~x~0_19 Int)) (or (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351)) |main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |main_~#Dest~0.offset|)) 4) |main_~#distance~0.offset|) v_ArrVal_353) |main_~#distance~0.offset|)) (<= v_main_~j~0_28 0) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_19)) (not (<= v_main_~j~0_28 1))))} is VALID [2022-04-27 10:18:26,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {6889#(forall ((v_main_~j~0_28 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int) (v_main_~x~0_19 Int)) (or (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351)) |main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |main_~#Dest~0.offset|)) 4) |main_~#distance~0.offset|) v_ArrVal_353) |main_~#distance~0.offset|)) (<= v_main_~j~0_28 0) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_19)) (not (<= v_main_~j~0_28 1))))} assume !(~i~0 < ~nodecount~0); {6889#(forall ((v_main_~j~0_28 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int) (v_main_~x~0_19 Int)) (or (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351)) |main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |main_~#Dest~0.offset|)) 4) |main_~#distance~0.offset|) v_ArrVal_353) |main_~#distance~0.offset|)) (<= v_main_~j~0_28 0) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_19)) (not (<= v_main_~j~0_28 1))))} is VALID [2022-04-27 10:18:26,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {6889#(forall ((v_main_~j~0_28 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int) (v_main_~x~0_19 Int)) (or (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351)) |main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |main_~#Dest~0.offset|)) 4) |main_~#distance~0.offset|) v_ArrVal_353) |main_~#distance~0.offset|)) (<= v_main_~j~0_28 0) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_19)) (not (<= v_main_~j~0_28 1))))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {6889#(forall ((v_main_~j~0_28 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int) (v_main_~x~0_19 Int)) (or (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351)) |main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |main_~#Dest~0.offset|)) 4) |main_~#distance~0.offset|) v_ArrVal_353) |main_~#distance~0.offset|)) (<= v_main_~j~0_28 0) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_19)) (not (<= v_main_~j~0_28 1))))} is VALID [2022-04-27 10:18:27,589 WARN L290 TraceCheckUtils]: 9: Hoare triple {6902#(forall ((v_main_~j~0_28 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int) (v_main_~x~0_19 Int) (v_ArrVal_349 Int)) (or (<= v_main_~j~0_28 0) (<= 0 (select (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_349) (+ |main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_349) (+ |main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351)) |main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_353) |main_~#distance~0.offset|)) (not (<= (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_349)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_19)) (not (<= 0 v_ArrVal_349)) (not (<= v_main_~j~0_28 1))))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {6889#(forall ((v_main_~j~0_28 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int) (v_main_~x~0_19 Int)) (or (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351)) |main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |main_~#Dest~0.offset|)) 4) |main_~#distance~0.offset|) v_ArrVal_353) |main_~#distance~0.offset|)) (<= v_main_~j~0_28 0) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_19)) (not (<= v_main_~j~0_28 1))))} is UNKNOWN [2022-04-27 10:18:27,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {6902#(forall ((v_main_~j~0_28 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int) (v_main_~x~0_19 Int) (v_ArrVal_349 Int)) (or (<= v_main_~j~0_28 0) (<= 0 (select (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_349) (+ |main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_349) (+ |main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351)) |main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_353) |main_~#distance~0.offset|)) (not (<= (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_349)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_19)) (not (<= 0 v_ArrVal_349)) (not (<= v_main_~j~0_28 1))))} assume !!(~i~0 < ~nodecount~0); {6902#(forall ((v_main_~j~0_28 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int) (v_main_~x~0_19 Int) (v_ArrVal_349 Int)) (or (<= v_main_~j~0_28 0) (<= 0 (select (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_349) (+ |main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_349) (+ |main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351)) |main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_353) |main_~#distance~0.offset|)) (not (<= (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_349)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_19)) (not (<= 0 v_ArrVal_349)) (not (<= v_main_~j~0_28 1))))} is VALID [2022-04-27 10:18:27,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {6660#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {6902#(forall ((v_main_~j~0_28 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int) (v_main_~x~0_19 Int) (v_ArrVal_349 Int)) (or (<= v_main_~j~0_28 0) (<= 0 (select (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_349) (+ |main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_349) (+ |main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351)) |main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_353) |main_~#distance~0.offset|)) (not (<= (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_349)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_19)) (not (<= 0 v_ArrVal_349)) (not (<= v_main_~j~0_28 1))))} is VALID [2022-04-27 10:18:27,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {6660#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {6660#true} is VALID [2022-04-27 10:18:27,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {6660#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {6660#true} is VALID [2022-04-27 10:18:27,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {6660#true} call #t~ret22 := main(); {6660#true} is VALID [2022-04-27 10:18:27,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6660#true} {6660#true} #123#return; {6660#true} is VALID [2022-04-27 10:18:27,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {6660#true} assume true; {6660#true} is VALID [2022-04-27 10:18:27,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {6660#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {6660#true} is VALID [2022-04-27 10:18:27,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {6660#true} call ULTIMATE.init(); {6660#true} is VALID [2022-04-27 10:18:27,594 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-04-27 10:18:27,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667426857] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:18:27,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:18:27,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 19] total 48 [2022-04-27 10:18:27,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432967811] [2022-04-27 10:18:27,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:18:27,596 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 45 states have internal predecessors, (88), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-27 10:18:27,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:18:27,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 45 states have internal predecessors, (88), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:27,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:27,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-27 10:18:27,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:18:27,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-27 10:18:27,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=1828, Unknown=16, NotChecked=90, Total=2256 [2022-04-27 10:18:27,688 INFO L87 Difference]: Start difference. First operand 128 states and 160 transitions. Second operand has 48 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 45 states have internal predecessors, (88), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:28,396 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_main_~#Dest~0.base|))) (let ((.cse0 (select .cse1 |c_main_~#Dest~0.offset|)) (.cse2 (select |c_#memory_int| |c_main_~#distance~0.base|))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= .cse0 1) (= |c_main_~#distance~0.offset| 0) (= |c_old(~INFINITY~0)| c_~INFINITY~0) (= (select .cse1 (+ 8 |c_main_~#Dest~0.offset|)) 4) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (= |c_main_~#Dest~0.offset| 0) (= c_main_~i~0 0) (= (select .cse2 (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|)) 0) (<= 1 .cse0) (forall ((v_main_~j~0_28 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int) (v_main_~x~0_19 Int)) (or (<= v_main_~j~0_28 0) (<= 0 (select (let ((.cse3 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351))) (store .cse3 (+ (* (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse3) |c_main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_353)) |c_main_~#distance~0.offset|)) (not (<= v_main_~j~0_28 1)) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_19)))) (<= |c_main_~#Dest~0.offset| 0) (= 3 (select .cse1 (+ 4 |c_main_~#Dest~0.offset|))) (<= 0 (select .cse2 |c_main_~#distance~0.offset|)) (<= 0 |c_main_~#Dest~0.offset|) (= |c_#NULL.offset| |c_old(#NULL.offset)|)))) is different from false [2022-04-27 10:18:28,909 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_main_~#Dest~0.base|))) (let ((.cse0 (select .cse1 |c_main_~#Dest~0.offset|)) (.cse2 (select |c_#memory_int| |c_main_~#distance~0.base|))) (and (= .cse0 1) (= |c_main_~#distance~0.offset| 0) (= (select .cse1 (+ 8 |c_main_~#Dest~0.offset|)) 4) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (= |c_main_~#Dest~0.offset| 0) (= (select .cse2 0) 0) (<= 1 .cse0) (forall ((v_main_~j~0_28 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int) (v_main_~x~0_19 Int)) (or (<= v_main_~j~0_28 0) (<= 0 (select (let ((.cse3 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* v_main_~x~0_19 4)) v_ArrVal_351))) (store .cse3 (+ (* (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse3) |c_main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_353)) |c_main_~#distance~0.offset|)) (not (<= v_main_~j~0_28 1)) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_19)))) (= 3 (select .cse1 (+ 4 |c_main_~#Dest~0.offset|))) (<= 0 (select .cse2 |c_main_~#distance~0.offset|))))) is different from false [2022-04-27 10:18:29,891 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)) (.cse0 (select |c_#memory_int| |c_main_~#Dest~0.base|)) (.cse3 (+ 4 |c_main_~#Dest~0.offset|)) (.cse2 (select |c_#memory_int| |c_main_~#distance~0.base|))) (and (<= c_main_~j~0 1) (= |c_#NULL.base| |c_old(#NULL.base)|) (= (select .cse0 .cse1) 3) (= |c_main_~#distance~0.offset| 0) (= |c_old(~INFINITY~0)| c_~INFINITY~0) (= (select .cse0 (+ 8 |c_main_~#Dest~0.offset|)) 4) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (= |c_main_~#Dest~0.offset| 0) (= (select .cse2 0) 0) (not (= (+ (* 4 c_main_~x~0) |c_main_~#distance~0.offset|) 0)) (<= 1 (select .cse0 |c_main_~#Dest~0.offset|)) (= .cse1 .cse3) (exists ((|main_~#Dest~0.base| Int)) (let ((.cse4 (select |c_#memory_int| |main_~#Dest~0.base|))) (and (<= 1 (select .cse4 0)) (= 3 (select .cse4 4)) (= (select .cse4 8) 4) (= c_main_~x~0 (select .cse4 (* c_main_~j~0 4))) (not (= |main_~#Dest~0.base| |c_main_~#distance~0.base|))))) (= 3 (select .cse0 .cse3)) (<= 0 (select .cse2 |c_main_~#distance~0.offset|)) (forall ((v_main_~j~0_28 Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (<= 0 (select (let ((.cse5 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* 4 c_main_~x~0) |c_main_~#distance~0.offset|) v_ArrVal_351))) (store .cse5 (+ (* (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse5) |c_main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_353)) |c_main_~#distance~0.offset|)) (<= v_main_~j~0_28 0) (not (<= v_main_~j~0_28 (+ c_main_~j~0 1))))) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2022-04-27 10:18:31,915 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_main_~j~0 1) (forall ((v_main_~j~0_28 Int)) (or (<= v_main_~j~0_28 0) (not (<= v_main_~j~0_28 (+ c_main_~j~0 1))) (forall ((v_ArrVal_353 Int)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* v_main_~j~0_28 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_353) |c_main_~#distance~0.offset|))))) (= |c_main_~#distance~0.offset| 0) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (= |c_main_~#Dest~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#distance~0.base|) 0) 0) (exists ((|main_~#Dest~0.base| Int)) (let ((.cse0 (select |c_#memory_int| |main_~#Dest~0.base|))) (and (<= 1 (select .cse0 0)) (= 3 (select .cse0 4)) (= (select .cse0 8) 4) (or (= (+ (* 4 (select .cse0 (* c_main_~j~0 4))) |c_main_~#distance~0.offset|) |c_main_~#distance~0.offset|) (<= 0 (select (select |c_#memory_int| |c_main_~#distance~0.base|) |c_main_~#distance~0.offset|))) (not (= |main_~#Dest~0.base| |c_main_~#distance~0.base|))))) (= (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|) (+ 4 |c_main_~#Dest~0.offset|))) is different from false [2022-04-27 10:18:33,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:33,186 INFO L93 Difference]: Finished difference Result 174 states and 214 transitions. [2022-04-27 10:18:33,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-27 10:18:33,187 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 45 states have internal predecessors, (88), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-27 10:18:33,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:18:33,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 45 states have internal predecessors, (88), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:33,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 97 transitions. [2022-04-27 10:18:33,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 45 states have internal predecessors, (88), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:33,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 97 transitions. [2022-04-27 10:18:33,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 97 transitions. [2022-04-27 10:18:33,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:33,306 INFO L225 Difference]: With dead ends: 174 [2022-04-27 10:18:33,307 INFO L226 Difference]: Without dead ends: 142 [2022-04-27 10:18:33,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 56.0s TimeCoverageRelationStatistics Valid=618, Invalid=4074, Unknown=20, NotChecked=690, Total=5402 [2022-04-27 10:18:33,309 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 86 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:18:33,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 218 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 357 Invalid, 0 Unknown, 212 Unchecked, 0.3s Time] [2022-04-27 10:18:33,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-04-27 10:18:33,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 137. [2022-04-27 10:18:33,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:18:33,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand has 137 states, 128 states have (on average 1.28125) internal successors, (164), 130 states have internal predecessors, (164), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:18:33,470 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand has 137 states, 128 states have (on average 1.28125) internal successors, (164), 130 states have internal predecessors, (164), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:18:33,470 INFO L87 Difference]: Start difference. First operand 142 states. Second operand has 137 states, 128 states have (on average 1.28125) internal successors, (164), 130 states have internal predecessors, (164), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:18:33,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:33,473 INFO L93 Difference]: Finished difference Result 142 states and 179 transitions. [2022-04-27 10:18:33,473 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 179 transitions. [2022-04-27 10:18:33,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:33,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:33,473 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 128 states have (on average 1.28125) internal successors, (164), 130 states have internal predecessors, (164), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 142 states. [2022-04-27 10:18:33,473 INFO L87 Difference]: Start difference. First operand has 137 states, 128 states have (on average 1.28125) internal successors, (164), 130 states have internal predecessors, (164), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 142 states. [2022-04-27 10:18:33,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:33,476 INFO L93 Difference]: Finished difference Result 142 states and 179 transitions. [2022-04-27 10:18:33,476 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 179 transitions. [2022-04-27 10:18:33,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:33,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:33,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:18:33,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:18:33,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 128 states have (on average 1.28125) internal successors, (164), 130 states have internal predecessors, (164), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:18:33,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 172 transitions. [2022-04-27 10:18:33,479 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 172 transitions. Word has length 37 [2022-04-27 10:18:33,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:18:33,480 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 172 transitions. [2022-04-27 10:18:33,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 45 states have internal predecessors, (88), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:33,480 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 172 transitions. [2022-04-27 10:18:33,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 10:18:33,480 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:18:33,481 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:18:33,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 10:18:33,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-27 10:18:33,695 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:18:33,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:18:33,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1135801840, now seen corresponding path program 1 times [2022-04-27 10:18:33,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:18:33,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308642888] [2022-04-27 10:18:33,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:18:33,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:18:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:34,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:18:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:34,081 INFO L290 TraceCheckUtils]: 0: Hoare triple {7731#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {7714#true} is VALID [2022-04-27 10:18:34,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {7714#true} assume true; {7714#true} is VALID [2022-04-27 10:18:34,081 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7714#true} {7714#true} #123#return; {7714#true} is VALID [2022-04-27 10:18:34,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {7714#true} call ULTIMATE.init(); {7731#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:18:34,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {7731#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {7714#true} is VALID [2022-04-27 10:18:34,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {7714#true} assume true; {7714#true} is VALID [2022-04-27 10:18:34,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7714#true} {7714#true} #123#return; {7714#true} is VALID [2022-04-27 10:18:34,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {7714#true} call #t~ret22 := main(); {7714#true} is VALID [2022-04-27 10:18:34,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {7714#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {7714#true} is VALID [2022-04-27 10:18:34,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {7714#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {7714#true} is VALID [2022-04-27 10:18:34,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {7714#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {7719#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:34,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {7719#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {7719#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:34,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {7719#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7720#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:34,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {7720#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) 0) (= main_~i~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7721#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:18:34,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {7721#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} assume !(~i~0 < ~nodecount~0); {7721#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:18:34,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {7721#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} ~i~0 := 0; {7721#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:18:34,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {7721#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7722#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 1) (= main_~j~0 0) (= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 0))} is VALID [2022-04-27 10:18:34,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {7722#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 1) (= main_~j~0 0) (= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7723#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= main_~j~0 0) (not (= (+ (* main_~x~0 4) |main_~#distance~0.offset|) 0)) (= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 0))} is VALID [2022-04-27 10:18:34,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {7723#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= main_~j~0 0) (not (= (+ (* main_~x~0 4) |main_~#distance~0.offset|) 0)) (= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 0))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {7724#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= main_~j~0 0) (= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 0))} is VALID [2022-04-27 10:18:34,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {7724#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= main_~j~0 0) (= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 0))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {7725#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:18:34,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {7725#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7725#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:18:34,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {7725#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} assume !(#t~mem13 > #t~mem11 + #t~mem12);havoc #t~mem13;havoc #t~mem11;havoc #t~mem12; {7725#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:18:34,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {7725#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {7725#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:18:34,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {7725#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} assume !(~j~0 < ~edgecount~0); {7725#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:18:34,090 INFO L290 TraceCheckUtils]: 21: Hoare triple {7725#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7725#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:18:34,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {7725#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} assume !(~i~0 < ~nodecount~0); {7725#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:18:34,091 INFO L290 TraceCheckUtils]: 23: Hoare triple {7725#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} ~i~0 := 0; {7725#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:18:34,092 INFO L290 TraceCheckUtils]: 24: Hoare triple {7725#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {7725#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:18:34,092 INFO L290 TraceCheckUtils]: 25: Hoare triple {7725#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {7725#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:18:34,092 INFO L290 TraceCheckUtils]: 26: Hoare triple {7725#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7725#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:18:34,093 INFO L290 TraceCheckUtils]: 27: Hoare triple {7725#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {7726#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:18:34,093 INFO L290 TraceCheckUtils]: 28: Hoare triple {7726#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {7726#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:18:34,093 INFO L290 TraceCheckUtils]: 29: Hoare triple {7726#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7726#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:18:34,094 INFO L290 TraceCheckUtils]: 30: Hoare triple {7726#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !(~i~0 < ~edgecount~0); {7726#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:18:34,094 INFO L290 TraceCheckUtils]: 31: Hoare triple {7726#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} ~i~0 := 0; {7727#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:34,095 INFO L290 TraceCheckUtils]: 32: Hoare triple {7727#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7728#(= |main_#t~mem21| 0)} is VALID [2022-04-27 10:18:34,095 INFO L272 TraceCheckUtils]: 33: Hoare triple {7728#(= |main_#t~mem21| 0)} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {7729#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:18:34,095 INFO L290 TraceCheckUtils]: 34: Hoare triple {7729#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {7730#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:18:34,096 INFO L290 TraceCheckUtils]: 35: Hoare triple {7730#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7715#false} is VALID [2022-04-27 10:18:34,096 INFO L290 TraceCheckUtils]: 36: Hoare triple {7715#false} assume !false; {7715#false} is VALID [2022-04-27 10:18:34,096 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 10:18:34,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:18:34,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308642888] [2022-04-27 10:18:34,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308642888] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:18:34,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972693081] [2022-04-27 10:18:34,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:18:34,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:18:34,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:18:34,099 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:18:34,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 10:18:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:34,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 10:18:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:34,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:18:34,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2022-04-27 10:18:34,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-04-27 10:18:34,626 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-04-27 10:18:34,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-04-27 10:18:35,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-04-27 10:18:35,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {7714#true} call ULTIMATE.init(); {7714#true} is VALID [2022-04-27 10:18:35,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {7714#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {7714#true} is VALID [2022-04-27 10:18:35,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {7714#true} assume true; {7714#true} is VALID [2022-04-27 10:18:35,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7714#true} {7714#true} #123#return; {7714#true} is VALID [2022-04-27 10:18:35,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {7714#true} call #t~ret22 := main(); {7714#true} is VALID [2022-04-27 10:18:35,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {7714#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {7714#true} is VALID [2022-04-27 10:18:35,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {7714#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {7714#true} is VALID [2022-04-27 10:18:35,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {7714#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {7756#(and (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)))} is VALID [2022-04-27 10:18:35,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {7756#(and (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)))} assume !!(~i~0 < ~nodecount~0); {7756#(and (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)))} is VALID [2022-04-27 10:18:35,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {7756#(and (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7763#(and (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:18:35,608 INFO L290 TraceCheckUtils]: 10: Hoare triple {7763#(and (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7763#(and (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:18:35,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {7763#(and (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~i~0 < ~nodecount~0); {7763#(and (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:18:35,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {7763#(and (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} ~i~0 := 0; {7763#(and (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:18:35,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {7763#(and (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7776#(and (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:18:35,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {7776#(and (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7780#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)) (<= (select (select |#memory_int| |main_~#Dest~0.base|) 0) main_~x~0))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:18:35,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {7780#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)) (<= (select (select |#memory_int| |main_~#Dest~0.base|) 0) main_~x~0))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {7784#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:18:35,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {7784#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {7784#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:18:35,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {7784#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7784#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:18:35,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {7784#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(#t~mem13 > #t~mem11 + #t~mem12);havoc #t~mem13;havoc #t~mem11;havoc #t~mem12; {7784#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:18:35,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {7784#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {7784#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:18:35,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {7784#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~j~0 < ~edgecount~0); {7784#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:18:35,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {7784#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7784#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:18:35,616 INFO L290 TraceCheckUtils]: 22: Hoare triple {7784#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~i~0 < ~nodecount~0); {7784#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:18:35,616 INFO L290 TraceCheckUtils]: 23: Hoare triple {7784#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} ~i~0 := 0; {7784#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:18:35,617 INFO L290 TraceCheckUtils]: 24: Hoare triple {7784#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {7784#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:18:35,618 INFO L290 TraceCheckUtils]: 25: Hoare triple {7784#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {7784#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:18:35,618 INFO L290 TraceCheckUtils]: 26: Hoare triple {7784#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7784#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:18:35,619 INFO L290 TraceCheckUtils]: 27: Hoare triple {7784#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {7784#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:18:35,620 INFO L290 TraceCheckUtils]: 28: Hoare triple {7784#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {7784#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:18:35,620 INFO L290 TraceCheckUtils]: 29: Hoare triple {7784#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7784#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:18:35,621 INFO L290 TraceCheckUtils]: 30: Hoare triple {7784#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~i~0 < ~edgecount~0); {7784#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:18:35,621 INFO L290 TraceCheckUtils]: 31: Hoare triple {7784#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} ~i~0 := 0; {7833#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (= main_~i~0 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:18:35,622 INFO L290 TraceCheckUtils]: 32: Hoare triple {7833#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 1 (select (select |#memory_int| |main_~#Dest~0.base|) 0)))) (= main_~i~0 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7837#(<= 0 |main_#t~mem21|)} is VALID [2022-04-27 10:18:35,622 INFO L272 TraceCheckUtils]: 33: Hoare triple {7837#(<= 0 |main_#t~mem21|)} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {7841#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:18:35,623 INFO L290 TraceCheckUtils]: 34: Hoare triple {7841#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7845#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:18:35,623 INFO L290 TraceCheckUtils]: 35: Hoare triple {7845#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7715#false} is VALID [2022-04-27 10:18:35,623 INFO L290 TraceCheckUtils]: 36: Hoare triple {7715#false} assume !false; {7715#false} is VALID [2022-04-27 10:18:35,623 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 10:18:35,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:18:37,885 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~x~0_24 Int)) (or (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)) v_main_~x~0_24)) (forall ((v_ArrVal_396 Int)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_24 4) |c_main_~#distance~0.offset|) v_ArrVal_396) |c_main_~#distance~0.offset|))))) is different from false [2022-04-27 10:18:38,414 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_396 Int) (v_main_~x~0_24 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_24 4) |c_main_~#distance~0.offset|) v_ArrVal_396) |c_main_~#distance~0.offset|)) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_24)))) is different from false [2022-04-27 10:18:39,607 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_396 Int) (v_ArrVal_394 Int) (v_main_~x~0_24 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|) v_ArrVal_394))) (or (not (<= (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse0) |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_24)) (<= 0 (select (store .cse0 (+ (* v_main_~x~0_24 4) |c_main_~#distance~0.offset|) v_ArrVal_396) |c_main_~#distance~0.offset|)) (not (<= 0 v_ArrVal_394))))) is different from false [2022-04-27 10:18:40,098 INFO L290 TraceCheckUtils]: 36: Hoare triple {7715#false} assume !false; {7715#false} is VALID [2022-04-27 10:18:40,098 INFO L290 TraceCheckUtils]: 35: Hoare triple {7845#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7715#false} is VALID [2022-04-27 10:18:40,099 INFO L290 TraceCheckUtils]: 34: Hoare triple {7841#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7845#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:18:40,099 INFO L272 TraceCheckUtils]: 33: Hoare triple {7837#(<= 0 |main_#t~mem21|)} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {7841#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:18:40,100 INFO L290 TraceCheckUtils]: 32: Hoare triple {7864#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7837#(<= 0 |main_#t~mem21|)} is VALID [2022-04-27 10:18:40,100 INFO L290 TraceCheckUtils]: 31: Hoare triple {7868#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} ~i~0 := 0; {7864#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))))} is VALID [2022-04-27 10:18:40,101 INFO L290 TraceCheckUtils]: 30: Hoare triple {7868#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !(~i~0 < ~edgecount~0); {7868#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:18:40,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {7868#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7868#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:18:40,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {7868#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {7868#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:18:40,102 INFO L290 TraceCheckUtils]: 27: Hoare triple {7868#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {7868#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:18:40,102 INFO L290 TraceCheckUtils]: 26: Hoare triple {7868#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {7868#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:18:40,103 INFO L290 TraceCheckUtils]: 25: Hoare triple {7868#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {7868#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:18:40,103 INFO L290 TraceCheckUtils]: 24: Hoare triple {7868#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {7868#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:18:40,103 INFO L290 TraceCheckUtils]: 23: Hoare triple {7868#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} ~i~0 := 0; {7868#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:18:40,104 INFO L290 TraceCheckUtils]: 22: Hoare triple {7868#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !(~i~0 < ~nodecount~0); {7868#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:18:40,104 INFO L290 TraceCheckUtils]: 21: Hoare triple {7868#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7868#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:18:40,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {7868#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !(~j~0 < ~edgecount~0); {7868#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:18:40,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {7868#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {7868#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:18:40,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {7868#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !(#t~mem13 > #t~mem11 + #t~mem12);havoc #t~mem13;havoc #t~mem11;havoc #t~mem12; {7868#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:18:40,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {7868#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7868#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:18:40,106 INFO L290 TraceCheckUtils]: 16: Hoare triple {7868#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {7868#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:18:40,106 INFO L290 TraceCheckUtils]: 15: Hoare triple {7917#(forall ((v_ArrVal_396 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_396) |main_~#distance~0.offset|)))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {7868#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:18:40,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {7921#(forall ((v_main_~x~0_24 Int)) (or (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) v_main_~x~0_24)) (forall ((v_ArrVal_396 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* v_main_~x~0_24 4)) v_ArrVal_396) |main_~#distance~0.offset|)))))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {7917#(forall ((v_ArrVal_396 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_396) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:18:40,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {7925#(forall ((v_ArrVal_396 Int) (v_main_~x~0_24 Int)) (or (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_24)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* v_main_~x~0_24 4)) v_ArrVal_396) |main_~#distance~0.offset|))))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {7921#(forall ((v_main_~x~0_24 Int)) (or (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) v_main_~x~0_24)) (forall ((v_ArrVal_396 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* v_main_~x~0_24 4)) v_ArrVal_396) |main_~#distance~0.offset|)))))} is VALID [2022-04-27 10:18:40,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {7925#(forall ((v_ArrVal_396 Int) (v_main_~x~0_24 Int)) (or (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_24)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* v_main_~x~0_24 4)) v_ArrVal_396) |main_~#distance~0.offset|))))} ~i~0 := 0; {7925#(forall ((v_ArrVal_396 Int) (v_main_~x~0_24 Int)) (or (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_24)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* v_main_~x~0_24 4)) v_ArrVal_396) |main_~#distance~0.offset|))))} is VALID [2022-04-27 10:18:40,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {7925#(forall ((v_ArrVal_396 Int) (v_main_~x~0_24 Int)) (or (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_24)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* v_main_~x~0_24 4)) v_ArrVal_396) |main_~#distance~0.offset|))))} assume !(~i~0 < ~nodecount~0); {7925#(forall ((v_ArrVal_396 Int) (v_main_~x~0_24 Int)) (or (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_24)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* v_main_~x~0_24 4)) v_ArrVal_396) |main_~#distance~0.offset|))))} is VALID [2022-04-27 10:18:40,111 INFO L290 TraceCheckUtils]: 10: Hoare triple {7925#(forall ((v_ArrVal_396 Int) (v_main_~x~0_24 Int)) (or (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_24)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* v_main_~x~0_24 4)) v_ArrVal_396) |main_~#distance~0.offset|))))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7925#(forall ((v_ArrVal_396 Int) (v_main_~x~0_24 Int)) (or (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_24)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* v_main_~x~0_24 4)) v_ArrVal_396) |main_~#distance~0.offset|))))} is VALID [2022-04-27 10:18:40,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {7938#(forall ((v_ArrVal_396 Int) (v_ArrVal_394 Int) (v_main_~x~0_24 Int)) (or (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_394) (+ |main_~#distance~0.offset| (* v_main_~x~0_24 4)) v_ArrVal_396) |main_~#distance~0.offset|)) (not (<= (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_394)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_24)) (not (<= 0 v_ArrVal_394))))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {7925#(forall ((v_ArrVal_396 Int) (v_main_~x~0_24 Int)) (or (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_24)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* v_main_~x~0_24 4)) v_ArrVal_396) |main_~#distance~0.offset|))))} is VALID [2022-04-27 10:18:40,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {7938#(forall ((v_ArrVal_396 Int) (v_ArrVal_394 Int) (v_main_~x~0_24 Int)) (or (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_394) (+ |main_~#distance~0.offset| (* v_main_~x~0_24 4)) v_ArrVal_396) |main_~#distance~0.offset|)) (not (<= (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_394)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_24)) (not (<= 0 v_ArrVal_394))))} assume !!(~i~0 < ~nodecount~0); {7938#(forall ((v_ArrVal_396 Int) (v_ArrVal_394 Int) (v_main_~x~0_24 Int)) (or (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_394) (+ |main_~#distance~0.offset| (* v_main_~x~0_24 4)) v_ArrVal_396) |main_~#distance~0.offset|)) (not (<= (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_394)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_24)) (not (<= 0 v_ArrVal_394))))} is VALID [2022-04-27 10:18:40,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {7714#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {7938#(forall ((v_ArrVal_396 Int) (v_ArrVal_394 Int) (v_main_~x~0_24 Int)) (or (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_394) (+ |main_~#distance~0.offset| (* v_main_~x~0_24 4)) v_ArrVal_396) |main_~#distance~0.offset|)) (not (<= (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_394)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_24)) (not (<= 0 v_ArrVal_394))))} is VALID [2022-04-27 10:18:40,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {7714#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {7714#true} is VALID [2022-04-27 10:18:40,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {7714#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {7714#true} is VALID [2022-04-27 10:18:40,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {7714#true} call #t~ret22 := main(); {7714#true} is VALID [2022-04-27 10:18:40,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7714#true} {7714#true} #123#return; {7714#true} is VALID [2022-04-27 10:18:40,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {7714#true} assume true; {7714#true} is VALID [2022-04-27 10:18:40,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {7714#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {7714#true} is VALID [2022-04-27 10:18:40,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {7714#true} call ULTIMATE.init(); {7714#true} is VALID [2022-04-27 10:18:40,118 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 4 not checked. [2022-04-27 10:18:40,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972693081] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:18:40,118 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:18:40,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 30 [2022-04-27 10:18:40,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466348210] [2022-04-27 10:18:40,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:18:40,119 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.857142857142857) internal successors, (80), 27 states have internal predecessors, (80), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-27 10:18:40,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:18:40,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 28 states have (on average 2.857142857142857) internal successors, (80), 27 states have internal predecessors, (80), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:40,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:40,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-27 10:18:40,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:18:40,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-27 10:18:40,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=599, Unknown=3, NotChecked=156, Total=870 [2022-04-27 10:18:40,193 INFO L87 Difference]: Start difference. First operand 137 states and 172 transitions. Second operand has 30 states, 28 states have (on average 2.857142857142857) internal successors, (80), 27 states have internal predecessors, (80), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:41,592 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (forall ((v_ArrVal_396 Int) (v_main_~x~0_24 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_24 4) |c_main_~#distance~0.offset|) v_ArrVal_396) |c_main_~#distance~0.offset|)) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_24)))) (= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) 1) (= |c_main_~#distance~0.offset| 0) (= |c_old(~INFINITY~0)| c_~INFINITY~0) (= |c_main_~#Dest~0.offset| 0) (= c_main_~i~0 0) (= (select (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|)) 0) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-04-27 10:18:41,952 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_396 Int) (v_main_~x~0_24 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_24 4) |c_main_~#distance~0.offset|) v_ArrVal_396) |c_main_~#distance~0.offset|)) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_24)))) (= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) 1) (= |c_main_~#distance~0.offset| 0) (= |c_main_~#Dest~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#distance~0.base|) 0) 0)) is different from false [2022-04-27 10:18:44,003 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|))) (and (= .cse0 0) (= |c_main_~#distance~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#distance~0.base|) 0) 0) (= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) .cse0) 1) (forall ((v_main_~x~0_24 Int)) (or (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)) v_main_~x~0_24)) (forall ((v_ArrVal_396 Int)) (<= 0 (select (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_24 4) |c_main_~#distance~0.offset|) v_ArrVal_396) |c_main_~#distance~0.offset|))))) (= c_main_~j~0 0))) is different from false [2022-04-27 10:18:44,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:44,879 INFO L93 Difference]: Finished difference Result 161 states and 198 transitions. [2022-04-27 10:18:44,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-27 10:18:44,879 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.857142857142857) internal successors, (80), 27 states have internal predecessors, (80), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-27 10:18:44,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:18:44,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 2.857142857142857) internal successors, (80), 27 states have internal predecessors, (80), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:44,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 74 transitions. [2022-04-27 10:18:44,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 2.857142857142857) internal successors, (80), 27 states have internal predecessors, (80), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:44,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 74 transitions. [2022-04-27 10:18:44,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 74 transitions. [2022-04-27 10:18:44,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:44,956 INFO L225 Difference]: With dead ends: 161 [2022-04-27 10:18:44,956 INFO L226 Difference]: Without dead ends: 142 [2022-04-27 10:18:44,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=196, Invalid=1154, Unknown=6, NotChecked=450, Total=1806 [2022-04-27 10:18:44,957 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 40 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 247 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:18:44,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 208 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 406 Invalid, 0 Unknown, 247 Unchecked, 0.3s Time] [2022-04-27 10:18:44,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-04-27 10:18:45,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2022-04-27 10:18:45,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:18:45,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand has 134 states, 125 states have (on average 1.28) internal successors, (160), 127 states have internal predecessors, (160), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:18:45,116 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand has 134 states, 125 states have (on average 1.28) internal successors, (160), 127 states have internal predecessors, (160), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:18:45,116 INFO L87 Difference]: Start difference. First operand 142 states. Second operand has 134 states, 125 states have (on average 1.28) internal successors, (160), 127 states have internal predecessors, (160), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:18:45,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:45,119 INFO L93 Difference]: Finished difference Result 142 states and 178 transitions. [2022-04-27 10:18:45,119 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 178 transitions. [2022-04-27 10:18:45,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:45,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:45,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 125 states have (on average 1.28) internal successors, (160), 127 states have internal predecessors, (160), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 142 states. [2022-04-27 10:18:45,120 INFO L87 Difference]: Start difference. First operand has 134 states, 125 states have (on average 1.28) internal successors, (160), 127 states have internal predecessors, (160), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 142 states. [2022-04-27 10:18:45,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:45,122 INFO L93 Difference]: Finished difference Result 142 states and 178 transitions. [2022-04-27 10:18:45,122 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 178 transitions. [2022-04-27 10:18:45,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:45,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:45,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:18:45,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:18:45,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 125 states have (on average 1.28) internal successors, (160), 127 states have internal predecessors, (160), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:18:45,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 168 transitions. [2022-04-27 10:18:45,125 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 168 transitions. Word has length 37 [2022-04-27 10:18:45,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:18:45,125 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 168 transitions. [2022-04-27 10:18:45,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 2.857142857142857) internal successors, (80), 27 states have internal predecessors, (80), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:45,126 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 168 transitions. [2022-04-27 10:18:45,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 10:18:45,126 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:18:45,126 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:18:45,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-27 10:18:45,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:18:45,348 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:18:45,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:18:45,349 INFO L85 PathProgramCache]: Analyzing trace with hash -792280217, now seen corresponding path program 4 times [2022-04-27 10:18:45,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:18:45,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71237871] [2022-04-27 10:18:45,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:18:45,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:18:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:45,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:18:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:45,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {8706#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {8699#true} is VALID [2022-04-27 10:18:45,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {8699#true} assume true; {8699#true} is VALID [2022-04-27 10:18:45,412 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8699#true} {8699#true} #123#return; {8699#true} is VALID [2022-04-27 10:18:45,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {8699#true} call ULTIMATE.init(); {8706#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:18:45,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {8706#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {8699#true} is VALID [2022-04-27 10:18:45,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {8699#true} assume true; {8699#true} is VALID [2022-04-27 10:18:45,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8699#true} {8699#true} #123#return; {8699#true} is VALID [2022-04-27 10:18:45,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {8699#true} call #t~ret22 := main(); {8699#true} is VALID [2022-04-27 10:18:45,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {8699#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {8699#true} is VALID [2022-04-27 10:18:45,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {8699#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {8699#true} is VALID [2022-04-27 10:18:45,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {8699#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {8704#(and (= main_~source~0 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:45,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {8704#(and (= main_~source~0 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {8704#(and (= main_~source~0 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:45,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {8704#(and (= main_~source~0 0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8704#(and (= main_~source~0 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:45,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {8704#(and (= main_~source~0 0) (= main_~i~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8705#(and (= main_~source~0 0) (not (= main_~i~0 0)))} is VALID [2022-04-27 10:18:45,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {8705#(and (= main_~source~0 0) (not (= main_~i~0 0)))} assume !!(~i~0 < ~nodecount~0); {8705#(and (= main_~source~0 0) (not (= main_~i~0 0)))} is VALID [2022-04-27 10:18:45,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {8705#(and (= main_~source~0 0) (not (= main_~i~0 0)))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8700#false} is VALID [2022-04-27 10:18:45,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {8700#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8700#false} is VALID [2022-04-27 10:18:45,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {8700#false} assume !(~i~0 < ~nodecount~0); {8700#false} is VALID [2022-04-27 10:18:45,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {8700#false} ~i~0 := 0; {8700#false} is VALID [2022-04-27 10:18:45,417 INFO L290 TraceCheckUtils]: 16: Hoare triple {8700#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {8700#false} is VALID [2022-04-27 10:18:45,417 INFO L290 TraceCheckUtils]: 17: Hoare triple {8700#false} assume !(~j~0 < ~edgecount~0); {8700#false} is VALID [2022-04-27 10:18:45,417 INFO L290 TraceCheckUtils]: 18: Hoare triple {8700#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8700#false} is VALID [2022-04-27 10:18:45,418 INFO L290 TraceCheckUtils]: 19: Hoare triple {8700#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {8700#false} is VALID [2022-04-27 10:18:45,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {8700#false} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8700#false} is VALID [2022-04-27 10:18:45,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {8700#false} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {8700#false} is VALID [2022-04-27 10:18:45,418 INFO L290 TraceCheckUtils]: 22: Hoare triple {8700#false} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {8700#false} is VALID [2022-04-27 10:18:45,418 INFO L290 TraceCheckUtils]: 23: Hoare triple {8700#false} assume !(~j~0 < ~edgecount~0); {8700#false} is VALID [2022-04-27 10:18:45,418 INFO L290 TraceCheckUtils]: 24: Hoare triple {8700#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8700#false} is VALID [2022-04-27 10:18:45,418 INFO L290 TraceCheckUtils]: 25: Hoare triple {8700#false} assume !(~i~0 < ~nodecount~0); {8700#false} is VALID [2022-04-27 10:18:45,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {8700#false} ~i~0 := 0; {8700#false} is VALID [2022-04-27 10:18:45,418 INFO L290 TraceCheckUtils]: 27: Hoare triple {8700#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {8700#false} is VALID [2022-04-27 10:18:45,418 INFO L290 TraceCheckUtils]: 28: Hoare triple {8700#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {8700#false} is VALID [2022-04-27 10:18:45,418 INFO L290 TraceCheckUtils]: 29: Hoare triple {8700#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8700#false} is VALID [2022-04-27 10:18:45,418 INFO L290 TraceCheckUtils]: 30: Hoare triple {8700#false} assume !(~i~0 < ~edgecount~0); {8700#false} is VALID [2022-04-27 10:18:45,418 INFO L290 TraceCheckUtils]: 31: Hoare triple {8700#false} ~i~0 := 0; {8700#false} is VALID [2022-04-27 10:18:45,419 INFO L290 TraceCheckUtils]: 32: Hoare triple {8700#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8700#false} is VALID [2022-04-27 10:18:45,419 INFO L272 TraceCheckUtils]: 33: Hoare triple {8700#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {8700#false} is VALID [2022-04-27 10:18:45,419 INFO L290 TraceCheckUtils]: 34: Hoare triple {8700#false} ~cond := #in~cond; {8700#false} is VALID [2022-04-27 10:18:45,419 INFO L290 TraceCheckUtils]: 35: Hoare triple {8700#false} assume 0 == ~cond; {8700#false} is VALID [2022-04-27 10:18:45,419 INFO L290 TraceCheckUtils]: 36: Hoare triple {8700#false} assume !false; {8700#false} is VALID [2022-04-27 10:18:45,419 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 10:18:45,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:18:45,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71237871] [2022-04-27 10:18:45,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71237871] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:18:45,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995950687] [2022-04-27 10:18:45,420 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 10:18:45,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:18:45,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:18:45,424 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:18:45,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-27 10:18:45,501 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 10:18:45,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:18:45,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 10:18:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:45,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:18:45,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {8699#true} call ULTIMATE.init(); {8699#true} is VALID [2022-04-27 10:18:45,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {8699#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {8699#true} is VALID [2022-04-27 10:18:45,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {8699#true} assume true; {8699#true} is VALID [2022-04-27 10:18:45,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8699#true} {8699#true} #123#return; {8699#true} is VALID [2022-04-27 10:18:45,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {8699#true} call #t~ret22 := main(); {8699#true} is VALID [2022-04-27 10:18:45,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {8699#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {8699#true} is VALID [2022-04-27 10:18:45,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {8699#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {8699#true} is VALID [2022-04-27 10:18:45,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {8699#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {8699#true} is VALID [2022-04-27 10:18:45,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {8699#true} assume !!(~i~0 < ~nodecount~0); {8699#true} is VALID [2022-04-27 10:18:45,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {8699#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8737#(<= main_~source~0 main_~i~0)} is VALID [2022-04-27 10:18:45,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {8737#(<= main_~source~0 main_~i~0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8741#(<= (+ main_~source~0 1) main_~i~0)} is VALID [2022-04-27 10:18:45,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {8741#(<= (+ main_~source~0 1) main_~i~0)} assume !!(~i~0 < ~nodecount~0); {8741#(<= (+ main_~source~0 1) main_~i~0)} is VALID [2022-04-27 10:18:45,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {8741#(<= (+ main_~source~0 1) main_~i~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8700#false} is VALID [2022-04-27 10:18:45,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {8700#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {8700#false} is VALID [2022-04-27 10:18:45,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {8700#false} assume !(~i~0 < ~nodecount~0); {8700#false} is VALID [2022-04-27 10:18:45,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {8700#false} ~i~0 := 0; {8700#false} is VALID [2022-04-27 10:18:45,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {8700#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {8700#false} is VALID [2022-04-27 10:18:45,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {8700#false} assume !(~j~0 < ~edgecount~0); {8700#false} is VALID [2022-04-27 10:18:45,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {8700#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8700#false} is VALID [2022-04-27 10:18:45,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {8700#false} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {8700#false} is VALID [2022-04-27 10:18:45,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {8700#false} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {8700#false} is VALID [2022-04-27 10:18:45,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {8700#false} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {8700#false} is VALID [2022-04-27 10:18:45,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {8700#false} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {8700#false} is VALID [2022-04-27 10:18:45,588 INFO L290 TraceCheckUtils]: 23: Hoare triple {8700#false} assume !(~j~0 < ~edgecount~0); {8700#false} is VALID [2022-04-27 10:18:45,588 INFO L290 TraceCheckUtils]: 24: Hoare triple {8700#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8700#false} is VALID [2022-04-27 10:18:45,588 INFO L290 TraceCheckUtils]: 25: Hoare triple {8700#false} assume !(~i~0 < ~nodecount~0); {8700#false} is VALID [2022-04-27 10:18:45,588 INFO L290 TraceCheckUtils]: 26: Hoare triple {8700#false} ~i~0 := 0; {8700#false} is VALID [2022-04-27 10:18:45,588 INFO L290 TraceCheckUtils]: 27: Hoare triple {8700#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {8700#false} is VALID [2022-04-27 10:18:45,588 INFO L290 TraceCheckUtils]: 28: Hoare triple {8700#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {8700#false} is VALID [2022-04-27 10:18:45,588 INFO L290 TraceCheckUtils]: 29: Hoare triple {8700#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {8700#false} is VALID [2022-04-27 10:18:45,588 INFO L290 TraceCheckUtils]: 30: Hoare triple {8700#false} assume !(~i~0 < ~edgecount~0); {8700#false} is VALID [2022-04-27 10:18:45,588 INFO L290 TraceCheckUtils]: 31: Hoare triple {8700#false} ~i~0 := 0; {8700#false} is VALID [2022-04-27 10:18:45,588 INFO L290 TraceCheckUtils]: 32: Hoare triple {8700#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {8700#false} is VALID [2022-04-27 10:18:45,588 INFO L272 TraceCheckUtils]: 33: Hoare triple {8700#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {8700#false} is VALID [2022-04-27 10:18:45,589 INFO L290 TraceCheckUtils]: 34: Hoare triple {8700#false} ~cond := #in~cond; {8700#false} is VALID [2022-04-27 10:18:45,589 INFO L290 TraceCheckUtils]: 35: Hoare triple {8700#false} assume 0 == ~cond; {8700#false} is VALID [2022-04-27 10:18:45,589 INFO L290 TraceCheckUtils]: 36: Hoare triple {8700#false} assume !false; {8700#false} is VALID [2022-04-27 10:18:45,589 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 10:18:45,589 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 10:18:45,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995950687] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:18:45,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 10:18:45,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-04-27 10:18:45,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977937793] [2022-04-27 10:18:45,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:18:45,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-27 10:18:45,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:18:45,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:45,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:45,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:18:45,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:18:45,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:18:45,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:18:45,622 INFO L87 Difference]: Start difference. First operand 134 states and 168 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:45,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:45,863 INFO L93 Difference]: Finished difference Result 225 states and 285 transitions. [2022-04-27 10:18:45,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:18:45,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-27 10:18:45,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:18:45,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:45,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-04-27 10:18:45,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:45,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-04-27 10:18:45,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 71 transitions. [2022-04-27 10:18:45,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:45,930 INFO L225 Difference]: With dead ends: 225 [2022-04-27 10:18:45,930 INFO L226 Difference]: Without dead ends: 134 [2022-04-27 10:18:45,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:18:45,935 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 3 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:18:45,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 75 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:18:45,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-27 10:18:46,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-04-27 10:18:46,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:18:46,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 134 states, 125 states have (on average 1.272) internal successors, (159), 127 states have internal predecessors, (159), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:18:46,127 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 134 states, 125 states have (on average 1.272) internal successors, (159), 127 states have internal predecessors, (159), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:18:46,127 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 134 states, 125 states have (on average 1.272) internal successors, (159), 127 states have internal predecessors, (159), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:18:46,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:46,130 INFO L93 Difference]: Finished difference Result 134 states and 167 transitions. [2022-04-27 10:18:46,130 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 167 transitions. [2022-04-27 10:18:46,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:46,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:46,134 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 125 states have (on average 1.272) internal successors, (159), 127 states have internal predecessors, (159), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 134 states. [2022-04-27 10:18:46,134 INFO L87 Difference]: Start difference. First operand has 134 states, 125 states have (on average 1.272) internal successors, (159), 127 states have internal predecessors, (159), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 134 states. [2022-04-27 10:18:46,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:46,137 INFO L93 Difference]: Finished difference Result 134 states and 167 transitions. [2022-04-27 10:18:46,137 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 167 transitions. [2022-04-27 10:18:46,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:46,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:46,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:18:46,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:18:46,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 125 states have (on average 1.272) internal successors, (159), 127 states have internal predecessors, (159), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:18:46,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 167 transitions. [2022-04-27 10:18:46,140 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 167 transitions. Word has length 37 [2022-04-27 10:18:46,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:18:46,140 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 167 transitions. [2022-04-27 10:18:46,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:46,140 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 167 transitions. [2022-04-27 10:18:46,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 10:18:46,140 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:18:46,140 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:18:46,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-27 10:18:46,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-27 10:18:46,355 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:18:46,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:18:46,356 INFO L85 PathProgramCache]: Analyzing trace with hash -651731607, now seen corresponding path program 1 times [2022-04-27 10:18:46,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:18:46,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157973497] [2022-04-27 10:18:46,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:18:46,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:18:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:46,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:18:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:46,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {9606#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {9598#true} is VALID [2022-04-27 10:18:46,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {9598#true} assume true; {9598#true} is VALID [2022-04-27 10:18:46,428 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9598#true} {9598#true} #123#return; {9598#true} is VALID [2022-04-27 10:18:46,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {9598#true} call ULTIMATE.init(); {9606#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:18:46,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {9606#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {9598#true} is VALID [2022-04-27 10:18:46,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {9598#true} assume true; {9598#true} is VALID [2022-04-27 10:18:46,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9598#true} {9598#true} #123#return; {9598#true} is VALID [2022-04-27 10:18:46,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {9598#true} call #t~ret22 := main(); {9598#true} is VALID [2022-04-27 10:18:46,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {9598#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {9598#true} is VALID [2022-04-27 10:18:46,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {9598#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {9598#true} is VALID [2022-04-27 10:18:46,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {9598#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {9598#true} is VALID [2022-04-27 10:18:46,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {9598#true} assume !!(~i~0 < ~nodecount~0); {9598#true} is VALID [2022-04-27 10:18:46,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {9598#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9598#true} is VALID [2022-04-27 10:18:46,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {9598#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9598#true} is VALID [2022-04-27 10:18:46,430 INFO L290 TraceCheckUtils]: 11: Hoare triple {9598#true} assume !!(~i~0 < ~nodecount~0); {9598#true} is VALID [2022-04-27 10:18:46,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {9598#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9598#true} is VALID [2022-04-27 10:18:46,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {9598#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9598#true} is VALID [2022-04-27 10:18:46,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {9598#true} assume !(~i~0 < ~nodecount~0); {9598#true} is VALID [2022-04-27 10:18:46,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {9598#true} ~i~0 := 0; {9598#true} is VALID [2022-04-27 10:18:46,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {9598#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9603#(= main_~j~0 0)} is VALID [2022-04-27 10:18:46,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {9603#(= main_~j~0 0)} assume !(~j~0 < ~edgecount~0); {9604#(<= main_~edgecount~0 0)} is VALID [2022-04-27 10:18:46,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {9604#(<= main_~edgecount~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9604#(<= main_~edgecount~0 0)} is VALID [2022-04-27 10:18:46,431 INFO L290 TraceCheckUtils]: 19: Hoare triple {9604#(<= main_~edgecount~0 0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {9605#(and (= main_~j~0 0) (<= main_~edgecount~0 0))} is VALID [2022-04-27 10:18:46,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {9605#(and (= main_~j~0 0) (<= main_~edgecount~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {9599#false} is VALID [2022-04-27 10:18:46,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {9599#false} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {9599#false} is VALID [2022-04-27 10:18:46,432 INFO L290 TraceCheckUtils]: 22: Hoare triple {9599#false} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {9599#false} is VALID [2022-04-27 10:18:46,432 INFO L290 TraceCheckUtils]: 23: Hoare triple {9599#false} assume !(~j~0 < ~edgecount~0); {9599#false} is VALID [2022-04-27 10:18:46,432 INFO L290 TraceCheckUtils]: 24: Hoare triple {9599#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9599#false} is VALID [2022-04-27 10:18:46,432 INFO L290 TraceCheckUtils]: 25: Hoare triple {9599#false} assume !(~i~0 < ~nodecount~0); {9599#false} is VALID [2022-04-27 10:18:46,432 INFO L290 TraceCheckUtils]: 26: Hoare triple {9599#false} ~i~0 := 0; {9599#false} is VALID [2022-04-27 10:18:46,432 INFO L290 TraceCheckUtils]: 27: Hoare triple {9599#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {9599#false} is VALID [2022-04-27 10:18:46,432 INFO L290 TraceCheckUtils]: 28: Hoare triple {9599#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {9599#false} is VALID [2022-04-27 10:18:46,432 INFO L290 TraceCheckUtils]: 29: Hoare triple {9599#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {9599#false} is VALID [2022-04-27 10:18:46,432 INFO L290 TraceCheckUtils]: 30: Hoare triple {9599#false} assume !(~i~0 < ~edgecount~0); {9599#false} is VALID [2022-04-27 10:18:46,433 INFO L290 TraceCheckUtils]: 31: Hoare triple {9599#false} ~i~0 := 0; {9599#false} is VALID [2022-04-27 10:18:46,433 INFO L290 TraceCheckUtils]: 32: Hoare triple {9599#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {9599#false} is VALID [2022-04-27 10:18:46,433 INFO L272 TraceCheckUtils]: 33: Hoare triple {9599#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {9599#false} is VALID [2022-04-27 10:18:46,433 INFO L290 TraceCheckUtils]: 34: Hoare triple {9599#false} ~cond := #in~cond; {9599#false} is VALID [2022-04-27 10:18:46,433 INFO L290 TraceCheckUtils]: 35: Hoare triple {9599#false} assume 0 == ~cond; {9599#false} is VALID [2022-04-27 10:18:46,433 INFO L290 TraceCheckUtils]: 36: Hoare triple {9599#false} assume !false; {9599#false} is VALID [2022-04-27 10:18:46,433 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 10:18:46,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:18:46,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157973497] [2022-04-27 10:18:46,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157973497] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:18:46,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:18:46,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:18:46,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861014453] [2022-04-27 10:18:46,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:18:46,434 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-27 10:18:46,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:18:46,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:46,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:46,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:18:46,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:18:46,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:18:46,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:18:46,462 INFO L87 Difference]: Start difference. First operand 134 states and 167 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:46,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:46,857 INFO L93 Difference]: Finished difference Result 208 states and 260 transitions. [2022-04-27 10:18:46,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:18:46,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-27 10:18:46,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:18:46,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:46,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2022-04-27 10:18:46,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:46,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2022-04-27 10:18:46,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 83 transitions. [2022-04-27 10:18:46,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:46,922 INFO L225 Difference]: With dead ends: 208 [2022-04-27 10:18:46,922 INFO L226 Difference]: Without dead ends: 148 [2022-04-27 10:18:46,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:18:46,923 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 71 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:18:46,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 44 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:18:46,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-04-27 10:18:47,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 134. [2022-04-27 10:18:47,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:18:47,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand has 134 states, 125 states have (on average 1.264) internal successors, (158), 127 states have internal predecessors, (158), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:18:47,088 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand has 134 states, 125 states have (on average 1.264) internal successors, (158), 127 states have internal predecessors, (158), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:18:47,088 INFO L87 Difference]: Start difference. First operand 148 states. Second operand has 134 states, 125 states have (on average 1.264) internal successors, (158), 127 states have internal predecessors, (158), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:18:47,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:47,090 INFO L93 Difference]: Finished difference Result 148 states and 185 transitions. [2022-04-27 10:18:47,090 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 185 transitions. [2022-04-27 10:18:47,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:47,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:47,091 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 125 states have (on average 1.264) internal successors, (158), 127 states have internal predecessors, (158), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 148 states. [2022-04-27 10:18:47,091 INFO L87 Difference]: Start difference. First operand has 134 states, 125 states have (on average 1.264) internal successors, (158), 127 states have internal predecessors, (158), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 148 states. [2022-04-27 10:18:47,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:47,094 INFO L93 Difference]: Finished difference Result 148 states and 185 transitions. [2022-04-27 10:18:47,094 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 185 transitions. [2022-04-27 10:18:47,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:47,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:47,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:18:47,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:18:47,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 125 states have (on average 1.264) internal successors, (158), 127 states have internal predecessors, (158), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:18:47,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 166 transitions. [2022-04-27 10:18:47,097 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 166 transitions. Word has length 37 [2022-04-27 10:18:47,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:18:47,097 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 166 transitions. [2022-04-27 10:18:47,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:47,098 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 166 transitions. [2022-04-27 10:18:47,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 10:18:47,098 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:18:47,098 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:18:47,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 10:18:47,098 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:18:47,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:18:47,099 INFO L85 PathProgramCache]: Analyzing trace with hash 524779340, now seen corresponding path program 1 times [2022-04-27 10:18:47,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:18:47,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693722583] [2022-04-27 10:18:47,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:18:47,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:18:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:47,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:18:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:47,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {10413#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {10399#(<= 899 ~INFINITY~0)} is VALID [2022-04-27 10:18:47,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {10399#(<= 899 ~INFINITY~0)} assume true; {10399#(<= 899 ~INFINITY~0)} is VALID [2022-04-27 10:18:47,266 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10399#(<= 899 ~INFINITY~0)} {10394#true} #123#return; {10399#(<= 899 ~INFINITY~0)} is VALID [2022-04-27 10:18:47,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-27 10:18:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:47,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {10394#true} ~cond := #in~cond; {10394#true} is VALID [2022-04-27 10:18:47,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {10394#true} assume !(0 == ~cond); {10394#true} is VALID [2022-04-27 10:18:47,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {10394#true} assume true; {10394#true} is VALID [2022-04-27 10:18:47,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10394#true} {10404#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)) (= main_~i~0 0))} #121#return; {10404#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)) (= main_~i~0 0))} is VALID [2022-04-27 10:18:47,272 INFO L272 TraceCheckUtils]: 0: Hoare triple {10394#true} call ULTIMATE.init(); {10413#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:18:47,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {10413#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {10399#(<= 899 ~INFINITY~0)} is VALID [2022-04-27 10:18:47,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {10399#(<= 899 ~INFINITY~0)} assume true; {10399#(<= 899 ~INFINITY~0)} is VALID [2022-04-27 10:18:47,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10399#(<= 899 ~INFINITY~0)} {10394#true} #123#return; {10399#(<= 899 ~INFINITY~0)} is VALID [2022-04-27 10:18:47,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {10399#(<= 899 ~INFINITY~0)} call #t~ret22 := main(); {10399#(<= 899 ~INFINITY~0)} is VALID [2022-04-27 10:18:47,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {10399#(<= 899 ~INFINITY~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {10399#(<= 899 ~INFINITY~0)} is VALID [2022-04-27 10:18:47,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {10399#(<= 899 ~INFINITY~0)} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {10399#(<= 899 ~INFINITY~0)} is VALID [2022-04-27 10:18:47,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {10399#(<= 899 ~INFINITY~0)} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {10400#(and (<= 899 ~INFINITY~0) (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:47,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {10400#(and (<= 899 ~INFINITY~0) (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {10400#(and (<= 899 ~INFINITY~0) (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:47,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {10400#(and (<= 899 ~INFINITY~0) (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10400#(and (<= 899 ~INFINITY~0) (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:47,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {10400#(and (<= 899 ~INFINITY~0) (= |main_~#distance~0.offset| 0) (= main_~i~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10401#(and (<= 899 ~INFINITY~0) (= |main_~#distance~0.offset| 0) (= (+ |main_~#distance~0.offset| (* main_~i~0 4)) 4))} is VALID [2022-04-27 10:18:47,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {10401#(and (<= 899 ~INFINITY~0) (= |main_~#distance~0.offset| 0) (= (+ |main_~#distance~0.offset| (* main_~i~0 4)) 4))} assume !!(~i~0 < ~nodecount~0); {10401#(and (<= 899 ~INFINITY~0) (= |main_~#distance~0.offset| 0) (= (+ |main_~#distance~0.offset| (* main_~i~0 4)) 4))} is VALID [2022-04-27 10:18:47,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {10401#(and (<= 899 ~INFINITY~0) (= |main_~#distance~0.offset| 0) (= (+ |main_~#distance~0.offset| (* main_~i~0 4)) 4))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10402#(and (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)))) (= |main_~#distance~0.offset| 0) (= (+ |main_~#distance~0.offset| (* main_~i~0 4)) 4))} is VALID [2022-04-27 10:18:47,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {10402#(and (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)))) (= |main_~#distance~0.offset| 0) (= (+ |main_~#distance~0.offset| (* main_~i~0 4)) 4))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10403#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)))} is VALID [2022-04-27 10:18:47,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {10403#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)))} assume !(~i~0 < ~nodecount~0); {10403#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)))} is VALID [2022-04-27 10:18:47,281 INFO L290 TraceCheckUtils]: 15: Hoare triple {10403#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)))} ~i~0 := 0; {10403#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)))} is VALID [2022-04-27 10:18:47,281 INFO L290 TraceCheckUtils]: 16: Hoare triple {10403#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {10403#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)))} is VALID [2022-04-27 10:18:47,282 INFO L290 TraceCheckUtils]: 17: Hoare triple {10403#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)))} assume !(~j~0 < ~edgecount~0); {10403#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)))} is VALID [2022-04-27 10:18:47,282 INFO L290 TraceCheckUtils]: 18: Hoare triple {10403#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10403#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)))} is VALID [2022-04-27 10:18:47,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {10403#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {10403#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)))} is VALID [2022-04-27 10:18:47,283 INFO L290 TraceCheckUtils]: 20: Hoare triple {10403#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)))} assume !(~j~0 < ~edgecount~0); {10403#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)))} is VALID [2022-04-27 10:18:47,284 INFO L290 TraceCheckUtils]: 21: Hoare triple {10403#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10403#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)))} is VALID [2022-04-27 10:18:47,284 INFO L290 TraceCheckUtils]: 22: Hoare triple {10403#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)))} assume !(~i~0 < ~nodecount~0); {10403#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)))} is VALID [2022-04-27 10:18:47,285 INFO L290 TraceCheckUtils]: 23: Hoare triple {10403#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)))} ~i~0 := 0; {10403#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)))} is VALID [2022-04-27 10:18:47,285 INFO L290 TraceCheckUtils]: 24: Hoare triple {10403#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)))} assume !(~i~0 < ~edgecount~0); {10403#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)))} is VALID [2022-04-27 10:18:47,285 INFO L290 TraceCheckUtils]: 25: Hoare triple {10403#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)))} ~i~0 := 0; {10404#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)) (= main_~i~0 0))} is VALID [2022-04-27 10:18:47,286 INFO L290 TraceCheckUtils]: 26: Hoare triple {10404#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10404#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)) (= main_~i~0 0))} is VALID [2022-04-27 10:18:47,286 INFO L272 TraceCheckUtils]: 27: Hoare triple {10404#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {10394#true} is VALID [2022-04-27 10:18:47,286 INFO L290 TraceCheckUtils]: 28: Hoare triple {10394#true} ~cond := #in~cond; {10394#true} is VALID [2022-04-27 10:18:47,286 INFO L290 TraceCheckUtils]: 29: Hoare triple {10394#true} assume !(0 == ~cond); {10394#true} is VALID [2022-04-27 10:18:47,286 INFO L290 TraceCheckUtils]: 30: Hoare triple {10394#true} assume true; {10394#true} is VALID [2022-04-27 10:18:47,287 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10394#true} {10404#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)) (= main_~i~0 0))} #121#return; {10404#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)) (= main_~i~0 0))} is VALID [2022-04-27 10:18:47,287 INFO L290 TraceCheckUtils]: 32: Hoare triple {10404#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)) (= main_~i~0 0))} havoc #t~mem21; {10404#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)) (= main_~i~0 0))} is VALID [2022-04-27 10:18:47,287 INFO L290 TraceCheckUtils]: 33: Hoare triple {10404#(and (= |main_~#distance~0.offset| 0) (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) 4)) (= main_~i~0 0))} #t~post20 := ~i~0;~i~0 := 1 + #t~post20;havoc #t~post20; {10409#(and (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)))) (= |main_~#distance~0.offset| 0))} is VALID [2022-04-27 10:18:47,288 INFO L290 TraceCheckUtils]: 34: Hoare triple {10409#(and (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)))) (= |main_~#distance~0.offset| 0))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10410#(<= 899 |main_#t~mem21|)} is VALID [2022-04-27 10:18:47,288 INFO L272 TraceCheckUtils]: 35: Hoare triple {10410#(<= 899 |main_#t~mem21|)} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {10411#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:18:47,289 INFO L290 TraceCheckUtils]: 36: Hoare triple {10411#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {10412#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:18:47,289 INFO L290 TraceCheckUtils]: 37: Hoare triple {10412#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {10395#false} is VALID [2022-04-27 10:18:47,289 INFO L290 TraceCheckUtils]: 38: Hoare triple {10395#false} assume !false; {10395#false} is VALID [2022-04-27 10:18:47,289 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 10:18:47,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:18:47,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693722583] [2022-04-27 10:18:47,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693722583] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:18:47,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700796659] [2022-04-27 10:18:47,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:18:47,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:18:47,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:18:47,290 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:18:47,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-27 10:18:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:47,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 10:18:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:47,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:18:47,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-04-27 10:18:49,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-04-27 10:18:49,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {10394#true} call ULTIMATE.init(); {10394#true} is VALID [2022-04-27 10:18:49,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {10394#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {10399#(<= 899 ~INFINITY~0)} is VALID [2022-04-27 10:18:49,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {10399#(<= 899 ~INFINITY~0)} assume true; {10399#(<= 899 ~INFINITY~0)} is VALID [2022-04-27 10:18:49,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10399#(<= 899 ~INFINITY~0)} {10394#true} #123#return; {10399#(<= 899 ~INFINITY~0)} is VALID [2022-04-27 10:18:49,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {10399#(<= 899 ~INFINITY~0)} call #t~ret22 := main(); {10399#(<= 899 ~INFINITY~0)} is VALID [2022-04-27 10:18:49,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {10399#(<= 899 ~INFINITY~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {10399#(<= 899 ~INFINITY~0)} is VALID [2022-04-27 10:18:49,824 INFO L290 TraceCheckUtils]: 6: Hoare triple {10399#(<= 899 ~INFINITY~0)} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {10399#(<= 899 ~INFINITY~0)} is VALID [2022-04-27 10:18:49,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {10399#(<= 899 ~INFINITY~0)} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {10438#(and (<= 899 ~INFINITY~0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:49,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {10438#(and (<= 899 ~INFINITY~0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {10438#(and (<= 899 ~INFINITY~0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:49,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {10438#(and (<= 899 ~INFINITY~0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10438#(and (<= 899 ~INFINITY~0) (= main_~i~0 0))} is VALID [2022-04-27 10:18:49,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {10438#(and (<= 899 ~INFINITY~0) (= main_~i~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10448#(and (<= 899 ~INFINITY~0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 10:18:49,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {10448#(and (<= 899 ~INFINITY~0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 < ~nodecount~0); {10448#(and (<= 899 ~INFINITY~0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 10:18:49,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {10448#(and (<= 899 ~INFINITY~0) (= (+ (- 1) main_~i~0) 0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10455#(<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} is VALID [2022-04-27 10:18:49,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {10455#(<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10455#(<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} is VALID [2022-04-27 10:18:49,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {10455#(<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} assume !(~i~0 < ~nodecount~0); {10455#(<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} is VALID [2022-04-27 10:18:49,831 INFO L290 TraceCheckUtils]: 15: Hoare triple {10455#(<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} ~i~0 := 0; {10455#(<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} is VALID [2022-04-27 10:18:49,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {10455#(<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {10455#(<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} is VALID [2022-04-27 10:18:49,832 INFO L290 TraceCheckUtils]: 17: Hoare triple {10455#(<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} assume !(~j~0 < ~edgecount~0); {10455#(<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} is VALID [2022-04-27 10:18:49,832 INFO L290 TraceCheckUtils]: 18: Hoare triple {10455#(<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10455#(<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} is VALID [2022-04-27 10:18:49,833 INFO L290 TraceCheckUtils]: 19: Hoare triple {10455#(<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {10455#(<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} is VALID [2022-04-27 10:18:49,833 INFO L290 TraceCheckUtils]: 20: Hoare triple {10455#(<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} assume !(~j~0 < ~edgecount~0); {10455#(<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} is VALID [2022-04-27 10:18:49,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {10455#(<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10455#(<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} is VALID [2022-04-27 10:18:49,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {10455#(<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} assume !(~i~0 < ~nodecount~0); {10455#(<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} is VALID [2022-04-27 10:18:49,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {10455#(<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} ~i~0 := 0; {10455#(<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} is VALID [2022-04-27 10:18:49,835 INFO L290 TraceCheckUtils]: 24: Hoare triple {10455#(<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} assume !(~i~0 < ~edgecount~0); {10455#(<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} is VALID [2022-04-27 10:18:49,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {10455#(<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} ~i~0 := 0; {10495#(and (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (= main_~i~0 0))} is VALID [2022-04-27 10:18:49,836 INFO L290 TraceCheckUtils]: 26: Hoare triple {10495#(and (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10495#(and (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (= main_~i~0 0))} is VALID [2022-04-27 10:18:49,836 INFO L272 TraceCheckUtils]: 27: Hoare triple {10495#(and (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {10502#(exists ((|v_main_~#distance~0.offset_BEFORE_CALL_1| Int) (|v_main_~#distance~0.base_BEFORE_CALL_1| Int)) (<= 899 (select (select |#memory_int| |v_main_~#distance~0.base_BEFORE_CALL_1|) (+ |v_main_~#distance~0.offset_BEFORE_CALL_1| 4))))} is VALID [2022-04-27 10:18:49,837 INFO L290 TraceCheckUtils]: 28: Hoare triple {10502#(exists ((|v_main_~#distance~0.offset_BEFORE_CALL_1| Int) (|v_main_~#distance~0.base_BEFORE_CALL_1| Int)) (<= 899 (select (select |#memory_int| |v_main_~#distance~0.base_BEFORE_CALL_1|) (+ |v_main_~#distance~0.offset_BEFORE_CALL_1| 4))))} ~cond := #in~cond; {10502#(exists ((|v_main_~#distance~0.offset_BEFORE_CALL_1| Int) (|v_main_~#distance~0.base_BEFORE_CALL_1| Int)) (<= 899 (select (select |#memory_int| |v_main_~#distance~0.base_BEFORE_CALL_1|) (+ |v_main_~#distance~0.offset_BEFORE_CALL_1| 4))))} is VALID [2022-04-27 10:18:49,837 INFO L290 TraceCheckUtils]: 29: Hoare triple {10502#(exists ((|v_main_~#distance~0.offset_BEFORE_CALL_1| Int) (|v_main_~#distance~0.base_BEFORE_CALL_1| Int)) (<= 899 (select (select |#memory_int| |v_main_~#distance~0.base_BEFORE_CALL_1|) (+ |v_main_~#distance~0.offset_BEFORE_CALL_1| 4))))} assume !(0 == ~cond); {10502#(exists ((|v_main_~#distance~0.offset_BEFORE_CALL_1| Int) (|v_main_~#distance~0.base_BEFORE_CALL_1| Int)) (<= 899 (select (select |#memory_int| |v_main_~#distance~0.base_BEFORE_CALL_1|) (+ |v_main_~#distance~0.offset_BEFORE_CALL_1| 4))))} is VALID [2022-04-27 10:18:49,837 INFO L290 TraceCheckUtils]: 30: Hoare triple {10502#(exists ((|v_main_~#distance~0.offset_BEFORE_CALL_1| Int) (|v_main_~#distance~0.base_BEFORE_CALL_1| Int)) (<= 899 (select (select |#memory_int| |v_main_~#distance~0.base_BEFORE_CALL_1|) (+ |v_main_~#distance~0.offset_BEFORE_CALL_1| 4))))} assume true; {10502#(exists ((|v_main_~#distance~0.offset_BEFORE_CALL_1| Int) (|v_main_~#distance~0.base_BEFORE_CALL_1| Int)) (<= 899 (select (select |#memory_int| |v_main_~#distance~0.base_BEFORE_CALL_1|) (+ |v_main_~#distance~0.offset_BEFORE_CALL_1| 4))))} is VALID [2022-04-27 10:18:49,838 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10502#(exists ((|v_main_~#distance~0.offset_BEFORE_CALL_1| Int) (|v_main_~#distance~0.base_BEFORE_CALL_1| Int)) (<= 899 (select (select |#memory_int| |v_main_~#distance~0.base_BEFORE_CALL_1|) (+ |v_main_~#distance~0.offset_BEFORE_CALL_1| 4))))} {10495#(and (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (= main_~i~0 0))} #121#return; {10495#(and (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (= main_~i~0 0))} is VALID [2022-04-27 10:18:49,838 INFO L290 TraceCheckUtils]: 32: Hoare triple {10495#(and (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (= main_~i~0 0))} havoc #t~mem21; {10495#(and (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (= main_~i~0 0))} is VALID [2022-04-27 10:18:49,839 INFO L290 TraceCheckUtils]: 33: Hoare triple {10495#(and (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (= main_~i~0 0))} #t~post20 := ~i~0;~i~0 := 1 + #t~post20;havoc #t~post20; {10521#(and (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (= main_~i~0 1))} is VALID [2022-04-27 10:18:49,839 INFO L290 TraceCheckUtils]: 34: Hoare triple {10521#(and (<= 899 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4))) (= main_~i~0 1))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10410#(<= 899 |main_#t~mem21|)} is VALID [2022-04-27 10:18:49,840 INFO L272 TraceCheckUtils]: 35: Hoare triple {10410#(<= 899 |main_#t~mem21|)} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {10528#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:18:49,840 INFO L290 TraceCheckUtils]: 36: Hoare triple {10528#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10532#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:18:49,840 INFO L290 TraceCheckUtils]: 37: Hoare triple {10532#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10395#false} is VALID [2022-04-27 10:18:49,841 INFO L290 TraceCheckUtils]: 38: Hoare triple {10395#false} assume !false; {10395#false} is VALID [2022-04-27 10:18:49,841 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 10:18:49,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:18:52,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-04-27 10:18:52,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-04-27 10:18:52,294 INFO L290 TraceCheckUtils]: 38: Hoare triple {10395#false} assume !false; {10395#false} is VALID [2022-04-27 10:18:52,294 INFO L290 TraceCheckUtils]: 37: Hoare triple {10532#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10395#false} is VALID [2022-04-27 10:18:52,295 INFO L290 TraceCheckUtils]: 36: Hoare triple {10528#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10532#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:18:52,295 INFO L272 TraceCheckUtils]: 35: Hoare triple {10548#(<= 0 |main_#t~mem21|)} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {10528#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:18:52,296 INFO L290 TraceCheckUtils]: 34: Hoare triple {10552#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10548#(<= 0 |main_#t~mem21|)} is VALID [2022-04-27 10:18:52,297 INFO L290 TraceCheckUtils]: 33: Hoare triple {10556#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4))))} #t~post20 := ~i~0;~i~0 := 1 + #t~post20;havoc #t~post20; {10552#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))))} is VALID [2022-04-27 10:18:52,297 INFO L290 TraceCheckUtils]: 32: Hoare triple {10556#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4))))} havoc #t~mem21; {10556#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4))))} is VALID [2022-04-27 10:18:52,298 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10394#true} {10556#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4))))} #121#return; {10556#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4))))} is VALID [2022-04-27 10:18:52,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {10394#true} assume true; {10394#true} is VALID [2022-04-27 10:18:52,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {10394#true} assume !(0 == ~cond); {10394#true} is VALID [2022-04-27 10:18:52,298 INFO L290 TraceCheckUtils]: 28: Hoare triple {10394#true} ~cond := #in~cond; {10394#true} is VALID [2022-04-27 10:18:52,298 INFO L272 TraceCheckUtils]: 27: Hoare triple {10556#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4))))} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {10394#true} is VALID [2022-04-27 10:18:52,298 INFO L290 TraceCheckUtils]: 26: Hoare triple {10556#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4))))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10556#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4))))} is VALID [2022-04-27 10:18:52,299 INFO L290 TraceCheckUtils]: 25: Hoare triple {10581#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} ~i~0 := 0; {10556#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4))))} is VALID [2022-04-27 10:18:52,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {10581#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} assume !(~i~0 < ~edgecount~0); {10581#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} is VALID [2022-04-27 10:18:52,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {10581#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} ~i~0 := 0; {10581#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} is VALID [2022-04-27 10:18:52,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {10581#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} assume !(~i~0 < ~nodecount~0); {10581#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} is VALID [2022-04-27 10:18:52,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {10581#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10581#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} is VALID [2022-04-27 10:18:52,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {10581#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} assume !(~j~0 < ~edgecount~0); {10581#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} is VALID [2022-04-27 10:18:52,301 INFO L290 TraceCheckUtils]: 19: Hoare triple {10581#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {10581#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} is VALID [2022-04-27 10:18:52,301 INFO L290 TraceCheckUtils]: 18: Hoare triple {10581#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10581#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} is VALID [2022-04-27 10:18:52,301 INFO L290 TraceCheckUtils]: 17: Hoare triple {10581#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} assume !(~j~0 < ~edgecount~0); {10581#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} is VALID [2022-04-27 10:18:52,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {10581#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {10581#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} is VALID [2022-04-27 10:18:52,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {10581#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} ~i~0 := 0; {10581#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} is VALID [2022-04-27 10:18:52,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {10581#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} assume !(~i~0 < ~nodecount~0); {10581#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} is VALID [2022-04-27 10:18:52,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {10581#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10581#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} is VALID [2022-04-27 10:18:52,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {10621#(and (forall ((|main_~#distance~0.offset| Int)) (= (+ |main_~#distance~0.offset| 4) (+ |main_~#distance~0.offset| (* main_~i~0 4)))) (<= 0 ~INFINITY~0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10581#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)))} is VALID [2022-04-27 10:18:52,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {10621#(and (forall ((|main_~#distance~0.offset| Int)) (= (+ |main_~#distance~0.offset| 4) (+ |main_~#distance~0.offset| (* main_~i~0 4)))) (<= 0 ~INFINITY~0))} assume !!(~i~0 < ~nodecount~0); {10621#(and (forall ((|main_~#distance~0.offset| Int)) (= (+ |main_~#distance~0.offset| 4) (+ |main_~#distance~0.offset| (* main_~i~0 4)))) (<= 0 ~INFINITY~0))} is VALID [2022-04-27 10:18:52,304 INFO L290 TraceCheckUtils]: 10: Hoare triple {10628#(and (forall ((|main_~#distance~0.offset| Int)) (= (+ |main_~#distance~0.offset| 4) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4)))) (<= 0 ~INFINITY~0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {10621#(and (forall ((|main_~#distance~0.offset| Int)) (= (+ |main_~#distance~0.offset| 4) (+ |main_~#distance~0.offset| (* main_~i~0 4)))) (<= 0 ~INFINITY~0))} is VALID [2022-04-27 10:18:52,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {10628#(and (forall ((|main_~#distance~0.offset| Int)) (= (+ |main_~#distance~0.offset| 4) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4)))) (<= 0 ~INFINITY~0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {10628#(and (forall ((|main_~#distance~0.offset| Int)) (= (+ |main_~#distance~0.offset| 4) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4)))) (<= 0 ~INFINITY~0))} is VALID [2022-04-27 10:18:52,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {10628#(and (forall ((|main_~#distance~0.offset| Int)) (= (+ |main_~#distance~0.offset| 4) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4)))) (<= 0 ~INFINITY~0))} assume !!(~i~0 < ~nodecount~0); {10628#(and (forall ((|main_~#distance~0.offset| Int)) (= (+ |main_~#distance~0.offset| 4) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4)))) (<= 0 ~INFINITY~0))} is VALID [2022-04-27 10:18:52,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {10638#(<= 0 ~INFINITY~0)} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {10628#(and (forall ((|main_~#distance~0.offset| Int)) (= (+ |main_~#distance~0.offset| 4) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4)))) (<= 0 ~INFINITY~0))} is VALID [2022-04-27 10:18:52,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {10638#(<= 0 ~INFINITY~0)} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {10638#(<= 0 ~INFINITY~0)} is VALID [2022-04-27 10:18:52,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {10638#(<= 0 ~INFINITY~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {10638#(<= 0 ~INFINITY~0)} is VALID [2022-04-27 10:18:52,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {10638#(<= 0 ~INFINITY~0)} call #t~ret22 := main(); {10638#(<= 0 ~INFINITY~0)} is VALID [2022-04-27 10:18:52,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10638#(<= 0 ~INFINITY~0)} {10394#true} #123#return; {10638#(<= 0 ~INFINITY~0)} is VALID [2022-04-27 10:18:52,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {10638#(<= 0 ~INFINITY~0)} assume true; {10638#(<= 0 ~INFINITY~0)} is VALID [2022-04-27 10:18:52,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {10394#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {10638#(<= 0 ~INFINITY~0)} is VALID [2022-04-27 10:18:52,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {10394#true} call ULTIMATE.init(); {10394#true} is VALID [2022-04-27 10:18:52,317 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 10:18:52,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700796659] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:18:52,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:18:52,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 28 [2022-04-27 10:18:52,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916653345] [2022-04-27 10:18:52,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:18:52,318 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.076923076923077) internal successors, (80), 25 states have internal predecessors, (80), 8 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 39 [2022-04-27 10:18:52,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:18:52,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 26 states have (on average 3.076923076923077) internal successors, (80), 25 states have internal predecessors, (80), 8 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 10:18:52,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:52,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-27 10:18:52,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:18:52,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-27 10:18:52,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=654, Unknown=2, NotChecked=0, Total=756 [2022-04-27 10:18:52,391 INFO L87 Difference]: Start difference. First operand 134 states and 166 transitions. Second operand has 28 states, 26 states have (on average 3.076923076923077) internal successors, (80), 25 states have internal predecessors, (80), 8 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 10:19:04,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:04,832 INFO L93 Difference]: Finished difference Result 263 states and 323 transitions. [2022-04-27 10:19:04,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-27 10:19:04,832 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.076923076923077) internal successors, (80), 25 states have internal predecessors, (80), 8 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 39 [2022-04-27 10:19:04,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:19:04,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 3.076923076923077) internal successors, (80), 25 states have internal predecessors, (80), 8 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 10:19:04,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 179 transitions. [2022-04-27 10:19:04,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 3.076923076923077) internal successors, (80), 25 states have internal predecessors, (80), 8 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 10:19:04,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 179 transitions. [2022-04-27 10:19:04,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 179 transitions. [2022-04-27 10:19:05,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:05,014 INFO L225 Difference]: With dead ends: 263 [2022-04-27 10:19:05,014 INFO L226 Difference]: Without dead ends: 261 [2022-04-27 10:19:05,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=349, Invalid=2297, Unknown=6, NotChecked=0, Total=2652 [2022-04-27 10:19:05,016 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 315 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 351 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-27 10:19:05,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 100 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 856 Invalid, 0 Unknown, 351 Unchecked, 0.9s Time] [2022-04-27 10:19:05,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-04-27 10:19:05,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 142. [2022-04-27 10:19:05,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:19:05,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand has 142 states, 131 states have (on average 1.251908396946565) internal successors, (164), 133 states have internal predecessors, (164), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:19:05,253 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand has 142 states, 131 states have (on average 1.251908396946565) internal successors, (164), 133 states have internal predecessors, (164), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:19:05,254 INFO L87 Difference]: Start difference. First operand 261 states. Second operand has 142 states, 131 states have (on average 1.251908396946565) internal successors, (164), 133 states have internal predecessors, (164), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:19:05,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:05,258 INFO L93 Difference]: Finished difference Result 261 states and 320 transitions. [2022-04-27 10:19:05,258 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 320 transitions. [2022-04-27 10:19:05,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:05,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:05,259 INFO L74 IsIncluded]: Start isIncluded. First operand has 142 states, 131 states have (on average 1.251908396946565) internal successors, (164), 133 states have internal predecessors, (164), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 261 states. [2022-04-27 10:19:05,260 INFO L87 Difference]: Start difference. First operand has 142 states, 131 states have (on average 1.251908396946565) internal successors, (164), 133 states have internal predecessors, (164), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 261 states. [2022-04-27 10:19:05,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:05,265 INFO L93 Difference]: Finished difference Result 261 states and 320 transitions. [2022-04-27 10:19:05,265 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 320 transitions. [2022-04-27 10:19:05,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:05,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:05,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:19:05,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:19:05,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 131 states have (on average 1.251908396946565) internal successors, (164), 133 states have internal predecessors, (164), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:19:05,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 174 transitions. [2022-04-27 10:19:05,268 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 174 transitions. Word has length 39 [2022-04-27 10:19:05,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:19:05,269 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 174 transitions. [2022-04-27 10:19:05,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.076923076923077) internal successors, (80), 25 states have internal predecessors, (80), 8 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 10:19:05,269 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 174 transitions. [2022-04-27 10:19:05,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-27 10:19:05,270 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:05,270 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:05,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-27 10:19:05,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-27 10:19:05,491 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:05,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:05,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1213721693, now seen corresponding path program 2 times [2022-04-27 10:19:05,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:05,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135250712] [2022-04-27 10:19:05,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:05,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:05,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:19:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:05,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {11821#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {11809#true} is VALID [2022-04-27 10:19:05,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {11809#true} assume true; {11809#true} is VALID [2022-04-27 10:19:05,605 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11809#true} {11809#true} #123#return; {11809#true} is VALID [2022-04-27 10:19:05,606 INFO L272 TraceCheckUtils]: 0: Hoare triple {11809#true} call ULTIMATE.init(); {11821#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:19:05,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {11821#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {11809#true} is VALID [2022-04-27 10:19:05,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {11809#true} assume true; {11809#true} is VALID [2022-04-27 10:19:05,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11809#true} {11809#true} #123#return; {11809#true} is VALID [2022-04-27 10:19:05,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {11809#true} call #t~ret22 := main(); {11809#true} is VALID [2022-04-27 10:19:05,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {11809#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {11809#true} is VALID [2022-04-27 10:19:05,607 INFO L290 TraceCheckUtils]: 6: Hoare triple {11809#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {11809#true} is VALID [2022-04-27 10:19:05,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {11809#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {11809#true} is VALID [2022-04-27 10:19:05,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {11809#true} assume !!(~i~0 < ~nodecount~0); {11809#true} is VALID [2022-04-27 10:19:05,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {11809#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11809#true} is VALID [2022-04-27 10:19:05,607 INFO L290 TraceCheckUtils]: 10: Hoare triple {11809#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11809#true} is VALID [2022-04-27 10:19:05,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {11809#true} assume !(~i~0 < ~nodecount~0); {11809#true} is VALID [2022-04-27 10:19:05,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {11809#true} ~i~0 := 0; {11809#true} is VALID [2022-04-27 10:19:05,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {11809#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11814#(= main_~j~0 0)} is VALID [2022-04-27 10:19:05,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {11814#(= main_~j~0 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11814#(= main_~j~0 0)} is VALID [2022-04-27 10:19:05,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {11814#(= main_~j~0 0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {11814#(= main_~j~0 0)} is VALID [2022-04-27 10:19:05,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {11814#(= main_~j~0 0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {11815#(<= 1 main_~j~0)} is VALID [2022-04-27 10:19:05,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {11815#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11815#(<= 1 main_~j~0)} is VALID [2022-04-27 10:19:05,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {11815#(<= 1 main_~j~0)} assume !(#t~mem13 > #t~mem11 + #t~mem12);havoc #t~mem13;havoc #t~mem11;havoc #t~mem12; {11815#(<= 1 main_~j~0)} is VALID [2022-04-27 10:19:05,610 INFO L290 TraceCheckUtils]: 19: Hoare triple {11815#(<= 1 main_~j~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {11816#(<= 2 main_~j~0)} is VALID [2022-04-27 10:19:05,611 INFO L290 TraceCheckUtils]: 20: Hoare triple {11816#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11817#(<= 3 main_~edgecount~0)} is VALID [2022-04-27 10:19:05,611 INFO L290 TraceCheckUtils]: 21: Hoare triple {11817#(<= 3 main_~edgecount~0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {11817#(<= 3 main_~edgecount~0)} is VALID [2022-04-27 10:19:05,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {11817#(<= 3 main_~edgecount~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {11817#(<= 3 main_~edgecount~0)} is VALID [2022-04-27 10:19:05,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {11817#(<= 3 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {11817#(<= 3 main_~edgecount~0)} is VALID [2022-04-27 10:19:05,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {11817#(<= 3 main_~edgecount~0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11817#(<= 3 main_~edgecount~0)} is VALID [2022-04-27 10:19:05,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {11817#(<= 3 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {11817#(<= 3 main_~edgecount~0)} is VALID [2022-04-27 10:19:05,613 INFO L290 TraceCheckUtils]: 26: Hoare triple {11817#(<= 3 main_~edgecount~0)} ~i~0 := 0; {11818#(and (= main_~i~0 0) (<= 3 main_~edgecount~0))} is VALID [2022-04-27 10:19:05,613 INFO L290 TraceCheckUtils]: 27: Hoare triple {11818#(and (= main_~i~0 0) (<= 3 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {11818#(and (= main_~i~0 0) (<= 3 main_~edgecount~0))} is VALID [2022-04-27 10:19:05,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {11818#(and (= main_~i~0 0) (<= 3 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {11818#(and (= main_~i~0 0) (<= 3 main_~edgecount~0))} is VALID [2022-04-27 10:19:05,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {11818#(and (= main_~i~0 0) (<= 3 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11819#(<= (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-27 10:19:05,615 INFO L290 TraceCheckUtils]: 30: Hoare triple {11819#(<= (+ main_~i~0 2) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {11819#(<= (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-27 10:19:05,615 INFO L290 TraceCheckUtils]: 31: Hoare triple {11819#(<= (+ main_~i~0 2) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {11819#(<= (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-27 10:19:05,615 INFO L290 TraceCheckUtils]: 32: Hoare triple {11819#(<= (+ main_~i~0 2) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11820#(<= (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-27 10:19:05,616 INFO L290 TraceCheckUtils]: 33: Hoare triple {11820#(<= (+ main_~i~0 1) main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {11810#false} is VALID [2022-04-27 10:19:05,616 INFO L290 TraceCheckUtils]: 34: Hoare triple {11810#false} ~i~0 := 0; {11810#false} is VALID [2022-04-27 10:19:05,616 INFO L290 TraceCheckUtils]: 35: Hoare triple {11810#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11810#false} is VALID [2022-04-27 10:19:05,616 INFO L272 TraceCheckUtils]: 36: Hoare triple {11810#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {11810#false} is VALID [2022-04-27 10:19:05,616 INFO L290 TraceCheckUtils]: 37: Hoare triple {11810#false} ~cond := #in~cond; {11810#false} is VALID [2022-04-27 10:19:05,616 INFO L290 TraceCheckUtils]: 38: Hoare triple {11810#false} assume 0 == ~cond; {11810#false} is VALID [2022-04-27 10:19:05,616 INFO L290 TraceCheckUtils]: 39: Hoare triple {11810#false} assume !false; {11810#false} is VALID [2022-04-27 10:19:05,617 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:19:05,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:19:05,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135250712] [2022-04-27 10:19:05,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135250712] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:19:05,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066965672] [2022-04-27 10:19:05,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:19:05,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:19:05,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:19:05,620 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:19:05,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-27 10:19:05,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:19:05,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:19:05,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 10:19:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:05,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:19:05,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {11809#true} call ULTIMATE.init(); {11809#true} is VALID [2022-04-27 10:19:05,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {11809#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {11809#true} is VALID [2022-04-27 10:19:05,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {11809#true} assume true; {11809#true} is VALID [2022-04-27 10:19:05,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11809#true} {11809#true} #123#return; {11809#true} is VALID [2022-04-27 10:19:05,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {11809#true} call #t~ret22 := main(); {11809#true} is VALID [2022-04-27 10:19:05,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {11809#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {11809#true} is VALID [2022-04-27 10:19:05,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {11809#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {11809#true} is VALID [2022-04-27 10:19:05,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {11809#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {11809#true} is VALID [2022-04-27 10:19:05,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {11809#true} assume !!(~i~0 < ~nodecount~0); {11809#true} is VALID [2022-04-27 10:19:05,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {11809#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11809#true} is VALID [2022-04-27 10:19:05,994 INFO L290 TraceCheckUtils]: 10: Hoare triple {11809#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11809#true} is VALID [2022-04-27 10:19:05,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {11809#true} assume !(~i~0 < ~nodecount~0); {11809#true} is VALID [2022-04-27 10:19:05,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {11809#true} ~i~0 := 0; {11809#true} is VALID [2022-04-27 10:19:05,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {11809#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11864#(<= 0 main_~j~0)} is VALID [2022-04-27 10:19:05,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {11864#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11864#(<= 0 main_~j~0)} is VALID [2022-04-27 10:19:05,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {11864#(<= 0 main_~j~0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {11864#(<= 0 main_~j~0)} is VALID [2022-04-27 10:19:05,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {11864#(<= 0 main_~j~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {11815#(<= 1 main_~j~0)} is VALID [2022-04-27 10:19:05,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {11815#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11815#(<= 1 main_~j~0)} is VALID [2022-04-27 10:19:05,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {11815#(<= 1 main_~j~0)} assume !(#t~mem13 > #t~mem11 + #t~mem12);havoc #t~mem13;havoc #t~mem11;havoc #t~mem12; {11815#(<= 1 main_~j~0)} is VALID [2022-04-27 10:19:05,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {11815#(<= 1 main_~j~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {11816#(<= 2 main_~j~0)} is VALID [2022-04-27 10:19:05,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {11816#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11817#(<= 3 main_~edgecount~0)} is VALID [2022-04-27 10:19:05,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {11817#(<= 3 main_~edgecount~0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {11817#(<= 3 main_~edgecount~0)} is VALID [2022-04-27 10:19:05,998 INFO L290 TraceCheckUtils]: 22: Hoare triple {11817#(<= 3 main_~edgecount~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {11817#(<= 3 main_~edgecount~0)} is VALID [2022-04-27 10:19:05,998 INFO L290 TraceCheckUtils]: 23: Hoare triple {11817#(<= 3 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {11817#(<= 3 main_~edgecount~0)} is VALID [2022-04-27 10:19:05,999 INFO L290 TraceCheckUtils]: 24: Hoare triple {11817#(<= 3 main_~edgecount~0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11817#(<= 3 main_~edgecount~0)} is VALID [2022-04-27 10:19:05,999 INFO L290 TraceCheckUtils]: 25: Hoare triple {11817#(<= 3 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {11817#(<= 3 main_~edgecount~0)} is VALID [2022-04-27 10:19:05,999 INFO L290 TraceCheckUtils]: 26: Hoare triple {11817#(<= 3 main_~edgecount~0)} ~i~0 := 0; {11904#(and (<= main_~i~0 0) (<= 3 main_~edgecount~0))} is VALID [2022-04-27 10:19:06,000 INFO L290 TraceCheckUtils]: 27: Hoare triple {11904#(and (<= main_~i~0 0) (<= 3 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {11904#(and (<= main_~i~0 0) (<= 3 main_~edgecount~0))} is VALID [2022-04-27 10:19:06,000 INFO L290 TraceCheckUtils]: 28: Hoare triple {11904#(and (<= main_~i~0 0) (<= 3 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {11904#(and (<= main_~i~0 0) (<= 3 main_~edgecount~0))} is VALID [2022-04-27 10:19:06,001 INFO L290 TraceCheckUtils]: 29: Hoare triple {11904#(and (<= main_~i~0 0) (<= 3 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11914#(and (<= main_~i~0 1) (<= 3 main_~edgecount~0))} is VALID [2022-04-27 10:19:06,002 INFO L290 TraceCheckUtils]: 30: Hoare triple {11914#(and (<= main_~i~0 1) (<= 3 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {11914#(and (<= main_~i~0 1) (<= 3 main_~edgecount~0))} is VALID [2022-04-27 10:19:06,002 INFO L290 TraceCheckUtils]: 31: Hoare triple {11914#(and (<= main_~i~0 1) (<= 3 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {11914#(and (<= main_~i~0 1) (<= 3 main_~edgecount~0))} is VALID [2022-04-27 10:19:06,003 INFO L290 TraceCheckUtils]: 32: Hoare triple {11914#(and (<= main_~i~0 1) (<= 3 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11924#(and (<= main_~i~0 2) (<= 3 main_~edgecount~0))} is VALID [2022-04-27 10:19:06,003 INFO L290 TraceCheckUtils]: 33: Hoare triple {11924#(and (<= main_~i~0 2) (<= 3 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {11810#false} is VALID [2022-04-27 10:19:06,003 INFO L290 TraceCheckUtils]: 34: Hoare triple {11810#false} ~i~0 := 0; {11810#false} is VALID [2022-04-27 10:19:06,003 INFO L290 TraceCheckUtils]: 35: Hoare triple {11810#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11810#false} is VALID [2022-04-27 10:19:06,003 INFO L272 TraceCheckUtils]: 36: Hoare triple {11810#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {11810#false} is VALID [2022-04-27 10:19:06,003 INFO L290 TraceCheckUtils]: 37: Hoare triple {11810#false} ~cond := #in~cond; {11810#false} is VALID [2022-04-27 10:19:06,003 INFO L290 TraceCheckUtils]: 38: Hoare triple {11810#false} assume 0 == ~cond; {11810#false} is VALID [2022-04-27 10:19:06,003 INFO L290 TraceCheckUtils]: 39: Hoare triple {11810#false} assume !false; {11810#false} is VALID [2022-04-27 10:19:06,004 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:19:06,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:19:06,165 INFO L290 TraceCheckUtils]: 39: Hoare triple {11810#false} assume !false; {11810#false} is VALID [2022-04-27 10:19:06,165 INFO L290 TraceCheckUtils]: 38: Hoare triple {11810#false} assume 0 == ~cond; {11810#false} is VALID [2022-04-27 10:19:06,165 INFO L290 TraceCheckUtils]: 37: Hoare triple {11810#false} ~cond := #in~cond; {11810#false} is VALID [2022-04-27 10:19:06,165 INFO L272 TraceCheckUtils]: 36: Hoare triple {11810#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {11810#false} is VALID [2022-04-27 10:19:06,166 INFO L290 TraceCheckUtils]: 35: Hoare triple {11810#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11810#false} is VALID [2022-04-27 10:19:06,166 INFO L290 TraceCheckUtils]: 34: Hoare triple {11810#false} ~i~0 := 0; {11810#false} is VALID [2022-04-27 10:19:06,166 INFO L290 TraceCheckUtils]: 33: Hoare triple {11820#(<= (+ main_~i~0 1) main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {11810#false} is VALID [2022-04-27 10:19:06,166 INFO L290 TraceCheckUtils]: 32: Hoare triple {11819#(<= (+ main_~i~0 2) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11820#(<= (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-27 10:19:06,167 INFO L290 TraceCheckUtils]: 31: Hoare triple {11819#(<= (+ main_~i~0 2) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {11819#(<= (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-27 10:19:06,167 INFO L290 TraceCheckUtils]: 30: Hoare triple {11819#(<= (+ main_~i~0 2) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {11819#(<= (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-27 10:19:06,167 INFO L290 TraceCheckUtils]: 29: Hoare triple {11976#(<= (+ main_~i~0 3) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {11819#(<= (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-27 10:19:06,168 INFO L290 TraceCheckUtils]: 28: Hoare triple {11976#(<= (+ main_~i~0 3) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {11976#(<= (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-27 10:19:06,168 INFO L290 TraceCheckUtils]: 27: Hoare triple {11976#(<= (+ main_~i~0 3) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {11976#(<= (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-27 10:19:06,168 INFO L290 TraceCheckUtils]: 26: Hoare triple {11817#(<= 3 main_~edgecount~0)} ~i~0 := 0; {11976#(<= (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-27 10:19:06,169 INFO L290 TraceCheckUtils]: 25: Hoare triple {11817#(<= 3 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {11817#(<= 3 main_~edgecount~0)} is VALID [2022-04-27 10:19:06,169 INFO L290 TraceCheckUtils]: 24: Hoare triple {11817#(<= 3 main_~edgecount~0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11817#(<= 3 main_~edgecount~0)} is VALID [2022-04-27 10:19:06,169 INFO L290 TraceCheckUtils]: 23: Hoare triple {11817#(<= 3 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {11817#(<= 3 main_~edgecount~0)} is VALID [2022-04-27 10:19:06,169 INFO L290 TraceCheckUtils]: 22: Hoare triple {11817#(<= 3 main_~edgecount~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {11817#(<= 3 main_~edgecount~0)} is VALID [2022-04-27 10:19:06,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {11817#(<= 3 main_~edgecount~0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {11817#(<= 3 main_~edgecount~0)} is VALID [2022-04-27 10:19:06,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {11816#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11817#(<= 3 main_~edgecount~0)} is VALID [2022-04-27 10:19:06,171 INFO L290 TraceCheckUtils]: 19: Hoare triple {11815#(<= 1 main_~j~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {11816#(<= 2 main_~j~0)} is VALID [2022-04-27 10:19:06,171 INFO L290 TraceCheckUtils]: 18: Hoare triple {11815#(<= 1 main_~j~0)} assume !(#t~mem13 > #t~mem11 + #t~mem12);havoc #t~mem13;havoc #t~mem11;havoc #t~mem12; {11815#(<= 1 main_~j~0)} is VALID [2022-04-27 10:19:06,171 INFO L290 TraceCheckUtils]: 17: Hoare triple {11815#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11815#(<= 1 main_~j~0)} is VALID [2022-04-27 10:19:06,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {11864#(<= 0 main_~j~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {11815#(<= 1 main_~j~0)} is VALID [2022-04-27 10:19:06,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {11864#(<= 0 main_~j~0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {11864#(<= 0 main_~j~0)} is VALID [2022-04-27 10:19:06,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {11864#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {11864#(<= 0 main_~j~0)} is VALID [2022-04-27 10:19:06,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {11809#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {11864#(<= 0 main_~j~0)} is VALID [2022-04-27 10:19:06,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {11809#true} ~i~0 := 0; {11809#true} is VALID [2022-04-27 10:19:06,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {11809#true} assume !(~i~0 < ~nodecount~0); {11809#true} is VALID [2022-04-27 10:19:06,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {11809#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11809#true} is VALID [2022-04-27 10:19:06,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {11809#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {11809#true} is VALID [2022-04-27 10:19:06,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {11809#true} assume !!(~i~0 < ~nodecount~0); {11809#true} is VALID [2022-04-27 10:19:06,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {11809#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {11809#true} is VALID [2022-04-27 10:19:06,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {11809#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {11809#true} is VALID [2022-04-27 10:19:06,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {11809#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {11809#true} is VALID [2022-04-27 10:19:06,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {11809#true} call #t~ret22 := main(); {11809#true} is VALID [2022-04-27 10:19:06,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11809#true} {11809#true} #123#return; {11809#true} is VALID [2022-04-27 10:19:06,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {11809#true} assume true; {11809#true} is VALID [2022-04-27 10:19:06,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {11809#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {11809#true} is VALID [2022-04-27 10:19:06,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {11809#true} call ULTIMATE.init(); {11809#true} is VALID [2022-04-27 10:19:06,174 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:19:06,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066965672] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:19:06,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:19:06,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-04-27 10:19:06,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741413306] [2022-04-27 10:19:06,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:19:06,174 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-27 10:19:06,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:19:06,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:06,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:06,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 10:19:06,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:19:06,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 10:19:06,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-04-27 10:19:06,216 INFO L87 Difference]: Start difference. First operand 142 states and 174 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:07,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:07,779 INFO L93 Difference]: Finished difference Result 312 states and 386 transitions. [2022-04-27 10:19:07,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 10:19:07,780 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-27 10:19:07,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:19:07,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:07,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 138 transitions. [2022-04-27 10:19:07,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:07,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 138 transitions. [2022-04-27 10:19:07,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 138 transitions. [2022-04-27 10:19:07,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:07,915 INFO L225 Difference]: With dead ends: 312 [2022-04-27 10:19:07,915 INFO L226 Difference]: Without dead ends: 283 [2022-04-27 10:19:07,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2022-04-27 10:19:07,916 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 180 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:19:07,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 85 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 10:19:07,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-04-27 10:19:08,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 181. [2022-04-27 10:19:08,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:19:08,261 INFO L82 GeneralOperation]: Start isEquivalent. First operand 283 states. Second operand has 181 states, 170 states have (on average 1.276470588235294) internal successors, (217), 172 states have internal predecessors, (217), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:19:08,261 INFO L74 IsIncluded]: Start isIncluded. First operand 283 states. Second operand has 181 states, 170 states have (on average 1.276470588235294) internal successors, (217), 172 states have internal predecessors, (217), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:19:08,261 INFO L87 Difference]: Start difference. First operand 283 states. Second operand has 181 states, 170 states have (on average 1.276470588235294) internal successors, (217), 172 states have internal predecessors, (217), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:19:08,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:08,272 INFO L93 Difference]: Finished difference Result 283 states and 354 transitions. [2022-04-27 10:19:08,272 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 354 transitions. [2022-04-27 10:19:08,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:08,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:08,273 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 170 states have (on average 1.276470588235294) internal successors, (217), 172 states have internal predecessors, (217), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 283 states. [2022-04-27 10:19:08,274 INFO L87 Difference]: Start difference. First operand has 181 states, 170 states have (on average 1.276470588235294) internal successors, (217), 172 states have internal predecessors, (217), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 283 states. [2022-04-27 10:19:08,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:08,280 INFO L93 Difference]: Finished difference Result 283 states and 354 transitions. [2022-04-27 10:19:08,280 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 354 transitions. [2022-04-27 10:19:08,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:08,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:08,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:19:08,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:19:08,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 170 states have (on average 1.276470588235294) internal successors, (217), 172 states have internal predecessors, (217), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:19:08,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 227 transitions. [2022-04-27 10:19:08,285 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 227 transitions. Word has length 40 [2022-04-27 10:19:08,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:19:08,285 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 227 transitions. [2022-04-27 10:19:08,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:08,285 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 227 transitions. [2022-04-27 10:19:08,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-27 10:19:08,286 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:08,286 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:08,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-27 10:19:08,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-27 10:19:08,510 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:08,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:08,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1497733084, now seen corresponding path program 2 times [2022-04-27 10:19:08,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:08,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601390558] [2022-04-27 10:19:08,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:08,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:09,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:19:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:09,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {13373#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {13354#true} is VALID [2022-04-27 10:19:09,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {13354#true} assume true; {13354#true} is VALID [2022-04-27 10:19:09,116 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13354#true} {13354#true} #123#return; {13354#true} is VALID [2022-04-27 10:19:09,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {13354#true} call ULTIMATE.init(); {13373#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:19:09,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {13373#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {13354#true} is VALID [2022-04-27 10:19:09,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {13354#true} assume true; {13354#true} is VALID [2022-04-27 10:19:09,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13354#true} {13354#true} #123#return; {13354#true} is VALID [2022-04-27 10:19:09,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {13354#true} call #t~ret22 := main(); {13354#true} is VALID [2022-04-27 10:19:09,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {13354#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {13354#true} is VALID [2022-04-27 10:19:09,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {13354#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {13354#true} is VALID [2022-04-27 10:19:09,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {13354#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {13359#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:19:09,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {13359#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {13359#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:19:09,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {13359#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13360#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:19:09,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {13360#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) 0) (= main_~i~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13361#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:19:09,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {13361#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} assume !!(~i~0 < ~nodecount~0); {13361#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:19:09,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {13361#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13362#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:19:09,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {13362#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13362#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:19:09,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {13362#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} assume !(~i~0 < ~nodecount~0); {13362#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:19:09,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {13362#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} ~i~0 := 0; {13362#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:19:09,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {13362#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {13363#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 1) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:19:09,125 INFO L290 TraceCheckUtils]: 17: Hoare triple {13363#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 1) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13364#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= main_~j~0 0) (= main_~x~0 1) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:19:09,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {13364#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= main_~j~0 0) (= main_~x~0 1) (= |main_~#Dest~0.offset| 0))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {13363#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 1) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:19:09,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {13363#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 1) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {13362#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:19:09,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {13362#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} assume !(~j~0 < ~edgecount~0); {13362#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:19:09,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {13362#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13362#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:19:09,127 INFO L290 TraceCheckUtils]: 22: Hoare triple {13362#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {13363#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 1) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:19:09,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {13363#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 1) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13365#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= main_~x~0 1) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:19:09,128 INFO L290 TraceCheckUtils]: 24: Hoare triple {13365#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= main_~x~0 1) (= |main_~#Dest~0.offset| 0))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {13366#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:19:09,128 INFO L290 TraceCheckUtils]: 25: Hoare triple {13366#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {13367#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:19:09,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {13367#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} assume !(~j~0 < ~edgecount~0); {13367#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:19:09,129 INFO L290 TraceCheckUtils]: 27: Hoare triple {13367#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13367#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:19:09,129 INFO L290 TraceCheckUtils]: 28: Hoare triple {13367#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} assume !(~i~0 < ~nodecount~0); {13367#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:19:09,130 INFO L290 TraceCheckUtils]: 29: Hoare triple {13367#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} ~i~0 := 0; {13367#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:19:09,130 INFO L290 TraceCheckUtils]: 30: Hoare triple {13367#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {13368#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:19:09,131 INFO L290 TraceCheckUtils]: 31: Hoare triple {13368#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13368#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:19:09,131 INFO L290 TraceCheckUtils]: 32: Hoare triple {13368#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13368#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:19:09,131 INFO L290 TraceCheckUtils]: 33: Hoare triple {13368#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !(~i~0 < ~edgecount~0); {13368#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:19:09,132 INFO L290 TraceCheckUtils]: 34: Hoare triple {13368#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} ~i~0 := 0; {13369#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:19:09,132 INFO L290 TraceCheckUtils]: 35: Hoare triple {13369#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13370#(= |main_#t~mem21| 0)} is VALID [2022-04-27 10:19:09,132 INFO L272 TraceCheckUtils]: 36: Hoare triple {13370#(= |main_#t~mem21| 0)} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {13371#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:19:09,133 INFO L290 TraceCheckUtils]: 37: Hoare triple {13371#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {13372#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:19:09,133 INFO L290 TraceCheckUtils]: 38: Hoare triple {13372#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {13355#false} is VALID [2022-04-27 10:19:09,133 INFO L290 TraceCheckUtils]: 39: Hoare triple {13355#false} assume !false; {13355#false} is VALID [2022-04-27 10:19:09,133 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 10:19:09,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:19:09,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601390558] [2022-04-27 10:19:09,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601390558] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:19:09,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408381544] [2022-04-27 10:19:09,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:19:09,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:19:09,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:19:09,135 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:19:09,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-27 10:19:09,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:19:09,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:19:09,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-27 10:19:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:09,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:19:09,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-04-27 10:19:09,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-04-27 10:19:09,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:19:09,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-04-27 10:19:09,714 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-04-27 10:19:09,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-04-27 10:19:09,923 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-04-27 10:19:09,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-04-27 10:19:10,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-04-27 10:19:10,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {13354#true} call ULTIMATE.init(); {13354#true} is VALID [2022-04-27 10:19:10,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {13354#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {13354#true} is VALID [2022-04-27 10:19:10,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {13354#true} assume true; {13354#true} is VALID [2022-04-27 10:19:10,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13354#true} {13354#true} #123#return; {13354#true} is VALID [2022-04-27 10:19:10,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {13354#true} call #t~ret22 := main(); {13354#true} is VALID [2022-04-27 10:19:10,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {13354#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {13354#true} is VALID [2022-04-27 10:19:10,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {13354#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {13354#true} is VALID [2022-04-27 10:19:10,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {13354#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {13359#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:19:10,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {13359#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {13359#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:19:10,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {13359#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13404#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)))) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:19:10,573 INFO L290 TraceCheckUtils]: 10: Hoare triple {13404#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)))) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13408#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* main_~i~0 4)))) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 10:19:10,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {13408#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* main_~i~0 4)))) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 < ~nodecount~0); {13408#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* main_~i~0 4)))) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 10:19:10,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {13408#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ (- 4) |main_~#distance~0.offset| (* main_~i~0 4)))) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13415#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:10,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {13415#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13415#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:10,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {13415#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~i~0 < ~nodecount~0); {13415#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:10,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {13415#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} ~i~0 := 0; {13415#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:10,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {13415#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {13428#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:10,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {13428#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13432#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~x~0 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:10,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {13432#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~x~0 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {13415#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:10,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {13415#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {13415#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:10,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {13415#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~j~0 < ~edgecount~0); {13415#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:10,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {13415#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13415#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:10,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {13415#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {13428#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:10,589 INFO L290 TraceCheckUtils]: 23: Hoare triple {13428#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13451#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (= main_~x~0 (select (select |#memory_int| |main_~#Dest~0.base|) 0)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:10,590 INFO L290 TraceCheckUtils]: 24: Hoare triple {13451#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (= main_~x~0 (select (select |#memory_int| |main_~#Dest~0.base|) 0)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {13455#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:10,591 INFO L290 TraceCheckUtils]: 25: Hoare triple {13455#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {13455#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:10,592 INFO L290 TraceCheckUtils]: 26: Hoare triple {13455#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~j~0 < ~edgecount~0); {13455#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:10,592 INFO L290 TraceCheckUtils]: 27: Hoare triple {13455#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13455#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:10,593 INFO L290 TraceCheckUtils]: 28: Hoare triple {13455#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~i~0 < ~nodecount~0); {13455#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:10,593 INFO L290 TraceCheckUtils]: 29: Hoare triple {13455#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} ~i~0 := 0; {13455#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:10,594 INFO L290 TraceCheckUtils]: 30: Hoare triple {13455#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {13455#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:10,595 INFO L290 TraceCheckUtils]: 31: Hoare triple {13455#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13455#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:10,595 INFO L290 TraceCheckUtils]: 32: Hoare triple {13455#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13455#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:10,596 INFO L290 TraceCheckUtils]: 33: Hoare triple {13455#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~i~0 < ~edgecount~0); {13455#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:10,596 INFO L290 TraceCheckUtils]: 34: Hoare triple {13455#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} ~i~0 := 0; {13486#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:10,597 INFO L290 TraceCheckUtils]: 35: Hoare triple {13486#(and (= |main_~#distance~0.offset| 0) (= main_~i~0 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13490#(<= 0 |main_#t~mem21|)} is VALID [2022-04-27 10:19:10,597 INFO L272 TraceCheckUtils]: 36: Hoare triple {13490#(<= 0 |main_#t~mem21|)} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {13494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:19:10,598 INFO L290 TraceCheckUtils]: 37: Hoare triple {13494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:19:10,598 INFO L290 TraceCheckUtils]: 38: Hoare triple {13498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13355#false} is VALID [2022-04-27 10:19:10,598 INFO L290 TraceCheckUtils]: 39: Hoare triple {13355#false} assume !false; {13355#false} is VALID [2022-04-27 10:19:10,598 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 10:19:10,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:19:18,303 INFO L290 TraceCheckUtils]: 39: Hoare triple {13355#false} assume !false; {13355#false} is VALID [2022-04-27 10:19:18,304 INFO L290 TraceCheckUtils]: 38: Hoare triple {13498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13355#false} is VALID [2022-04-27 10:19:18,304 INFO L290 TraceCheckUtils]: 37: Hoare triple {13494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:19:18,304 INFO L272 TraceCheckUtils]: 36: Hoare triple {13490#(<= 0 |main_#t~mem21|)} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {13494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:19:18,305 INFO L290 TraceCheckUtils]: 35: Hoare triple {13517#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13490#(<= 0 |main_#t~mem21|)} is VALID [2022-04-27 10:19:18,305 INFO L290 TraceCheckUtils]: 34: Hoare triple {13521#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} ~i~0 := 0; {13517#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))))} is VALID [2022-04-27 10:19:18,305 INFO L290 TraceCheckUtils]: 33: Hoare triple {13521#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !(~i~0 < ~edgecount~0); {13521#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:19:18,306 INFO L290 TraceCheckUtils]: 32: Hoare triple {13521#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {13521#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:19:18,306 INFO L290 TraceCheckUtils]: 31: Hoare triple {13521#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {13521#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:19:18,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {13521#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {13521#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:19:18,306 INFO L290 TraceCheckUtils]: 29: Hoare triple {13521#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} ~i~0 := 0; {13521#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:19:18,307 INFO L290 TraceCheckUtils]: 28: Hoare triple {13521#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !(~i~0 < ~nodecount~0); {13521#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:19:18,307 INFO L290 TraceCheckUtils]: 27: Hoare triple {13521#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13521#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:19:18,307 INFO L290 TraceCheckUtils]: 26: Hoare triple {13521#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !(~j~0 < ~edgecount~0); {13521#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:19:18,307 INFO L290 TraceCheckUtils]: 25: Hoare triple {13521#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {13521#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:19:18,308 INFO L290 TraceCheckUtils]: 24: Hoare triple {13552#(forall ((v_ArrVal_590 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_590) |main_~#distance~0.offset|)))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {13521#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:19:18,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {13556#(forall ((v_ArrVal_590 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_590) |main_~#distance~0.offset|)))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13552#(forall ((v_ArrVal_590 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_590) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:18,309 INFO L290 TraceCheckUtils]: 22: Hoare triple {13560#(forall ((v_ArrVal_590 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_590) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {13556#(forall ((v_ArrVal_590 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_590) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:18,315 INFO L290 TraceCheckUtils]: 21: Hoare triple {13560#(forall ((v_ArrVal_590 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_590) |main_~#distance~0.offset|)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13560#(forall ((v_ArrVal_590 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_590) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:18,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {13560#(forall ((v_ArrVal_590 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_590) |main_~#distance~0.offset|)))} assume !(~j~0 < ~edgecount~0); {13560#(forall ((v_ArrVal_590 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_590) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:18,316 INFO L290 TraceCheckUtils]: 19: Hoare triple {13560#(forall ((v_ArrVal_590 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_590) |main_~#distance~0.offset|)))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {13560#(forall ((v_ArrVal_590 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_590) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:18,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {13573#(forall ((v_ArrVal_587 Int) (v_ArrVal_590 Int)) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_587) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_587)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_590) |main_~#distance~0.offset|)))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {13560#(forall ((v_ArrVal_590 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_590) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:18,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {13577#(forall ((v_ArrVal_587 Int) (v_ArrVal_590 Int)) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_587) (+ |main_~#distance~0.offset| (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_587)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|))) v_ArrVal_590) |main_~#distance~0.offset|)))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {13573#(forall ((v_ArrVal_587 Int) (v_ArrVal_590 Int)) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_587) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_587)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_590) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:18,319 INFO L290 TraceCheckUtils]: 16: Hoare triple {13581#(forall ((v_ArrVal_587 Int) (v_ArrVal_590 Int)) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_587) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_587)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_590) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {13577#(forall ((v_ArrVal_587 Int) (v_ArrVal_590 Int)) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_587) (+ |main_~#distance~0.offset| (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_587)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|))) v_ArrVal_590) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:18,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {13581#(forall ((v_ArrVal_587 Int) (v_ArrVal_590 Int)) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_587) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_587)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_590) |main_~#distance~0.offset|)))} ~i~0 := 0; {13581#(forall ((v_ArrVal_587 Int) (v_ArrVal_590 Int)) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_587) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_587)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_590) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:18,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {13581#(forall ((v_ArrVal_587 Int) (v_ArrVal_590 Int)) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_587) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_587)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_590) |main_~#distance~0.offset|)))} assume !(~i~0 < ~nodecount~0); {13581#(forall ((v_ArrVal_587 Int) (v_ArrVal_590 Int)) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_587) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_587)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_590) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:18,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {13581#(forall ((v_ArrVal_587 Int) (v_ArrVal_590 Int)) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_587) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_587)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_590) |main_~#distance~0.offset|)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13581#(forall ((v_ArrVal_587 Int) (v_ArrVal_590 Int)) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_587) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_587)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_590) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:20,104 WARN L290 TraceCheckUtils]: 12: Hoare triple {13594#(forall ((v_ArrVal_587 Int) (v_ArrVal_585 Int) (v_ArrVal_590 Int)) (<= 0 (select (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_585) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_585)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_587) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_585) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_585)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_587)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_590) |main_~#distance~0.offset|)))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13581#(forall ((v_ArrVal_587 Int) (v_ArrVal_590 Int)) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_587) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_587)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_590) |main_~#distance~0.offset|)))} is UNKNOWN [2022-04-27 10:19:20,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {13594#(forall ((v_ArrVal_587 Int) (v_ArrVal_585 Int) (v_ArrVal_590 Int)) (<= 0 (select (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_585) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_585)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_587) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_585) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_585)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_587)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_590) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~nodecount~0); {13594#(forall ((v_ArrVal_587 Int) (v_ArrVal_585 Int) (v_ArrVal_590 Int)) (<= 0 (select (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_585) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_585)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_587) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_585) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_585)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_587)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_590) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:20,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {13601#(forall ((v_ArrVal_587 Int) (v_ArrVal_585 Int) (v_ArrVal_590 Int)) (<= 0 (select (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4)) v_ArrVal_585) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4)) v_ArrVal_585)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_587) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4)) v_ArrVal_585) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4)) v_ArrVal_585)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_587)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_590) |main_~#distance~0.offset|)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13594#(forall ((v_ArrVal_587 Int) (v_ArrVal_585 Int) (v_ArrVal_590 Int)) (<= 0 (select (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_585) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_585)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_587) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_585) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_585)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_587)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_590) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:20,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {13605#(forall ((v_ArrVal_587 Int) (v_ArrVal_585 Int) (v_ArrVal_583 Int) (v_ArrVal_590 Int)) (or (<= 0 (select (store (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_583) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4)) v_ArrVal_585) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_583) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4)) v_ArrVal_585)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_587) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_583) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4)) v_ArrVal_585) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_583) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4)) v_ArrVal_585)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_587)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_590) |main_~#distance~0.offset|)) (not (<= 0 v_ArrVal_583))))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {13601#(forall ((v_ArrVal_587 Int) (v_ArrVal_585 Int) (v_ArrVal_590 Int)) (<= 0 (select (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4)) v_ArrVal_585) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4)) v_ArrVal_585)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_587) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4)) v_ArrVal_585) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4)) v_ArrVal_585)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_587)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_590) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:19:20,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {13605#(forall ((v_ArrVal_587 Int) (v_ArrVal_585 Int) (v_ArrVal_583 Int) (v_ArrVal_590 Int)) (or (<= 0 (select (store (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_583) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4)) v_ArrVal_585) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_583) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4)) v_ArrVal_585)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_587) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_583) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4)) v_ArrVal_585) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_583) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4)) v_ArrVal_585)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_587)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_590) |main_~#distance~0.offset|)) (not (<= 0 v_ArrVal_583))))} assume !!(~i~0 < ~nodecount~0); {13605#(forall ((v_ArrVal_587 Int) (v_ArrVal_585 Int) (v_ArrVal_583 Int) (v_ArrVal_590 Int)) (or (<= 0 (select (store (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_583) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4)) v_ArrVal_585) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_583) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4)) v_ArrVal_585)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_587) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_583) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4)) v_ArrVal_585) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_583) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4)) v_ArrVal_585)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_587)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_590) |main_~#distance~0.offset|)) (not (<= 0 v_ArrVal_583))))} is VALID [2022-04-27 10:19:20,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {13354#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {13605#(forall ((v_ArrVal_587 Int) (v_ArrVal_585 Int) (v_ArrVal_583 Int) (v_ArrVal_590 Int)) (or (<= 0 (select (store (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_583) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4)) v_ArrVal_585) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_583) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4)) v_ArrVal_585)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_587) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_583) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4)) v_ArrVal_585) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_583) (+ |main_~#distance~0.offset| 4 (* main_~i~0 4)) v_ArrVal_585)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_587)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_590) |main_~#distance~0.offset|)) (not (<= 0 v_ArrVal_583))))} is VALID [2022-04-27 10:19:20,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {13354#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {13354#true} is VALID [2022-04-27 10:19:20,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {13354#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {13354#true} is VALID [2022-04-27 10:19:20,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {13354#true} call #t~ret22 := main(); {13354#true} is VALID [2022-04-27 10:19:20,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13354#true} {13354#true} #123#return; {13354#true} is VALID [2022-04-27 10:19:20,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {13354#true} assume true; {13354#true} is VALID [2022-04-27 10:19:20,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {13354#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {13354#true} is VALID [2022-04-27 10:19:20,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {13354#true} call ULTIMATE.init(); {13354#true} is VALID [2022-04-27 10:19:20,166 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:19:20,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408381544] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:19:20,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:19:20,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 16] total 39 [2022-04-27 10:19:20,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020771431] [2022-04-27 10:19:20,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:19:20,167 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 36 states have internal predecessors, (93), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-27 10:19:20,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:19:20,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 36 states have internal predecessors, (93), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:22,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 98 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:22,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-27 10:19:22,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:19:22,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-27 10:19:22,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1264, Unknown=5, NotChecked=0, Total=1482 [2022-04-27 10:19:22,290 INFO L87 Difference]: Start difference. First operand 181 states and 227 transitions. Second operand has 39 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 36 states have internal predecessors, (93), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:27,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:27,914 INFO L93 Difference]: Finished difference Result 271 states and 339 transitions. [2022-04-27 10:19:27,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-27 10:19:27,914 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 36 states have internal predecessors, (93), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-27 10:19:27,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:19:27,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 36 states have internal predecessors, (93), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:27,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 107 transitions. [2022-04-27 10:19:27,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 36 states have internal predecessors, (93), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:27,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 107 transitions. [2022-04-27 10:19:27,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 107 transitions. [2022-04-27 10:19:28,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:28,056 INFO L225 Difference]: With dead ends: 271 [2022-04-27 10:19:28,056 INFO L226 Difference]: Without dead ends: 269 [2022-04-27 10:19:28,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1134 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=530, Invalid=3370, Unknown=6, NotChecked=0, Total=3906 [2022-04-27 10:19:28,058 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 107 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 323 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:19:28,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 152 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 270 Invalid, 0 Unknown, 323 Unchecked, 0.2s Time] [2022-04-27 10:19:28,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-04-27 10:19:28,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 214. [2022-04-27 10:19:28,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:19:28,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 269 states. Second operand has 214 states, 203 states have (on average 1.29064039408867) internal successors, (262), 205 states have internal predecessors, (262), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:19:28,526 INFO L74 IsIncluded]: Start isIncluded. First operand 269 states. Second operand has 214 states, 203 states have (on average 1.29064039408867) internal successors, (262), 205 states have internal predecessors, (262), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:19:28,526 INFO L87 Difference]: Start difference. First operand 269 states. Second operand has 214 states, 203 states have (on average 1.29064039408867) internal successors, (262), 205 states have internal predecessors, (262), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:19:28,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:28,532 INFO L93 Difference]: Finished difference Result 269 states and 337 transitions. [2022-04-27 10:19:28,532 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 337 transitions. [2022-04-27 10:19:28,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:28,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:28,533 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 203 states have (on average 1.29064039408867) internal successors, (262), 205 states have internal predecessors, (262), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 269 states. [2022-04-27 10:19:28,533 INFO L87 Difference]: Start difference. First operand has 214 states, 203 states have (on average 1.29064039408867) internal successors, (262), 205 states have internal predecessors, (262), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 269 states. [2022-04-27 10:19:28,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:28,538 INFO L93 Difference]: Finished difference Result 269 states and 337 transitions. [2022-04-27 10:19:28,538 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 337 transitions. [2022-04-27 10:19:28,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:28,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:28,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:19:28,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:19:28,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 203 states have (on average 1.29064039408867) internal successors, (262), 205 states have internal predecessors, (262), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:19:28,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 272 transitions. [2022-04-27 10:19:28,543 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 272 transitions. Word has length 40 [2022-04-27 10:19:28,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:19:28,544 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 272 transitions. [2022-04-27 10:19:28,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 36 states have internal predecessors, (93), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:28,544 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 272 transitions. [2022-04-27 10:19:28,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 10:19:28,545 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:28,545 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1] [2022-04-27 10:19:28,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-27 10:19:28,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-27 10:19:28,756 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:28,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:28,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1769101657, now seen corresponding path program 3 times [2022-04-27 10:19:28,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:28,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796280458] [2022-04-27 10:19:28,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:28,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:29,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:19:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:29,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {14940#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {14919#true} is VALID [2022-04-27 10:19:29,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {14919#true} assume true; {14919#true} is VALID [2022-04-27 10:19:29,529 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14919#true} {14919#true} #123#return; {14919#true} is VALID [2022-04-27 10:19:29,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {14919#true} call ULTIMATE.init(); {14940#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:19:29,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {14940#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {14919#true} is VALID [2022-04-27 10:19:29,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {14919#true} assume true; {14919#true} is VALID [2022-04-27 10:19:29,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14919#true} {14919#true} #123#return; {14919#true} is VALID [2022-04-27 10:19:29,529 INFO L272 TraceCheckUtils]: 4: Hoare triple {14919#true} call #t~ret22 := main(); {14919#true} is VALID [2022-04-27 10:19:29,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {14919#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {14919#true} is VALID [2022-04-27 10:19:29,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {14919#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {14919#true} is VALID [2022-04-27 10:19:29,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {14919#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {14924#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (<= 0 |main_~#Dest~0.offset|))} is VALID [2022-04-27 10:19:29,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {14924#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (<= 0 |main_~#Dest~0.offset|))} assume !!(~i~0 < ~nodecount~0); {14924#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (<= 0 |main_~#Dest~0.offset|))} is VALID [2022-04-27 10:19:29,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {14924#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (<= 0 |main_~#Dest~0.offset|))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14925#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:19:29,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {14925#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) 0) (= main_~i~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14926#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:19:29,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {14926#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} assume !(~i~0 < ~nodecount~0); {14926#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:19:29,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {14926#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} ~i~0 := 0; {14926#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:19:29,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {14926#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14927#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 1) (= main_~j~0 0) (= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 0))} is VALID [2022-04-27 10:19:29,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {14927#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 1) (= main_~j~0 0) (= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14928#(and (= (+ (- 1) main_~x~0) 0) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 0))} is VALID [2022-04-27 10:19:29,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {14928#(and (= (+ (- 1) main_~x~0) 0) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 0))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {14929#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 0))} is VALID [2022-04-27 10:19:29,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {14929#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 0))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {14930#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 4) (= |main_~#Dest~0.offset| 0) (<= 4 (+ (* main_~j~0 4) |main_~#Dest~0.offset|)))} is VALID [2022-04-27 10:19:29,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {14930#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 4) (= |main_~#Dest~0.offset| 0) (<= 4 (+ (* main_~j~0 4) |main_~#Dest~0.offset|)))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14930#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 4) (= |main_~#Dest~0.offset| 0) (<= 4 (+ (* main_~j~0 4) |main_~#Dest~0.offset|)))} is VALID [2022-04-27 10:19:29,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {14930#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 4) (= |main_~#Dest~0.offset| 0) (<= 4 (+ (* main_~j~0 4) |main_~#Dest~0.offset|)))} assume !(#t~mem13 > #t~mem11 + #t~mem12);havoc #t~mem13;havoc #t~mem11;havoc #t~mem12; {14930#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 4) (= |main_~#Dest~0.offset| 0) (<= 4 (+ (* main_~j~0 4) |main_~#Dest~0.offset|)))} is VALID [2022-04-27 10:19:29,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {14930#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 4) (= |main_~#Dest~0.offset| 0) (<= 4 (+ (* main_~j~0 4) |main_~#Dest~0.offset|)))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {14931#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4) (= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 8))} is VALID [2022-04-27 10:19:29,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {14931#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4) (= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 8))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14932#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~x~0 4) (= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 8))} is VALID [2022-04-27 10:19:29,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {14932#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~x~0 4) (= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 8))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {14933#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 8))} is VALID [2022-04-27 10:19:29,540 INFO L290 TraceCheckUtils]: 22: Hoare triple {14933#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 8))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {14934#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} is VALID [2022-04-27 10:19:29,541 INFO L290 TraceCheckUtils]: 23: Hoare triple {14934#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} assume !(~j~0 < ~edgecount~0); {14934#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} is VALID [2022-04-27 10:19:29,541 INFO L290 TraceCheckUtils]: 24: Hoare triple {14934#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {14934#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} is VALID [2022-04-27 10:19:29,542 INFO L290 TraceCheckUtils]: 25: Hoare triple {14934#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} assume !(~i~0 < ~nodecount~0); {14934#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} is VALID [2022-04-27 10:19:29,542 INFO L290 TraceCheckUtils]: 26: Hoare triple {14934#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} ~i~0 := 0; {14934#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} is VALID [2022-04-27 10:19:29,543 INFO L290 TraceCheckUtils]: 27: Hoare triple {14934#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {14934#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} is VALID [2022-04-27 10:19:29,543 INFO L290 TraceCheckUtils]: 28: Hoare triple {14934#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {14934#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} is VALID [2022-04-27 10:19:29,543 INFO L290 TraceCheckUtils]: 29: Hoare triple {14934#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {14934#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} is VALID [2022-04-27 10:19:29,544 INFO L290 TraceCheckUtils]: 30: Hoare triple {14934#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {14934#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} is VALID [2022-04-27 10:19:29,544 INFO L290 TraceCheckUtils]: 31: Hoare triple {14934#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {14934#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} is VALID [2022-04-27 10:19:29,545 INFO L290 TraceCheckUtils]: 32: Hoare triple {14934#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {14934#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} is VALID [2022-04-27 10:19:29,545 INFO L290 TraceCheckUtils]: 33: Hoare triple {14934#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {14935#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:19:29,545 INFO L290 TraceCheckUtils]: 34: Hoare triple {14935#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {14935#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:19:29,546 INFO L290 TraceCheckUtils]: 35: Hoare triple {14935#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {14935#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:19:29,546 INFO L290 TraceCheckUtils]: 36: Hoare triple {14935#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !(~i~0 < ~edgecount~0); {14935#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:19:29,546 INFO L290 TraceCheckUtils]: 37: Hoare triple {14935#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} ~i~0 := 0; {14936#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:19:29,547 INFO L290 TraceCheckUtils]: 38: Hoare triple {14936#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14937#(= |main_#t~mem21| 0)} is VALID [2022-04-27 10:19:29,547 INFO L272 TraceCheckUtils]: 39: Hoare triple {14937#(= |main_#t~mem21| 0)} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {14938#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:19:29,548 INFO L290 TraceCheckUtils]: 40: Hoare triple {14938#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {14939#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:19:29,548 INFO L290 TraceCheckUtils]: 41: Hoare triple {14939#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {14920#false} is VALID [2022-04-27 10:19:29,548 INFO L290 TraceCheckUtils]: 42: Hoare triple {14920#false} assume !false; {14920#false} is VALID [2022-04-27 10:19:29,549 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 10:19:29,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:19:29,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796280458] [2022-04-27 10:19:29,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796280458] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:19:29,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094832214] [2022-04-27 10:19:29,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 10:19:29,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:19:29,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:19:29,553 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:19:29,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-27 10:19:29,704 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 10:19:29,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:19:29,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 65 conjunts are in the unsatisfiable core [2022-04-27 10:19:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:29,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:19:29,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-04-27 10:19:29,903 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-27 10:19:29,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:19:29,907 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-04-27 10:19:29,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 42 [2022-04-27 10:19:30,309 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-27 10:19:30,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:19:30,324 INFO L356 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2022-04-27 10:19:30,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 59 [2022-04-27 10:19:31,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:19:31,098 INFO L356 Elim1Store]: treesize reduction 238, result has 26.8 percent of original size [2022-04-27 10:19:31,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 4 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 23 case distinctions, treesize of input 88 treesize of output 159 [2022-04-27 10:20:00,434 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-04-27 10:20:00,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 29 [2022-04-27 10:20:00,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {14919#true} call ULTIMATE.init(); {14919#true} is VALID [2022-04-27 10:20:00,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {14919#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {14919#true} is VALID [2022-04-27 10:20:00,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {14919#true} assume true; {14919#true} is VALID [2022-04-27 10:20:00,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14919#true} {14919#true} #123#return; {14919#true} is VALID [2022-04-27 10:20:00,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {14919#true} call #t~ret22 := main(); {14919#true} is VALID [2022-04-27 10:20:00,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {14919#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {14919#true} is VALID [2022-04-27 10:20:00,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {14919#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {14919#true} is VALID [2022-04-27 10:20:00,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {14919#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {14965#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 8 |main_~#Weight~0.offset|))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 8)) 1) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:20:00,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {14965#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 8 |main_~#Weight~0.offset|))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 8)) 1) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} assume !!(~i~0 < ~nodecount~0); {14965#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 8 |main_~#Weight~0.offset|))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 8)) 1) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:20:00,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {14965#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 8 |main_~#Weight~0.offset|))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 8)) 1) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {14972#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 8 |main_~#Weight~0.offset|))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 8)) 1) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0))} is VALID [2022-04-27 10:20:00,644 INFO L290 TraceCheckUtils]: 10: Hoare triple {14972#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 8 |main_~#Weight~0.offset|))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 8)) 1) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14972#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 8 |main_~#Weight~0.offset|))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 8)) 1) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0))} is VALID [2022-04-27 10:20:00,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {14972#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 8 |main_~#Weight~0.offset|))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 8)) 1) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0))} assume !(~i~0 < ~nodecount~0); {14972#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 8 |main_~#Weight~0.offset|))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 8)) 1) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0))} is VALID [2022-04-27 10:20:00,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {14972#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 8 |main_~#Weight~0.offset|))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 8)) 1) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0))} ~i~0 := 0; {14972#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 8 |main_~#Weight~0.offset|))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 8)) 1) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0))} is VALID [2022-04-27 10:20:00,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {14972#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 8 |main_~#Weight~0.offset|))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 8)) 1) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {14985#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 8 |main_~#Weight~0.offset|))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 8)) 1) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0))} is VALID [2022-04-27 10:20:00,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {14985#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 8 |main_~#Weight~0.offset|))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 8)) 1) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14989#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 8 |main_~#Weight~0.offset|))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 8)) 1) (= |main_~#Dest~0.offset| 0) (= main_~x~0 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0))} is VALID [2022-04-27 10:20:00,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {14989#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 8 |main_~#Weight~0.offset|))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 8)) 1) (= |main_~#Dest~0.offset| 0) (= main_~x~0 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {14993#(and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 8 |main_~#Weight~0.offset|))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 8)) 1) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0))} is VALID [2022-04-27 10:20:00,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {14993#(and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 8 |main_~#Weight~0.offset|))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 8)) 1) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {14993#(and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 8 |main_~#Weight~0.offset|))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 8)) 1) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0))} is VALID [2022-04-27 10:20:00,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {14993#(and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 8 |main_~#Weight~0.offset|))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 8)) 1) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {14993#(and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 8 |main_~#Weight~0.offset|))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 8)) 1) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0))} is VALID [2022-04-27 10:20:00,650 INFO L290 TraceCheckUtils]: 18: Hoare triple {14993#(and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 8 |main_~#Weight~0.offset|))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 8)) 1) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0))} assume !(#t~mem13 > #t~mem11 + #t~mem12);havoc #t~mem13;havoc #t~mem11;havoc #t~mem12; {14993#(and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 8 |main_~#Weight~0.offset|))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 8)) 1) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0))} is VALID [2022-04-27 10:20:00,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {14993#(and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 8 |main_~#Weight~0.offset|))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 8)) 1) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {14993#(and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 8 |main_~#Weight~0.offset|))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 8)) 1) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0))} is VALID [2022-04-27 10:20:00,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {14993#(and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) (+ 8 |main_~#Weight~0.offset|))) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| 8)) 1) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15009#(and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (<= |main_#t~mem13| (select (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|))) (= |main_~#Dest~0.offset| 0) (exists ((|main_~#Weight~0.base| Int)) (and (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Weight~0.base|) (* main_~j~0 4)) |main_#t~mem12|) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (< main_~j~0 main_~edgecount~0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0) (exists ((|main_~#Source~0.base| Int)) (and (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 (select (select |#memory_int| |main_~#Source~0.base|) (* main_~j~0 4))))) |main_#t~mem11|) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1))))} is VALID [2022-04-27 10:20:00,657 INFO L290 TraceCheckUtils]: 21: Hoare triple {15009#(and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (<= |main_#t~mem13| (select (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|))) (= |main_~#Dest~0.offset| 0) (exists ((|main_~#Weight~0.base| Int)) (and (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Weight~0.base|) (* main_~j~0 4)) |main_#t~mem12|) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (< main_~j~0 main_~edgecount~0) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0) (exists ((|main_~#Source~0.base| Int)) (and (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 (select (select |#memory_int| |main_~#Source~0.base|) (* main_~j~0 4))))) |main_#t~mem11|) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1))))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {15013#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (exists ((|main_~#Weight~0.base| Int) (|main_~#Source~0.base| Int)) (and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1) (or (and (or (< (select (select |#memory_int| |main_~#Weight~0.base|) (* main_~j~0 4)) 0) (not (= 4 (* 4 (select (select |#memory_int| |main_~#Source~0.base|) (* main_~j~0 4)))))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)) (and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (or (and (not (= 0 (* 4 (select (select |#memory_int| |main_~#Source~0.base|) (* main_~j~0 4))))) (< (+ (select (select |#memory_int| |main_~#Weight~0.base|) (* main_~j~0 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 (select (select |#memory_int| |main_~#Source~0.base|) (* main_~j~0 4)))))) 0)) (and (< (select (select |#memory_int| |main_~#Weight~0.base|) (* main_~j~0 4)) 0) (= 0 (* 4 (select (select |#memory_int| |main_~#Source~0.base|) (* main_~j~0 4))))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)))) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (< main_~j~0 main_~edgecount~0))} is VALID [2022-04-27 10:20:00,661 INFO L290 TraceCheckUtils]: 22: Hoare triple {15013#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (exists ((|main_~#Weight~0.base| Int) (|main_~#Source~0.base| Int)) (and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1) (or (and (or (< (select (select |#memory_int| |main_~#Weight~0.base|) (* main_~j~0 4)) 0) (not (= 4 (* 4 (select (select |#memory_int| |main_~#Source~0.base|) (* main_~j~0 4)))))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)) (and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (or (and (not (= 0 (* 4 (select (select |#memory_int| |main_~#Source~0.base|) (* main_~j~0 4))))) (< (+ (select (select |#memory_int| |main_~#Weight~0.base|) (* main_~j~0 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 (select (select |#memory_int| |main_~#Source~0.base|) (* main_~j~0 4)))))) 0)) (and (< (select (select |#memory_int| |main_~#Weight~0.base|) (* main_~j~0 4)) 0) (= 0 (* 4 (select (select |#memory_int| |main_~#Source~0.base|) (* main_~j~0 4))))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)))) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (< main_~j~0 main_~edgecount~0))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {15017#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_49 Int) (|main_~#Weight~0.base| Int) (|main_~#Source~0.base| Int)) (and (<= main_~j~0 (+ v_main_~j~0_49 1)) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (or (and (or (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)) (and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (or (and (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (and (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (< (+ (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) |main_~#distance~0.offset|))) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)))) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1) (< v_main_~j~0_49 main_~edgecount~0) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:20:00,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {15017#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_49 Int) (|main_~#Weight~0.base| Int) (|main_~#Source~0.base| Int)) (and (<= main_~j~0 (+ v_main_~j~0_49 1)) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (or (and (or (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)) (and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (or (and (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (and (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (< (+ (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) |main_~#distance~0.offset|))) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)))) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1) (< v_main_~j~0_49 main_~edgecount~0) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} assume !(~j~0 < ~edgecount~0); {15021#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_49 Int) (|main_~#Weight~0.base| Int) (|main_~#Source~0.base| Int)) (and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (or (and (or (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)) (and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (or (and (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (and (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (< (+ (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) |main_~#distance~0.offset|))) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)))) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1) (<= main_~edgecount~0 (+ v_main_~j~0_49 1)) (< v_main_~j~0_49 main_~edgecount~0) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:20:00,667 INFO L290 TraceCheckUtils]: 24: Hoare triple {15021#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_49 Int) (|main_~#Weight~0.base| Int) (|main_~#Source~0.base| Int)) (and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (or (and (or (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)) (and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (or (and (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (and (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (< (+ (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) |main_~#distance~0.offset|))) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)))) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1) (<= main_~edgecount~0 (+ v_main_~j~0_49 1)) (< v_main_~j~0_49 main_~edgecount~0) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15021#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_49 Int) (|main_~#Weight~0.base| Int) (|main_~#Source~0.base| Int)) (and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (or (and (or (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)) (and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (or (and (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (and (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (< (+ (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) |main_~#distance~0.offset|))) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)))) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1) (<= main_~edgecount~0 (+ v_main_~j~0_49 1)) (< v_main_~j~0_49 main_~edgecount~0) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:20:00,671 INFO L290 TraceCheckUtils]: 25: Hoare triple {15021#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_49 Int) (|main_~#Weight~0.base| Int) (|main_~#Source~0.base| Int)) (and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (or (and (or (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)) (and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (or (and (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (and (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (< (+ (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) |main_~#distance~0.offset|))) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)))) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1) (<= main_~edgecount~0 (+ v_main_~j~0_49 1)) (< v_main_~j~0_49 main_~edgecount~0) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} assume !(~i~0 < ~nodecount~0); {15021#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_49 Int) (|main_~#Weight~0.base| Int) (|main_~#Source~0.base| Int)) (and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (or (and (or (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)) (and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (or (and (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (and (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (< (+ (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) |main_~#distance~0.offset|))) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)))) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1) (<= main_~edgecount~0 (+ v_main_~j~0_49 1)) (< v_main_~j~0_49 main_~edgecount~0) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:20:00,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {15021#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_49 Int) (|main_~#Weight~0.base| Int) (|main_~#Source~0.base| Int)) (and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (or (and (or (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)) (and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (or (and (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (and (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (< (+ (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) |main_~#distance~0.offset|))) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)))) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1) (<= main_~edgecount~0 (+ v_main_~j~0_49 1)) (< v_main_~j~0_49 main_~edgecount~0) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0))} ~i~0 := 0; {15031#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_49 Int) (|main_~#Weight~0.base| Int) (|main_~#Source~0.base| Int)) (and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (or (and (or (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)) (and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (or (and (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (and (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (< (+ (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) |main_~#distance~0.offset|))) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)))) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1) (<= main_~edgecount~0 (+ v_main_~j~0_49 1)) (< v_main_~j~0_49 main_~edgecount~0) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:20:00,681 INFO L290 TraceCheckUtils]: 27: Hoare triple {15031#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_49 Int) (|main_~#Weight~0.base| Int) (|main_~#Source~0.base| Int)) (and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (or (and (or (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)) (and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (or (and (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (and (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (< (+ (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) |main_~#distance~0.offset|))) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)))) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1) (<= main_~edgecount~0 (+ v_main_~j~0_49 1)) (< v_main_~j~0_49 main_~edgecount~0) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {15035#(and (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_49 Int) (|main_~#Weight~0.base| Int) (|main_~#Source~0.base| Int)) (and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (or (and (or (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)) (and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (or (and (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (and (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (< (+ (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) |main_~#distance~0.offset|))) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)))) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1) (<= main_~edgecount~0 (+ v_main_~j~0_49 1)) (< v_main_~j~0_49 main_~edgecount~0) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (= main_~i~0 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))))} is VALID [2022-04-27 10:20:00,684 INFO L290 TraceCheckUtils]: 28: Hoare triple {15035#(and (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_49 Int) (|main_~#Weight~0.base| Int) (|main_~#Source~0.base| Int)) (and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (or (and (or (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)) (and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (or (and (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (and (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (< (+ (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) |main_~#distance~0.offset|))) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)))) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1) (<= main_~edgecount~0 (+ v_main_~j~0_49 1)) (< v_main_~j~0_49 main_~edgecount~0) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (= main_~i~0 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {15035#(and (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_49 Int) (|main_~#Weight~0.base| Int) (|main_~#Source~0.base| Int)) (and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (or (and (or (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)) (and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (or (and (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (and (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (< (+ (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) |main_~#distance~0.offset|))) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)))) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1) (<= main_~edgecount~0 (+ v_main_~j~0_49 1)) (< v_main_~j~0_49 main_~edgecount~0) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (= main_~i~0 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))))} is VALID [2022-04-27 10:20:00,688 INFO L290 TraceCheckUtils]: 29: Hoare triple {15035#(and (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_49 Int) (|main_~#Weight~0.base| Int) (|main_~#Source~0.base| Int)) (and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (or (and (or (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)) (and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (or (and (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (and (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (< (+ (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) |main_~#distance~0.offset|))) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)))) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1) (<= main_~edgecount~0 (+ v_main_~j~0_49 1)) (< v_main_~j~0_49 main_~edgecount~0) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (= main_~i~0 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15042#(and (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_49 Int) (|main_~#Weight~0.base| Int) (|main_~#Source~0.base| Int)) (and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (or (and (or (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)) (and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (or (and (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (and (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (< (+ (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) |main_~#distance~0.offset|))) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)))) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1) (<= main_~edgecount~0 (+ v_main_~j~0_49 1)) (< v_main_~j~0_49 main_~edgecount~0) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (= (+ (- 1) main_~i~0) 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))))} is VALID [2022-04-27 10:20:00,692 INFO L290 TraceCheckUtils]: 30: Hoare triple {15042#(and (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_49 Int) (|main_~#Weight~0.base| Int) (|main_~#Source~0.base| Int)) (and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (or (and (or (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)) (and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (or (and (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (and (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (< (+ (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) |main_~#distance~0.offset|))) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)))) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1) (<= main_~edgecount~0 (+ v_main_~j~0_49 1)) (< v_main_~j~0_49 main_~edgecount~0) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (= (+ (- 1) main_~i~0) 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {15042#(and (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_49 Int) (|main_~#Weight~0.base| Int) (|main_~#Source~0.base| Int)) (and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (or (and (or (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)) (and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (or (and (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (and (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (< (+ (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) |main_~#distance~0.offset|))) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)))) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1) (<= main_~edgecount~0 (+ v_main_~j~0_49 1)) (< v_main_~j~0_49 main_~edgecount~0) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (= (+ (- 1) main_~i~0) 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))))} is VALID [2022-04-27 10:20:00,696 INFO L290 TraceCheckUtils]: 31: Hoare triple {15042#(and (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_49 Int) (|main_~#Weight~0.base| Int) (|main_~#Source~0.base| Int)) (and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (or (and (or (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)) (and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (or (and (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (and (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (< (+ (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) |main_~#distance~0.offset|))) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)))) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1) (<= main_~edgecount~0 (+ v_main_~j~0_49 1)) (< v_main_~j~0_49 main_~edgecount~0) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (= (+ (- 1) main_~i~0) 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {15042#(and (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_49 Int) (|main_~#Weight~0.base| Int) (|main_~#Source~0.base| Int)) (and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (or (and (or (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)) (and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (or (and (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (and (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (< (+ (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) |main_~#distance~0.offset|))) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)))) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1) (<= main_~edgecount~0 (+ v_main_~j~0_49 1)) (< v_main_~j~0_49 main_~edgecount~0) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (= (+ (- 1) main_~i~0) 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))))} is VALID [2022-04-27 10:20:00,699 INFO L290 TraceCheckUtils]: 32: Hoare triple {15042#(and (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_49 Int) (|main_~#Weight~0.base| Int) (|main_~#Source~0.base| Int)) (and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (or (and (or (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)) (and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (or (and (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (and (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (< (+ (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) |main_~#distance~0.offset|))) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)))) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1) (<= main_~edgecount~0 (+ v_main_~j~0_49 1)) (< v_main_~j~0_49 main_~edgecount~0) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (= (+ (- 1) main_~i~0) 0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15052#(and (= (+ (- 2) main_~i~0) 0) (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_49 Int) (|main_~#Weight~0.base| Int) (|main_~#Source~0.base| Int)) (and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (or (and (or (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)) (and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (or (and (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (and (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (< (+ (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) |main_~#distance~0.offset|))) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)))) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1) (<= main_~edgecount~0 (+ v_main_~j~0_49 1)) (< v_main_~j~0_49 main_~edgecount~0) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))))} is VALID [2022-04-27 10:20:00,704 INFO L290 TraceCheckUtils]: 33: Hoare triple {15052#(and (= (+ (- 2) main_~i~0) 0) (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_49 Int) (|main_~#Weight~0.base| Int) (|main_~#Source~0.base| Int)) (and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (or (and (or (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)) (and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (or (and (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (and (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (< (+ (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) |main_~#distance~0.offset|))) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)))) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1) (<= main_~edgecount~0 (+ v_main_~j~0_49 1)) (< v_main_~j~0_49 main_~edgecount~0) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {15056#(and (= (+ (- 2) main_~i~0) 0) (= |main_~#distance~0.offset| 0) (< main_~i~0 main_~edgecount~0) (exists ((v_main_~j~0_49 Int) (|main_~#Weight~0.base| Int) (|main_~#Source~0.base| Int)) (and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (or (and (or (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)) (and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (or (and (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (and (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (< (+ (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) |main_~#distance~0.offset|))) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)))) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1) (<= main_~edgecount~0 (+ v_main_~j~0_49 1)) (< v_main_~j~0_49 main_~edgecount~0) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))))} is VALID [2022-04-27 10:20:00,708 INFO L290 TraceCheckUtils]: 34: Hoare triple {15056#(and (= (+ (- 2) main_~i~0) 0) (= |main_~#distance~0.offset| 0) (< main_~i~0 main_~edgecount~0) (exists ((v_main_~j~0_49 Int) (|main_~#Weight~0.base| Int) (|main_~#Source~0.base| Int)) (and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (or (and (or (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)) (and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (or (and (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (and (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (< (+ (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) |main_~#distance~0.offset|))) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)))) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1) (<= main_~edgecount~0 (+ v_main_~j~0_49 1)) (< v_main_~j~0_49 main_~edgecount~0) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {15056#(and (= (+ (- 2) main_~i~0) 0) (= |main_~#distance~0.offset| 0) (< main_~i~0 main_~edgecount~0) (exists ((v_main_~j~0_49 Int) (|main_~#Weight~0.base| Int) (|main_~#Source~0.base| Int)) (and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (or (and (or (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)) (and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (or (and (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (and (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (< (+ (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) |main_~#distance~0.offset|))) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)))) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1) (<= main_~edgecount~0 (+ v_main_~j~0_49 1)) (< v_main_~j~0_49 main_~edgecount~0) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))))} is VALID [2022-04-27 10:20:00,712 INFO L290 TraceCheckUtils]: 35: Hoare triple {15056#(and (= (+ (- 2) main_~i~0) 0) (= |main_~#distance~0.offset| 0) (< main_~i~0 main_~edgecount~0) (exists ((v_main_~j~0_49 Int) (|main_~#Weight~0.base| Int) (|main_~#Source~0.base| Int)) (and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (or (and (or (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)) (and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (or (and (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (and (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (< (+ (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) |main_~#distance~0.offset|))) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)))) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1) (<= main_~edgecount~0 (+ v_main_~j~0_49 1)) (< v_main_~j~0_49 main_~edgecount~0) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15063#(and (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_49 Int) (|main_~#Weight~0.base| Int) (|main_~#Source~0.base| Int)) (and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (or (and (or (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)) (and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (or (and (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (and (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (< (+ (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) |main_~#distance~0.offset|))) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)))) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1) (<= main_~edgecount~0 (+ v_main_~j~0_49 1)) (< v_main_~j~0_49 main_~edgecount~0) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (< 2 main_~edgecount~0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))) (<= main_~i~0 3))} is VALID [2022-04-27 10:20:00,714 INFO L290 TraceCheckUtils]: 36: Hoare triple {15063#(and (= |main_~#distance~0.offset| 0) (exists ((v_main_~j~0_49 Int) (|main_~#Weight~0.base| Int) (|main_~#Source~0.base| Int)) (and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (or (and (or (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 4))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)) (and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (or (and (< (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) 0) (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (and (not (= (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) 0)) (< (+ (select (select |#memory_int| |main_~#Weight~0.base|) (* v_main_~j~0_49 4)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Source~0.base|) (* v_main_~j~0_49 4)) 4) |main_~#distance~0.offset|))) 0)) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0)))) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1) (<= main_~edgecount~0 (+ v_main_~j~0_49 1)) (< v_main_~j~0_49 main_~edgecount~0) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (< 2 main_~edgecount~0) (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1))) (<= main_~i~0 3))} assume !(~i~0 < ~edgecount~0); {15067#(and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (exists ((|main_~#Weight~0.base| Int)) (and (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1)) (exists ((|main_~#Source~0.base| Int)) (and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0))} is VALID [2022-04-27 10:20:00,732 INFO L290 TraceCheckUtils]: 37: Hoare triple {15067#(and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (exists ((|main_~#Weight~0.base| Int)) (and (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1)) (exists ((|main_~#Source~0.base| Int)) (and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0))} ~i~0 := 0; {15071#(and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (exists ((|main_~#Weight~0.base| Int)) (and (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1)) (= main_~i~0 0) (exists ((|main_~#Source~0.base| Int)) (and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0))} is VALID [2022-04-27 10:20:00,735 INFO L290 TraceCheckUtils]: 38: Hoare triple {15071#(and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (exists ((|main_~#Weight~0.base| Int)) (and (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (<= 2 (select (select |#memory_int| |main_~#Weight~0.base|) 8)))) (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1)) (= main_~i~0 0) (exists ((|main_~#Source~0.base| Int)) (and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) 8) 1))) (= (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|) 0))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15075#(<= 0 |main_#t~mem21|)} is VALID [2022-04-27 10:20:00,736 INFO L272 TraceCheckUtils]: 39: Hoare triple {15075#(<= 0 |main_#t~mem21|)} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {15079#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:20:00,736 INFO L290 TraceCheckUtils]: 40: Hoare triple {15079#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15083#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:20:00,737 INFO L290 TraceCheckUtils]: 41: Hoare triple {15083#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14920#false} is VALID [2022-04-27 10:20:00,737 INFO L290 TraceCheckUtils]: 42: Hoare triple {14920#false} assume !false; {14920#false} is VALID [2022-04-27 10:20:00,738 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 10:20:00,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:20:03,806 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_640 Int) (main_~j~0 Int) (v_ArrVal_639 Int) (v_main_~x~0_39 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* 4 c_main_~x~0) |c_main_~#distance~0.offset|) v_ArrVal_639)) (.cse1 (+ (* v_main_~x~0_39 4) |c_main_~#distance~0.offset|))) (or (not (<= 0 (+ v_ArrVal_639 1))) (<= (select .cse0 .cse1) (let ((.cse2 (store |c_#memory_int| |c_main_~#distance~0.base| .cse0)) (.cse3 (* main_~j~0 4))) (+ (select (select .cse2 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| .cse3)) (select .cse0 (+ (* (select (select .cse2 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| .cse3)) 4) |c_main_~#distance~0.offset|))))) (<= 3 main_~j~0) (<= main_~j~0 1) (<= 0 (select (store .cse0 .cse1 v_ArrVal_640) |c_main_~#distance~0.offset|))))) is different from false [2022-04-27 10:20:05,054 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_639)) (.cse1 (+ (* v_main_~x~0_39 4) |c_main_~#distance~0.offset|))) (or (<= (select .cse0 .cse1) (let ((.cse2 (store |c_#memory_int| |c_main_~#distance~0.base| .cse0)) (.cse3 (* v_main_~j~0_53 4))) (+ (select .cse0 (+ (* (select (select .cse2 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| .cse3)) 4) |c_main_~#distance~0.offset|)) (select (select .cse2 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| .cse3))))) (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= 0 (select (store .cse0 .cse1 v_ArrVal_640) |c_main_~#distance~0.offset|)) (<= 3 v_main_~j~0_53)))) is different from false [2022-04-27 10:20:06,318 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (let ((.cse1 (+ (* v_main_~x~0_39 4) |c_main_~#distance~0.offset|)) (.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) 4)) v_ArrVal_639))) (or (<= 0 (select (store .cse0 .cse1 v_ArrVal_640) |c_main_~#distance~0.offset|)) (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= (select .cse0 .cse1) (let ((.cse2 (store |c_#memory_int| |c_main_~#distance~0.base| .cse0)) (.cse3 (* v_main_~j~0_53 4))) (+ (select (select .cse2 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| .cse3)) (select .cse0 (+ (* (select (select .cse2 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| .cse3)) 4) |c_main_~#distance~0.offset|))))) (<= 3 v_main_~j~0_53)))) is different from false [2022-04-27 10:20:18,144 INFO L290 TraceCheckUtils]: 42: Hoare triple {14920#false} assume !false; {14920#false} is VALID [2022-04-27 10:20:18,144 INFO L290 TraceCheckUtils]: 41: Hoare triple {15083#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14920#false} is VALID [2022-04-27 10:20:18,145 INFO L290 TraceCheckUtils]: 40: Hoare triple {15079#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15083#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:20:18,145 INFO L272 TraceCheckUtils]: 39: Hoare triple {15075#(<= 0 |main_#t~mem21|)} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {15079#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:20:18,145 INFO L290 TraceCheckUtils]: 38: Hoare triple {15102#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15075#(<= 0 |main_#t~mem21|)} is VALID [2022-04-27 10:20:18,146 INFO L290 TraceCheckUtils]: 37: Hoare triple {15106#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} ~i~0 := 0; {15102#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))))} is VALID [2022-04-27 10:20:18,146 INFO L290 TraceCheckUtils]: 36: Hoare triple {15110#(or (< main_~i~0 main_~edgecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~i~0 < ~edgecount~0); {15106#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:20:18,147 INFO L290 TraceCheckUtils]: 35: Hoare triple {15114#(or (< (+ main_~i~0 1) main_~edgecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15110#(or (< main_~i~0 main_~edgecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:20:18,147 INFO L290 TraceCheckUtils]: 34: Hoare triple {15114#(or (< (+ main_~i~0 1) main_~edgecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {15114#(or (< (+ main_~i~0 1) main_~edgecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:20:18,148 INFO L290 TraceCheckUtils]: 33: Hoare triple {15121#(or (not (< main_~i~0 main_~edgecount~0)) (< (+ main_~i~0 1) main_~edgecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {15114#(or (< (+ main_~i~0 1) main_~edgecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:20:18,148 INFO L290 TraceCheckUtils]: 32: Hoare triple {15125#(or (< (+ main_~i~0 2) main_~edgecount~0) (not (< (+ main_~i~0 1) main_~edgecount~0)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15121#(or (not (< main_~i~0 main_~edgecount~0)) (< (+ main_~i~0 1) main_~edgecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:20:18,148 INFO L290 TraceCheckUtils]: 31: Hoare triple {15125#(or (< (+ main_~i~0 2) main_~edgecount~0) (not (< (+ main_~i~0 1) main_~edgecount~0)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {15125#(or (< (+ main_~i~0 2) main_~edgecount~0) (not (< (+ main_~i~0 1) main_~edgecount~0)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:20:18,149 INFO L290 TraceCheckUtils]: 30: Hoare triple {15125#(or (< (+ main_~i~0 2) main_~edgecount~0) (not (< (+ main_~i~0 1) main_~edgecount~0)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {15125#(or (< (+ main_~i~0 2) main_~edgecount~0) (not (< (+ main_~i~0 1) main_~edgecount~0)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:20:18,149 INFO L290 TraceCheckUtils]: 29: Hoare triple {15135#(or (< (+ main_~i~0 3) main_~edgecount~0) (not (< (+ main_~i~0 2) main_~edgecount~0)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15125#(or (< (+ main_~i~0 2) main_~edgecount~0) (not (< (+ main_~i~0 1) main_~edgecount~0)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:20:18,149 INFO L290 TraceCheckUtils]: 28: Hoare triple {15135#(or (< (+ main_~i~0 3) main_~edgecount~0) (not (< (+ main_~i~0 2) main_~edgecount~0)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {15135#(or (< (+ main_~i~0 3) main_~edgecount~0) (not (< (+ main_~i~0 2) main_~edgecount~0)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:20:18,150 INFO L290 TraceCheckUtils]: 27: Hoare triple {15135#(or (< (+ main_~i~0 3) main_~edgecount~0) (not (< (+ main_~i~0 2) main_~edgecount~0)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {15135#(or (< (+ main_~i~0 3) main_~edgecount~0) (not (< (+ main_~i~0 2) main_~edgecount~0)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:20:18,150 INFO L290 TraceCheckUtils]: 26: Hoare triple {15145#(or (not (< 2 main_~edgecount~0)) (< 3 main_~edgecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} ~i~0 := 0; {15135#(or (< (+ main_~i~0 3) main_~edgecount~0) (not (< (+ main_~i~0 2) main_~edgecount~0)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:20:18,150 INFO L290 TraceCheckUtils]: 25: Hoare triple {15145#(or (not (< 2 main_~edgecount~0)) (< 3 main_~edgecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~i~0 < ~nodecount~0); {15145#(or (not (< 2 main_~edgecount~0)) (< 3 main_~edgecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:20:18,151 INFO L290 TraceCheckUtils]: 24: Hoare triple {15145#(or (not (< 2 main_~edgecount~0)) (< 3 main_~edgecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {15145#(or (not (< 2 main_~edgecount~0)) (< 3 main_~edgecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:20:18,151 INFO L290 TraceCheckUtils]: 23: Hoare triple {15155#(or (not (< 2 main_~edgecount~0)) (< main_~j~0 main_~edgecount~0) (< 3 main_~edgecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~j~0 < ~edgecount~0); {15145#(or (not (< 2 main_~edgecount~0)) (< 3 main_~edgecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:20:18,152 INFO L290 TraceCheckUtils]: 22: Hoare triple {15159#(or (< (+ main_~j~0 1) main_~edgecount~0) (not (< 2 main_~edgecount~0)) (< 3 main_~edgecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {15155#(or (not (< 2 main_~edgecount~0)) (< main_~j~0 main_~edgecount~0) (< 3 main_~edgecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:20:18,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {15163#(or (< (+ main_~j~0 1) main_~edgecount~0) (not (< 2 main_~edgecount~0)) (forall ((v_ArrVal_640 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_640) |main_~#distance~0.offset|))) (< 3 main_~edgecount~0) (not (< (+ |main_#t~mem12| |main_#t~mem11|) |main_#t~mem13|)))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {15159#(or (< (+ main_~j~0 1) main_~edgecount~0) (not (< 2 main_~edgecount~0)) (< 3 main_~edgecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:20:18,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {15167#(forall ((v_ArrVal_640 Int) (main_~j~0 Int) (v_main_~x~0_39 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|) v_ArrVal_640) |main_~#distance~0.offset|)) (<= 3 main_~j~0) (<= main_~j~0 1) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|)) (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) (+ (* main_~j~0 4) |main_~#Source~0.offset|)) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) (+ (* main_~j~0 4) |main_~#Weight~0.offset|))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15163#(or (< (+ main_~j~0 1) main_~edgecount~0) (not (< 2 main_~edgecount~0)) (forall ((v_ArrVal_640 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_640) |main_~#distance~0.offset|))) (< 3 main_~edgecount~0) (not (< (+ |main_#t~mem12| |main_#t~mem11|) |main_#t~mem13|)))} is VALID [2022-04-27 10:20:18,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {15167#(forall ((v_ArrVal_640 Int) (main_~j~0 Int) (v_main_~x~0_39 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|) v_ArrVal_640) |main_~#distance~0.offset|)) (<= 3 main_~j~0) (<= main_~j~0 1) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|)) (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) (+ (* main_~j~0 4) |main_~#Source~0.offset|)) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) (+ (* main_~j~0 4) |main_~#Weight~0.offset|))))))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {15167#(forall ((v_ArrVal_640 Int) (main_~j~0 Int) (v_main_~x~0_39 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|) v_ArrVal_640) |main_~#distance~0.offset|)) (<= 3 main_~j~0) (<= main_~j~0 1) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|)) (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) (+ (* main_~j~0 4) |main_~#Source~0.offset|)) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) (+ (* main_~j~0 4) |main_~#Weight~0.offset|))))))} is VALID [2022-04-27 10:20:18,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {15167#(forall ((v_ArrVal_640 Int) (main_~j~0 Int) (v_main_~x~0_39 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|) v_ArrVal_640) |main_~#distance~0.offset|)) (<= 3 main_~j~0) (<= main_~j~0 1) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|)) (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) (+ (* main_~j~0 4) |main_~#Source~0.offset|)) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) (+ (* main_~j~0 4) |main_~#Weight~0.offset|))))))} assume !(#t~mem13 > #t~mem11 + #t~mem12);havoc #t~mem13;havoc #t~mem11;havoc #t~mem12; {15167#(forall ((v_ArrVal_640 Int) (main_~j~0 Int) (v_main_~x~0_39 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|) v_ArrVal_640) |main_~#distance~0.offset|)) (<= 3 main_~j~0) (<= main_~j~0 1) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|)) (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) (+ (* main_~j~0 4) |main_~#Source~0.offset|)) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) (+ (* main_~j~0 4) |main_~#Weight~0.offset|))))))} is VALID [2022-04-27 10:20:18,156 INFO L290 TraceCheckUtils]: 17: Hoare triple {15167#(forall ((v_ArrVal_640 Int) (main_~j~0 Int) (v_main_~x~0_39 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|) v_ArrVal_640) |main_~#distance~0.offset|)) (<= 3 main_~j~0) (<= main_~j~0 1) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|)) (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) (+ (* main_~j~0 4) |main_~#Source~0.offset|)) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) (+ (* main_~j~0 4) |main_~#Weight~0.offset|))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15167#(forall ((v_ArrVal_640 Int) (main_~j~0 Int) (v_main_~x~0_39 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|) v_ArrVal_640) |main_~#distance~0.offset|)) (<= 3 main_~j~0) (<= main_~j~0 1) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|)) (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) (+ (* main_~j~0 4) |main_~#Source~0.offset|)) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) (+ (* main_~j~0 4) |main_~#Weight~0.offset|))))))} is VALID [2022-04-27 10:20:18,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {15167#(forall ((v_ArrVal_640 Int) (main_~j~0 Int) (v_main_~x~0_39 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|) v_ArrVal_640) |main_~#distance~0.offset|)) (<= 3 main_~j~0) (<= main_~j~0 1) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|)) (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) (+ (* main_~j~0 4) |main_~#Source~0.offset|)) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) (+ (* main_~j~0 4) |main_~#Weight~0.offset|))))))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {15167#(forall ((v_ArrVal_640 Int) (main_~j~0 Int) (v_main_~x~0_39 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|) v_ArrVal_640) |main_~#distance~0.offset|)) (<= 3 main_~j~0) (<= main_~j~0 1) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|)) (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) (+ (* main_~j~0 4) |main_~#Source~0.offset|)) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) (+ (* main_~j~0 4) |main_~#Weight~0.offset|))))))} is VALID [2022-04-27 10:20:19,352 WARN L290 TraceCheckUtils]: 15: Hoare triple {15183#(forall ((v_ArrVal_640 Int) (main_~j~0 Int) (v_ArrVal_639 Int) (v_main_~x~0_39 Int)) (or (<= (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|)) (+ (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_639)) |main_~#Weight~0.base|) (+ (* main_~j~0 4) |main_~#Weight~0.offset|)) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_639)) |main_~#Source~0.base|) (+ (* main_~j~0 4) |main_~#Source~0.offset|)) 4))))) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|) v_ArrVal_640) |main_~#distance~0.offset|)) (not (<= 0 (+ v_ArrVal_639 1))) (<= 3 main_~j~0) (<= main_~j~0 1)))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {15167#(forall ((v_ArrVal_640 Int) (main_~j~0 Int) (v_main_~x~0_39 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|) v_ArrVal_640) |main_~#distance~0.offset|)) (<= 3 main_~j~0) (<= main_~j~0 1) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|)) (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) (+ (* main_~j~0 4) |main_~#Source~0.offset|)) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) (+ (* main_~j~0 4) |main_~#Weight~0.offset|))))))} is UNKNOWN [2022-04-27 10:20:20,695 WARN L290 TraceCheckUtils]: 14: Hoare triple {15187#(forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (or (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_639) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|) v_ArrVal_640) |main_~#distance~0.offset|)) (<= (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_639) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|)) (+ (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_639) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_639)) |main_~#Source~0.base|) (+ |main_~#Source~0.offset| (* v_main_~j~0_53 4))) 4) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_639)) |main_~#Weight~0.base|) (+ (* v_main_~j~0_53 4) |main_~#Weight~0.offset|)))) (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= 3 v_main_~j~0_53)))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {15183#(forall ((v_ArrVal_640 Int) (main_~j~0 Int) (v_ArrVal_639 Int) (v_main_~x~0_39 Int)) (or (<= (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|)) (+ (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_639)) |main_~#Weight~0.base|) (+ (* main_~j~0 4) |main_~#Weight~0.offset|)) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_639)) |main_~#Source~0.base|) (+ (* main_~j~0 4) |main_~#Source~0.offset|)) 4))))) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|) v_ArrVal_640) |main_~#distance~0.offset|)) (not (<= 0 (+ v_ArrVal_639 1))) (<= 3 main_~j~0) (<= main_~j~0 1)))} is UNKNOWN [2022-04-27 10:20:20,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {15191#(forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (or (<= (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|)) (+ (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639)) |main_~#Weight~0.base|) (+ (* v_main_~j~0_53 4) |main_~#Weight~0.offset|)) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639)) |main_~#Source~0.base|) (+ |main_~#Source~0.offset| (* v_main_~j~0_53 4))) 4) |main_~#distance~0.offset|)))) (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|) v_ArrVal_640) |main_~#distance~0.offset|)) (<= 3 v_main_~j~0_53)))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {15187#(forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (or (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_639) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|) v_ArrVal_640) |main_~#distance~0.offset|)) (<= (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_639) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|)) (+ (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_639) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_639)) |main_~#Source~0.base|) (+ |main_~#Source~0.offset| (* v_main_~j~0_53 4))) 4) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_639)) |main_~#Weight~0.base|) (+ (* v_main_~j~0_53 4) |main_~#Weight~0.offset|)))) (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= 3 v_main_~j~0_53)))} is VALID [2022-04-27 10:20:20,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {15191#(forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (or (<= (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|)) (+ (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639)) |main_~#Weight~0.base|) (+ (* v_main_~j~0_53 4) |main_~#Weight~0.offset|)) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639)) |main_~#Source~0.base|) (+ |main_~#Source~0.offset| (* v_main_~j~0_53 4))) 4) |main_~#distance~0.offset|)))) (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|) v_ArrVal_640) |main_~#distance~0.offset|)) (<= 3 v_main_~j~0_53)))} ~i~0 := 0; {15191#(forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (or (<= (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|)) (+ (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639)) |main_~#Weight~0.base|) (+ (* v_main_~j~0_53 4) |main_~#Weight~0.offset|)) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639)) |main_~#Source~0.base|) (+ |main_~#Source~0.offset| (* v_main_~j~0_53 4))) 4) |main_~#distance~0.offset|)))) (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|) v_ArrVal_640) |main_~#distance~0.offset|)) (<= 3 v_main_~j~0_53)))} is VALID [2022-04-27 10:20:20,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {15191#(forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (or (<= (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|)) (+ (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639)) |main_~#Weight~0.base|) (+ (* v_main_~j~0_53 4) |main_~#Weight~0.offset|)) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639)) |main_~#Source~0.base|) (+ |main_~#Source~0.offset| (* v_main_~j~0_53 4))) 4) |main_~#distance~0.offset|)))) (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|) v_ArrVal_640) |main_~#distance~0.offset|)) (<= 3 v_main_~j~0_53)))} assume !(~i~0 < ~nodecount~0); {15191#(forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (or (<= (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|)) (+ (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639)) |main_~#Weight~0.base|) (+ (* v_main_~j~0_53 4) |main_~#Weight~0.offset|)) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639)) |main_~#Source~0.base|) (+ |main_~#Source~0.offset| (* v_main_~j~0_53 4))) 4) |main_~#distance~0.offset|)))) (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|) v_ArrVal_640) |main_~#distance~0.offset|)) (<= 3 v_main_~j~0_53)))} is VALID [2022-04-27 10:20:20,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {15191#(forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (or (<= (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|)) (+ (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639)) |main_~#Weight~0.base|) (+ (* v_main_~j~0_53 4) |main_~#Weight~0.offset|)) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639)) |main_~#Source~0.base|) (+ |main_~#Source~0.offset| (* v_main_~j~0_53 4))) 4) |main_~#distance~0.offset|)))) (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|) v_ArrVal_640) |main_~#distance~0.offset|)) (<= 3 v_main_~j~0_53)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15191#(forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (or (<= (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|)) (+ (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639)) |main_~#Weight~0.base|) (+ (* v_main_~j~0_53 4) |main_~#Weight~0.offset|)) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639)) |main_~#Source~0.base|) (+ |main_~#Source~0.offset| (* v_main_~j~0_53 4))) 4) |main_~#distance~0.offset|)))) (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|) v_ArrVal_640) |main_~#distance~0.offset|)) (<= 3 v_main_~j~0_53)))} is VALID [2022-04-27 10:20:22,165 WARN L290 TraceCheckUtils]: 9: Hoare triple {15204#(forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (or (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|)) (+ (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639)) |main_~#Weight~0.base|) (+ (* v_main_~j~0_53 4) |main_~#Weight~0.offset|)) (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639)) |main_~#Source~0.base|) (+ |main_~#Source~0.offset| (* v_main_~j~0_53 4))) 4) |main_~#distance~0.offset|)))) (<= 0 (select (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|) v_ArrVal_640) |main_~#distance~0.offset|)) (<= 3 v_main_~j~0_53)))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {15191#(forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (or (<= (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|)) (+ (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639)) |main_~#Weight~0.base|) (+ (* v_main_~j~0_53 4) |main_~#Weight~0.offset|)) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639)) |main_~#Source~0.base|) (+ |main_~#Source~0.offset| (* v_main_~j~0_53 4))) 4) |main_~#distance~0.offset|)))) (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|) v_ArrVal_640) |main_~#distance~0.offset|)) (<= 3 v_main_~j~0_53)))} is UNKNOWN [2022-04-27 10:20:22,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {15204#(forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (or (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|)) (+ (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639)) |main_~#Weight~0.base|) (+ (* v_main_~j~0_53 4) |main_~#Weight~0.offset|)) (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639)) |main_~#Source~0.base|) (+ |main_~#Source~0.offset| (* v_main_~j~0_53 4))) 4) |main_~#distance~0.offset|)))) (<= 0 (select (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|) v_ArrVal_640) |main_~#distance~0.offset|)) (<= 3 v_main_~j~0_53)))} assume !!(~i~0 < ~nodecount~0); {15204#(forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (or (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|)) (+ (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639)) |main_~#Weight~0.base|) (+ (* v_main_~j~0_53 4) |main_~#Weight~0.offset|)) (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639)) |main_~#Source~0.base|) (+ |main_~#Source~0.offset| (* v_main_~j~0_53 4))) 4) |main_~#distance~0.offset|)))) (<= 0 (select (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|) v_ArrVal_640) |main_~#distance~0.offset|)) (<= 3 v_main_~j~0_53)))} is VALID [2022-04-27 10:20:22,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {14919#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {15204#(forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (or (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|)) (+ (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639)) |main_~#Weight~0.base|) (+ (* v_main_~j~0_53 4) |main_~#Weight~0.offset|)) (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639)) |main_~#Source~0.base|) (+ |main_~#Source~0.offset| (* v_main_~j~0_53 4))) 4) |main_~#distance~0.offset|)))) (<= 0 (select (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) 0)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_639) (+ (* v_main_~x~0_39 4) |main_~#distance~0.offset|) v_ArrVal_640) |main_~#distance~0.offset|)) (<= 3 v_main_~j~0_53)))} is VALID [2022-04-27 10:20:22,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {14919#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {14919#true} is VALID [2022-04-27 10:20:22,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {14919#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {14919#true} is VALID [2022-04-27 10:20:22,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {14919#true} call #t~ret22 := main(); {14919#true} is VALID [2022-04-27 10:20:22,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14919#true} {14919#true} #123#return; {14919#true} is VALID [2022-04-27 10:20:22,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {14919#true} assume true; {14919#true} is VALID [2022-04-27 10:20:22,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {14919#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {14919#true} is VALID [2022-04-27 10:20:22,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {14919#true} call ULTIMATE.init(); {14919#true} is VALID [2022-04-27 10:20:22,180 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2022-04-27 10:20:22,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094832214] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:20:22,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:20:22,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22, 21] total 55 [2022-04-27 10:20:22,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548456985] [2022-04-27 10:20:22,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:20:22,181 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 52 states have internal predecessors, (101), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-27 10:20:22,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:20:22,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 55 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 52 states have internal predecessors, (101), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:20:37,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 98 inductive. 0 not inductive. 9 times theorem prover too weak to decide inductivity. [2022-04-27 10:20:37,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-27 10:20:37,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:20:37,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-27 10:20:37,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=2249, Unknown=15, NotChecked=306, Total=2970 [2022-04-27 10:20:37,796 INFO L87 Difference]: Start difference. First operand 214 states and 272 transitions. Second operand has 55 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 52 states have internal predecessors, (101), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:20:38,911 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_main_~#Dest~0.base|)) (.cse1 (select |c_#memory_int| |c_main_~#distance~0.base|))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= (select .cse0 |c_main_~#Dest~0.offset|) 1) (= |c_main_~#Source~0.offset| 0) (= |c_main_~#distance~0.offset| 0) (= |c_old(~INFINITY~0)| c_~INFINITY~0) (= (select .cse0 (+ 8 |c_main_~#Dest~0.offset|)) 4) (not (= |c_main_~#distance~0.base| |c_main_~#Weight~0.base|)) (= |c_main_~#Dest~0.offset| 0) (= (select .cse1 |c_main_~#distance~0.offset|) 0) (forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (let ((.cse3 (+ (* v_main_~x~0_39 4) |c_main_~#distance~0.offset|)) (.cse2 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) 4)) v_ArrVal_639))) (or (<= 0 (select (store .cse2 .cse3 v_ArrVal_640) |c_main_~#distance~0.offset|)) (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= (select .cse2 .cse3) (let ((.cse4 (store |c_#memory_int| |c_main_~#distance~0.base| .cse2)) (.cse5 (* v_main_~j~0_53 4))) (+ (select (select .cse4 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| .cse5)) (select .cse2 (+ (* (select (select .cse4 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| .cse5)) 4) |c_main_~#distance~0.offset|))))) (<= 3 v_main_~j~0_53)))) (= c_main_~i~0 0) (= (select .cse1 (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|)) 0) (not (= |c_main_~#distance~0.base| |c_main_~#Source~0.base|)) (= |c_main_~#Weight~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| 8)) 1) (<= 2 (select (select |c_#memory_int| |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| 8))) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2022-04-27 10:20:39,690 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_main_~#Dest~0.base|)) (.cse1 (select |c_#memory_int| |c_main_~#distance~0.base|))) (and (= (select .cse0 |c_main_~#Dest~0.offset|) 1) (= |c_main_~#Source~0.offset| 0) (= |c_main_~#distance~0.offset| 0) (= (select .cse0 (+ 8 |c_main_~#Dest~0.offset|)) 4) (not (= |c_main_~#distance~0.base| |c_main_~#Weight~0.base|)) (= |c_main_~#Dest~0.offset| 0) (= (select .cse1 |c_main_~#distance~0.offset|) 0) (= (select .cse1 0) 0) (forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (let ((.cse3 (+ (* v_main_~x~0_39 4) |c_main_~#distance~0.offset|)) (.cse2 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) 4)) v_ArrVal_639))) (or (<= 0 (select (store .cse2 .cse3 v_ArrVal_640) |c_main_~#distance~0.offset|)) (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= (select .cse2 .cse3) (let ((.cse4 (store |c_#memory_int| |c_main_~#distance~0.base| .cse2)) (.cse5 (* v_main_~j~0_53 4))) (+ (select (select .cse4 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| .cse5)) (select .cse2 (+ (* (select (select .cse4 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| .cse5)) 4) |c_main_~#distance~0.offset|))))) (<= 3 v_main_~j~0_53)))) (not (= |c_main_~#distance~0.base| |c_main_~#Source~0.base|)) (= |c_main_~#Weight~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| 8)) 1) (<= 2 (select (select |c_#memory_int| |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| 8))))) is different from false [2022-04-27 10:20:40,505 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_main_~#distance~0.base|)) (.cse0 (select |c_#memory_int| |c_main_~#Dest~0.base|)) (.cse1 (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|))) (and (= (select .cse0 |c_main_~#Dest~0.offset|) 1) (= |c_main_~#Source~0.offset| 0) (= .cse1 0) (= |c_main_~#distance~0.offset| 0) (= (select .cse0 (+ 8 |c_main_~#Dest~0.offset|)) 4) (not (= |c_main_~#distance~0.base| |c_main_~#Weight~0.base|)) (= |c_main_~#Dest~0.offset| 0) (forall ((v_ArrVal_640 Int) (v_ArrVal_639 Int) (v_main_~j~0_53 Int) (v_main_~x~0_39 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_639)) (.cse3 (+ (* v_main_~x~0_39 4) |c_main_~#distance~0.offset|))) (or (<= (select .cse2 .cse3) (let ((.cse4 (store |c_#memory_int| |c_main_~#distance~0.base| .cse2)) (.cse5 (* v_main_~j~0_53 4))) (+ (select .cse2 (+ (* (select (select .cse4 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| .cse5)) 4) |c_main_~#distance~0.offset|)) (select (select .cse4 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| .cse5))))) (not (<= 0 (+ v_ArrVal_639 1))) (<= v_main_~j~0_53 1) (<= 0 (select (store .cse2 .cse3 v_ArrVal_640) |c_main_~#distance~0.offset|)) (<= 3 v_main_~j~0_53)))) (= (select .cse6 |c_main_~#distance~0.offset|) 0) (= (select .cse6 0) 0) (= (select .cse0 .cse1) 1) (not (= |c_main_~#distance~0.base| |c_main_~#Source~0.base|)) (= |c_main_~#Weight~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| 8)) 1) (<= 2 (select (select |c_#memory_int| |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| 8))) (= c_main_~j~0 0))) is different from false [2022-04-27 10:20:41,343 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_main_~#Dest~0.base|))) (let ((.cse0 (select .cse1 |c_main_~#Dest~0.offset|)) (.cse2 (select |c_#memory_int| |c_main_~#distance~0.base|))) (and (= .cse0 1) (= |c_main_~#Source~0.offset| 0) (= (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|) 0) (= |c_main_~#distance~0.offset| 0) (= .cse0 c_main_~x~0) (= (select .cse1 (+ 8 |c_main_~#Dest~0.offset|)) 4) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (not (= |c_main_~#distance~0.base| |c_main_~#Weight~0.base|)) (= |c_main_~#Dest~0.offset| 0) (= (select .cse2 |c_main_~#distance~0.offset|) 0) (= (select .cse2 0) 0) (not (= |c_main_~#distance~0.base| |c_main_~#Source~0.base|)) (forall ((v_ArrVal_640 Int) (main_~j~0 Int) (v_ArrVal_639 Int) (v_main_~x~0_39 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* 4 c_main_~x~0) |c_main_~#distance~0.offset|) v_ArrVal_639)) (.cse4 (+ (* v_main_~x~0_39 4) |c_main_~#distance~0.offset|))) (or (not (<= 0 (+ v_ArrVal_639 1))) (<= (select .cse3 .cse4) (let ((.cse5 (store |c_#memory_int| |c_main_~#distance~0.base| .cse3)) (.cse6 (* main_~j~0 4))) (+ (select (select .cse5 |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| .cse6)) (select .cse3 (+ (* (select (select .cse5 |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| .cse6)) 4) |c_main_~#distance~0.offset|))))) (<= 3 main_~j~0) (<= main_~j~0 1) (<= 0 (select (store .cse3 .cse4 v_ArrVal_640) |c_main_~#distance~0.offset|))))) (= |c_main_~#Weight~0.offset| 0) (= (select (select |c_#memory_int| |c_main_~#Source~0.base|) (+ |c_main_~#Source~0.offset| 8)) 1) (<= 2 (select (select |c_#memory_int| |c_main_~#Weight~0.base|) (+ |c_main_~#Weight~0.offset| 8))) (= (+ (- 1) c_main_~x~0) 0) (= c_main_~j~0 0)))) is different from false [2022-04-27 10:20:47,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:20:47,529 INFO L93 Difference]: Finished difference Result 330 states and 412 transitions. [2022-04-27 10:20:47,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-27 10:20:47,529 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 52 states have internal predecessors, (101), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-27 10:20:47,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:20:47,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 52 states have internal predecessors, (101), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:20:47,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 176 transitions. [2022-04-27 10:20:47,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 52 states have internal predecessors, (101), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:20:47,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 176 transitions. [2022-04-27 10:20:47,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 176 transitions. [2022-04-27 10:20:47,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:20:47,937 INFO L225 Difference]: With dead ends: 330 [2022-04-27 10:20:47,937 INFO L226 Difference]: Without dead ends: 299 [2022-04-27 10:20:47,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 111 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2859 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=1609, Invalid=9530, Unknown=19, NotChecked=1498, Total=12656 [2022-04-27 10:20:47,941 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 238 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 2421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1506 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-27 10:20:47,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 143 Invalid, 2421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 812 Invalid, 0 Unknown, 1506 Unchecked, 0.9s Time] [2022-04-27 10:20:47,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-04-27 10:20:48,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 231. [2022-04-27 10:20:48,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:20:48,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 299 states. Second operand has 231 states, 220 states have (on average 1.2863636363636364) internal successors, (283), 222 states have internal predecessors, (283), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:20:48,462 INFO L74 IsIncluded]: Start isIncluded. First operand 299 states. Second operand has 231 states, 220 states have (on average 1.2863636363636364) internal successors, (283), 222 states have internal predecessors, (283), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:20:48,462 INFO L87 Difference]: Start difference. First operand 299 states. Second operand has 231 states, 220 states have (on average 1.2863636363636364) internal successors, (283), 222 states have internal predecessors, (283), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:20:48,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:20:48,467 INFO L93 Difference]: Finished difference Result 299 states and 378 transitions. [2022-04-27 10:20:48,468 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 378 transitions. [2022-04-27 10:20:48,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:20:48,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:20:48,468 INFO L74 IsIncluded]: Start isIncluded. First operand has 231 states, 220 states have (on average 1.2863636363636364) internal successors, (283), 222 states have internal predecessors, (283), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 299 states. [2022-04-27 10:20:48,469 INFO L87 Difference]: Start difference. First operand has 231 states, 220 states have (on average 1.2863636363636364) internal successors, (283), 222 states have internal predecessors, (283), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 299 states. [2022-04-27 10:20:48,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:20:48,474 INFO L93 Difference]: Finished difference Result 299 states and 378 transitions. [2022-04-27 10:20:48,474 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 378 transitions. [2022-04-27 10:20:48,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:20:48,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:20:48,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:20:48,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:20:48,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 220 states have (on average 1.2863636363636364) internal successors, (283), 222 states have internal predecessors, (283), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:20:48,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 293 transitions. [2022-04-27 10:20:48,479 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 293 transitions. Word has length 43 [2022-04-27 10:20:48,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:20:48,480 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 293 transitions. [2022-04-27 10:20:48,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 52 states have internal predecessors, (101), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:20:48,480 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 293 transitions. [2022-04-27 10:20:48,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 10:20:48,481 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:20:48,481 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1] [2022-04-27 10:20:48,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-27 10:20:48,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:20:48,692 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:20:48,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:20:48,692 INFO L85 PathProgramCache]: Analyzing trace with hash 2016392549, now seen corresponding path program 4 times [2022-04-27 10:20:48,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:20:48,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700919361] [2022-04-27 10:20:48,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:20:48,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:20:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:20:49,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:20:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:20:49,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {16768#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {16751#true} is VALID [2022-04-27 10:20:49,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {16751#true} assume true; {16751#true} is VALID [2022-04-27 10:20:49,144 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16751#true} {16751#true} #123#return; {16751#true} is VALID [2022-04-27 10:20:49,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {16751#true} call ULTIMATE.init(); {16768#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:20:49,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {16768#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {16751#true} is VALID [2022-04-27 10:20:49,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {16751#true} assume true; {16751#true} is VALID [2022-04-27 10:20:49,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16751#true} {16751#true} #123#return; {16751#true} is VALID [2022-04-27 10:20:49,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {16751#true} call #t~ret22 := main(); {16751#true} is VALID [2022-04-27 10:20:49,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {16751#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {16751#true} is VALID [2022-04-27 10:20:49,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {16751#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {16751#true} is VALID [2022-04-27 10:20:49,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {16751#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {16756#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= main_~i~0 0))} is VALID [2022-04-27 10:20:49,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {16756#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0); {16756#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= main_~i~0 0))} is VALID [2022-04-27 10:20:49,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {16756#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= main_~i~0 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16757#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:20:49,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {16757#(and (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) 0) (= main_~i~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {16758#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:20:49,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {16758#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} assume !(~i~0 < ~nodecount~0); {16758#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:20:49,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {16758#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} ~i~0 := 0; {16758#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:20:49,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {16758#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= |main_~#Dest~0.offset| 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {16759#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:20:49,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {16759#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16759#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:20:49,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {16759#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0))} assume !(#t~mem13 > #t~mem11 + #t~mem12);havoc #t~mem13;havoc #t~mem11;havoc #t~mem12; {16759#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0))} is VALID [2022-04-27 10:20:49,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {16759#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {16760#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (<= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 4) (= |main_~#Dest~0.offset| 0) (<= 4 (+ (* main_~j~0 4) |main_~#Dest~0.offset|)))} is VALID [2022-04-27 10:20:49,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {16760#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (<= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 4) (= |main_~#Dest~0.offset| 0) (<= 4 (+ (* main_~j~0 4) |main_~#Dest~0.offset|)))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16760#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (<= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 4) (= |main_~#Dest~0.offset| 0) (<= 4 (+ (* main_~j~0 4) |main_~#Dest~0.offset|)))} is VALID [2022-04-27 10:20:49,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {16760#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (<= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 4) (= |main_~#Dest~0.offset| 0) (<= 4 (+ (* main_~j~0 4) |main_~#Dest~0.offset|)))} assume !(#t~mem13 > #t~mem11 + #t~mem12);havoc #t~mem13;havoc #t~mem11;havoc #t~mem12; {16760#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (<= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 4) (= |main_~#Dest~0.offset| 0) (<= 4 (+ (* main_~j~0 4) |main_~#Dest~0.offset|)))} is VALID [2022-04-27 10:20:49,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {16760#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) 4) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (<= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 4) (= |main_~#Dest~0.offset| 0) (<= 4 (+ (* main_~j~0 4) |main_~#Dest~0.offset|)))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {16761#(and (<= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 8) (< 7 (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4))} is VALID [2022-04-27 10:20:49,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {16761#(and (<= (+ (* main_~j~0 4) |main_~#Dest~0.offset|) 8) (< 7 (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) (= |main_~#distance~0.offset| 0) (= (+ 8 |main_~#Dest~0.offset|) 8) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16762#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= main_~x~0 4))} is VALID [2022-04-27 10:20:49,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {16762#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0) (= main_~x~0 4))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {16763#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:20:49,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {16763#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {16763#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:20:49,157 INFO L290 TraceCheckUtils]: 23: Hoare triple {16763#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !(~j~0 < ~edgecount~0); {16763#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:20:49,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {16763#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16763#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:20:49,158 INFO L290 TraceCheckUtils]: 25: Hoare triple {16763#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !(~i~0 < ~nodecount~0); {16763#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:20:49,158 INFO L290 TraceCheckUtils]: 26: Hoare triple {16763#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} ~i~0 := 0; {16763#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:20:49,159 INFO L290 TraceCheckUtils]: 27: Hoare triple {16763#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16763#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:20:49,159 INFO L290 TraceCheckUtils]: 28: Hoare triple {16763#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {16763#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:20:49,159 INFO L290 TraceCheckUtils]: 29: Hoare triple {16763#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {16763#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:20:49,160 INFO L290 TraceCheckUtils]: 30: Hoare triple {16763#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16763#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:20:49,160 INFO L290 TraceCheckUtils]: 31: Hoare triple {16763#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {16763#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:20:49,161 INFO L290 TraceCheckUtils]: 32: Hoare triple {16763#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {16763#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:20:49,161 INFO L290 TraceCheckUtils]: 33: Hoare triple {16763#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16763#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:20:49,176 INFO L290 TraceCheckUtils]: 34: Hoare triple {16763#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {16763#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:20:49,176 INFO L290 TraceCheckUtils]: 35: Hoare triple {16763#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {16763#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:20:49,177 INFO L290 TraceCheckUtils]: 36: Hoare triple {16763#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} assume !(~i~0 < ~edgecount~0); {16763#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} is VALID [2022-04-27 10:20:49,177 INFO L290 TraceCheckUtils]: 37: Hoare triple {16763#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) 0) 0))} ~i~0 := 0; {16764#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) 0) (= main_~i~0 0))} is VALID [2022-04-27 10:20:49,177 INFO L290 TraceCheckUtils]: 38: Hoare triple {16764#(and (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))) 0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16765#(= |main_#t~mem21| 0)} is VALID [2022-04-27 10:20:49,178 INFO L272 TraceCheckUtils]: 39: Hoare triple {16765#(= |main_#t~mem21| 0)} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {16766#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:20:49,178 INFO L290 TraceCheckUtils]: 40: Hoare triple {16766#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {16767#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:20:49,179 INFO L290 TraceCheckUtils]: 41: Hoare triple {16767#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {16752#false} is VALID [2022-04-27 10:20:49,179 INFO L290 TraceCheckUtils]: 42: Hoare triple {16752#false} assume !false; {16752#false} is VALID [2022-04-27 10:20:49,179 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 10:20:49,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:20:49,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700919361] [2022-04-27 10:20:49,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700919361] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:20:49,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863165193] [2022-04-27 10:20:49,180 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 10:20:49,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:20:49,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:20:49,181 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:20:49,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-27 10:20:49,335 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 10:20:49,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:20:49,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-27 10:20:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:20:49,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:20:49,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 98 [2022-04-27 10:20:49,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-04-27 10:20:50,933 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-04-27 10:20:50,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 49 [2022-04-27 10:20:55,312 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-04-27 10:20:55,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 13 [2022-04-27 10:20:55,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {16751#true} call ULTIMATE.init(); {16751#true} is VALID [2022-04-27 10:20:55,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {16751#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {16751#true} is VALID [2022-04-27 10:20:55,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {16751#true} assume true; {16751#true} is VALID [2022-04-27 10:20:55,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16751#true} {16751#true} #123#return; {16751#true} is VALID [2022-04-27 10:20:55,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {16751#true} call #t~ret22 := main(); {16751#true} is VALID [2022-04-27 10:20:55,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {16751#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {16751#true} is VALID [2022-04-27 10:20:55,461 INFO L290 TraceCheckUtils]: 6: Hoare triple {16751#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {16751#true} is VALID [2022-04-27 10:20:55,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {16751#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {16793#(and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))} is VALID [2022-04-27 10:20:55,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {16793#(and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))} assume !!(~i~0 < ~nodecount~0); {16797#(and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (< main_~i~0 main_~nodecount~0) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))} is VALID [2022-04-27 10:20:55,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {16797#(and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (< main_~i~0 main_~nodecount~0) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16801#(and (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)))) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (< main_~i~0 main_~nodecount~0) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))} is VALID [2022-04-27 10:20:55,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {16801#(and (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)))) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (< main_~i~0 main_~nodecount~0) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {16805#(and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 main_~nodecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (<= main_~i~0 (+ v_main_~i~0_130 1)))) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))} is VALID [2022-04-27 10:20:55,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {16805#(and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 main_~nodecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (<= main_~i~0 (+ v_main_~i~0_130 1)))) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))} assume !(~i~0 < ~nodecount~0); {16809#(and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 main_~nodecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (<= main_~nodecount~0 (+ v_main_~i~0_130 1)))) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))} is VALID [2022-04-27 10:20:55,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {16809#(and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 main_~nodecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (<= main_~nodecount~0 (+ v_main_~i~0_130 1)))) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))} ~i~0 := 0; {16813#(and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 main_~nodecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (<= main_~nodecount~0 (+ v_main_~i~0_130 1)))) (= main_~i~0 0) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))} is VALID [2022-04-27 10:20:55,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {16813#(and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 main_~nodecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (<= main_~nodecount~0 (+ v_main_~i~0_130 1)))) (= main_~i~0 0) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {16817#(and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 main_~nodecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (<= main_~nodecount~0 (+ v_main_~i~0_130 1)))) (= main_~i~0 0) (< main_~i~0 main_~nodecount~0) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))} is VALID [2022-04-27 10:20:55,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {16817#(and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 main_~nodecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (<= main_~nodecount~0 (+ v_main_~i~0_130 1)))) (= main_~i~0 0) (< main_~i~0 main_~nodecount~0) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16817#(and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 main_~nodecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (<= main_~nodecount~0 (+ v_main_~i~0_130 1)))) (= main_~i~0 0) (< main_~i~0 main_~nodecount~0) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))} is VALID [2022-04-27 10:20:55,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {16817#(and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 main_~nodecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (<= main_~nodecount~0 (+ v_main_~i~0_130 1)))) (= main_~i~0 0) (< main_~i~0 main_~nodecount~0) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))} assume !(#t~mem13 > #t~mem11 + #t~mem12);havoc #t~mem13;havoc #t~mem11;havoc #t~mem12; {16817#(and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 main_~nodecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (<= main_~nodecount~0 (+ v_main_~i~0_130 1)))) (= main_~i~0 0) (< main_~i~0 main_~nodecount~0) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))} is VALID [2022-04-27 10:20:55,471 INFO L290 TraceCheckUtils]: 16: Hoare triple {16817#(and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 main_~nodecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (<= main_~nodecount~0 (+ v_main_~i~0_130 1)))) (= main_~i~0 0) (< main_~i~0 main_~nodecount~0) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {16827#(and (= main_~j~0 1) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 main_~nodecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (<= main_~nodecount~0 (+ v_main_~i~0_130 1)))) (= main_~i~0 0) (< main_~i~0 main_~nodecount~0) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))} is VALID [2022-04-27 10:20:55,472 INFO L290 TraceCheckUtils]: 17: Hoare triple {16827#(and (= main_~j~0 1) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 main_~nodecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (<= main_~nodecount~0 (+ v_main_~i~0_130 1)))) (= main_~i~0 0) (< main_~i~0 main_~nodecount~0) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16827#(and (= main_~j~0 1) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 main_~nodecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (<= main_~nodecount~0 (+ v_main_~i~0_130 1)))) (= main_~i~0 0) (< main_~i~0 main_~nodecount~0) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))} is VALID [2022-04-27 10:20:55,472 INFO L290 TraceCheckUtils]: 18: Hoare triple {16827#(and (= main_~j~0 1) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 main_~nodecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (<= main_~nodecount~0 (+ v_main_~i~0_130 1)))) (= main_~i~0 0) (< main_~i~0 main_~nodecount~0) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))} assume !(#t~mem13 > #t~mem11 + #t~mem12);havoc #t~mem13;havoc #t~mem11;havoc #t~mem12; {16827#(and (= main_~j~0 1) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 main_~nodecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (<= main_~nodecount~0 (+ v_main_~i~0_130 1)))) (= main_~i~0 0) (< main_~i~0 main_~nodecount~0) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))} is VALID [2022-04-27 10:20:55,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {16827#(and (= main_~j~0 1) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 main_~nodecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (<= main_~nodecount~0 (+ v_main_~i~0_130 1)))) (= main_~i~0 0) (< main_~i~0 main_~nodecount~0) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {16837#(and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 main_~nodecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (<= main_~nodecount~0 (+ v_main_~i~0_130 1)))) (= main_~i~0 0) (< main_~i~0 main_~nodecount~0) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))) (= (+ (- 1) main_~j~0) 1))} is VALID [2022-04-27 10:20:55,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {16837#(and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 main_~nodecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (<= main_~nodecount~0 (+ v_main_~i~0_130 1)))) (= main_~i~0 0) (< main_~i~0 main_~nodecount~0) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))) (= (+ (- 1) main_~j~0) 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16841#(and (exists ((|main_~#Dest~0.base| Int) (|main_~#Dest~0.offset| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) main_~x~0) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 main_~nodecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (<= main_~nodecount~0 (+ v_main_~i~0_130 1)))) (= main_~i~0 0) (< main_~i~0 main_~nodecount~0))} is VALID [2022-04-27 10:20:55,476 INFO L290 TraceCheckUtils]: 21: Hoare triple {16841#(and (exists ((|main_~#Dest~0.base| Int) (|main_~#Dest~0.offset| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) main_~x~0) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 main_~nodecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (<= main_~nodecount~0 (+ v_main_~i~0_130 1)))) (= main_~i~0 0) (< main_~i~0 main_~nodecount~0))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {16845#(and (exists ((|main_~#Dest~0.base| Int) (v_main_~i~0_130 Int) (|main_~#Dest~0.offset| Int)) (and (< v_main_~i~0_130 main_~nodecount~0) (or (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) v_main_~i~0_130)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= main_~nodecount~0 (+ v_main_~i~0_130 1)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (= main_~i~0 0) (< main_~i~0 main_~nodecount~0))} is VALID [2022-04-27 10:20:55,478 INFO L290 TraceCheckUtils]: 22: Hoare triple {16845#(and (exists ((|main_~#Dest~0.base| Int) (v_main_~i~0_130 Int) (|main_~#Dest~0.offset| Int)) (and (< v_main_~i~0_130 main_~nodecount~0) (or (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) v_main_~i~0_130)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= main_~nodecount~0 (+ v_main_~i~0_130 1)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (= main_~i~0 0) (< main_~i~0 main_~nodecount~0))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {16845#(and (exists ((|main_~#Dest~0.base| Int) (v_main_~i~0_130 Int) (|main_~#Dest~0.offset| Int)) (and (< v_main_~i~0_130 main_~nodecount~0) (or (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) v_main_~i~0_130)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= main_~nodecount~0 (+ v_main_~i~0_130 1)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (= main_~i~0 0) (< main_~i~0 main_~nodecount~0))} is VALID [2022-04-27 10:20:55,480 INFO L290 TraceCheckUtils]: 23: Hoare triple {16845#(and (exists ((|main_~#Dest~0.base| Int) (v_main_~i~0_130 Int) (|main_~#Dest~0.offset| Int)) (and (< v_main_~i~0_130 main_~nodecount~0) (or (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) v_main_~i~0_130)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= main_~nodecount~0 (+ v_main_~i~0_130 1)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (= main_~i~0 0) (< main_~i~0 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {16845#(and (exists ((|main_~#Dest~0.base| Int) (v_main_~i~0_130 Int) (|main_~#Dest~0.offset| Int)) (and (< v_main_~i~0_130 main_~nodecount~0) (or (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) v_main_~i~0_130)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= main_~nodecount~0 (+ v_main_~i~0_130 1)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (= main_~i~0 0) (< main_~i~0 main_~nodecount~0))} is VALID [2022-04-27 10:20:55,482 INFO L290 TraceCheckUtils]: 24: Hoare triple {16845#(and (exists ((|main_~#Dest~0.base| Int) (v_main_~i~0_130 Int) (|main_~#Dest~0.offset| Int)) (and (< v_main_~i~0_130 main_~nodecount~0) (or (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) v_main_~i~0_130)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= main_~nodecount~0 (+ v_main_~i~0_130 1)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (= main_~i~0 0) (< main_~i~0 main_~nodecount~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16855#(and (< 0 main_~nodecount~0) (<= main_~i~0 1) (exists ((|main_~#Dest~0.base| Int) (v_main_~i~0_130 Int) (|main_~#Dest~0.offset| Int)) (and (< v_main_~i~0_130 main_~nodecount~0) (or (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) v_main_~i~0_130)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= main_~nodecount~0 (+ v_main_~i~0_130 1)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))))} is VALID [2022-04-27 10:20:55,483 INFO L290 TraceCheckUtils]: 25: Hoare triple {16855#(and (< 0 main_~nodecount~0) (<= main_~i~0 1) (exists ((|main_~#Dest~0.base| Int) (v_main_~i~0_130 Int) (|main_~#Dest~0.offset| Int)) (and (< v_main_~i~0_130 main_~nodecount~0) (or (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) v_main_~i~0_130)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= main_~nodecount~0 (+ v_main_~i~0_130 1)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))))} assume !(~i~0 < ~nodecount~0); {16859#(and (exists ((|main_~#Dest~0.base| Int) (|main_~#Dest~0.offset| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (< 0 (+ v_main_~i~0_130 1)))))} is VALID [2022-04-27 10:20:55,483 INFO L290 TraceCheckUtils]: 26: Hoare triple {16859#(and (exists ((|main_~#Dest~0.base| Int) (|main_~#Dest~0.offset| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (< 0 (+ v_main_~i~0_130 1)))))} ~i~0 := 0; {16859#(and (exists ((|main_~#Dest~0.base| Int) (|main_~#Dest~0.offset| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (< 0 (+ v_main_~i~0_130 1)))))} is VALID [2022-04-27 10:20:55,484 INFO L290 TraceCheckUtils]: 27: Hoare triple {16859#(and (exists ((|main_~#Dest~0.base| Int) (|main_~#Dest~0.offset| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (< 0 (+ v_main_~i~0_130 1)))))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16859#(and (exists ((|main_~#Dest~0.base| Int) (|main_~#Dest~0.offset| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (< 0 (+ v_main_~i~0_130 1)))))} is VALID [2022-04-27 10:20:55,485 INFO L290 TraceCheckUtils]: 28: Hoare triple {16859#(and (exists ((|main_~#Dest~0.base| Int) (|main_~#Dest~0.offset| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (< 0 (+ v_main_~i~0_130 1)))))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {16859#(and (exists ((|main_~#Dest~0.base| Int) (|main_~#Dest~0.offset| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (< 0 (+ v_main_~i~0_130 1)))))} is VALID [2022-04-27 10:20:55,486 INFO L290 TraceCheckUtils]: 29: Hoare triple {16859#(and (exists ((|main_~#Dest~0.base| Int) (|main_~#Dest~0.offset| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (< 0 (+ v_main_~i~0_130 1)))))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {16859#(and (exists ((|main_~#Dest~0.base| Int) (|main_~#Dest~0.offset| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (< 0 (+ v_main_~i~0_130 1)))))} is VALID [2022-04-27 10:20:55,487 INFO L290 TraceCheckUtils]: 30: Hoare triple {16859#(and (exists ((|main_~#Dest~0.base| Int) (|main_~#Dest~0.offset| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (< 0 (+ v_main_~i~0_130 1)))))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16859#(and (exists ((|main_~#Dest~0.base| Int) (|main_~#Dest~0.offset| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (< 0 (+ v_main_~i~0_130 1)))))} is VALID [2022-04-27 10:20:55,487 INFO L290 TraceCheckUtils]: 31: Hoare triple {16859#(and (exists ((|main_~#Dest~0.base| Int) (|main_~#Dest~0.offset| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (< 0 (+ v_main_~i~0_130 1)))))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {16859#(and (exists ((|main_~#Dest~0.base| Int) (|main_~#Dest~0.offset| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (< 0 (+ v_main_~i~0_130 1)))))} is VALID [2022-04-27 10:20:55,488 INFO L290 TraceCheckUtils]: 32: Hoare triple {16859#(and (exists ((|main_~#Dest~0.base| Int) (|main_~#Dest~0.offset| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (< 0 (+ v_main_~i~0_130 1)))))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {16859#(and (exists ((|main_~#Dest~0.base| Int) (|main_~#Dest~0.offset| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (< 0 (+ v_main_~i~0_130 1)))))} is VALID [2022-04-27 10:20:55,489 INFO L290 TraceCheckUtils]: 33: Hoare triple {16859#(and (exists ((|main_~#Dest~0.base| Int) (|main_~#Dest~0.offset| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (< 0 (+ v_main_~i~0_130 1)))))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16859#(and (exists ((|main_~#Dest~0.base| Int) (|main_~#Dest~0.offset| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (< 0 (+ v_main_~i~0_130 1)))))} is VALID [2022-04-27 10:20:55,490 INFO L290 TraceCheckUtils]: 34: Hoare triple {16859#(and (exists ((|main_~#Dest~0.base| Int) (|main_~#Dest~0.offset| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (< 0 (+ v_main_~i~0_130 1)))))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {16859#(and (exists ((|main_~#Dest~0.base| Int) (|main_~#Dest~0.offset| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (< 0 (+ v_main_~i~0_130 1)))))} is VALID [2022-04-27 10:20:55,490 INFO L290 TraceCheckUtils]: 35: Hoare triple {16859#(and (exists ((|main_~#Dest~0.base| Int) (|main_~#Dest~0.offset| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (< 0 (+ v_main_~i~0_130 1)))))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {16859#(and (exists ((|main_~#Dest~0.base| Int) (|main_~#Dest~0.offset| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (< 0 (+ v_main_~i~0_130 1)))))} is VALID [2022-04-27 10:20:55,491 INFO L290 TraceCheckUtils]: 36: Hoare triple {16859#(and (exists ((|main_~#Dest~0.base| Int) (|main_~#Dest~0.offset| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (< 0 (+ v_main_~i~0_130 1)))))} assume !(~i~0 < ~edgecount~0); {16859#(and (exists ((|main_~#Dest~0.base| Int) (|main_~#Dest~0.offset| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (< 0 (+ v_main_~i~0_130 1)))))} is VALID [2022-04-27 10:20:55,492 INFO L290 TraceCheckUtils]: 37: Hoare triple {16859#(and (exists ((|main_~#Dest~0.base| Int) (|main_~#Dest~0.offset| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (< 0 (+ v_main_~i~0_130 1)))))} ~i~0 := 0; {16896#(and (exists ((|main_~#Dest~0.base| Int) (|main_~#Dest~0.offset| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (< 0 (+ v_main_~i~0_130 1)))) (= main_~i~0 0))} is VALID [2022-04-27 10:20:55,492 INFO L290 TraceCheckUtils]: 38: Hoare triple {16896#(and (exists ((|main_~#Dest~0.base| Int) (|main_~#Dest~0.offset| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|))))) (exists ((v_main_~i~0_130 Int)) (and (< v_main_~i~0_130 1) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_130)))) (< 0 (+ v_main_~i~0_130 1)))) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16900#(<= 0 |main_#t~mem21|)} is VALID [2022-04-27 10:20:55,493 INFO L272 TraceCheckUtils]: 39: Hoare triple {16900#(<= 0 |main_#t~mem21|)} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {16904#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:20:55,493 INFO L290 TraceCheckUtils]: 40: Hoare triple {16904#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16908#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:20:55,493 INFO L290 TraceCheckUtils]: 41: Hoare triple {16908#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16752#false} is VALID [2022-04-27 10:20:55,493 INFO L290 TraceCheckUtils]: 42: Hoare triple {16752#false} assume !false; {16752#false} is VALID [2022-04-27 10:20:55,494 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 10:20:55,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:21:12,911 INFO L290 TraceCheckUtils]: 42: Hoare triple {16752#false} assume !false; {16752#false} is VALID [2022-04-27 10:21:12,911 INFO L290 TraceCheckUtils]: 41: Hoare triple {16908#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16752#false} is VALID [2022-04-27 10:21:12,911 INFO L290 TraceCheckUtils]: 40: Hoare triple {16904#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16908#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:21:12,912 INFO L272 TraceCheckUtils]: 39: Hoare triple {16900#(<= 0 |main_#t~mem21|)} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {16904#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:21:12,912 INFO L290 TraceCheckUtils]: 38: Hoare triple {16927#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {16900#(<= 0 |main_#t~mem21|)} is VALID [2022-04-27 10:21:12,913 INFO L290 TraceCheckUtils]: 37: Hoare triple {16931#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} ~i~0 := 0; {16927#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))))} is VALID [2022-04-27 10:21:12,913 INFO L290 TraceCheckUtils]: 36: Hoare triple {16931#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !(~i~0 < ~edgecount~0); {16931#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:21:12,913 INFO L290 TraceCheckUtils]: 35: Hoare triple {16931#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {16931#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:21:12,913 INFO L290 TraceCheckUtils]: 34: Hoare triple {16931#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {16931#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:21:12,914 INFO L290 TraceCheckUtils]: 33: Hoare triple {16931#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16931#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:21:12,914 INFO L290 TraceCheckUtils]: 32: Hoare triple {16931#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {16931#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:21:12,914 INFO L290 TraceCheckUtils]: 31: Hoare triple {16931#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {16931#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:21:12,914 INFO L290 TraceCheckUtils]: 30: Hoare triple {16931#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16931#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:21:12,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {16931#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {16931#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:21:12,915 INFO L290 TraceCheckUtils]: 28: Hoare triple {16931#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {16931#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:21:12,915 INFO L290 TraceCheckUtils]: 27: Hoare triple {16931#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {16931#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:21:12,915 INFO L290 TraceCheckUtils]: 26: Hoare triple {16931#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} ~i~0 := 0; {16931#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:21:12,916 INFO L290 TraceCheckUtils]: 25: Hoare triple {16968#(or (< main_~i~0 main_~nodecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~i~0 < ~nodecount~0); {16931#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:21:12,916 INFO L290 TraceCheckUtils]: 24: Hoare triple {16972#(or (< (+ main_~i~0 1) main_~nodecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {16968#(or (< main_~i~0 main_~nodecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:21:12,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {16972#(or (< (+ main_~i~0 1) main_~nodecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~j~0 < ~edgecount~0); {16972#(or (< (+ main_~i~0 1) main_~nodecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:21:12,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {16972#(or (< (+ main_~i~0 1) main_~nodecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {16972#(or (< (+ main_~i~0 1) main_~nodecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:21:12,918 INFO L290 TraceCheckUtils]: 21: Hoare triple {16982#(or (forall ((v_ArrVal_683 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_683) |main_~#distance~0.offset|))) (< (+ main_~i~0 1) main_~nodecount~0))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {16972#(or (< (+ main_~i~0 1) main_~nodecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:21:12,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {16986#(or (forall ((v_ArrVal_683 Int) (v_main_~x~0_46 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_46 4) |main_~#distance~0.offset|) v_ArrVal_683) |main_~#distance~0.offset|)) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) v_main_~x~0_46)))) (< (+ main_~i~0 1) main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16982#(or (forall ((v_ArrVal_683 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_683) |main_~#distance~0.offset|))) (< (+ main_~i~0 1) main_~nodecount~0))} is VALID [2022-04-27 10:21:12,920 INFO L290 TraceCheckUtils]: 19: Hoare triple {16990#(or (< (+ main_~i~0 1) main_~nodecount~0) (forall ((v_ArrVal_683 Int) (v_main_~x~0_46 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_46 4) |main_~#distance~0.offset|) v_ArrVal_683) |main_~#distance~0.offset|)) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) 4 |main_~#Dest~0.offset|)) v_main_~x~0_46)))))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {16986#(or (forall ((v_ArrVal_683 Int) (v_main_~x~0_46 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_46 4) |main_~#distance~0.offset|) v_ArrVal_683) |main_~#distance~0.offset|)) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) v_main_~x~0_46)))) (< (+ main_~i~0 1) main_~nodecount~0))} is VALID [2022-04-27 10:21:12,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {16990#(or (< (+ main_~i~0 1) main_~nodecount~0) (forall ((v_ArrVal_683 Int) (v_main_~x~0_46 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_46 4) |main_~#distance~0.offset|) v_ArrVal_683) |main_~#distance~0.offset|)) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) 4 |main_~#Dest~0.offset|)) v_main_~x~0_46)))))} assume !(#t~mem13 > #t~mem11 + #t~mem12);havoc #t~mem13;havoc #t~mem11;havoc #t~mem12; {16990#(or (< (+ main_~i~0 1) main_~nodecount~0) (forall ((v_ArrVal_683 Int) (v_main_~x~0_46 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_46 4) |main_~#distance~0.offset|) v_ArrVal_683) |main_~#distance~0.offset|)) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) 4 |main_~#Dest~0.offset|)) v_main_~x~0_46)))))} is VALID [2022-04-27 10:21:12,921 INFO L290 TraceCheckUtils]: 17: Hoare triple {16990#(or (< (+ main_~i~0 1) main_~nodecount~0) (forall ((v_ArrVal_683 Int) (v_main_~x~0_46 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_46 4) |main_~#distance~0.offset|) v_ArrVal_683) |main_~#distance~0.offset|)) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) 4 |main_~#Dest~0.offset|)) v_main_~x~0_46)))))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {16990#(or (< (+ main_~i~0 1) main_~nodecount~0) (forall ((v_ArrVal_683 Int) (v_main_~x~0_46 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_46 4) |main_~#distance~0.offset|) v_ArrVal_683) |main_~#distance~0.offset|)) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) 4 |main_~#Dest~0.offset|)) v_main_~x~0_46)))))} is VALID [2022-04-27 10:21:12,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {17000#(or (< (+ main_~i~0 1) main_~nodecount~0) (forall ((v_ArrVal_683 Int) (v_main_~x~0_46 Int)) (or (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) 8 |main_~#Dest~0.offset|)) v_main_~x~0_46)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_46 4) |main_~#distance~0.offset|) v_ArrVal_683) |main_~#distance~0.offset|)))))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {16990#(or (< (+ main_~i~0 1) main_~nodecount~0) (forall ((v_ArrVal_683 Int) (v_main_~x~0_46 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_46 4) |main_~#distance~0.offset|) v_ArrVal_683) |main_~#distance~0.offset|)) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) 4 |main_~#Dest~0.offset|)) v_main_~x~0_46)))))} is VALID [2022-04-27 10:21:12,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {17000#(or (< (+ main_~i~0 1) main_~nodecount~0) (forall ((v_ArrVal_683 Int) (v_main_~x~0_46 Int)) (or (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) 8 |main_~#Dest~0.offset|)) v_main_~x~0_46)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_46 4) |main_~#distance~0.offset|) v_ArrVal_683) |main_~#distance~0.offset|)))))} assume !(#t~mem13 > #t~mem11 + #t~mem12);havoc #t~mem13;havoc #t~mem11;havoc #t~mem12; {17000#(or (< (+ main_~i~0 1) main_~nodecount~0) (forall ((v_ArrVal_683 Int) (v_main_~x~0_46 Int)) (or (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) 8 |main_~#Dest~0.offset|)) v_main_~x~0_46)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_46 4) |main_~#distance~0.offset|) v_ArrVal_683) |main_~#distance~0.offset|)))))} is VALID [2022-04-27 10:21:12,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {17000#(or (< (+ main_~i~0 1) main_~nodecount~0) (forall ((v_ArrVal_683 Int) (v_main_~x~0_46 Int)) (or (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) 8 |main_~#Dest~0.offset|)) v_main_~x~0_46)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_46 4) |main_~#distance~0.offset|) v_ArrVal_683) |main_~#distance~0.offset|)))))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {17000#(or (< (+ main_~i~0 1) main_~nodecount~0) (forall ((v_ArrVal_683 Int) (v_main_~x~0_46 Int)) (or (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) 8 |main_~#Dest~0.offset|)) v_main_~x~0_46)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_46 4) |main_~#distance~0.offset|) v_ArrVal_683) |main_~#distance~0.offset|)))))} is VALID [2022-04-27 10:21:12,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {17010#(or (< (+ main_~i~0 1) main_~nodecount~0) (forall ((v_ArrVal_683 Int) (v_main_~x~0_46 Int)) (or (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) v_main_~x~0_46)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_46 4) |main_~#distance~0.offset|) v_ArrVal_683) |main_~#distance~0.offset|)))) (not (< main_~i~0 main_~nodecount~0)))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {17000#(or (< (+ main_~i~0 1) main_~nodecount~0) (forall ((v_ArrVal_683 Int) (v_main_~x~0_46 Int)) (or (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) 8 |main_~#Dest~0.offset|)) v_main_~x~0_46)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_46 4) |main_~#distance~0.offset|) v_ArrVal_683) |main_~#distance~0.offset|)))))} is VALID [2022-04-27 10:21:12,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {17014#(or (not (< 0 main_~nodecount~0)) (< 1 main_~nodecount~0) (forall ((v_ArrVal_683 Int) (v_main_~x~0_46 Int)) (or (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) v_main_~x~0_46)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_46 4) |main_~#distance~0.offset|) v_ArrVal_683) |main_~#distance~0.offset|)))))} ~i~0 := 0; {17010#(or (< (+ main_~i~0 1) main_~nodecount~0) (forall ((v_ArrVal_683 Int) (v_main_~x~0_46 Int)) (or (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) v_main_~x~0_46)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_46 4) |main_~#distance~0.offset|) v_ArrVal_683) |main_~#distance~0.offset|)))) (not (< main_~i~0 main_~nodecount~0)))} is VALID [2022-04-27 10:21:12,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {17018#(or (not (< 0 main_~nodecount~0)) (< 1 main_~nodecount~0) (< main_~i~0 main_~nodecount~0) (forall ((v_ArrVal_683 Int) (v_main_~x~0_46 Int)) (or (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) v_main_~x~0_46)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_46 4) |main_~#distance~0.offset|) v_ArrVal_683) |main_~#distance~0.offset|)))))} assume !(~i~0 < ~nodecount~0); {17014#(or (not (< 0 main_~nodecount~0)) (< 1 main_~nodecount~0) (forall ((v_ArrVal_683 Int) (v_main_~x~0_46 Int)) (or (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) v_main_~x~0_46)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_46 4) |main_~#distance~0.offset|) v_ArrVal_683) |main_~#distance~0.offset|)))))} is VALID [2022-04-27 10:21:12,925 INFO L290 TraceCheckUtils]: 10: Hoare triple {17022#(or (not (< 0 main_~nodecount~0)) (< 1 main_~nodecount~0) (< (+ main_~i~0 1) main_~nodecount~0) (forall ((v_ArrVal_683 Int) (v_main_~x~0_46 Int)) (or (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) v_main_~x~0_46)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_46 4) |main_~#distance~0.offset|) v_ArrVal_683) |main_~#distance~0.offset|)))))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {17018#(or (not (< 0 main_~nodecount~0)) (< 1 main_~nodecount~0) (< main_~i~0 main_~nodecount~0) (forall ((v_ArrVal_683 Int) (v_main_~x~0_46 Int)) (or (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) v_main_~x~0_46)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_46 4) |main_~#distance~0.offset|) v_ArrVal_683) |main_~#distance~0.offset|)))))} is VALID [2022-04-27 10:21:14,753 WARN L290 TraceCheckUtils]: 9: Hoare triple {17026#(or (not (< 0 main_~nodecount~0)) (< 1 main_~nodecount~0) (< (+ main_~i~0 1) main_~nodecount~0) (forall ((|main_~#distance~0.offset| Int) (v_ArrVal_683 Int) (v_ArrVal_681 Int) (v_main_~x~0_46 Int)) (or (not (<= 0 v_ArrVal_681)) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_681) (+ (* v_main_~x~0_46 4) |main_~#distance~0.offset|) v_ArrVal_683) |main_~#distance~0.offset|)) (not (<= (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_681)) |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) v_main_~x~0_46)))))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {17022#(or (not (< 0 main_~nodecount~0)) (< 1 main_~nodecount~0) (< (+ main_~i~0 1) main_~nodecount~0) (forall ((v_ArrVal_683 Int) (v_main_~x~0_46 Int)) (or (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) v_main_~x~0_46)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_46 4) |main_~#distance~0.offset|) v_ArrVal_683) |main_~#distance~0.offset|)))))} is UNKNOWN [2022-04-27 10:21:14,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {17030#(forall ((main_~i~0 Int) (|main_~#distance~0.offset| Int) (v_ArrVal_683 Int) (v_ArrVal_681 Int) (v_main_~x~0_46 Int)) (or (not (<= 0 v_ArrVal_681)) (<= (+ main_~i~0 1) 0) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_681) (+ (* v_main_~x~0_46 4) |main_~#distance~0.offset|) v_ArrVal_683) |main_~#distance~0.offset|)) (not (<= (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_681)) |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) v_main_~x~0_46)) (<= 1 main_~i~0)))} assume !!(~i~0 < ~nodecount~0); {17026#(or (not (< 0 main_~nodecount~0)) (< 1 main_~nodecount~0) (< (+ main_~i~0 1) main_~nodecount~0) (forall ((|main_~#distance~0.offset| Int) (v_ArrVal_683 Int) (v_ArrVal_681 Int) (v_main_~x~0_46 Int)) (or (not (<= 0 v_ArrVal_681)) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_681) (+ (* v_main_~x~0_46 4) |main_~#distance~0.offset|) v_ArrVal_683) |main_~#distance~0.offset|)) (not (<= (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_681)) |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) v_main_~x~0_46)))))} is VALID [2022-04-27 10:21:14,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {16751#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {17030#(forall ((main_~i~0 Int) (|main_~#distance~0.offset| Int) (v_ArrVal_683 Int) (v_ArrVal_681 Int) (v_main_~x~0_46 Int)) (or (not (<= 0 v_ArrVal_681)) (<= (+ main_~i~0 1) 0) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_681) (+ (* v_main_~x~0_46 4) |main_~#distance~0.offset|) v_ArrVal_683) |main_~#distance~0.offset|)) (not (<= (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_681)) |main_~#Dest~0.base|) (+ 8 |main_~#Dest~0.offset|)) v_main_~x~0_46)) (<= 1 main_~i~0)))} is VALID [2022-04-27 10:21:14,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {16751#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {16751#true} is VALID [2022-04-27 10:21:14,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {16751#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {16751#true} is VALID [2022-04-27 10:21:14,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {16751#true} call #t~ret22 := main(); {16751#true} is VALID [2022-04-27 10:21:14,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16751#true} {16751#true} #123#return; {16751#true} is VALID [2022-04-27 10:21:14,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {16751#true} assume true; {16751#true} is VALID [2022-04-27 10:21:14,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {16751#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {16751#true} is VALID [2022-04-27 10:21:14,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {16751#true} call ULTIMATE.init(); {16751#true} is VALID [2022-04-27 10:21:14,759 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 10:21:14,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863165193] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:21:14,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:21:14,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 19] total 46 [2022-04-27 10:21:14,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367312519] [2022-04-27 10:21:14,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:21:14,759 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-27 10:21:14,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:21:14,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:16,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 93 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:16,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-27 10:21:16,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:21:16,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-27 10:21:16,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1782, Unknown=18, NotChecked=0, Total=2070 [2022-04-27 10:21:16,495 INFO L87 Difference]: Start difference. First operand 231 states and 293 transitions. Second operand has 46 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:31,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:31,818 INFO L93 Difference]: Finished difference Result 260 states and 325 transitions. [2022-04-27 10:21:31,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-27 10:21:31,819 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-27 10:21:31,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:21:31,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:31,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 82 transitions. [2022-04-27 10:21:31,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:31,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 82 transitions. [2022-04-27 10:21:31,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 82 transitions. [2022-04-27 10:21:32,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 81 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:32,680 INFO L225 Difference]: With dead ends: 260 [2022-04-27 10:21:32,681 INFO L226 Difference]: Without dead ends: 238 [2022-04-27 10:21:32,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1214 ImplicationChecksByTransitivity, 29.9s TimeCoverageRelationStatistics Valid=620, Invalid=3514, Unknown=26, NotChecked=0, Total=4160 [2022-04-27 10:21:32,682 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 103 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 587 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:21:32,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 206 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 371 Invalid, 0 Unknown, 587 Unchecked, 0.3s Time] [2022-04-27 10:21:32,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-04-27 10:21:33,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2022-04-27 10:21:33,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:21:33,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states. Second operand has 234 states, 223 states have (on average 1.2869955156950672) internal successors, (287), 225 states have internal predecessors, (287), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:21:33,215 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand has 234 states, 223 states have (on average 1.2869955156950672) internal successors, (287), 225 states have internal predecessors, (287), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:21:33,215 INFO L87 Difference]: Start difference. First operand 238 states. Second operand has 234 states, 223 states have (on average 1.2869955156950672) internal successors, (287), 225 states have internal predecessors, (287), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:21:33,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:33,218 INFO L93 Difference]: Finished difference Result 238 states and 302 transitions. [2022-04-27 10:21:33,219 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 302 transitions. [2022-04-27 10:21:33,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:33,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:33,219 INFO L74 IsIncluded]: Start isIncluded. First operand has 234 states, 223 states have (on average 1.2869955156950672) internal successors, (287), 225 states have internal predecessors, (287), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 238 states. [2022-04-27 10:21:33,220 INFO L87 Difference]: Start difference. First operand has 234 states, 223 states have (on average 1.2869955156950672) internal successors, (287), 225 states have internal predecessors, (287), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 238 states. [2022-04-27 10:21:33,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:33,223 INFO L93 Difference]: Finished difference Result 238 states and 302 transitions. [2022-04-27 10:21:33,223 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 302 transitions. [2022-04-27 10:21:33,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:33,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:33,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:21:33,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:21:33,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 223 states have (on average 1.2869955156950672) internal successors, (287), 225 states have internal predecessors, (287), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:21:33,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 297 transitions. [2022-04-27 10:21:33,228 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 297 transitions. Word has length 43 [2022-04-27 10:21:33,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:21:33,229 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 297 transitions. [2022-04-27 10:21:33,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:33,229 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 297 transitions. [2022-04-27 10:21:33,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 10:21:33,230 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:21:33,230 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:21:33,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-27 10:21:33,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:21:33,452 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:21:33,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:21:33,452 INFO L85 PathProgramCache]: Analyzing trace with hash -976653666, now seen corresponding path program 3 times [2022-04-27 10:21:33,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:21:33,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92592362] [2022-04-27 10:21:33,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:21:33,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:21:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:33,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:21:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:33,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {18286#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {18274#true} is VALID [2022-04-27 10:21:33,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {18274#true} assume true; {18274#true} is VALID [2022-04-27 10:21:33,543 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18274#true} {18274#true} #123#return; {18274#true} is VALID [2022-04-27 10:21:33,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {18274#true} call ULTIMATE.init(); {18286#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:21:33,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {18286#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {18274#true} is VALID [2022-04-27 10:21:33,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {18274#true} assume true; {18274#true} is VALID [2022-04-27 10:21:33,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18274#true} {18274#true} #123#return; {18274#true} is VALID [2022-04-27 10:21:33,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {18274#true} call #t~ret22 := main(); {18274#true} is VALID [2022-04-27 10:21:33,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {18274#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {18274#true} is VALID [2022-04-27 10:21:33,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {18274#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {18274#true} is VALID [2022-04-27 10:21:33,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {18274#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {18279#(= main_~i~0 0)} is VALID [2022-04-27 10:21:33,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {18279#(= main_~i~0 0)} assume !!(~i~0 < ~nodecount~0); {18279#(= main_~i~0 0)} is VALID [2022-04-27 10:21:33,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {18279#(= main_~i~0 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18279#(= main_~i~0 0)} is VALID [2022-04-27 10:21:33,546 INFO L290 TraceCheckUtils]: 10: Hoare triple {18279#(= main_~i~0 0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {18280#(<= 1 main_~i~0)} is VALID [2022-04-27 10:21:33,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {18280#(<= 1 main_~i~0)} assume !!(~i~0 < ~nodecount~0); {18280#(<= 1 main_~i~0)} is VALID [2022-04-27 10:21:33,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {18280#(<= 1 main_~i~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18280#(<= 1 main_~i~0)} is VALID [2022-04-27 10:21:33,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {18280#(<= 1 main_~i~0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {18281#(<= 2 main_~i~0)} is VALID [2022-04-27 10:21:33,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {18281#(<= 2 main_~i~0)} assume !!(~i~0 < ~nodecount~0); {18282#(<= 3 main_~nodecount~0)} is VALID [2022-04-27 10:21:33,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {18282#(<= 3 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18282#(<= 3 main_~nodecount~0)} is VALID [2022-04-27 10:21:33,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {18282#(<= 3 main_~nodecount~0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {18282#(<= 3 main_~nodecount~0)} is VALID [2022-04-27 10:21:33,548 INFO L290 TraceCheckUtils]: 17: Hoare triple {18282#(<= 3 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {18282#(<= 3 main_~nodecount~0)} is VALID [2022-04-27 10:21:33,549 INFO L290 TraceCheckUtils]: 18: Hoare triple {18282#(<= 3 main_~nodecount~0)} ~i~0 := 0; {18283#(and (<= 3 main_~nodecount~0) (= main_~i~0 0))} is VALID [2022-04-27 10:21:33,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {18283#(and (<= 3 main_~nodecount~0) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {18283#(and (<= 3 main_~nodecount~0) (= main_~i~0 0))} is VALID [2022-04-27 10:21:33,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {18283#(and (<= 3 main_~nodecount~0) (= main_~i~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18283#(and (<= 3 main_~nodecount~0) (= main_~i~0 0))} is VALID [2022-04-27 10:21:33,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {18283#(and (<= 3 main_~nodecount~0) (= main_~i~0 0))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {18283#(and (<= 3 main_~nodecount~0) (= main_~i~0 0))} is VALID [2022-04-27 10:21:33,551 INFO L290 TraceCheckUtils]: 22: Hoare triple {18283#(and (<= 3 main_~nodecount~0) (= main_~i~0 0))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {18283#(and (<= 3 main_~nodecount~0) (= main_~i~0 0))} is VALID [2022-04-27 10:21:33,551 INFO L290 TraceCheckUtils]: 23: Hoare triple {18283#(and (<= 3 main_~nodecount~0) (= main_~i~0 0))} assume !(~j~0 < ~edgecount~0); {18283#(and (<= 3 main_~nodecount~0) (= main_~i~0 0))} is VALID [2022-04-27 10:21:33,552 INFO L290 TraceCheckUtils]: 24: Hoare triple {18283#(and (<= 3 main_~nodecount~0) (= main_~i~0 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18284#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:21:33,552 INFO L290 TraceCheckUtils]: 25: Hoare triple {18284#(<= (+ main_~i~0 2) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {18284#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:21:33,552 INFO L290 TraceCheckUtils]: 26: Hoare triple {18284#(<= (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18284#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:21:33,553 INFO L290 TraceCheckUtils]: 27: Hoare triple {18284#(<= (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {18284#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:21:33,553 INFO L290 TraceCheckUtils]: 28: Hoare triple {18284#(<= (+ main_~i~0 2) main_~nodecount~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {18284#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:21:33,553 INFO L290 TraceCheckUtils]: 29: Hoare triple {18284#(<= (+ main_~i~0 2) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {18284#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:21:33,554 INFO L290 TraceCheckUtils]: 30: Hoare triple {18284#(<= (+ main_~i~0 2) main_~nodecount~0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18285#(<= (+ main_~i~0 1) main_~nodecount~0)} is VALID [2022-04-27 10:21:33,554 INFO L290 TraceCheckUtils]: 31: Hoare triple {18285#(<= (+ main_~i~0 1) main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {18275#false} is VALID [2022-04-27 10:21:33,554 INFO L290 TraceCheckUtils]: 32: Hoare triple {18275#false} ~i~0 := 0; {18275#false} is VALID [2022-04-27 10:21:33,554 INFO L290 TraceCheckUtils]: 33: Hoare triple {18275#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {18275#false} is VALID [2022-04-27 10:21:33,555 INFO L290 TraceCheckUtils]: 34: Hoare triple {18275#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {18275#false} is VALID [2022-04-27 10:21:33,555 INFO L290 TraceCheckUtils]: 35: Hoare triple {18275#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {18275#false} is VALID [2022-04-27 10:21:33,555 INFO L290 TraceCheckUtils]: 36: Hoare triple {18275#false} assume !(~i~0 < ~edgecount~0); {18275#false} is VALID [2022-04-27 10:21:33,555 INFO L290 TraceCheckUtils]: 37: Hoare triple {18275#false} ~i~0 := 0; {18275#false} is VALID [2022-04-27 10:21:33,555 INFO L290 TraceCheckUtils]: 38: Hoare triple {18275#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18275#false} is VALID [2022-04-27 10:21:33,555 INFO L272 TraceCheckUtils]: 39: Hoare triple {18275#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {18275#false} is VALID [2022-04-27 10:21:33,555 INFO L290 TraceCheckUtils]: 40: Hoare triple {18275#false} ~cond := #in~cond; {18275#false} is VALID [2022-04-27 10:21:33,555 INFO L290 TraceCheckUtils]: 41: Hoare triple {18275#false} assume 0 == ~cond; {18275#false} is VALID [2022-04-27 10:21:33,555 INFO L290 TraceCheckUtils]: 42: Hoare triple {18275#false} assume !false; {18275#false} is VALID [2022-04-27 10:21:33,555 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 10:21:33,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:21:33,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92592362] [2022-04-27 10:21:33,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92592362] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:21:33,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163277520] [2022-04-27 10:21:33,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 10:21:33,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:21:33,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:21:33,560 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:21:33,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-27 10:21:33,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 10:21:33,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:21:33,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-27 10:21:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:33,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:21:33,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2022-04-27 10:21:33,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:21:33,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-04-27 10:21:34,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:21:34,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:21:34,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-04-27 10:21:34,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:21:34,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:21:34,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-04-27 10:21:34,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:21:34,388 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-04-27 10:21:34,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2022-04-27 10:21:34,661 INFO L356 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-04-27 10:21:34,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2022-04-27 10:21:38,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-04-27 10:21:38,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {18274#true} call ULTIMATE.init(); {18274#true} is VALID [2022-04-27 10:21:38,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {18274#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {18274#true} is VALID [2022-04-27 10:21:38,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {18274#true} assume true; {18274#true} is VALID [2022-04-27 10:21:38,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18274#true} {18274#true} #123#return; {18274#true} is VALID [2022-04-27 10:21:38,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {18274#true} call #t~ret22 := main(); {18274#true} is VALID [2022-04-27 10:21:38,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {18274#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {18274#true} is VALID [2022-04-27 10:21:38,099 INFO L290 TraceCheckUtils]: 6: Hoare triple {18274#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {18274#true} is VALID [2022-04-27 10:21:38,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {18274#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {18311#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0))} is VALID [2022-04-27 10:21:38,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {18311#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0))} assume !!(~i~0 < ~nodecount~0); {18311#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0))} is VALID [2022-04-27 10:21:38,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {18311#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18318#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)))) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0))} is VALID [2022-04-27 10:21:38,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {18318#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)))) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {18322#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:21:38,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {18322#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~nodecount~0); {18322#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:21:38,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {18322#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18322#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:21:38,107 INFO L290 TraceCheckUtils]: 13: Hoare triple {18322#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (<= 1 main_~i~0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {18332#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (<= 2 main_~i~0) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:21:38,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {18332#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (<= 2 main_~i~0) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~nodecount~0); {18332#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (<= 2 main_~i~0) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:21:38,108 INFO L290 TraceCheckUtils]: 15: Hoare triple {18332#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (<= 2 main_~i~0) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18339#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:21:38,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {18339#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {18339#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:21:38,109 INFO L290 TraceCheckUtils]: 17: Hoare triple {18339#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~i~0 < ~nodecount~0); {18339#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:21:38,110 INFO L290 TraceCheckUtils]: 18: Hoare triple {18339#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} ~i~0 := 0; {18339#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:21:38,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {18339#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {18352#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:21:38,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {18352#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18356#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) main_~x~0) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:21:38,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {18356#(and (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) main_~x~0) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {18339#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:21:38,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {18339#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {18339#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:21:38,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {18339#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~j~0 < ~edgecount~0); {18339#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:21:38,113 INFO L290 TraceCheckUtils]: 24: Hoare triple {18339#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18339#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:21:38,114 INFO L290 TraceCheckUtils]: 25: Hoare triple {18339#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {18339#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:21:38,115 INFO L290 TraceCheckUtils]: 26: Hoare triple {18339#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (= |main_~#distance~0.offset| 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ 40 |main_~#Dest~0.offset|)) 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18375#(and (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1) (= (select (select |#memory_int| |main_~#Dest~0.base|) 40) 0) (= main_~x~0 (select (select |#memory_int| |main_~#Dest~0.base|) (* main_~j~0 4))))) (= |main_~#distance~0.offset| 0) (< main_~j~0 main_~edgecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:21:38,116 INFO L290 TraceCheckUtils]: 27: Hoare triple {18375#(and (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1) (= (select (select |#memory_int| |main_~#Dest~0.base|) 40) 0) (= main_~x~0 (select (select |#memory_int| |main_~#Dest~0.base|) (* main_~j~0 4))))) (= |main_~#distance~0.offset| 0) (< main_~j~0 main_~edgecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {18379#(and (exists ((|main_~#Dest~0.base| Int)) (and (or (= |main_~#distance~0.offset| (+ |main_~#distance~0.offset| (* 4 (select (select |#memory_int| |main_~#Dest~0.base|) (* main_~j~0 4))))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1) (= (select (select |#memory_int| |main_~#Dest~0.base|) 40) 0))) (= |main_~#distance~0.offset| 0) (< main_~j~0 main_~edgecount~0))} is VALID [2022-04-27 10:21:38,117 INFO L290 TraceCheckUtils]: 28: Hoare triple {18379#(and (exists ((|main_~#Dest~0.base| Int)) (and (or (= |main_~#distance~0.offset| (+ |main_~#distance~0.offset| (* 4 (select (select |#memory_int| |main_~#Dest~0.base|) (* main_~j~0 4))))) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1) (= (select (select |#memory_int| |main_~#Dest~0.base|) 40) 0))) (= |main_~#distance~0.offset| 0) (< main_~j~0 main_~edgecount~0))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {18383#(and (exists ((|main_~#Dest~0.base| Int) (v_main_~j~0_63 Int)) (and (<= main_~j~0 (+ v_main_~j~0_63 1)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1) (< v_main_~j~0_63 main_~edgecount~0) (= (select (select |#memory_int| |main_~#Dest~0.base|) 40) 0) (or (= (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (* v_main_~j~0_63 4)) 4)) |main_~#distance~0.offset|) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))))) (= |main_~#distance~0.offset| 0))} is VALID [2022-04-27 10:21:38,118 INFO L290 TraceCheckUtils]: 29: Hoare triple {18383#(and (exists ((|main_~#Dest~0.base| Int) (v_main_~j~0_63 Int)) (and (<= main_~j~0 (+ v_main_~j~0_63 1)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1) (< v_main_~j~0_63 main_~edgecount~0) (= (select (select |#memory_int| |main_~#Dest~0.base|) 40) 0) (or (= (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (* v_main_~j~0_63 4)) 4)) |main_~#distance~0.offset|) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))))) (= |main_~#distance~0.offset| 0))} assume !(~j~0 < ~edgecount~0); {18387#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int) (v_main_~j~0_63 Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1) (<= main_~edgecount~0 (+ v_main_~j~0_63 1)) (< v_main_~j~0_63 main_~edgecount~0) (= (select (select |#memory_int| |main_~#Dest~0.base|) 40) 0) (or (= (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (* v_main_~j~0_63 4)) 4)) |main_~#distance~0.offset|) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))))))} is VALID [2022-04-27 10:21:38,118 INFO L290 TraceCheckUtils]: 30: Hoare triple {18387#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int) (v_main_~j~0_63 Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1) (<= main_~edgecount~0 (+ v_main_~j~0_63 1)) (< v_main_~j~0_63 main_~edgecount~0) (= (select (select |#memory_int| |main_~#Dest~0.base|) 40) 0) (or (= (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (* v_main_~j~0_63 4)) 4)) |main_~#distance~0.offset|) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))))))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18387#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int) (v_main_~j~0_63 Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1) (<= main_~edgecount~0 (+ v_main_~j~0_63 1)) (< v_main_~j~0_63 main_~edgecount~0) (= (select (select |#memory_int| |main_~#Dest~0.base|) 40) 0) (or (= (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (* v_main_~j~0_63 4)) 4)) |main_~#distance~0.offset|) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))))))} is VALID [2022-04-27 10:21:38,119 INFO L290 TraceCheckUtils]: 31: Hoare triple {18387#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int) (v_main_~j~0_63 Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1) (<= main_~edgecount~0 (+ v_main_~j~0_63 1)) (< v_main_~j~0_63 main_~edgecount~0) (= (select (select |#memory_int| |main_~#Dest~0.base|) 40) 0) (or (= (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (* v_main_~j~0_63 4)) 4)) |main_~#distance~0.offset|) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))))))} assume !(~i~0 < ~nodecount~0); {18387#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int) (v_main_~j~0_63 Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1) (<= main_~edgecount~0 (+ v_main_~j~0_63 1)) (< v_main_~j~0_63 main_~edgecount~0) (= (select (select |#memory_int| |main_~#Dest~0.base|) 40) 0) (or (= (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (* v_main_~j~0_63 4)) 4)) |main_~#distance~0.offset|) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))))))} is VALID [2022-04-27 10:21:38,120 INFO L290 TraceCheckUtils]: 32: Hoare triple {18387#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int) (v_main_~j~0_63 Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1) (<= main_~edgecount~0 (+ v_main_~j~0_63 1)) (< v_main_~j~0_63 main_~edgecount~0) (= (select (select |#memory_int| |main_~#Dest~0.base|) 40) 0) (or (= (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (* v_main_~j~0_63 4)) 4)) |main_~#distance~0.offset|) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))))))} ~i~0 := 0; {18397#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int) (v_main_~j~0_63 Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1) (<= main_~edgecount~0 (+ v_main_~j~0_63 1)) (< v_main_~j~0_63 main_~edgecount~0) (= (select (select |#memory_int| |main_~#Dest~0.base|) 40) 0) (or (= (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (* v_main_~j~0_63 4)) 4)) |main_~#distance~0.offset|) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))))) (= main_~i~0 0))} is VALID [2022-04-27 10:21:38,122 INFO L290 TraceCheckUtils]: 33: Hoare triple {18397#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int) (v_main_~j~0_63 Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1) (<= main_~edgecount~0 (+ v_main_~j~0_63 1)) (< v_main_~j~0_63 main_~edgecount~0) (= (select (select |#memory_int| |main_~#Dest~0.base|) 40) 0) (or (= (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (* v_main_~j~0_63 4)) 4)) |main_~#distance~0.offset|) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))))) (= main_~i~0 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {18401#(and (= |main_~#distance~0.offset| 0) (< main_~i~0 main_~edgecount~0) (exists ((|main_~#Dest~0.base| Int) (v_main_~j~0_63 Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1) (<= main_~edgecount~0 (+ v_main_~j~0_63 1)) (< v_main_~j~0_63 main_~edgecount~0) (= (select (select |#memory_int| |main_~#Dest~0.base|) 40) 0) (or (= (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (* v_main_~j~0_63 4)) 4)) |main_~#distance~0.offset|) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))))) (= main_~i~0 0))} is VALID [2022-04-27 10:21:38,122 INFO L290 TraceCheckUtils]: 34: Hoare triple {18401#(and (= |main_~#distance~0.offset| 0) (< main_~i~0 main_~edgecount~0) (exists ((|main_~#Dest~0.base| Int) (v_main_~j~0_63 Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1) (<= main_~edgecount~0 (+ v_main_~j~0_63 1)) (< v_main_~j~0_63 main_~edgecount~0) (= (select (select |#memory_int| |main_~#Dest~0.base|) 40) 0) (or (= (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (* v_main_~j~0_63 4)) 4)) |main_~#distance~0.offset|) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))))) (= main_~i~0 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {18401#(and (= |main_~#distance~0.offset| 0) (< main_~i~0 main_~edgecount~0) (exists ((|main_~#Dest~0.base| Int) (v_main_~j~0_63 Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1) (<= main_~edgecount~0 (+ v_main_~j~0_63 1)) (< v_main_~j~0_63 main_~edgecount~0) (= (select (select |#memory_int| |main_~#Dest~0.base|) 40) 0) (or (= (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (* v_main_~j~0_63 4)) 4)) |main_~#distance~0.offset|) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))))) (= main_~i~0 0))} is VALID [2022-04-27 10:21:38,123 INFO L290 TraceCheckUtils]: 35: Hoare triple {18401#(and (= |main_~#distance~0.offset| 0) (< main_~i~0 main_~edgecount~0) (exists ((|main_~#Dest~0.base| Int) (v_main_~j~0_63 Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1) (<= main_~edgecount~0 (+ v_main_~j~0_63 1)) (< v_main_~j~0_63 main_~edgecount~0) (= (select (select |#memory_int| |main_~#Dest~0.base|) 40) 0) (or (= (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (* v_main_~j~0_63 4)) 4)) |main_~#distance~0.offset|) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))))) (= main_~i~0 0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {18408#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int) (v_main_~j~0_63 Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1) (<= main_~edgecount~0 (+ v_main_~j~0_63 1)) (< v_main_~j~0_63 main_~edgecount~0) (= (select (select |#memory_int| |main_~#Dest~0.base|) 40) 0) (or (= (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (* v_main_~j~0_63 4)) 4)) |main_~#distance~0.offset|) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))))) (<= main_~i~0 1) (< 0 main_~edgecount~0))} is VALID [2022-04-27 10:21:38,124 INFO L290 TraceCheckUtils]: 36: Hoare triple {18408#(and (= |main_~#distance~0.offset| 0) (exists ((|main_~#Dest~0.base| Int) (v_main_~j~0_63 Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1) (<= main_~edgecount~0 (+ v_main_~j~0_63 1)) (< v_main_~j~0_63 main_~edgecount~0) (= (select (select |#memory_int| |main_~#Dest~0.base|) 40) 0) (or (= (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (* v_main_~j~0_63 4)) 4)) |main_~#distance~0.offset|) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))))) (<= main_~i~0 1) (< 0 main_~edgecount~0))} assume !(~i~0 < ~edgecount~0); {18412#(and (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1) (= (select (select |#memory_int| |main_~#Dest~0.base|) 40) 0))) (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:21:38,125 INFO L290 TraceCheckUtils]: 37: Hoare triple {18412#(and (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1) (= (select (select |#memory_int| |main_~#Dest~0.base|) 40) 0))) (= |main_~#distance~0.offset| 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} ~i~0 := 0; {18416#(and (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1) (= (select (select |#memory_int| |main_~#Dest~0.base|) 40) 0))) (= |main_~#distance~0.offset| 0) (= main_~i~0 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:21:38,125 INFO L290 TraceCheckUtils]: 38: Hoare triple {18416#(and (exists ((|main_~#Dest~0.base| Int)) (and (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) 0) 1) (= (select (select |#memory_int| |main_~#Dest~0.base|) 40) 0))) (= |main_~#distance~0.offset| 0) (= main_~i~0 0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18420#(<= 0 |main_#t~mem21|)} is VALID [2022-04-27 10:21:38,126 INFO L272 TraceCheckUtils]: 39: Hoare triple {18420#(<= 0 |main_#t~mem21|)} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {18424#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:21:38,126 INFO L290 TraceCheckUtils]: 40: Hoare triple {18424#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18428#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:21:38,126 INFO L290 TraceCheckUtils]: 41: Hoare triple {18428#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18275#false} is VALID [2022-04-27 10:21:38,127 INFO L290 TraceCheckUtils]: 42: Hoare triple {18275#false} assume !false; {18275#false} is VALID [2022-04-27 10:21:38,127 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 10:21:38,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:21:47,007 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~x~0_52 Int)) (or (forall ((v_ArrVal_742 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (<= 0 (select (let ((.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_52 4) |c_main_~#distance~0.offset|) v_ArrVal_742))) (store .cse0 (+ (* 4 (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse0) |c_main_~#Dest~0.base|) (+ (* main_~j~0 4) |c_main_~#Dest~0.offset|))) |c_main_~#distance~0.offset|) v_ArrVal_744)) |c_main_~#distance~0.offset|)))) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)) v_main_~x~0_52)))) is different from false [2022-04-27 10:21:48,233 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (<= 0 (select (let ((.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_52 4) |c_main_~#distance~0.offset|) v_ArrVal_742))) (store .cse0 (+ (* 4 (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse0) |c_main_~#Dest~0.base|) (+ (* main_~j~0 4) |c_main_~#Dest~0.offset|))) |c_main_~#distance~0.offset|) v_ArrVal_744)) |c_main_~#distance~0.offset|)) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_52)))) is different from false [2022-04-27 10:21:51,656 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 Int) (v_ArrVal_741 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|) v_ArrVal_741))) (or (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (<= 0 (select (let ((.cse0 (store .cse1 (+ (* v_main_~x~0_52 4) |c_main_~#distance~0.offset|) v_ArrVal_742))) (store .cse0 (+ (* (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse0) |c_main_~#Dest~0.base|) (+ (* main_~j~0 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_744)) |c_main_~#distance~0.offset|)) (not (<= (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse1) |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_52))))) is different from false [2022-04-27 10:21:54,879 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_151 Int)) (or (forall ((v_ArrVal_742 Int) (v_ArrVal_741 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741))) (or (<= (+ main_~j~0 1) 0) (not (<= (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse0) |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_52)) (<= 1 main_~j~0) (<= 0 (select (let ((.cse1 (store .cse0 (+ (* v_main_~x~0_52 4) |c_main_~#distance~0.offset|) v_ArrVal_742))) (store .cse1 (+ (* (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse1) |c_main_~#Dest~0.base|) (+ (* main_~j~0 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_744)) |c_main_~#distance~0.offset|))))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_151)))) is different from false [2022-04-27 10:22:49,057 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_152 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_152)) (forall ((v_ArrVal_742 Int) (v_ArrVal_741 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_main_~i~0_151 Int) (v_ArrVal_739 Int) (v_ArrVal_744 Int)) (let ((.cse0 (store (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* 4 v_main_~i~0_152) |c_main_~#distance~0.offset|) v_ArrVal_739) (+ |c_main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741))) (or (<= (+ main_~j~0 1) 0) (not (<= (+ v_main_~i~0_152 1) v_main_~i~0_151)) (<= 1 main_~j~0) (not (<= (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse0) |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_52)) (<= 0 (select (let ((.cse1 (store .cse0 (+ (* v_main_~x~0_52 4) |c_main_~#distance~0.offset|) v_ArrVal_742))) (store .cse1 (+ (* 4 (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse1) |c_main_~#Dest~0.base|) (+ (* main_~j~0 4) |c_main_~#Dest~0.offset|))) |c_main_~#distance~0.offset|) v_ArrVal_744)) |c_main_~#distance~0.offset|))))))) is different from false [2022-04-27 10:23:11,617 INFO L290 TraceCheckUtils]: 42: Hoare triple {18275#false} assume !false; {18275#false} is VALID [2022-04-27 10:23:11,618 INFO L290 TraceCheckUtils]: 41: Hoare triple {18428#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18275#false} is VALID [2022-04-27 10:23:11,618 INFO L290 TraceCheckUtils]: 40: Hoare triple {18424#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18428#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:23:11,618 INFO L272 TraceCheckUtils]: 39: Hoare triple {18420#(<= 0 |main_#t~mem21|)} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {18424#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:23:11,619 INFO L290 TraceCheckUtils]: 38: Hoare triple {18447#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18420#(<= 0 |main_#t~mem21|)} is VALID [2022-04-27 10:23:11,619 INFO L290 TraceCheckUtils]: 37: Hoare triple {18451#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} ~i~0 := 0; {18447#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4))))} is VALID [2022-04-27 10:23:11,620 INFO L290 TraceCheckUtils]: 36: Hoare triple {18455#(or (< main_~i~0 main_~edgecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(~i~0 < ~edgecount~0); {18451#(<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|))} is VALID [2022-04-27 10:23:11,620 INFO L290 TraceCheckUtils]: 35: Hoare triple {18459#(or (< (+ main_~i~0 1) main_~edgecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {18455#(or (< main_~i~0 main_~edgecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:23:11,620 INFO L290 TraceCheckUtils]: 34: Hoare triple {18459#(or (< (+ main_~i~0 1) main_~edgecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {18459#(or (< (+ main_~i~0 1) main_~edgecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:23:11,621 INFO L290 TraceCheckUtils]: 33: Hoare triple {18466#(or (not (< main_~i~0 main_~edgecount~0)) (< (+ main_~i~0 1) main_~edgecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {18459#(or (< (+ main_~i~0 1) main_~edgecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:23:11,621 INFO L290 TraceCheckUtils]: 32: Hoare triple {18470#(or (not (< 0 main_~edgecount~0)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)) (< 1 main_~edgecount~0))} ~i~0 := 0; {18466#(or (not (< main_~i~0 main_~edgecount~0)) (< (+ main_~i~0 1) main_~edgecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:23:11,622 INFO L290 TraceCheckUtils]: 31: Hoare triple {18470#(or (not (< 0 main_~edgecount~0)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)) (< 1 main_~edgecount~0))} assume !(~i~0 < ~nodecount~0); {18470#(or (not (< 0 main_~edgecount~0)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)) (< 1 main_~edgecount~0))} is VALID [2022-04-27 10:23:11,622 INFO L290 TraceCheckUtils]: 30: Hoare triple {18470#(or (not (< 0 main_~edgecount~0)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)) (< 1 main_~edgecount~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18470#(or (not (< 0 main_~edgecount~0)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)) (< 1 main_~edgecount~0))} is VALID [2022-04-27 10:23:11,622 INFO L290 TraceCheckUtils]: 29: Hoare triple {18480#(or (not (< 0 main_~edgecount~0)) (< main_~j~0 main_~edgecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)) (< 1 main_~edgecount~0))} assume !(~j~0 < ~edgecount~0); {18470#(or (not (< 0 main_~edgecount~0)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)) (< 1 main_~edgecount~0))} is VALID [2022-04-27 10:23:11,623 INFO L290 TraceCheckUtils]: 28: Hoare triple {18484#(or (< (+ main_~j~0 1) main_~edgecount~0) (not (< 0 main_~edgecount~0)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)) (< 1 main_~edgecount~0))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {18480#(or (not (< 0 main_~edgecount~0)) (< main_~j~0 main_~edgecount~0) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)) (< 1 main_~edgecount~0))} is VALID [2022-04-27 10:23:11,624 INFO L290 TraceCheckUtils]: 27: Hoare triple {18488#(or (< (+ main_~j~0 1) main_~edgecount~0) (forall ((v_ArrVal_744 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_744) |main_~#distance~0.offset|))) (not (< 0 main_~edgecount~0)) (< 1 main_~edgecount~0))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {18484#(or (< (+ main_~j~0 1) main_~edgecount~0) (not (< 0 main_~edgecount~0)) (<= 0 (select (select |#memory_int| |main_~#distance~0.base|) |main_~#distance~0.offset|)) (< 1 main_~edgecount~0))} is VALID [2022-04-27 10:23:11,627 INFO L290 TraceCheckUtils]: 26: Hoare triple {18492#(forall ((main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_744) |main_~#distance~0.offset|)) (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0)))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18488#(or (< (+ main_~j~0 1) main_~edgecount~0) (forall ((v_ArrVal_744 Int)) (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_744) |main_~#distance~0.offset|))) (not (< 0 main_~edgecount~0)) (< 1 main_~edgecount~0))} is VALID [2022-04-27 10:23:11,628 INFO L290 TraceCheckUtils]: 25: Hoare triple {18492#(forall ((main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_744) |main_~#distance~0.offset|)) (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0)))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {18492#(forall ((main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_744) |main_~#distance~0.offset|)) (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0)))} is VALID [2022-04-27 10:23:11,629 INFO L290 TraceCheckUtils]: 24: Hoare triple {18492#(forall ((main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_744) |main_~#distance~0.offset|)) (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {18492#(forall ((main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_744) |main_~#distance~0.offset|)) (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0)))} is VALID [2022-04-27 10:23:11,629 INFO L290 TraceCheckUtils]: 23: Hoare triple {18492#(forall ((main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_744) |main_~#distance~0.offset|)) (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0)))} assume !(~j~0 < ~edgecount~0); {18492#(forall ((main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_744) |main_~#distance~0.offset|)) (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0)))} is VALID [2022-04-27 10:23:11,630 INFO L290 TraceCheckUtils]: 22: Hoare triple {18492#(forall ((main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_744) |main_~#distance~0.offset|)) (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0)))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {18492#(forall ((main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_744) |main_~#distance~0.offset|)) (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0)))} is VALID [2022-04-27 10:23:11,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {18508#(forall ((v_ArrVal_742 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_742) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_742)) |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4) |main_~#distance~0.offset|) v_ArrVal_744) |main_~#distance~0.offset|))))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {18492#(forall ((main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= 0 (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_744) |main_~#distance~0.offset|)) (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0)))} is VALID [2022-04-27 10:23:11,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {18512#(forall ((v_main_~x~0_52 Int)) (or (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) v_main_~x~0_52)) (forall ((v_ArrVal_742 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742)) |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4) |main_~#distance~0.offset|) v_ArrVal_744) |main_~#distance~0.offset|))))))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {18508#(forall ((v_ArrVal_742 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_742) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_742)) |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4) |main_~#distance~0.offset|) v_ArrVal_744) |main_~#distance~0.offset|))))} is VALID [2022-04-27 10:23:11,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {18516#(forall ((v_ArrVal_742 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742)) |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4) |main_~#distance~0.offset|) v_ArrVal_744) |main_~#distance~0.offset|)) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_52))))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {18512#(forall ((v_main_~x~0_52 Int)) (or (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) v_main_~x~0_52)) (forall ((v_ArrVal_742 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742)) |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4) |main_~#distance~0.offset|) v_ArrVal_744) |main_~#distance~0.offset|))))))} is VALID [2022-04-27 10:23:11,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {18516#(forall ((v_ArrVal_742 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742)) |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4) |main_~#distance~0.offset|) v_ArrVal_744) |main_~#distance~0.offset|)) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_52))))} ~i~0 := 0; {18516#(forall ((v_ArrVal_742 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742)) |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4) |main_~#distance~0.offset|) v_ArrVal_744) |main_~#distance~0.offset|)) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_52))))} is VALID [2022-04-27 10:23:11,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {18516#(forall ((v_ArrVal_742 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742)) |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4) |main_~#distance~0.offset|) v_ArrVal_744) |main_~#distance~0.offset|)) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_52))))} assume !(~i~0 < ~nodecount~0); {18516#(forall ((v_ArrVal_742 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742)) |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4) |main_~#distance~0.offset|) v_ArrVal_744) |main_~#distance~0.offset|)) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_52))))} is VALID [2022-04-27 10:23:11,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {18516#(forall ((v_ArrVal_742 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742)) |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4) |main_~#distance~0.offset|) v_ArrVal_744) |main_~#distance~0.offset|)) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_52))))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {18516#(forall ((v_ArrVal_742 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742)) |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4) |main_~#distance~0.offset|) v_ArrVal_744) |main_~#distance~0.offset|)) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_52))))} is VALID [2022-04-27 10:23:13,642 WARN L290 TraceCheckUtils]: 15: Hoare triple {18529#(forall ((v_ArrVal_742 Int) (v_ArrVal_741 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (<= 0 (select (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_741) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_741) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742)) |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_744) |main_~#distance~0.offset|)) (not (<= (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_741)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_52))))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18516#(forall ((v_ArrVal_742 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (<= 0 (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742)) |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4) |main_~#distance~0.offset|) v_ArrVal_744) |main_~#distance~0.offset|)) (not (<= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_52))))} is UNKNOWN [2022-04-27 10:23:13,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {18529#(forall ((v_ArrVal_742 Int) (v_ArrVal_741 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (<= 0 (select (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_741) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_741) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742)) |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_744) |main_~#distance~0.offset|)) (not (<= (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_741)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_52))))} assume !!(~i~0 < ~nodecount~0); {18529#(forall ((v_ArrVal_742 Int) (v_ArrVal_741 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (<= 0 (select (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_741) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_741) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742)) |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_744) |main_~#distance~0.offset|)) (not (<= (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_741)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_52))))} is VALID [2022-04-27 10:23:13,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {18536#(forall ((v_main_~i~0_151 Int)) (or (forall ((v_ArrVal_742 Int) (v_ArrVal_741 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= 0 (select (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742)) |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4) |main_~#distance~0.offset|) v_ArrVal_744) |main_~#distance~0.offset|)) (<= (+ main_~j~0 1) 0) (not (<= (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_52)) (<= 1 main_~j~0))) (not (<= (+ main_~i~0 1) v_main_~i~0_151))))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {18529#(forall ((v_ArrVal_742 Int) (v_ArrVal_741 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (<= 0 (select (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_741) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_741) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742)) |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_744) |main_~#distance~0.offset|)) (not (<= (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_741)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_52))))} is VALID [2022-04-27 10:23:15,652 WARN L290 TraceCheckUtils]: 12: Hoare triple {18540#(forall ((v_ArrVal_742 Int) (v_ArrVal_741 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_main_~i~0_151 Int) (v_ArrVal_739 Int) (v_ArrVal_744 Int)) (or (not (<= (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_739) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_52)) (<= (+ main_~j~0 1) 0) (<= 0 (select (store (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_739) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_739) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742)) |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4) |main_~#distance~0.offset|) v_ArrVal_744) |main_~#distance~0.offset|)) (<= 1 main_~j~0) (not (<= (+ main_~i~0 1) v_main_~i~0_151))))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18536#(forall ((v_main_~i~0_151 Int)) (or (forall ((v_ArrVal_742 Int) (v_ArrVal_741 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= 0 (select (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742)) |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4) |main_~#distance~0.offset|) v_ArrVal_744) |main_~#distance~0.offset|)) (<= (+ main_~j~0 1) 0) (not (<= (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_52)) (<= 1 main_~j~0))) (not (<= (+ main_~i~0 1) v_main_~i~0_151))))} is UNKNOWN [2022-04-27 10:23:15,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {18540#(forall ((v_ArrVal_742 Int) (v_ArrVal_741 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_main_~i~0_151 Int) (v_ArrVal_739 Int) (v_ArrVal_744 Int)) (or (not (<= (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_739) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_52)) (<= (+ main_~j~0 1) 0) (<= 0 (select (store (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_739) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_739) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742)) |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4) |main_~#distance~0.offset|) v_ArrVal_744) |main_~#distance~0.offset|)) (<= 1 main_~j~0) (not (<= (+ main_~i~0 1) v_main_~i~0_151))))} assume !!(~i~0 < ~nodecount~0); {18540#(forall ((v_ArrVal_742 Int) (v_ArrVal_741 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_main_~i~0_151 Int) (v_ArrVal_739 Int) (v_ArrVal_744 Int)) (or (not (<= (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_739) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_52)) (<= (+ main_~j~0 1) 0) (<= 0 (select (store (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_739) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_739) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742)) |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4) |main_~#distance~0.offset|) v_ArrVal_744) |main_~#distance~0.offset|)) (<= 1 main_~j~0) (not (<= (+ main_~i~0 1) v_main_~i~0_151))))} is VALID [2022-04-27 10:23:15,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {18547#(forall ((v_main_~i~0_152 Int)) (or (forall ((v_ArrVal_742 Int) (v_ArrVal_741 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_main_~i~0_151 Int) (v_ArrVal_739 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (not (<= (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_main_~i~0_152) |main_~#distance~0.offset|) v_ArrVal_739) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_52)) (not (<= (+ v_main_~i~0_152 1) v_main_~i~0_151)) (<= 1 main_~j~0) (<= 0 (select (store (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_main_~i~0_152) |main_~#distance~0.offset|) v_ArrVal_739) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_main_~i~0_152) |main_~#distance~0.offset|) v_ArrVal_739) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742)) |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4) |main_~#distance~0.offset|) v_ArrVal_744) |main_~#distance~0.offset|)))) (not (<= (+ main_~i~0 1) v_main_~i~0_152))))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {18540#(forall ((v_ArrVal_742 Int) (v_ArrVal_741 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_main_~i~0_151 Int) (v_ArrVal_739 Int) (v_ArrVal_744 Int)) (or (not (<= (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_739) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_52)) (<= (+ main_~j~0 1) 0) (<= 0 (select (store (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_739) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_739) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742)) |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4) |main_~#distance~0.offset|) v_ArrVal_744) |main_~#distance~0.offset|)) (<= 1 main_~j~0) (not (<= (+ main_~i~0 1) v_main_~i~0_151))))} is VALID [2022-04-27 10:23:15,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {18551#(forall ((v_ArrVal_742 Int) (v_ArrVal_741 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_main_~i~0_151 Int) (v_main_~i~0_152 Int) (v_ArrVal_739 Int) (v_ArrVal_737 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (not (<= (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_737) (+ (* 4 v_main_~i~0_152) |main_~#distance~0.offset|) v_ArrVal_739) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_52)) (not (<= (+ v_main_~i~0_152 1) v_main_~i~0_151)) (<= 1 main_~j~0) (not (<= (+ main_~i~0 1) v_main_~i~0_152)) (not (<= 0 v_ArrVal_737)) (<= 0 (select (store (store (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_737) (+ (* 4 v_main_~i~0_152) |main_~#distance~0.offset|) v_ArrVal_739) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_737) (+ (* 4 v_main_~i~0_152) |main_~#distance~0.offset|) v_ArrVal_739) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742)) |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|))) |main_~#distance~0.offset|) v_ArrVal_744) |main_~#distance~0.offset|))))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {18547#(forall ((v_main_~i~0_152 Int)) (or (forall ((v_ArrVal_742 Int) (v_ArrVal_741 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_main_~i~0_151 Int) (v_ArrVal_739 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (not (<= (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_main_~i~0_152) |main_~#distance~0.offset|) v_ArrVal_739) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_52)) (not (<= (+ v_main_~i~0_152 1) v_main_~i~0_151)) (<= 1 main_~j~0) (<= 0 (select (store (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_main_~i~0_152) |main_~#distance~0.offset|) v_ArrVal_739) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 v_main_~i~0_152) |main_~#distance~0.offset|) v_ArrVal_739) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742)) |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4) |main_~#distance~0.offset|) v_ArrVal_744) |main_~#distance~0.offset|)))) (not (<= (+ main_~i~0 1) v_main_~i~0_152))))} is VALID [2022-04-27 10:23:15,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {18551#(forall ((v_ArrVal_742 Int) (v_ArrVal_741 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_main_~i~0_151 Int) (v_main_~i~0_152 Int) (v_ArrVal_739 Int) (v_ArrVal_737 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (not (<= (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_737) (+ (* 4 v_main_~i~0_152) |main_~#distance~0.offset|) v_ArrVal_739) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_52)) (not (<= (+ v_main_~i~0_152 1) v_main_~i~0_151)) (<= 1 main_~j~0) (not (<= (+ main_~i~0 1) v_main_~i~0_152)) (not (<= 0 v_ArrVal_737)) (<= 0 (select (store (store (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_737) (+ (* 4 v_main_~i~0_152) |main_~#distance~0.offset|) v_ArrVal_739) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_737) (+ (* 4 v_main_~i~0_152) |main_~#distance~0.offset|) v_ArrVal_739) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742)) |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|))) |main_~#distance~0.offset|) v_ArrVal_744) |main_~#distance~0.offset|))))} assume !!(~i~0 < ~nodecount~0); {18551#(forall ((v_ArrVal_742 Int) (v_ArrVal_741 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_main_~i~0_151 Int) (v_main_~i~0_152 Int) (v_ArrVal_739 Int) (v_ArrVal_737 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (not (<= (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_737) (+ (* 4 v_main_~i~0_152) |main_~#distance~0.offset|) v_ArrVal_739) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_52)) (not (<= (+ v_main_~i~0_152 1) v_main_~i~0_151)) (<= 1 main_~j~0) (not (<= (+ main_~i~0 1) v_main_~i~0_152)) (not (<= 0 v_ArrVal_737)) (<= 0 (select (store (store (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_737) (+ (* 4 v_main_~i~0_152) |main_~#distance~0.offset|) v_ArrVal_739) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_737) (+ (* 4 v_main_~i~0_152) |main_~#distance~0.offset|) v_ArrVal_739) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742)) |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|))) |main_~#distance~0.offset|) v_ArrVal_744) |main_~#distance~0.offset|))))} is VALID [2022-04-27 10:23:15,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {18274#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {18551#(forall ((v_ArrVal_742 Int) (v_ArrVal_741 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_main_~i~0_151 Int) (v_main_~i~0_152 Int) (v_ArrVal_739 Int) (v_ArrVal_737 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (not (<= (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_737) (+ (* 4 v_main_~i~0_152) |main_~#distance~0.offset|) v_ArrVal_739) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) v_main_~x~0_52)) (not (<= (+ v_main_~i~0_152 1) v_main_~i~0_151)) (<= 1 main_~j~0) (not (<= (+ main_~i~0 1) v_main_~i~0_152)) (not (<= 0 v_ArrVal_737)) (<= 0 (select (store (store (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_737) (+ (* 4 v_main_~i~0_152) |main_~#distance~0.offset|) v_ArrVal_739) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* main_~i~0 4)) v_ArrVal_737) (+ (* 4 v_main_~i~0_152) |main_~#distance~0.offset|) v_ArrVal_739) (+ |main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741) (+ (* v_main_~x~0_52 4) |main_~#distance~0.offset|) v_ArrVal_742)) |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|))) |main_~#distance~0.offset|) v_ArrVal_744) |main_~#distance~0.offset|))))} is VALID [2022-04-27 10:23:15,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {18274#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {18274#true} is VALID [2022-04-27 10:23:15,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {18274#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {18274#true} is VALID [2022-04-27 10:23:15,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {18274#true} call #t~ret22 := main(); {18274#true} is VALID [2022-04-27 10:23:15,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18274#true} {18274#true} #123#return; {18274#true} is VALID [2022-04-27 10:23:15,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {18274#true} assume true; {18274#true} is VALID [2022-04-27 10:23:15,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {18274#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {18274#true} is VALID [2022-04-27 10:23:15,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {18274#true} call ULTIMATE.init(); {18274#true} is VALID [2022-04-27 10:23:15,713 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 7 refuted. 2 times theorem prover too weak. 1 trivial. 15 not checked. [2022-04-27 10:23:15,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163277520] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:23:15,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:23:15,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 21, 23] total 47 [2022-04-27 10:23:15,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817077683] [2022-04-27 10:23:15,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:23:15,714 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.3043478260869565) internal successors, (106), 45 states have internal predecessors, (106), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-27 10:23:15,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:23:15,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 46 states have (on average 2.3043478260869565) internal successors, (106), 45 states have internal predecessors, (106), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:23:20,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 110 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 10:23:20,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-27 10:23:20,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:23:20,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-27 10:23:20,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=1440, Unknown=34, NotChecked=420, Total=2162 [2022-04-27 10:23:20,727 INFO L87 Difference]: Start difference. First operand 234 states and 297 transitions. Second operand has 47 states, 46 states have (on average 2.3043478260869565) internal successors, (106), 45 states have internal predecessors, (106), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:23:23,074 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_main_~#Dest~0.base|))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= (select .cse0 |c_main_~#Dest~0.offset|) 1) (= |c_main_~#distance~0.offset| 0) (= |c_old(~INFINITY~0)| c_~INFINITY~0) (forall ((v_main_~i~0_152 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_152)) (forall ((v_ArrVal_742 Int) (v_ArrVal_741 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_main_~i~0_151 Int) (v_ArrVal_739 Int) (v_ArrVal_744 Int)) (let ((.cse1 (store (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* 4 v_main_~i~0_152) |c_main_~#distance~0.offset|) v_ArrVal_739) (+ |c_main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741))) (or (<= (+ main_~j~0 1) 0) (not (<= (+ v_main_~i~0_152 1) v_main_~i~0_151)) (<= 1 main_~j~0) (not (<= (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse1) |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_52)) (<= 0 (select (let ((.cse2 (store .cse1 (+ (* v_main_~x~0_52 4) |c_main_~#distance~0.offset|) v_ArrVal_742))) (store .cse2 (+ (* 4 (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse2) |c_main_~#Dest~0.base|) (+ (* main_~j~0 4) |c_main_~#Dest~0.offset|))) |c_main_~#distance~0.offset|) v_ArrVal_744)) |c_main_~#distance~0.offset|))))))) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (= (select .cse0 (+ 40 |c_main_~#Dest~0.offset|)) 0) (<= (+ c_main_~i~0 1) c_main_~nodecount~0) (= |c_main_~#Dest~0.offset| 0) (= c_main_~i~0 0) (<= 0 (select (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|))) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2022-04-27 10:23:25,289 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_main_~#Dest~0.base|))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= (select .cse0 |c_main_~#Dest~0.offset|) 1) (<= 1 c_main_~i~0) (= |c_main_~#distance~0.offset| 0) (= |c_old(~INFINITY~0)| c_~INFINITY~0) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (= (select .cse0 (+ 40 |c_main_~#Dest~0.offset|)) 0) (<= (+ c_main_~i~0 1) c_main_~nodecount~0) (= |c_main_~#Dest~0.offset| 0) (forall ((v_main_~i~0_151 Int)) (or (forall ((v_ArrVal_742 Int) (v_ArrVal_741 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ |c_main_~#distance~0.offset| (* 4 v_main_~i~0_151)) v_ArrVal_741))) (or (<= (+ main_~j~0 1) 0) (not (<= (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse1) |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_52)) (<= 1 main_~j~0) (<= 0 (select (let ((.cse2 (store .cse1 (+ (* v_main_~x~0_52 4) |c_main_~#distance~0.offset|) v_ArrVal_742))) (store .cse2 (+ (* (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse2) |c_main_~#Dest~0.base|) (+ (* main_~j~0 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_744)) |c_main_~#distance~0.offset|))))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_151)))) (<= 0 (select (select |c_#memory_int| |c_main_~#distance~0.base|) |c_main_~#distance~0.offset|)) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2022-04-27 10:23:26,469 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_main_~#Dest~0.base|))) (and (= (select .cse0 |c_main_~#Dest~0.offset|) 1) (= |c_main_~#distance~0.offset| 0) (forall ((v_ArrVal_742 Int) (v_ArrVal_741 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|) v_ArrVal_741))) (or (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (<= 0 (select (let ((.cse1 (store .cse2 (+ (* v_main_~x~0_52 4) |c_main_~#distance~0.offset|) v_ArrVal_742))) (store .cse1 (+ (* (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse1) |c_main_~#Dest~0.base|) (+ (* main_~j~0 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_744)) |c_main_~#distance~0.offset|)) (not (<= (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse2) |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_52))))) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (<= 2 c_main_~i~0) (= (select .cse0 (+ 40 |c_main_~#Dest~0.offset|)) 0) (= |c_main_~#Dest~0.offset| 0) (<= 0 (select (select |c_#memory_int| |c_main_~#distance~0.base|) |c_main_~#distance~0.offset|)))) is different from false [2022-04-27 10:23:27,859 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_main_~#Dest~0.base|))) (and (= (select .cse0 |c_main_~#Dest~0.offset|) 1) (= |c_main_~#distance~0.offset| 0) (forall ((v_ArrVal_742 Int) (v_ArrVal_741 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* c_main_~i~0 4) |c_main_~#distance~0.offset|) v_ArrVal_741))) (or (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (<= 0 (select (let ((.cse1 (store .cse2 (+ (* v_main_~x~0_52 4) |c_main_~#distance~0.offset|) v_ArrVal_742))) (store .cse1 (+ (* (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse1) |c_main_~#Dest~0.base|) (+ (* main_~j~0 4) |c_main_~#Dest~0.offset|)) 4) |c_main_~#distance~0.offset|) v_ArrVal_744)) |c_main_~#distance~0.offset|)) (not (<= (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse2) |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_52))))) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (<= 2 c_main_~i~0) (= (select .cse0 (+ 40 |c_main_~#Dest~0.offset|)) 0) (= |c_main_~#Dest~0.offset| 0) (<= 3 c_main_~nodecount~0) (<= 0 (select (select |c_#memory_int| |c_main_~#distance~0.base|) |c_main_~#distance~0.offset|)))) is different from false [2022-04-27 10:23:28,715 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_main_~#Dest~0.base|))) (and (= (select .cse0 |c_main_~#Dest~0.offset|) 1) (= |c_main_~#distance~0.offset| 0) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (= (select .cse0 (+ 40 |c_main_~#Dest~0.offset|)) 0) (= |c_main_~#Dest~0.offset| 0) (forall ((v_ArrVal_742 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (<= 0 (select (let ((.cse1 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_52 4) |c_main_~#distance~0.offset|) v_ArrVal_742))) (store .cse1 (+ (* 4 (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse1) |c_main_~#Dest~0.base|) (+ (* main_~j~0 4) |c_main_~#Dest~0.offset|))) |c_main_~#distance~0.offset|) v_ArrVal_744)) |c_main_~#distance~0.offset|)) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_52)))) (<= 3 c_main_~nodecount~0) (<= 0 (select (select |c_#memory_int| |c_main_~#distance~0.base|) |c_main_~#distance~0.offset|)))) is different from false [2022-04-27 10:23:29,732 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_main_~#Dest~0.base|))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= (select .cse0 |c_main_~#Dest~0.offset|) 1) (= |c_main_~#distance~0.offset| 0) (= |c_old(~INFINITY~0)| c_~INFINITY~0) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (= (select .cse0 (+ 40 |c_main_~#Dest~0.offset|)) 0) (= |c_main_~#Dest~0.offset| 0) (= c_main_~i~0 0) (forall ((v_ArrVal_742 Int) (v_main_~x~0_52 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (<= 0 (select (let ((.cse1 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_52 4) |c_main_~#distance~0.offset|) v_ArrVal_742))) (store .cse1 (+ (* 4 (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse1) |c_main_~#Dest~0.base|) (+ (* main_~j~0 4) |c_main_~#Dest~0.offset|))) |c_main_~#distance~0.offset|) v_ArrVal_744)) |c_main_~#distance~0.offset|)) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|) v_main_~x~0_52)))) (<= 3 c_main_~nodecount~0) (<= 0 (select (select |c_#memory_int| |c_main_~#distance~0.base|) |c_main_~#distance~0.offset|)) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2022-04-27 10:23:31,832 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_main_~#Dest~0.base|))) (and (= (select .cse0 |c_main_~#Dest~0.offset|) 1) (= |c_main_~#distance~0.offset| 0) (not (= |c_main_~#distance~0.base| |c_main_~#Dest~0.base|)) (= (select .cse0 (+ 40 |c_main_~#Dest~0.offset|)) 0) (= |c_main_~#Dest~0.offset| 0) (= c_main_~i~0 0) (forall ((v_main_~x~0_52 Int)) (or (forall ((v_ArrVal_742 Int) (main_~j~0 Int) (v_ArrVal_744 Int)) (or (<= (+ main_~j~0 1) 0) (<= 1 main_~j~0) (<= 0 (select (let ((.cse1 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (+ (* v_main_~x~0_52 4) |c_main_~#distance~0.offset|) v_ArrVal_742))) (store .cse1 (+ (* 4 (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse1) |c_main_~#Dest~0.base|) (+ (* main_~j~0 4) |c_main_~#Dest~0.offset|))) |c_main_~#distance~0.offset|) v_ArrVal_744)) |c_main_~#distance~0.offset|)))) (not (<= (select (select |c_#memory_int| |c_main_~#Dest~0.base|) (+ (* c_main_~j~0 4) |c_main_~#Dest~0.offset|)) v_main_~x~0_52)))) (<= 3 c_main_~nodecount~0) (<= 0 (select (select |c_#memory_int| |c_main_~#distance~0.base|) |c_main_~#distance~0.offset|)) (= c_main_~j~0 0))) is different from false [2022-04-27 10:23:39,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:23:39,639 INFO L93 Difference]: Finished difference Result 606 states and 761 transitions. [2022-04-27 10:23:39,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2022-04-27 10:23:39,640 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.3043478260869565) internal successors, (106), 45 states have internal predecessors, (106), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-27 10:23:39,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:23:39,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 2.3043478260869565) internal successors, (106), 45 states have internal predecessors, (106), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:23:39,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 319 transitions. [2022-04-27 10:23:39,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 2.3043478260869565) internal successors, (106), 45 states have internal predecessors, (106), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:23:39,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 319 transitions. [2022-04-27 10:23:39,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 117 states and 319 transitions. [2022-04-27 10:23:40,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 319 edges. 319 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:23:40,014 INFO L225 Difference]: With dead ends: 606 [2022-04-27 10:23:40,014 INFO L226 Difference]: Without dead ends: 563 [2022-04-27 10:23:40,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 64 SyntacticMatches, 10 SemanticMatches, 149 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 7281 ImplicationChecksByTransitivity, 94.9s TimeCoverageRelationStatistics Valid=2604, Invalid=16585, Unknown=41, NotChecked=3420, Total=22650 [2022-04-27 10:23:40,020 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 382 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 3146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1726 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:23:40,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 223 Invalid, 3146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1218 Invalid, 0 Unknown, 1726 Unchecked, 1.4s Time] [2022-04-27 10:23:40,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-04-27 10:23:40,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 293. [2022-04-27 10:23:40,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:23:40,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 563 states. Second operand has 293 states, 282 states have (on average 1.301418439716312) internal successors, (367), 284 states have internal predecessors, (367), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:23:40,855 INFO L74 IsIncluded]: Start isIncluded. First operand 563 states. Second operand has 293 states, 282 states have (on average 1.301418439716312) internal successors, (367), 284 states have internal predecessors, (367), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:23:40,855 INFO L87 Difference]: Start difference. First operand 563 states. Second operand has 293 states, 282 states have (on average 1.301418439716312) internal successors, (367), 284 states have internal predecessors, (367), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:23:40,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:23:40,870 INFO L93 Difference]: Finished difference Result 563 states and 709 transitions. [2022-04-27 10:23:40,870 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 709 transitions. [2022-04-27 10:23:40,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:23:40,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:23:40,872 INFO L74 IsIncluded]: Start isIncluded. First operand has 293 states, 282 states have (on average 1.301418439716312) internal successors, (367), 284 states have internal predecessors, (367), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 563 states. [2022-04-27 10:23:40,872 INFO L87 Difference]: Start difference. First operand has 293 states, 282 states have (on average 1.301418439716312) internal successors, (367), 284 states have internal predecessors, (367), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 563 states. [2022-04-27 10:23:40,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:23:40,888 INFO L93 Difference]: Finished difference Result 563 states and 709 transitions. [2022-04-27 10:23:40,888 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 709 transitions. [2022-04-27 10:23:40,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:23:40,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:23:40,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:23:40,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:23:40,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 282 states have (on average 1.301418439716312) internal successors, (367), 284 states have internal predecessors, (367), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:23:40,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 377 transitions. [2022-04-27 10:23:40,895 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 377 transitions. Word has length 43 [2022-04-27 10:23:40,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:23:40,895 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 377 transitions. [2022-04-27 10:23:40,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.3043478260869565) internal successors, (106), 45 states have internal predecessors, (106), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:23:40,896 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 377 transitions. [2022-04-27 10:23:40,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-27 10:23:40,896 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:23:40,897 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:23:40,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-27 10:23:41,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:23:41,111 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:23:41,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:23:41,112 INFO L85 PathProgramCache]: Analyzing trace with hash 651363238, now seen corresponding path program 2 times [2022-04-27 10:23:41,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:23:41,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604336244] [2022-04-27 10:23:41,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:23:41,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:23:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:23:41,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:23:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:23:41,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {21222#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {21202#true} is VALID [2022-04-27 10:23:41,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {21202#true} assume true; {21202#true} is VALID [2022-04-27 10:23:41,206 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21202#true} {21202#true} #123#return; {21202#true} is VALID [2022-04-27 10:23:41,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-27 10:23:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:23:41,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {21202#true} ~cond := #in~cond; {21202#true} is VALID [2022-04-27 10:23:41,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {21202#true} assume !(0 == ~cond); {21202#true} is VALID [2022-04-27 10:23:41,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {21202#true} assume true; {21202#true} is VALID [2022-04-27 10:23:41,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21202#true} {21211#(and (<= main_~nodecount~0 2) (= main_~i~0 0))} #121#return; {21211#(and (<= main_~nodecount~0 2) (= main_~i~0 0))} is VALID [2022-04-27 10:23:41,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-04-27 10:23:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:23:41,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {21202#true} ~cond := #in~cond; {21202#true} is VALID [2022-04-27 10:23:41,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {21202#true} assume !(0 == ~cond); {21202#true} is VALID [2022-04-27 10:23:41,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {21202#true} assume true; {21202#true} is VALID [2022-04-27 10:23:41,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21202#true} {21216#(<= main_~nodecount~0 (+ main_~i~0 1))} #121#return; {21216#(<= main_~nodecount~0 (+ main_~i~0 1))} is VALID [2022-04-27 10:23:41,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {21202#true} call ULTIMATE.init(); {21222#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:23:41,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {21222#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {21202#true} is VALID [2022-04-27 10:23:41,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {21202#true} assume true; {21202#true} is VALID [2022-04-27 10:23:41,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21202#true} {21202#true} #123#return; {21202#true} is VALID [2022-04-27 10:23:41,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {21202#true} call #t~ret22 := main(); {21202#true} is VALID [2022-04-27 10:23:41,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {21202#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {21202#true} is VALID [2022-04-27 10:23:41,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {21202#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {21202#true} is VALID [2022-04-27 10:23:41,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {21202#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {21207#(= main_~i~0 0)} is VALID [2022-04-27 10:23:41,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {21207#(= main_~i~0 0)} assume !!(~i~0 < ~nodecount~0); {21207#(= main_~i~0 0)} is VALID [2022-04-27 10:23:41,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {21207#(= main_~i~0 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21207#(= main_~i~0 0)} is VALID [2022-04-27 10:23:41,216 INFO L290 TraceCheckUtils]: 10: Hoare triple {21207#(= main_~i~0 0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {21208#(<= main_~i~0 1)} is VALID [2022-04-27 10:23:41,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {21208#(<= main_~i~0 1)} assume !!(~i~0 < ~nodecount~0); {21208#(<= main_~i~0 1)} is VALID [2022-04-27 10:23:41,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {21208#(<= main_~i~0 1)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21208#(<= main_~i~0 1)} is VALID [2022-04-27 10:23:41,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {21208#(<= main_~i~0 1)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {21209#(<= main_~i~0 2)} is VALID [2022-04-27 10:23:41,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {21209#(<= main_~i~0 2)} assume !(~i~0 < ~nodecount~0); {21210#(<= main_~nodecount~0 2)} is VALID [2022-04-27 10:23:41,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {21210#(<= main_~nodecount~0 2)} ~i~0 := 0; {21210#(<= main_~nodecount~0 2)} is VALID [2022-04-27 10:23:41,218 INFO L290 TraceCheckUtils]: 16: Hoare triple {21210#(<= main_~nodecount~0 2)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {21210#(<= main_~nodecount~0 2)} is VALID [2022-04-27 10:23:41,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {21210#(<= main_~nodecount~0 2)} assume !(~j~0 < ~edgecount~0); {21210#(<= main_~nodecount~0 2)} is VALID [2022-04-27 10:23:41,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {21210#(<= main_~nodecount~0 2)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {21210#(<= main_~nodecount~0 2)} is VALID [2022-04-27 10:23:41,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {21210#(<= main_~nodecount~0 2)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {21210#(<= main_~nodecount~0 2)} is VALID [2022-04-27 10:23:41,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {21210#(<= main_~nodecount~0 2)} assume !(~j~0 < ~edgecount~0); {21210#(<= main_~nodecount~0 2)} is VALID [2022-04-27 10:23:41,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {21210#(<= main_~nodecount~0 2)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {21210#(<= main_~nodecount~0 2)} is VALID [2022-04-27 10:23:41,220 INFO L290 TraceCheckUtils]: 22: Hoare triple {21210#(<= main_~nodecount~0 2)} assume !(~i~0 < ~nodecount~0); {21210#(<= main_~nodecount~0 2)} is VALID [2022-04-27 10:23:41,221 INFO L290 TraceCheckUtils]: 23: Hoare triple {21210#(<= main_~nodecount~0 2)} ~i~0 := 0; {21210#(<= main_~nodecount~0 2)} is VALID [2022-04-27 10:23:41,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {21210#(<= main_~nodecount~0 2)} assume !(~i~0 < ~edgecount~0); {21210#(<= main_~nodecount~0 2)} is VALID [2022-04-27 10:23:41,221 INFO L290 TraceCheckUtils]: 25: Hoare triple {21210#(<= main_~nodecount~0 2)} ~i~0 := 0; {21211#(and (<= main_~nodecount~0 2) (= main_~i~0 0))} is VALID [2022-04-27 10:23:41,222 INFO L290 TraceCheckUtils]: 26: Hoare triple {21211#(and (<= main_~nodecount~0 2) (= main_~i~0 0))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21211#(and (<= main_~nodecount~0 2) (= main_~i~0 0))} is VALID [2022-04-27 10:23:41,222 INFO L272 TraceCheckUtils]: 27: Hoare triple {21211#(and (<= main_~nodecount~0 2) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {21202#true} is VALID [2022-04-27 10:23:41,222 INFO L290 TraceCheckUtils]: 28: Hoare triple {21202#true} ~cond := #in~cond; {21202#true} is VALID [2022-04-27 10:23:41,222 INFO L290 TraceCheckUtils]: 29: Hoare triple {21202#true} assume !(0 == ~cond); {21202#true} is VALID [2022-04-27 10:23:41,222 INFO L290 TraceCheckUtils]: 30: Hoare triple {21202#true} assume true; {21202#true} is VALID [2022-04-27 10:23:41,223 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21202#true} {21211#(and (<= main_~nodecount~0 2) (= main_~i~0 0))} #121#return; {21211#(and (<= main_~nodecount~0 2) (= main_~i~0 0))} is VALID [2022-04-27 10:23:41,223 INFO L290 TraceCheckUtils]: 32: Hoare triple {21211#(and (<= main_~nodecount~0 2) (= main_~i~0 0))} havoc #t~mem21; {21211#(and (<= main_~nodecount~0 2) (= main_~i~0 0))} is VALID [2022-04-27 10:23:41,224 INFO L290 TraceCheckUtils]: 33: Hoare triple {21211#(and (<= main_~nodecount~0 2) (= main_~i~0 0))} #t~post20 := ~i~0;~i~0 := 1 + #t~post20;havoc #t~post20; {21216#(<= main_~nodecount~0 (+ main_~i~0 1))} is VALID [2022-04-27 10:23:41,224 INFO L290 TraceCheckUtils]: 34: Hoare triple {21216#(<= main_~nodecount~0 (+ main_~i~0 1))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21216#(<= main_~nodecount~0 (+ main_~i~0 1))} is VALID [2022-04-27 10:23:41,224 INFO L272 TraceCheckUtils]: 35: Hoare triple {21216#(<= main_~nodecount~0 (+ main_~i~0 1))} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {21202#true} is VALID [2022-04-27 10:23:41,224 INFO L290 TraceCheckUtils]: 36: Hoare triple {21202#true} ~cond := #in~cond; {21202#true} is VALID [2022-04-27 10:23:41,224 INFO L290 TraceCheckUtils]: 37: Hoare triple {21202#true} assume !(0 == ~cond); {21202#true} is VALID [2022-04-27 10:23:41,224 INFO L290 TraceCheckUtils]: 38: Hoare triple {21202#true} assume true; {21202#true} is VALID [2022-04-27 10:23:41,225 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21202#true} {21216#(<= main_~nodecount~0 (+ main_~i~0 1))} #121#return; {21216#(<= main_~nodecount~0 (+ main_~i~0 1))} is VALID [2022-04-27 10:23:41,225 INFO L290 TraceCheckUtils]: 40: Hoare triple {21216#(<= main_~nodecount~0 (+ main_~i~0 1))} havoc #t~mem21; {21216#(<= main_~nodecount~0 (+ main_~i~0 1))} is VALID [2022-04-27 10:23:41,226 INFO L290 TraceCheckUtils]: 41: Hoare triple {21216#(<= main_~nodecount~0 (+ main_~i~0 1))} #t~post20 := ~i~0;~i~0 := 1 + #t~post20;havoc #t~post20; {21221#(<= main_~nodecount~0 main_~i~0)} is VALID [2022-04-27 10:23:41,226 INFO L290 TraceCheckUtils]: 42: Hoare triple {21221#(<= main_~nodecount~0 main_~i~0)} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21203#false} is VALID [2022-04-27 10:23:41,226 INFO L272 TraceCheckUtils]: 43: Hoare triple {21203#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {21203#false} is VALID [2022-04-27 10:23:41,226 INFO L290 TraceCheckUtils]: 44: Hoare triple {21203#false} ~cond := #in~cond; {21203#false} is VALID [2022-04-27 10:23:41,227 INFO L290 TraceCheckUtils]: 45: Hoare triple {21203#false} assume 0 == ~cond; {21203#false} is VALID [2022-04-27 10:23:41,227 INFO L290 TraceCheckUtils]: 46: Hoare triple {21203#false} assume !false; {21203#false} is VALID [2022-04-27 10:23:41,227 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 10:23:41,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:23:41,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604336244] [2022-04-27 10:23:41,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604336244] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:23:41,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636360219] [2022-04-27 10:23:41,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:23:41,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:23:41,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:23:41,232 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:23:41,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-27 10:23:41,337 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:23:41,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:23:41,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 10:23:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:23:41,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:23:41,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {21202#true} call ULTIMATE.init(); {21202#true} is VALID [2022-04-27 10:23:41,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {21202#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {21202#true} is VALID [2022-04-27 10:23:41,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {21202#true} assume true; {21202#true} is VALID [2022-04-27 10:23:41,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21202#true} {21202#true} #123#return; {21202#true} is VALID [2022-04-27 10:23:41,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {21202#true} call #t~ret22 := main(); {21202#true} is VALID [2022-04-27 10:23:41,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {21202#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {21202#true} is VALID [2022-04-27 10:23:41,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {21202#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {21202#true} is VALID [2022-04-27 10:23:41,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {21202#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {21247#(<= main_~i~0 0)} is VALID [2022-04-27 10:23:41,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {21247#(<= main_~i~0 0)} assume !!(~i~0 < ~nodecount~0); {21247#(<= main_~i~0 0)} is VALID [2022-04-27 10:23:41,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {21247#(<= main_~i~0 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21247#(<= main_~i~0 0)} is VALID [2022-04-27 10:23:41,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {21247#(<= main_~i~0 0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {21208#(<= main_~i~0 1)} is VALID [2022-04-27 10:23:41,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {21208#(<= main_~i~0 1)} assume !!(~i~0 < ~nodecount~0); {21208#(<= main_~i~0 1)} is VALID [2022-04-27 10:23:41,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {21208#(<= main_~i~0 1)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21208#(<= main_~i~0 1)} is VALID [2022-04-27 10:23:41,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {21208#(<= main_~i~0 1)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {21209#(<= main_~i~0 2)} is VALID [2022-04-27 10:23:41,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {21209#(<= main_~i~0 2)} assume !(~i~0 < ~nodecount~0); {21210#(<= main_~nodecount~0 2)} is VALID [2022-04-27 10:23:41,594 INFO L290 TraceCheckUtils]: 15: Hoare triple {21210#(<= main_~nodecount~0 2)} ~i~0 := 0; {21210#(<= main_~nodecount~0 2)} is VALID [2022-04-27 10:23:41,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {21210#(<= main_~nodecount~0 2)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {21210#(<= main_~nodecount~0 2)} is VALID [2022-04-27 10:23:41,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {21210#(<= main_~nodecount~0 2)} assume !(~j~0 < ~edgecount~0); {21210#(<= main_~nodecount~0 2)} is VALID [2022-04-27 10:23:41,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {21210#(<= main_~nodecount~0 2)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {21210#(<= main_~nodecount~0 2)} is VALID [2022-04-27 10:23:41,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {21210#(<= main_~nodecount~0 2)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {21210#(<= main_~nodecount~0 2)} is VALID [2022-04-27 10:23:41,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {21210#(<= main_~nodecount~0 2)} assume !(~j~0 < ~edgecount~0); {21210#(<= main_~nodecount~0 2)} is VALID [2022-04-27 10:23:41,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {21210#(<= main_~nodecount~0 2)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {21210#(<= main_~nodecount~0 2)} is VALID [2022-04-27 10:23:41,596 INFO L290 TraceCheckUtils]: 22: Hoare triple {21210#(<= main_~nodecount~0 2)} assume !(~i~0 < ~nodecount~0); {21210#(<= main_~nodecount~0 2)} is VALID [2022-04-27 10:23:41,596 INFO L290 TraceCheckUtils]: 23: Hoare triple {21210#(<= main_~nodecount~0 2)} ~i~0 := 0; {21210#(<= main_~nodecount~0 2)} is VALID [2022-04-27 10:23:41,596 INFO L290 TraceCheckUtils]: 24: Hoare triple {21210#(<= main_~nodecount~0 2)} assume !(~i~0 < ~edgecount~0); {21210#(<= main_~nodecount~0 2)} is VALID [2022-04-27 10:23:41,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {21210#(<= main_~nodecount~0 2)} ~i~0 := 0; {21302#(and (<= main_~nodecount~0 2) (<= 0 main_~i~0))} is VALID [2022-04-27 10:23:41,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {21302#(and (<= main_~nodecount~0 2) (<= 0 main_~i~0))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21302#(and (<= main_~nodecount~0 2) (<= 0 main_~i~0))} is VALID [2022-04-27 10:23:41,597 INFO L272 TraceCheckUtils]: 27: Hoare triple {21302#(and (<= main_~nodecount~0 2) (<= 0 main_~i~0))} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {21202#true} is VALID [2022-04-27 10:23:41,597 INFO L290 TraceCheckUtils]: 28: Hoare triple {21202#true} ~cond := #in~cond; {21202#true} is VALID [2022-04-27 10:23:41,597 INFO L290 TraceCheckUtils]: 29: Hoare triple {21202#true} assume !(0 == ~cond); {21202#true} is VALID [2022-04-27 10:23:41,597 INFO L290 TraceCheckUtils]: 30: Hoare triple {21202#true} assume true; {21202#true} is VALID [2022-04-27 10:23:41,597 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21202#true} {21302#(and (<= main_~nodecount~0 2) (<= 0 main_~i~0))} #121#return; {21302#(and (<= main_~nodecount~0 2) (<= 0 main_~i~0))} is VALID [2022-04-27 10:23:41,598 INFO L290 TraceCheckUtils]: 32: Hoare triple {21302#(and (<= main_~nodecount~0 2) (<= 0 main_~i~0))} havoc #t~mem21; {21302#(and (<= main_~nodecount~0 2) (<= 0 main_~i~0))} is VALID [2022-04-27 10:23:41,598 INFO L290 TraceCheckUtils]: 33: Hoare triple {21302#(and (<= main_~nodecount~0 2) (<= 0 main_~i~0))} #t~post20 := ~i~0;~i~0 := 1 + #t~post20;havoc #t~post20; {21327#(and (<= main_~nodecount~0 2) (<= 1 main_~i~0))} is VALID [2022-04-27 10:23:41,599 INFO L290 TraceCheckUtils]: 34: Hoare triple {21327#(and (<= main_~nodecount~0 2) (<= 1 main_~i~0))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21327#(and (<= main_~nodecount~0 2) (<= 1 main_~i~0))} is VALID [2022-04-27 10:23:41,599 INFO L272 TraceCheckUtils]: 35: Hoare triple {21327#(and (<= main_~nodecount~0 2) (<= 1 main_~i~0))} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {21202#true} is VALID [2022-04-27 10:23:41,599 INFO L290 TraceCheckUtils]: 36: Hoare triple {21202#true} ~cond := #in~cond; {21202#true} is VALID [2022-04-27 10:23:41,599 INFO L290 TraceCheckUtils]: 37: Hoare triple {21202#true} assume !(0 == ~cond); {21202#true} is VALID [2022-04-27 10:23:41,599 INFO L290 TraceCheckUtils]: 38: Hoare triple {21202#true} assume true; {21202#true} is VALID [2022-04-27 10:23:41,599 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21202#true} {21327#(and (<= main_~nodecount~0 2) (<= 1 main_~i~0))} #121#return; {21327#(and (<= main_~nodecount~0 2) (<= 1 main_~i~0))} is VALID [2022-04-27 10:23:41,600 INFO L290 TraceCheckUtils]: 40: Hoare triple {21327#(and (<= main_~nodecount~0 2) (<= 1 main_~i~0))} havoc #t~mem21; {21327#(and (<= main_~nodecount~0 2) (<= 1 main_~i~0))} is VALID [2022-04-27 10:23:41,600 INFO L290 TraceCheckUtils]: 41: Hoare triple {21327#(and (<= main_~nodecount~0 2) (<= 1 main_~i~0))} #t~post20 := ~i~0;~i~0 := 1 + #t~post20;havoc #t~post20; {21352#(and (<= main_~nodecount~0 2) (<= 2 main_~i~0))} is VALID [2022-04-27 10:23:41,600 INFO L290 TraceCheckUtils]: 42: Hoare triple {21352#(and (<= main_~nodecount~0 2) (<= 2 main_~i~0))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21203#false} is VALID [2022-04-27 10:23:41,600 INFO L272 TraceCheckUtils]: 43: Hoare triple {21203#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {21203#false} is VALID [2022-04-27 10:23:41,600 INFO L290 TraceCheckUtils]: 44: Hoare triple {21203#false} ~cond := #in~cond; {21203#false} is VALID [2022-04-27 10:23:41,601 INFO L290 TraceCheckUtils]: 45: Hoare triple {21203#false} assume 0 == ~cond; {21203#false} is VALID [2022-04-27 10:23:41,601 INFO L290 TraceCheckUtils]: 46: Hoare triple {21203#false} assume !false; {21203#false} is VALID [2022-04-27 10:23:41,601 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 10:23:41,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:23:41,785 INFO L290 TraceCheckUtils]: 46: Hoare triple {21203#false} assume !false; {21203#false} is VALID [2022-04-27 10:23:41,785 INFO L290 TraceCheckUtils]: 45: Hoare triple {21203#false} assume 0 == ~cond; {21203#false} is VALID [2022-04-27 10:23:41,785 INFO L290 TraceCheckUtils]: 44: Hoare triple {21203#false} ~cond := #in~cond; {21203#false} is VALID [2022-04-27 10:23:41,785 INFO L272 TraceCheckUtils]: 43: Hoare triple {21203#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {21203#false} is VALID [2022-04-27 10:23:41,786 INFO L290 TraceCheckUtils]: 42: Hoare triple {21221#(<= main_~nodecount~0 main_~i~0)} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21203#false} is VALID [2022-04-27 10:23:41,786 INFO L290 TraceCheckUtils]: 41: Hoare triple {21216#(<= main_~nodecount~0 (+ main_~i~0 1))} #t~post20 := ~i~0;~i~0 := 1 + #t~post20;havoc #t~post20; {21221#(<= main_~nodecount~0 main_~i~0)} is VALID [2022-04-27 10:23:41,786 INFO L290 TraceCheckUtils]: 40: Hoare triple {21216#(<= main_~nodecount~0 (+ main_~i~0 1))} havoc #t~mem21; {21216#(<= main_~nodecount~0 (+ main_~i~0 1))} is VALID [2022-04-27 10:23:41,787 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21202#true} {21216#(<= main_~nodecount~0 (+ main_~i~0 1))} #121#return; {21216#(<= main_~nodecount~0 (+ main_~i~0 1))} is VALID [2022-04-27 10:23:41,787 INFO L290 TraceCheckUtils]: 38: Hoare triple {21202#true} assume true; {21202#true} is VALID [2022-04-27 10:23:41,787 INFO L290 TraceCheckUtils]: 37: Hoare triple {21202#true} assume !(0 == ~cond); {21202#true} is VALID [2022-04-27 10:23:41,787 INFO L290 TraceCheckUtils]: 36: Hoare triple {21202#true} ~cond := #in~cond; {21202#true} is VALID [2022-04-27 10:23:41,787 INFO L272 TraceCheckUtils]: 35: Hoare triple {21216#(<= main_~nodecount~0 (+ main_~i~0 1))} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {21202#true} is VALID [2022-04-27 10:23:41,787 INFO L290 TraceCheckUtils]: 34: Hoare triple {21216#(<= main_~nodecount~0 (+ main_~i~0 1))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21216#(<= main_~nodecount~0 (+ main_~i~0 1))} is VALID [2022-04-27 10:23:41,788 INFO L290 TraceCheckUtils]: 33: Hoare triple {21407#(<= main_~nodecount~0 (+ main_~i~0 2))} #t~post20 := ~i~0;~i~0 := 1 + #t~post20;havoc #t~post20; {21216#(<= main_~nodecount~0 (+ main_~i~0 1))} is VALID [2022-04-27 10:23:41,788 INFO L290 TraceCheckUtils]: 32: Hoare triple {21407#(<= main_~nodecount~0 (+ main_~i~0 2))} havoc #t~mem21; {21407#(<= main_~nodecount~0 (+ main_~i~0 2))} is VALID [2022-04-27 10:23:41,788 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21202#true} {21407#(<= main_~nodecount~0 (+ main_~i~0 2))} #121#return; {21407#(<= main_~nodecount~0 (+ main_~i~0 2))} is VALID [2022-04-27 10:23:41,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {21202#true} assume true; {21202#true} is VALID [2022-04-27 10:23:41,789 INFO L290 TraceCheckUtils]: 29: Hoare triple {21202#true} assume !(0 == ~cond); {21202#true} is VALID [2022-04-27 10:23:41,789 INFO L290 TraceCheckUtils]: 28: Hoare triple {21202#true} ~cond := #in~cond; {21202#true} is VALID [2022-04-27 10:23:41,789 INFO L272 TraceCheckUtils]: 27: Hoare triple {21407#(<= main_~nodecount~0 (+ main_~i~0 2))} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {21202#true} is VALID [2022-04-27 10:23:41,789 INFO L290 TraceCheckUtils]: 26: Hoare triple {21407#(<= main_~nodecount~0 (+ main_~i~0 2))} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21407#(<= main_~nodecount~0 (+ main_~i~0 2))} is VALID [2022-04-27 10:23:41,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {21210#(<= main_~nodecount~0 2)} ~i~0 := 0; {21407#(<= main_~nodecount~0 (+ main_~i~0 2))} is VALID [2022-04-27 10:23:41,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {21210#(<= main_~nodecount~0 2)} assume !(~i~0 < ~edgecount~0); {21210#(<= main_~nodecount~0 2)} is VALID [2022-04-27 10:23:41,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {21210#(<= main_~nodecount~0 2)} ~i~0 := 0; {21210#(<= main_~nodecount~0 2)} is VALID [2022-04-27 10:23:41,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {21210#(<= main_~nodecount~0 2)} assume !(~i~0 < ~nodecount~0); {21210#(<= main_~nodecount~0 2)} is VALID [2022-04-27 10:23:41,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {21210#(<= main_~nodecount~0 2)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {21210#(<= main_~nodecount~0 2)} is VALID [2022-04-27 10:23:41,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {21210#(<= main_~nodecount~0 2)} assume !(~j~0 < ~edgecount~0); {21210#(<= main_~nodecount~0 2)} is VALID [2022-04-27 10:23:41,791 INFO L290 TraceCheckUtils]: 19: Hoare triple {21210#(<= main_~nodecount~0 2)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {21210#(<= main_~nodecount~0 2)} is VALID [2022-04-27 10:23:41,791 INFO L290 TraceCheckUtils]: 18: Hoare triple {21210#(<= main_~nodecount~0 2)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {21210#(<= main_~nodecount~0 2)} is VALID [2022-04-27 10:23:41,791 INFO L290 TraceCheckUtils]: 17: Hoare triple {21210#(<= main_~nodecount~0 2)} assume !(~j~0 < ~edgecount~0); {21210#(<= main_~nodecount~0 2)} is VALID [2022-04-27 10:23:41,791 INFO L290 TraceCheckUtils]: 16: Hoare triple {21210#(<= main_~nodecount~0 2)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {21210#(<= main_~nodecount~0 2)} is VALID [2022-04-27 10:23:41,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {21210#(<= main_~nodecount~0 2)} ~i~0 := 0; {21210#(<= main_~nodecount~0 2)} is VALID [2022-04-27 10:23:41,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {21209#(<= main_~i~0 2)} assume !(~i~0 < ~nodecount~0); {21210#(<= main_~nodecount~0 2)} is VALID [2022-04-27 10:23:41,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {21208#(<= main_~i~0 1)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {21209#(<= main_~i~0 2)} is VALID [2022-04-27 10:23:41,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {21208#(<= main_~i~0 1)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21208#(<= main_~i~0 1)} is VALID [2022-04-27 10:23:41,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {21208#(<= main_~i~0 1)} assume !!(~i~0 < ~nodecount~0); {21208#(<= main_~i~0 1)} is VALID [2022-04-27 10:23:41,796 INFO L290 TraceCheckUtils]: 10: Hoare triple {21247#(<= main_~i~0 0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {21208#(<= main_~i~0 1)} is VALID [2022-04-27 10:23:41,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {21247#(<= main_~i~0 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {21247#(<= main_~i~0 0)} is VALID [2022-04-27 10:23:41,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {21247#(<= main_~i~0 0)} assume !!(~i~0 < ~nodecount~0); {21247#(<= main_~i~0 0)} is VALID [2022-04-27 10:23:41,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {21202#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {21247#(<= main_~i~0 0)} is VALID [2022-04-27 10:23:41,801 INFO L290 TraceCheckUtils]: 6: Hoare triple {21202#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {21202#true} is VALID [2022-04-27 10:23:41,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {21202#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {21202#true} is VALID [2022-04-27 10:23:41,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {21202#true} call #t~ret22 := main(); {21202#true} is VALID [2022-04-27 10:23:41,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21202#true} {21202#true} #123#return; {21202#true} is VALID [2022-04-27 10:23:41,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {21202#true} assume true; {21202#true} is VALID [2022-04-27 10:23:41,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {21202#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {21202#true} is VALID [2022-04-27 10:23:41,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {21202#true} call ULTIMATE.init(); {21202#true} is VALID [2022-04-27 10:23:41,801 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 10:23:41,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636360219] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:23:41,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:23:41,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-04-27 10:23:41,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656898247] [2022-04-27 10:23:41,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:23:41,802 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 7 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2022-04-27 10:23:41,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:23:41,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 7 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:23:41,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:23:41,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 10:23:41,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:23:41,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 10:23:41,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-04-27 10:23:41,845 INFO L87 Difference]: Start difference. First operand 293 states and 377 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 7 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:23:44,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:23:44,912 INFO L93 Difference]: Finished difference Result 725 states and 937 transitions. [2022-04-27 10:23:44,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 10:23:44,912 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 7 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2022-04-27 10:23:44,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:23:44,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 7 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:23:44,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 190 transitions. [2022-04-27 10:23:44,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 7 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:23:44,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 190 transitions. [2022-04-27 10:23:44,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 190 transitions. [2022-04-27 10:23:45,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:23:45,097 INFO L225 Difference]: With dead ends: 725 [2022-04-27 10:23:45,097 INFO L226 Difference]: Without dead ends: 566 [2022-04-27 10:23:45,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2022-04-27 10:23:45,098 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 320 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 10:23:45,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 66 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 10:23:45,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2022-04-27 10:23:46,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 423. [2022-04-27 10:23:46,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:23:46,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 566 states. Second operand has 423 states, 410 states have (on average 1.3121951219512196) internal successors, (538), 413 states have internal predecessors, (538), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:23:46,351 INFO L74 IsIncluded]: Start isIncluded. First operand 566 states. Second operand has 423 states, 410 states have (on average 1.3121951219512196) internal successors, (538), 413 states have internal predecessors, (538), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:23:46,351 INFO L87 Difference]: Start difference. First operand 566 states. Second operand has 423 states, 410 states have (on average 1.3121951219512196) internal successors, (538), 413 states have internal predecessors, (538), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:23:46,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:23:46,369 INFO L93 Difference]: Finished difference Result 566 states and 728 transitions. [2022-04-27 10:23:46,369 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 728 transitions. [2022-04-27 10:23:46,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:23:46,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:23:46,371 INFO L74 IsIncluded]: Start isIncluded. First operand has 423 states, 410 states have (on average 1.3121951219512196) internal successors, (538), 413 states have internal predecessors, (538), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Second operand 566 states. [2022-04-27 10:23:46,371 INFO L87 Difference]: Start difference. First operand has 423 states, 410 states have (on average 1.3121951219512196) internal successors, (538), 413 states have internal predecessors, (538), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Second operand 566 states. [2022-04-27 10:23:46,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:23:46,382 INFO L93 Difference]: Finished difference Result 566 states and 728 transitions. [2022-04-27 10:23:46,382 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 728 transitions. [2022-04-27 10:23:46,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:23:46,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:23:46,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:23:46,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:23:46,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 410 states have (on average 1.3121951219512196) internal successors, (538), 413 states have internal predecessors, (538), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:23:46,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 552 transitions. [2022-04-27 10:23:46,392 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 552 transitions. Word has length 47 [2022-04-27 10:23:46,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:23:46,392 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 552 transitions. [2022-04-27 10:23:46,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 7 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:23:46,393 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 552 transitions. [2022-04-27 10:23:46,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-27 10:23:46,394 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:23:46,394 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:23:46,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-27 10:23:46,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:23:46,617 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:23:46,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:23:46,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1904691350, now seen corresponding path program 5 times [2022-04-27 10:23:46,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:23:46,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574809655] [2022-04-27 10:23:46,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:23:46,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:23:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:23:46,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:23:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:23:46,740 INFO L290 TraceCheckUtils]: 0: Hoare triple {24307#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {24293#true} is VALID [2022-04-27 10:23:46,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {24293#true} assume true; {24293#true} is VALID [2022-04-27 10:23:46,740 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24293#true} {24293#true} #123#return; {24293#true} is VALID [2022-04-27 10:23:46,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {24293#true} call ULTIMATE.init(); {24307#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:23:46,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {24307#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {24293#true} is VALID [2022-04-27 10:23:46,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {24293#true} assume true; {24293#true} is VALID [2022-04-27 10:23:46,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24293#true} {24293#true} #123#return; {24293#true} is VALID [2022-04-27 10:23:46,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {24293#true} call #t~ret22 := main(); {24293#true} is VALID [2022-04-27 10:23:46,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {24293#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {24293#true} is VALID [2022-04-27 10:23:46,741 INFO L290 TraceCheckUtils]: 6: Hoare triple {24293#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {24293#true} is VALID [2022-04-27 10:23:46,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {24293#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {24293#true} is VALID [2022-04-27 10:23:46,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {24293#true} assume !!(~i~0 < ~nodecount~0); {24293#true} is VALID [2022-04-27 10:23:46,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {24293#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {24293#true} is VALID [2022-04-27 10:23:46,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {24293#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {24293#true} is VALID [2022-04-27 10:23:46,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {24293#true} assume !(~i~0 < ~nodecount~0); {24293#true} is VALID [2022-04-27 10:23:46,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {24293#true} ~i~0 := 0; {24293#true} is VALID [2022-04-27 10:23:46,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {24293#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {24298#(= main_~j~0 0)} is VALID [2022-04-27 10:23:46,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {24298#(= main_~j~0 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {24298#(= main_~j~0 0)} is VALID [2022-04-27 10:23:46,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {24298#(= main_~j~0 0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {24298#(= main_~j~0 0)} is VALID [2022-04-27 10:23:46,743 INFO L290 TraceCheckUtils]: 16: Hoare triple {24298#(= main_~j~0 0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {24299#(<= 1 main_~j~0)} is VALID [2022-04-27 10:23:46,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {24299#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {24299#(<= 1 main_~j~0)} is VALID [2022-04-27 10:23:46,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {24299#(<= 1 main_~j~0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {24299#(<= 1 main_~j~0)} is VALID [2022-04-27 10:23:46,744 INFO L290 TraceCheckUtils]: 19: Hoare triple {24299#(<= 1 main_~j~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {24300#(<= 2 main_~j~0)} is VALID [2022-04-27 10:23:46,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {24300#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {24300#(<= 2 main_~j~0)} is VALID [2022-04-27 10:23:46,744 INFO L290 TraceCheckUtils]: 21: Hoare triple {24300#(<= 2 main_~j~0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {24300#(<= 2 main_~j~0)} is VALID [2022-04-27 10:23:46,745 INFO L290 TraceCheckUtils]: 22: Hoare triple {24300#(<= 2 main_~j~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {24301#(<= 3 main_~j~0)} is VALID [2022-04-27 10:23:46,746 INFO L290 TraceCheckUtils]: 23: Hoare triple {24301#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {24302#(<= 4 main_~edgecount~0)} is VALID [2022-04-27 10:23:46,746 INFO L290 TraceCheckUtils]: 24: Hoare triple {24302#(<= 4 main_~edgecount~0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {24302#(<= 4 main_~edgecount~0)} is VALID [2022-04-27 10:23:46,746 INFO L290 TraceCheckUtils]: 25: Hoare triple {24302#(<= 4 main_~edgecount~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {24302#(<= 4 main_~edgecount~0)} is VALID [2022-04-27 10:23:46,747 INFO L290 TraceCheckUtils]: 26: Hoare triple {24302#(<= 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {24302#(<= 4 main_~edgecount~0)} is VALID [2022-04-27 10:23:46,747 INFO L290 TraceCheckUtils]: 27: Hoare triple {24302#(<= 4 main_~edgecount~0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {24302#(<= 4 main_~edgecount~0)} is VALID [2022-04-27 10:23:46,747 INFO L290 TraceCheckUtils]: 28: Hoare triple {24302#(<= 4 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {24302#(<= 4 main_~edgecount~0)} is VALID [2022-04-27 10:23:46,748 INFO L290 TraceCheckUtils]: 29: Hoare triple {24302#(<= 4 main_~edgecount~0)} ~i~0 := 0; {24303#(and (= main_~i~0 0) (<= 4 main_~edgecount~0))} is VALID [2022-04-27 10:23:46,748 INFO L290 TraceCheckUtils]: 30: Hoare triple {24303#(and (= main_~i~0 0) (<= 4 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {24303#(and (= main_~i~0 0) (<= 4 main_~edgecount~0))} is VALID [2022-04-27 10:23:46,749 INFO L290 TraceCheckUtils]: 31: Hoare triple {24303#(and (= main_~i~0 0) (<= 4 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {24303#(and (= main_~i~0 0) (<= 4 main_~edgecount~0))} is VALID [2022-04-27 10:23:46,749 INFO L290 TraceCheckUtils]: 32: Hoare triple {24303#(and (= main_~i~0 0) (<= 4 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {24304#(<= (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-27 10:23:46,749 INFO L290 TraceCheckUtils]: 33: Hoare triple {24304#(<= (+ main_~i~0 3) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {24304#(<= (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-27 10:23:46,750 INFO L290 TraceCheckUtils]: 34: Hoare triple {24304#(<= (+ main_~i~0 3) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {24304#(<= (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-27 10:23:46,750 INFO L290 TraceCheckUtils]: 35: Hoare triple {24304#(<= (+ main_~i~0 3) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {24305#(<= (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-27 10:23:46,751 INFO L290 TraceCheckUtils]: 36: Hoare triple {24305#(<= (+ main_~i~0 2) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {24305#(<= (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-27 10:23:46,751 INFO L290 TraceCheckUtils]: 37: Hoare triple {24305#(<= (+ main_~i~0 2) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {24305#(<= (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-27 10:23:46,751 INFO L290 TraceCheckUtils]: 38: Hoare triple {24305#(<= (+ main_~i~0 2) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {24306#(<= (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-27 10:23:46,752 INFO L290 TraceCheckUtils]: 39: Hoare triple {24306#(<= (+ main_~i~0 1) main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {24294#false} is VALID [2022-04-27 10:23:46,752 INFO L290 TraceCheckUtils]: 40: Hoare triple {24294#false} ~i~0 := 0; {24294#false} is VALID [2022-04-27 10:23:46,752 INFO L290 TraceCheckUtils]: 41: Hoare triple {24294#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {24294#false} is VALID [2022-04-27 10:23:46,752 INFO L272 TraceCheckUtils]: 42: Hoare triple {24294#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {24294#false} is VALID [2022-04-27 10:23:46,752 INFO L290 TraceCheckUtils]: 43: Hoare triple {24294#false} ~cond := #in~cond; {24294#false} is VALID [2022-04-27 10:23:46,752 INFO L290 TraceCheckUtils]: 44: Hoare triple {24294#false} assume 0 == ~cond; {24294#false} is VALID [2022-04-27 10:23:46,752 INFO L290 TraceCheckUtils]: 45: Hoare triple {24294#false} assume !false; {24294#false} is VALID [2022-04-27 10:23:46,752 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:23:46,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:23:46,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574809655] [2022-04-27 10:23:46,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574809655] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:23:46,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153078672] [2022-04-27 10:23:46,753 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 10:23:46,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:23:46,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:23:46,756 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:23:46,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-27 10:23:47,098 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-27 10:23:47,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:23:47,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 10:23:47,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:23:47,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:23:47,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {24293#true} call ULTIMATE.init(); {24293#true} is VALID [2022-04-27 10:23:47,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {24293#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {24293#true} is VALID [2022-04-27 10:23:47,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {24293#true} assume true; {24293#true} is VALID [2022-04-27 10:23:47,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24293#true} {24293#true} #123#return; {24293#true} is VALID [2022-04-27 10:23:47,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {24293#true} call #t~ret22 := main(); {24293#true} is VALID [2022-04-27 10:23:47,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {24293#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {24293#true} is VALID [2022-04-27 10:23:47,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {24293#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {24293#true} is VALID [2022-04-27 10:23:47,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {24293#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {24293#true} is VALID [2022-04-27 10:23:47,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {24293#true} assume !!(~i~0 < ~nodecount~0); {24293#true} is VALID [2022-04-27 10:23:47,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {24293#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {24293#true} is VALID [2022-04-27 10:23:47,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {24293#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {24293#true} is VALID [2022-04-27 10:23:47,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {24293#true} assume !(~i~0 < ~nodecount~0); {24293#true} is VALID [2022-04-27 10:23:47,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {24293#true} ~i~0 := 0; {24293#true} is VALID [2022-04-27 10:23:47,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {24293#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {24350#(<= 0 main_~j~0)} is VALID [2022-04-27 10:23:47,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {24350#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {24350#(<= 0 main_~j~0)} is VALID [2022-04-27 10:23:47,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {24350#(<= 0 main_~j~0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {24350#(<= 0 main_~j~0)} is VALID [2022-04-27 10:23:47,461 INFO L290 TraceCheckUtils]: 16: Hoare triple {24350#(<= 0 main_~j~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {24299#(<= 1 main_~j~0)} is VALID [2022-04-27 10:23:47,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {24299#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {24299#(<= 1 main_~j~0)} is VALID [2022-04-27 10:23:47,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {24299#(<= 1 main_~j~0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {24299#(<= 1 main_~j~0)} is VALID [2022-04-27 10:23:47,462 INFO L290 TraceCheckUtils]: 19: Hoare triple {24299#(<= 1 main_~j~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {24300#(<= 2 main_~j~0)} is VALID [2022-04-27 10:23:47,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {24300#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {24300#(<= 2 main_~j~0)} is VALID [2022-04-27 10:23:47,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {24300#(<= 2 main_~j~0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {24300#(<= 2 main_~j~0)} is VALID [2022-04-27 10:23:47,463 INFO L290 TraceCheckUtils]: 22: Hoare triple {24300#(<= 2 main_~j~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {24301#(<= 3 main_~j~0)} is VALID [2022-04-27 10:23:47,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {24301#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {24302#(<= 4 main_~edgecount~0)} is VALID [2022-04-27 10:23:47,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {24302#(<= 4 main_~edgecount~0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {24302#(<= 4 main_~edgecount~0)} is VALID [2022-04-27 10:23:47,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {24302#(<= 4 main_~edgecount~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {24302#(<= 4 main_~edgecount~0)} is VALID [2022-04-27 10:23:47,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {24302#(<= 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {24302#(<= 4 main_~edgecount~0)} is VALID [2022-04-27 10:23:47,476 INFO L290 TraceCheckUtils]: 27: Hoare triple {24302#(<= 4 main_~edgecount~0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {24302#(<= 4 main_~edgecount~0)} is VALID [2022-04-27 10:23:47,476 INFO L290 TraceCheckUtils]: 28: Hoare triple {24302#(<= 4 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {24302#(<= 4 main_~edgecount~0)} is VALID [2022-04-27 10:23:47,477 INFO L290 TraceCheckUtils]: 29: Hoare triple {24302#(<= 4 main_~edgecount~0)} ~i~0 := 0; {24399#(and (<= main_~i~0 0) (<= 4 main_~edgecount~0))} is VALID [2022-04-27 10:23:47,478 INFO L290 TraceCheckUtils]: 30: Hoare triple {24399#(and (<= main_~i~0 0) (<= 4 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {24399#(and (<= main_~i~0 0) (<= 4 main_~edgecount~0))} is VALID [2022-04-27 10:23:47,478 INFO L290 TraceCheckUtils]: 31: Hoare triple {24399#(and (<= main_~i~0 0) (<= 4 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {24399#(and (<= main_~i~0 0) (<= 4 main_~edgecount~0))} is VALID [2022-04-27 10:23:47,479 INFO L290 TraceCheckUtils]: 32: Hoare triple {24399#(and (<= main_~i~0 0) (<= 4 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {24409#(and (<= main_~i~0 1) (<= 4 main_~edgecount~0))} is VALID [2022-04-27 10:23:47,479 INFO L290 TraceCheckUtils]: 33: Hoare triple {24409#(and (<= main_~i~0 1) (<= 4 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {24409#(and (<= main_~i~0 1) (<= 4 main_~edgecount~0))} is VALID [2022-04-27 10:23:47,480 INFO L290 TraceCheckUtils]: 34: Hoare triple {24409#(and (<= main_~i~0 1) (<= 4 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {24409#(and (<= main_~i~0 1) (<= 4 main_~edgecount~0))} is VALID [2022-04-27 10:23:47,480 INFO L290 TraceCheckUtils]: 35: Hoare triple {24409#(and (<= main_~i~0 1) (<= 4 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {24419#(and (<= main_~i~0 2) (<= 4 main_~edgecount~0))} is VALID [2022-04-27 10:23:47,481 INFO L290 TraceCheckUtils]: 36: Hoare triple {24419#(and (<= main_~i~0 2) (<= 4 main_~edgecount~0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {24419#(and (<= main_~i~0 2) (<= 4 main_~edgecount~0))} is VALID [2022-04-27 10:23:47,481 INFO L290 TraceCheckUtils]: 37: Hoare triple {24419#(and (<= main_~i~0 2) (<= 4 main_~edgecount~0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {24419#(and (<= main_~i~0 2) (<= 4 main_~edgecount~0))} is VALID [2022-04-27 10:23:47,482 INFO L290 TraceCheckUtils]: 38: Hoare triple {24419#(and (<= main_~i~0 2) (<= 4 main_~edgecount~0))} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {24429#(and (<= 4 main_~edgecount~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:23:47,482 INFO L290 TraceCheckUtils]: 39: Hoare triple {24429#(and (<= 4 main_~edgecount~0) (<= main_~i~0 3))} assume !(~i~0 < ~edgecount~0); {24294#false} is VALID [2022-04-27 10:23:47,482 INFO L290 TraceCheckUtils]: 40: Hoare triple {24294#false} ~i~0 := 0; {24294#false} is VALID [2022-04-27 10:23:47,482 INFO L290 TraceCheckUtils]: 41: Hoare triple {24294#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {24294#false} is VALID [2022-04-27 10:23:47,482 INFO L272 TraceCheckUtils]: 42: Hoare triple {24294#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {24294#false} is VALID [2022-04-27 10:23:47,483 INFO L290 TraceCheckUtils]: 43: Hoare triple {24294#false} ~cond := #in~cond; {24294#false} is VALID [2022-04-27 10:23:47,483 INFO L290 TraceCheckUtils]: 44: Hoare triple {24294#false} assume 0 == ~cond; {24294#false} is VALID [2022-04-27 10:23:47,483 INFO L290 TraceCheckUtils]: 45: Hoare triple {24294#false} assume !false; {24294#false} is VALID [2022-04-27 10:23:47,483 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:23:47,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:23:47,678 INFO L290 TraceCheckUtils]: 45: Hoare triple {24294#false} assume !false; {24294#false} is VALID [2022-04-27 10:23:47,678 INFO L290 TraceCheckUtils]: 44: Hoare triple {24294#false} assume 0 == ~cond; {24294#false} is VALID [2022-04-27 10:23:47,678 INFO L290 TraceCheckUtils]: 43: Hoare triple {24294#false} ~cond := #in~cond; {24294#false} is VALID [2022-04-27 10:23:47,679 INFO L272 TraceCheckUtils]: 42: Hoare triple {24294#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {24294#false} is VALID [2022-04-27 10:23:47,679 INFO L290 TraceCheckUtils]: 41: Hoare triple {24294#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {24294#false} is VALID [2022-04-27 10:23:47,679 INFO L290 TraceCheckUtils]: 40: Hoare triple {24294#false} ~i~0 := 0; {24294#false} is VALID [2022-04-27 10:23:47,679 INFO L290 TraceCheckUtils]: 39: Hoare triple {24306#(<= (+ main_~i~0 1) main_~edgecount~0)} assume !(~i~0 < ~edgecount~0); {24294#false} is VALID [2022-04-27 10:23:47,679 INFO L290 TraceCheckUtils]: 38: Hoare triple {24305#(<= (+ main_~i~0 2) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {24306#(<= (+ main_~i~0 1) main_~edgecount~0)} is VALID [2022-04-27 10:23:47,680 INFO L290 TraceCheckUtils]: 37: Hoare triple {24305#(<= (+ main_~i~0 2) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {24305#(<= (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-27 10:23:47,680 INFO L290 TraceCheckUtils]: 36: Hoare triple {24305#(<= (+ main_~i~0 2) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {24305#(<= (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-27 10:23:47,680 INFO L290 TraceCheckUtils]: 35: Hoare triple {24304#(<= (+ main_~i~0 3) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {24305#(<= (+ main_~i~0 2) main_~edgecount~0)} is VALID [2022-04-27 10:23:47,681 INFO L290 TraceCheckUtils]: 34: Hoare triple {24304#(<= (+ main_~i~0 3) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {24304#(<= (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-27 10:23:47,681 INFO L290 TraceCheckUtils]: 33: Hoare triple {24304#(<= (+ main_~i~0 3) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {24304#(<= (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-27 10:23:47,681 INFO L290 TraceCheckUtils]: 32: Hoare triple {24490#(<= (+ main_~i~0 4) main_~edgecount~0)} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {24304#(<= (+ main_~i~0 3) main_~edgecount~0)} is VALID [2022-04-27 10:23:47,682 INFO L290 TraceCheckUtils]: 31: Hoare triple {24490#(<= (+ main_~i~0 4) main_~edgecount~0)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {24490#(<= (+ main_~i~0 4) main_~edgecount~0)} is VALID [2022-04-27 10:23:47,682 INFO L290 TraceCheckUtils]: 30: Hoare triple {24490#(<= (+ main_~i~0 4) main_~edgecount~0)} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {24490#(<= (+ main_~i~0 4) main_~edgecount~0)} is VALID [2022-04-27 10:23:47,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {24302#(<= 4 main_~edgecount~0)} ~i~0 := 0; {24490#(<= (+ main_~i~0 4) main_~edgecount~0)} is VALID [2022-04-27 10:23:47,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {24302#(<= 4 main_~edgecount~0)} assume !(~i~0 < ~nodecount~0); {24302#(<= 4 main_~edgecount~0)} is VALID [2022-04-27 10:23:47,683 INFO L290 TraceCheckUtils]: 27: Hoare triple {24302#(<= 4 main_~edgecount~0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {24302#(<= 4 main_~edgecount~0)} is VALID [2022-04-27 10:23:47,683 INFO L290 TraceCheckUtils]: 26: Hoare triple {24302#(<= 4 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {24302#(<= 4 main_~edgecount~0)} is VALID [2022-04-27 10:23:47,683 INFO L290 TraceCheckUtils]: 25: Hoare triple {24302#(<= 4 main_~edgecount~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {24302#(<= 4 main_~edgecount~0)} is VALID [2022-04-27 10:23:47,683 INFO L290 TraceCheckUtils]: 24: Hoare triple {24302#(<= 4 main_~edgecount~0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {24302#(<= 4 main_~edgecount~0)} is VALID [2022-04-27 10:23:47,684 INFO L290 TraceCheckUtils]: 23: Hoare triple {24301#(<= 3 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {24302#(<= 4 main_~edgecount~0)} is VALID [2022-04-27 10:23:47,685 INFO L290 TraceCheckUtils]: 22: Hoare triple {24300#(<= 2 main_~j~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {24301#(<= 3 main_~j~0)} is VALID [2022-04-27 10:23:47,685 INFO L290 TraceCheckUtils]: 21: Hoare triple {24300#(<= 2 main_~j~0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {24300#(<= 2 main_~j~0)} is VALID [2022-04-27 10:23:47,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {24300#(<= 2 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {24300#(<= 2 main_~j~0)} is VALID [2022-04-27 10:23:47,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {24299#(<= 1 main_~j~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {24300#(<= 2 main_~j~0)} is VALID [2022-04-27 10:23:47,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {24299#(<= 1 main_~j~0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {24299#(<= 1 main_~j~0)} is VALID [2022-04-27 10:23:47,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {24299#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {24299#(<= 1 main_~j~0)} is VALID [2022-04-27 10:23:47,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {24350#(<= 0 main_~j~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {24299#(<= 1 main_~j~0)} is VALID [2022-04-27 10:23:47,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {24350#(<= 0 main_~j~0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {24350#(<= 0 main_~j~0)} is VALID [2022-04-27 10:23:47,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {24350#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {24350#(<= 0 main_~j~0)} is VALID [2022-04-27 10:23:47,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {24293#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {24350#(<= 0 main_~j~0)} is VALID [2022-04-27 10:23:47,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {24293#true} ~i~0 := 0; {24293#true} is VALID [2022-04-27 10:23:47,687 INFO L290 TraceCheckUtils]: 11: Hoare triple {24293#true} assume !(~i~0 < ~nodecount~0); {24293#true} is VALID [2022-04-27 10:23:47,687 INFO L290 TraceCheckUtils]: 10: Hoare triple {24293#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {24293#true} is VALID [2022-04-27 10:23:47,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {24293#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {24293#true} is VALID [2022-04-27 10:23:47,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {24293#true} assume !!(~i~0 < ~nodecount~0); {24293#true} is VALID [2022-04-27 10:23:47,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {24293#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {24293#true} is VALID [2022-04-27 10:23:47,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {24293#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {24293#true} is VALID [2022-04-27 10:23:47,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {24293#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {24293#true} is VALID [2022-04-27 10:23:47,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {24293#true} call #t~ret22 := main(); {24293#true} is VALID [2022-04-27 10:23:47,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24293#true} {24293#true} #123#return; {24293#true} is VALID [2022-04-27 10:23:47,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {24293#true} assume true; {24293#true} is VALID [2022-04-27 10:23:47,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {24293#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {24293#true} is VALID [2022-04-27 10:23:47,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {24293#true} call ULTIMATE.init(); {24293#true} is VALID [2022-04-27 10:23:47,688 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:23:47,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153078672] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:23:47,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:23:47,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-04-27 10:23:47,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365942618] [2022-04-27 10:23:47,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:23:47,689 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-27 10:23:47,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:23:47,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:23:47,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:23:47,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 10:23:47,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:23:47,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 10:23:47,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-04-27 10:23:47,747 INFO L87 Difference]: Start difference. First operand 423 states and 552 transitions. Second operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:23:52,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:23:52,098 INFO L93 Difference]: Finished difference Result 879 states and 1136 transitions. [2022-04-27 10:23:52,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-27 10:23:52,099 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-27 10:23:52,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:23:52,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:23:52,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 170 transitions. [2022-04-27 10:23:52,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:23:52,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 170 transitions. [2022-04-27 10:23:52,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 170 transitions. [2022-04-27 10:23:52,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:23:52,298 INFO L225 Difference]: With dead ends: 879 [2022-04-27 10:23:52,298 INFO L226 Difference]: Without dead ends: 845 [2022-04-27 10:23:52,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=292, Invalid=898, Unknown=0, NotChecked=0, Total=1190 [2022-04-27 10:23:52,299 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 161 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 10:23:52,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 108 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 10:23:52,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2022-04-27 10:23:53,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 532. [2022-04-27 10:23:53,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:23:53,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 845 states. Second operand has 532 states, 519 states have (on average 1.3429672447013488) internal successors, (697), 522 states have internal predecessors, (697), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:23:53,997 INFO L74 IsIncluded]: Start isIncluded. First operand 845 states. Second operand has 532 states, 519 states have (on average 1.3429672447013488) internal successors, (697), 522 states have internal predecessors, (697), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:23:53,997 INFO L87 Difference]: Start difference. First operand 845 states. Second operand has 532 states, 519 states have (on average 1.3429672447013488) internal successors, (697), 522 states have internal predecessors, (697), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:23:54,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:23:54,031 INFO L93 Difference]: Finished difference Result 845 states and 1097 transitions. [2022-04-27 10:23:54,031 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1097 transitions. [2022-04-27 10:23:54,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:23:54,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:23:54,034 INFO L74 IsIncluded]: Start isIncluded. First operand has 532 states, 519 states have (on average 1.3429672447013488) internal successors, (697), 522 states have internal predecessors, (697), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Second operand 845 states. [2022-04-27 10:23:54,034 INFO L87 Difference]: Start difference. First operand has 532 states, 519 states have (on average 1.3429672447013488) internal successors, (697), 522 states have internal predecessors, (697), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Second operand 845 states. [2022-04-27 10:23:54,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:23:54,067 INFO L93 Difference]: Finished difference Result 845 states and 1097 transitions. [2022-04-27 10:23:54,067 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1097 transitions. [2022-04-27 10:23:54,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:23:54,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:23:54,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:23:54,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:23:54,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 519 states have (on average 1.3429672447013488) internal successors, (697), 522 states have internal predecessors, (697), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:23:54,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 711 transitions. [2022-04-27 10:23:54,086 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 711 transitions. Word has length 46 [2022-04-27 10:23:54,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:23:54,086 INFO L495 AbstractCegarLoop]: Abstraction has 532 states and 711 transitions. [2022-04-27 10:23:54,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:23:54,086 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 711 transitions. [2022-04-27 10:23:54,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-27 10:23:54,088 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:23:54,088 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:23:54,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-27 10:23:54,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:23:54,302 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:23:54,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:23:54,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1776596685, now seen corresponding path program 4 times [2022-04-27 10:23:54,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:23:54,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168674148] [2022-04-27 10:23:54,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:23:54,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:23:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:23:54,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:23:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:23:54,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {28321#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {28311#true} is VALID [2022-04-27 10:23:54,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {28311#true} assume true; {28311#true} is VALID [2022-04-27 10:23:54,380 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28311#true} {28311#true} #123#return; {28311#true} is VALID [2022-04-27 10:23:54,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {28311#true} call ULTIMATE.init(); {28321#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:23:54,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {28321#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {28311#true} is VALID [2022-04-27 10:23:54,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {28311#true} assume true; {28311#true} is VALID [2022-04-27 10:23:54,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28311#true} {28311#true} #123#return; {28311#true} is VALID [2022-04-27 10:23:54,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {28311#true} call #t~ret22 := main(); {28311#true} is VALID [2022-04-27 10:23:54,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {28311#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {28311#true} is VALID [2022-04-27 10:23:54,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {28311#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {28311#true} is VALID [2022-04-27 10:23:54,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {28311#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {28311#true} is VALID [2022-04-27 10:23:54,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {28311#true} assume !!(~i~0 < ~nodecount~0); {28311#true} is VALID [2022-04-27 10:23:54,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {28311#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28311#true} is VALID [2022-04-27 10:23:54,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {28311#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {28311#true} is VALID [2022-04-27 10:23:54,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {28311#true} assume !!(~i~0 < ~nodecount~0); {28311#true} is VALID [2022-04-27 10:23:54,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {28311#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28311#true} is VALID [2022-04-27 10:23:54,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {28311#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {28311#true} is VALID [2022-04-27 10:23:54,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {28311#true} assume !(~i~0 < ~nodecount~0); {28311#true} is VALID [2022-04-27 10:23:54,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {28311#true} ~i~0 := 0; {28311#true} is VALID [2022-04-27 10:23:54,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {28311#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {28316#(= main_~j~0 0)} is VALID [2022-04-27 10:23:54,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {28316#(= main_~j~0 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28316#(= main_~j~0 0)} is VALID [2022-04-27 10:23:54,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {28316#(= main_~j~0 0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {28316#(= main_~j~0 0)} is VALID [2022-04-27 10:23:54,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {28316#(= main_~j~0 0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {28317#(<= main_~j~0 1)} is VALID [2022-04-27 10:23:54,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {28317#(<= main_~j~0 1)} assume !(~j~0 < ~edgecount~0); {28318#(<= main_~edgecount~0 1)} is VALID [2022-04-27 10:23:54,383 INFO L290 TraceCheckUtils]: 21: Hoare triple {28318#(<= main_~edgecount~0 1)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {28318#(<= main_~edgecount~0 1)} is VALID [2022-04-27 10:23:54,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {28318#(<= main_~edgecount~0 1)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {28319#(and (= main_~j~0 0) (<= main_~edgecount~0 1))} is VALID [2022-04-27 10:23:54,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {28319#(and (= main_~j~0 0) (<= main_~edgecount~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28319#(and (= main_~j~0 0) (<= main_~edgecount~0 1))} is VALID [2022-04-27 10:23:54,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {28319#(and (= main_~j~0 0) (<= main_~edgecount~0 1))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {28319#(and (= main_~j~0 0) (<= main_~edgecount~0 1))} is VALID [2022-04-27 10:23:54,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {28319#(and (= main_~j~0 0) (<= main_~edgecount~0 1))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {28320#(<= main_~edgecount~0 main_~j~0)} is VALID [2022-04-27 10:23:54,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {28320#(<= main_~edgecount~0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28312#false} is VALID [2022-04-27 10:23:54,386 INFO L290 TraceCheckUtils]: 27: Hoare triple {28312#false} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {28312#false} is VALID [2022-04-27 10:23:54,386 INFO L290 TraceCheckUtils]: 28: Hoare triple {28312#false} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {28312#false} is VALID [2022-04-27 10:23:54,386 INFO L290 TraceCheckUtils]: 29: Hoare triple {28312#false} assume !(~j~0 < ~edgecount~0); {28312#false} is VALID [2022-04-27 10:23:54,386 INFO L290 TraceCheckUtils]: 30: Hoare triple {28312#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {28312#false} is VALID [2022-04-27 10:23:54,386 INFO L290 TraceCheckUtils]: 31: Hoare triple {28312#false} assume !(~i~0 < ~nodecount~0); {28312#false} is VALID [2022-04-27 10:23:54,386 INFO L290 TraceCheckUtils]: 32: Hoare triple {28312#false} ~i~0 := 0; {28312#false} is VALID [2022-04-27 10:23:54,386 INFO L290 TraceCheckUtils]: 33: Hoare triple {28312#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {28312#false} is VALID [2022-04-27 10:23:54,386 INFO L290 TraceCheckUtils]: 34: Hoare triple {28312#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {28312#false} is VALID [2022-04-27 10:23:54,386 INFO L290 TraceCheckUtils]: 35: Hoare triple {28312#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {28312#false} is VALID [2022-04-27 10:23:54,386 INFO L290 TraceCheckUtils]: 36: Hoare triple {28312#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {28312#false} is VALID [2022-04-27 10:23:54,386 INFO L290 TraceCheckUtils]: 37: Hoare triple {28312#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {28312#false} is VALID [2022-04-27 10:23:54,386 INFO L290 TraceCheckUtils]: 38: Hoare triple {28312#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {28312#false} is VALID [2022-04-27 10:23:54,386 INFO L290 TraceCheckUtils]: 39: Hoare triple {28312#false} assume !(~i~0 < ~edgecount~0); {28312#false} is VALID [2022-04-27 10:23:54,386 INFO L290 TraceCheckUtils]: 40: Hoare triple {28312#false} ~i~0 := 0; {28312#false} is VALID [2022-04-27 10:23:54,387 INFO L290 TraceCheckUtils]: 41: Hoare triple {28312#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28312#false} is VALID [2022-04-27 10:23:54,387 INFO L272 TraceCheckUtils]: 42: Hoare triple {28312#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {28312#false} is VALID [2022-04-27 10:23:54,387 INFO L290 TraceCheckUtils]: 43: Hoare triple {28312#false} ~cond := #in~cond; {28312#false} is VALID [2022-04-27 10:23:54,387 INFO L290 TraceCheckUtils]: 44: Hoare triple {28312#false} assume 0 == ~cond; {28312#false} is VALID [2022-04-27 10:23:54,387 INFO L290 TraceCheckUtils]: 45: Hoare triple {28312#false} assume !false; {28312#false} is VALID [2022-04-27 10:23:54,387 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 10:23:54,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:23:54,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168674148] [2022-04-27 10:23:54,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168674148] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:23:54,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928159370] [2022-04-27 10:23:54,387 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 10:23:54,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:23:54,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:23:54,389 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:23:54,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-27 10:23:54,505 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 10:23:54,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:23:54,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 10:23:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:23:54,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:23:54,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {28311#true} call ULTIMATE.init(); {28311#true} is VALID [2022-04-27 10:23:54,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {28311#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {28311#true} is VALID [2022-04-27 10:23:54,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {28311#true} assume true; {28311#true} is VALID [2022-04-27 10:23:54,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28311#true} {28311#true} #123#return; {28311#true} is VALID [2022-04-27 10:23:54,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {28311#true} call #t~ret22 := main(); {28311#true} is VALID [2022-04-27 10:23:54,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {28311#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {28311#true} is VALID [2022-04-27 10:23:54,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {28311#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {28311#true} is VALID [2022-04-27 10:23:54,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {28311#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {28311#true} is VALID [2022-04-27 10:23:54,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {28311#true} assume !!(~i~0 < ~nodecount~0); {28311#true} is VALID [2022-04-27 10:23:54,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {28311#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28311#true} is VALID [2022-04-27 10:23:54,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {28311#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {28311#true} is VALID [2022-04-27 10:23:54,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {28311#true} assume !!(~i~0 < ~nodecount~0); {28311#true} is VALID [2022-04-27 10:23:54,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {28311#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28311#true} is VALID [2022-04-27 10:23:54,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {28311#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {28311#true} is VALID [2022-04-27 10:23:54,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {28311#true} assume !(~i~0 < ~nodecount~0); {28311#true} is VALID [2022-04-27 10:23:54,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {28311#true} ~i~0 := 0; {28311#true} is VALID [2022-04-27 10:23:54,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {28311#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {28373#(<= main_~j~0 0)} is VALID [2022-04-27 10:23:54,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {28373#(<= main_~j~0 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28373#(<= main_~j~0 0)} is VALID [2022-04-27 10:23:54,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {28373#(<= main_~j~0 0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {28373#(<= main_~j~0 0)} is VALID [2022-04-27 10:23:54,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {28373#(<= main_~j~0 0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {28317#(<= main_~j~0 1)} is VALID [2022-04-27 10:23:54,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {28317#(<= main_~j~0 1)} assume !(~j~0 < ~edgecount~0); {28318#(<= main_~edgecount~0 1)} is VALID [2022-04-27 10:23:54,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {28318#(<= main_~edgecount~0 1)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {28318#(<= main_~edgecount~0 1)} is VALID [2022-04-27 10:23:54,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {28318#(<= main_~edgecount~0 1)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {28392#(and (<= 0 main_~j~0) (<= main_~edgecount~0 1))} is VALID [2022-04-27 10:23:54,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {28392#(and (<= 0 main_~j~0) (<= main_~edgecount~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28392#(and (<= 0 main_~j~0) (<= main_~edgecount~0 1))} is VALID [2022-04-27 10:23:54,683 INFO L290 TraceCheckUtils]: 24: Hoare triple {28392#(and (<= 0 main_~j~0) (<= main_~edgecount~0 1))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {28392#(and (<= 0 main_~j~0) (<= main_~edgecount~0 1))} is VALID [2022-04-27 10:23:54,683 INFO L290 TraceCheckUtils]: 25: Hoare triple {28392#(and (<= 0 main_~j~0) (<= main_~edgecount~0 1))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {28402#(and (<= 1 main_~j~0) (<= main_~edgecount~0 1))} is VALID [2022-04-27 10:23:54,684 INFO L290 TraceCheckUtils]: 26: Hoare triple {28402#(and (<= 1 main_~j~0) (<= main_~edgecount~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28312#false} is VALID [2022-04-27 10:23:54,684 INFO L290 TraceCheckUtils]: 27: Hoare triple {28312#false} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {28312#false} is VALID [2022-04-27 10:23:54,684 INFO L290 TraceCheckUtils]: 28: Hoare triple {28312#false} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {28312#false} is VALID [2022-04-27 10:23:54,684 INFO L290 TraceCheckUtils]: 29: Hoare triple {28312#false} assume !(~j~0 < ~edgecount~0); {28312#false} is VALID [2022-04-27 10:23:54,684 INFO L290 TraceCheckUtils]: 30: Hoare triple {28312#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {28312#false} is VALID [2022-04-27 10:23:54,684 INFO L290 TraceCheckUtils]: 31: Hoare triple {28312#false} assume !(~i~0 < ~nodecount~0); {28312#false} is VALID [2022-04-27 10:23:54,684 INFO L290 TraceCheckUtils]: 32: Hoare triple {28312#false} ~i~0 := 0; {28312#false} is VALID [2022-04-27 10:23:54,684 INFO L290 TraceCheckUtils]: 33: Hoare triple {28312#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {28312#false} is VALID [2022-04-27 10:23:54,684 INFO L290 TraceCheckUtils]: 34: Hoare triple {28312#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {28312#false} is VALID [2022-04-27 10:23:54,684 INFO L290 TraceCheckUtils]: 35: Hoare triple {28312#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {28312#false} is VALID [2022-04-27 10:23:54,684 INFO L290 TraceCheckUtils]: 36: Hoare triple {28312#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {28312#false} is VALID [2022-04-27 10:23:54,684 INFO L290 TraceCheckUtils]: 37: Hoare triple {28312#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {28312#false} is VALID [2022-04-27 10:23:54,685 INFO L290 TraceCheckUtils]: 38: Hoare triple {28312#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {28312#false} is VALID [2022-04-27 10:23:54,685 INFO L290 TraceCheckUtils]: 39: Hoare triple {28312#false} assume !(~i~0 < ~edgecount~0); {28312#false} is VALID [2022-04-27 10:23:54,685 INFO L290 TraceCheckUtils]: 40: Hoare triple {28312#false} ~i~0 := 0; {28312#false} is VALID [2022-04-27 10:23:54,685 INFO L290 TraceCheckUtils]: 41: Hoare triple {28312#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28312#false} is VALID [2022-04-27 10:23:54,685 INFO L272 TraceCheckUtils]: 42: Hoare triple {28312#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {28312#false} is VALID [2022-04-27 10:23:54,685 INFO L290 TraceCheckUtils]: 43: Hoare triple {28312#false} ~cond := #in~cond; {28312#false} is VALID [2022-04-27 10:23:54,685 INFO L290 TraceCheckUtils]: 44: Hoare triple {28312#false} assume 0 == ~cond; {28312#false} is VALID [2022-04-27 10:23:54,685 INFO L290 TraceCheckUtils]: 45: Hoare triple {28312#false} assume !false; {28312#false} is VALID [2022-04-27 10:23:54,685 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 10:23:54,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:23:54,828 INFO L290 TraceCheckUtils]: 45: Hoare triple {28312#false} assume !false; {28312#false} is VALID [2022-04-27 10:23:54,828 INFO L290 TraceCheckUtils]: 44: Hoare triple {28312#false} assume 0 == ~cond; {28312#false} is VALID [2022-04-27 10:23:54,828 INFO L290 TraceCheckUtils]: 43: Hoare triple {28312#false} ~cond := #in~cond; {28312#false} is VALID [2022-04-27 10:23:54,828 INFO L272 TraceCheckUtils]: 42: Hoare triple {28312#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {28312#false} is VALID [2022-04-27 10:23:54,828 INFO L290 TraceCheckUtils]: 41: Hoare triple {28312#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28312#false} is VALID [2022-04-27 10:23:54,828 INFO L290 TraceCheckUtils]: 40: Hoare triple {28312#false} ~i~0 := 0; {28312#false} is VALID [2022-04-27 10:23:54,828 INFO L290 TraceCheckUtils]: 39: Hoare triple {28312#false} assume !(~i~0 < ~edgecount~0); {28312#false} is VALID [2022-04-27 10:23:54,829 INFO L290 TraceCheckUtils]: 38: Hoare triple {28312#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {28312#false} is VALID [2022-04-27 10:23:54,829 INFO L290 TraceCheckUtils]: 37: Hoare triple {28312#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {28312#false} is VALID [2022-04-27 10:23:54,829 INFO L290 TraceCheckUtils]: 36: Hoare triple {28312#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {28312#false} is VALID [2022-04-27 10:23:54,829 INFO L290 TraceCheckUtils]: 35: Hoare triple {28312#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {28312#false} is VALID [2022-04-27 10:23:54,829 INFO L290 TraceCheckUtils]: 34: Hoare triple {28312#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {28312#false} is VALID [2022-04-27 10:23:54,829 INFO L290 TraceCheckUtils]: 33: Hoare triple {28312#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {28312#false} is VALID [2022-04-27 10:23:54,829 INFO L290 TraceCheckUtils]: 32: Hoare triple {28312#false} ~i~0 := 0; {28312#false} is VALID [2022-04-27 10:23:54,829 INFO L290 TraceCheckUtils]: 31: Hoare triple {28312#false} assume !(~i~0 < ~nodecount~0); {28312#false} is VALID [2022-04-27 10:23:54,829 INFO L290 TraceCheckUtils]: 30: Hoare triple {28312#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {28312#false} is VALID [2022-04-27 10:23:54,829 INFO L290 TraceCheckUtils]: 29: Hoare triple {28312#false} assume !(~j~0 < ~edgecount~0); {28312#false} is VALID [2022-04-27 10:23:54,829 INFO L290 TraceCheckUtils]: 28: Hoare triple {28312#false} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {28312#false} is VALID [2022-04-27 10:23:54,829 INFO L290 TraceCheckUtils]: 27: Hoare triple {28312#false} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {28312#false} is VALID [2022-04-27 10:23:54,830 INFO L290 TraceCheckUtils]: 26: Hoare triple {28320#(<= main_~edgecount~0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28312#false} is VALID [2022-04-27 10:23:54,830 INFO L290 TraceCheckUtils]: 25: Hoare triple {28523#(<= main_~edgecount~0 (+ main_~j~0 1))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {28320#(<= main_~edgecount~0 main_~j~0)} is VALID [2022-04-27 10:23:54,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {28523#(<= main_~edgecount~0 (+ main_~j~0 1))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {28523#(<= main_~edgecount~0 (+ main_~j~0 1))} is VALID [2022-04-27 10:23:54,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {28523#(<= main_~edgecount~0 (+ main_~j~0 1))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28523#(<= main_~edgecount~0 (+ main_~j~0 1))} is VALID [2022-04-27 10:23:54,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {28318#(<= main_~edgecount~0 1)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {28523#(<= main_~edgecount~0 (+ main_~j~0 1))} is VALID [2022-04-27 10:23:54,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {28318#(<= main_~edgecount~0 1)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {28318#(<= main_~edgecount~0 1)} is VALID [2022-04-27 10:23:54,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {28317#(<= main_~j~0 1)} assume !(~j~0 < ~edgecount~0); {28318#(<= main_~edgecount~0 1)} is VALID [2022-04-27 10:23:54,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {28373#(<= main_~j~0 0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {28317#(<= main_~j~0 1)} is VALID [2022-04-27 10:23:54,833 INFO L290 TraceCheckUtils]: 18: Hoare triple {28373#(<= main_~j~0 0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {28373#(<= main_~j~0 0)} is VALID [2022-04-27 10:23:54,833 INFO L290 TraceCheckUtils]: 17: Hoare triple {28373#(<= main_~j~0 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {28373#(<= main_~j~0 0)} is VALID [2022-04-27 10:23:54,833 INFO L290 TraceCheckUtils]: 16: Hoare triple {28311#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {28373#(<= main_~j~0 0)} is VALID [2022-04-27 10:23:54,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {28311#true} ~i~0 := 0; {28311#true} is VALID [2022-04-27 10:23:54,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {28311#true} assume !(~i~0 < ~nodecount~0); {28311#true} is VALID [2022-04-27 10:23:54,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {28311#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {28311#true} is VALID [2022-04-27 10:23:54,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {28311#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28311#true} is VALID [2022-04-27 10:23:54,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {28311#true} assume !!(~i~0 < ~nodecount~0); {28311#true} is VALID [2022-04-27 10:23:54,834 INFO L290 TraceCheckUtils]: 10: Hoare triple {28311#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {28311#true} is VALID [2022-04-27 10:23:54,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {28311#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {28311#true} is VALID [2022-04-27 10:23:54,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {28311#true} assume !!(~i~0 < ~nodecount~0); {28311#true} is VALID [2022-04-27 10:23:54,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {28311#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {28311#true} is VALID [2022-04-27 10:23:54,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {28311#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {28311#true} is VALID [2022-04-27 10:23:54,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {28311#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {28311#true} is VALID [2022-04-27 10:23:54,834 INFO L272 TraceCheckUtils]: 4: Hoare triple {28311#true} call #t~ret22 := main(); {28311#true} is VALID [2022-04-27 10:23:54,834 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28311#true} {28311#true} #123#return; {28311#true} is VALID [2022-04-27 10:23:54,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {28311#true} assume true; {28311#true} is VALID [2022-04-27 10:23:54,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {28311#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {28311#true} is VALID [2022-04-27 10:23:54,834 INFO L272 TraceCheckUtils]: 0: Hoare triple {28311#true} call ULTIMATE.init(); {28311#true} is VALID [2022-04-27 10:23:54,834 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 10:23:54,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928159370] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:23:54,835 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:23:54,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-04-27 10:23:54,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630930033] [2022-04-27 10:23:54,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:23:54,837 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-27 10:23:54,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:23:54,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:23:54,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:23:54,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 10:23:54,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:23:54,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 10:23:54,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:23:54,876 INFO L87 Difference]: Start difference. First operand 532 states and 711 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:23:58,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:23:58,305 INFO L93 Difference]: Finished difference Result 980 states and 1288 transitions. [2022-04-27 10:23:58,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 10:23:58,305 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-27 10:23:58,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:23:58,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:23:58,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2022-04-27 10:23:58,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:23:58,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2022-04-27 10:23:58,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 122 transitions. [2022-04-27 10:23:58,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:23:58,437 INFO L225 Difference]: With dead ends: 980 [2022-04-27 10:23:58,437 INFO L226 Difference]: Without dead ends: 776 [2022-04-27 10:23:58,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2022-04-27 10:23:58,438 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 193 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:23:58,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 78 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:23:58,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2022-04-27 10:24:00,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 601. [2022-04-27 10:24:00,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:24:00,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 776 states. Second operand has 601 states, 588 states have (on average 1.3265306122448979) internal successors, (780), 591 states have internal predecessors, (780), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:24:00,408 INFO L74 IsIncluded]: Start isIncluded. First operand 776 states. Second operand has 601 states, 588 states have (on average 1.3265306122448979) internal successors, (780), 591 states have internal predecessors, (780), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:24:00,408 INFO L87 Difference]: Start difference. First operand 776 states. Second operand has 601 states, 588 states have (on average 1.3265306122448979) internal successors, (780), 591 states have internal predecessors, (780), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:24:00,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:24:00,438 INFO L93 Difference]: Finished difference Result 776 states and 1003 transitions. [2022-04-27 10:24:00,438 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1003 transitions. [2022-04-27 10:24:00,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:24:00,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:24:00,442 INFO L74 IsIncluded]: Start isIncluded. First operand has 601 states, 588 states have (on average 1.3265306122448979) internal successors, (780), 591 states have internal predecessors, (780), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Second operand 776 states. [2022-04-27 10:24:00,442 INFO L87 Difference]: Start difference. First operand has 601 states, 588 states have (on average 1.3265306122448979) internal successors, (780), 591 states have internal predecessors, (780), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Second operand 776 states. [2022-04-27 10:24:00,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:24:00,471 INFO L93 Difference]: Finished difference Result 776 states and 1003 transitions. [2022-04-27 10:24:00,471 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1003 transitions. [2022-04-27 10:24:00,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:24:00,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:24:00,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:24:00,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:24:00,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 588 states have (on average 1.3265306122448979) internal successors, (780), 591 states have internal predecessors, (780), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:24:00,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 794 transitions. [2022-04-27 10:24:00,493 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 794 transitions. Word has length 46 [2022-04-27 10:24:00,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:24:00,494 INFO L495 AbstractCegarLoop]: Abstraction has 601 states and 794 transitions. [2022-04-27 10:24:00,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:00,494 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 794 transitions. [2022-04-27 10:24:00,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-27 10:24:00,495 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:24:00,495 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:24:00,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-27 10:24:00,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:24:00,711 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:24:00,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:24:00,712 INFO L85 PathProgramCache]: Analyzing trace with hash -218065925, now seen corresponding path program 5 times [2022-04-27 10:24:00,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:24:00,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102185359] [2022-04-27 10:24:00,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:24:00,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:24:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:24:00,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:24:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:24:00,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {32415#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {32405#true} is VALID [2022-04-27 10:24:00,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {32405#true} assume true; {32405#true} is VALID [2022-04-27 10:24:00,788 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32405#true} {32405#true} #123#return; {32405#true} is VALID [2022-04-27 10:24:00,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {32405#true} call ULTIMATE.init(); {32415#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:24:00,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {32415#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {32405#true} is VALID [2022-04-27 10:24:00,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {32405#true} assume true; {32405#true} is VALID [2022-04-27 10:24:00,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32405#true} {32405#true} #123#return; {32405#true} is VALID [2022-04-27 10:24:00,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {32405#true} call #t~ret22 := main(); {32405#true} is VALID [2022-04-27 10:24:00,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {32405#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {32405#true} is VALID [2022-04-27 10:24:00,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {32405#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {32405#true} is VALID [2022-04-27 10:24:00,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {32405#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {32405#true} is VALID [2022-04-27 10:24:00,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {32405#true} assume !!(~i~0 < ~nodecount~0); {32405#true} is VALID [2022-04-27 10:24:00,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {32405#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {32405#true} is VALID [2022-04-27 10:24:00,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {32405#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {32405#true} is VALID [2022-04-27 10:24:00,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {32405#true} assume !!(~i~0 < ~nodecount~0); {32405#true} is VALID [2022-04-27 10:24:00,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {32405#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {32405#true} is VALID [2022-04-27 10:24:00,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {32405#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {32405#true} is VALID [2022-04-27 10:24:00,789 INFO L290 TraceCheckUtils]: 14: Hoare triple {32405#true} assume !(~i~0 < ~nodecount~0); {32405#true} is VALID [2022-04-27 10:24:00,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {32405#true} ~i~0 := 0; {32405#true} is VALID [2022-04-27 10:24:00,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {32405#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {32410#(= main_~j~0 0)} is VALID [2022-04-27 10:24:00,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {32410#(= main_~j~0 0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32410#(= main_~j~0 0)} is VALID [2022-04-27 10:24:00,790 INFO L290 TraceCheckUtils]: 18: Hoare triple {32410#(= main_~j~0 0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {32410#(= main_~j~0 0)} is VALID [2022-04-27 10:24:00,790 INFO L290 TraceCheckUtils]: 19: Hoare triple {32410#(= main_~j~0 0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {32411#(<= 1 main_~j~0)} is VALID [2022-04-27 10:24:00,791 INFO L290 TraceCheckUtils]: 20: Hoare triple {32411#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32412#(<= 2 main_~edgecount~0)} is VALID [2022-04-27 10:24:00,791 INFO L290 TraceCheckUtils]: 21: Hoare triple {32412#(<= 2 main_~edgecount~0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {32412#(<= 2 main_~edgecount~0)} is VALID [2022-04-27 10:24:00,792 INFO L290 TraceCheckUtils]: 22: Hoare triple {32412#(<= 2 main_~edgecount~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {32412#(<= 2 main_~edgecount~0)} is VALID [2022-04-27 10:24:00,792 INFO L290 TraceCheckUtils]: 23: Hoare triple {32412#(<= 2 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {32412#(<= 2 main_~edgecount~0)} is VALID [2022-04-27 10:24:00,792 INFO L290 TraceCheckUtils]: 24: Hoare triple {32412#(<= 2 main_~edgecount~0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {32412#(<= 2 main_~edgecount~0)} is VALID [2022-04-27 10:24:00,792 INFO L290 TraceCheckUtils]: 25: Hoare triple {32412#(<= 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {32413#(and (= main_~j~0 0) (<= 2 main_~edgecount~0))} is VALID [2022-04-27 10:24:00,793 INFO L290 TraceCheckUtils]: 26: Hoare triple {32413#(and (= main_~j~0 0) (<= 2 main_~edgecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32413#(and (= main_~j~0 0) (<= 2 main_~edgecount~0))} is VALID [2022-04-27 10:24:00,793 INFO L290 TraceCheckUtils]: 27: Hoare triple {32413#(and (= main_~j~0 0) (<= 2 main_~edgecount~0))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {32413#(and (= main_~j~0 0) (<= 2 main_~edgecount~0))} is VALID [2022-04-27 10:24:00,794 INFO L290 TraceCheckUtils]: 28: Hoare triple {32413#(and (= main_~j~0 0) (<= 2 main_~edgecount~0))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {32414#(<= (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-27 10:24:00,794 INFO L290 TraceCheckUtils]: 29: Hoare triple {32414#(<= (+ main_~j~0 1) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {32406#false} is VALID [2022-04-27 10:24:00,794 INFO L290 TraceCheckUtils]: 30: Hoare triple {32406#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {32406#false} is VALID [2022-04-27 10:24:00,794 INFO L290 TraceCheckUtils]: 31: Hoare triple {32406#false} assume !(~i~0 < ~nodecount~0); {32406#false} is VALID [2022-04-27 10:24:00,794 INFO L290 TraceCheckUtils]: 32: Hoare triple {32406#false} ~i~0 := 0; {32406#false} is VALID [2022-04-27 10:24:00,794 INFO L290 TraceCheckUtils]: 33: Hoare triple {32406#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {32406#false} is VALID [2022-04-27 10:24:00,795 INFO L290 TraceCheckUtils]: 34: Hoare triple {32406#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {32406#false} is VALID [2022-04-27 10:24:00,795 INFO L290 TraceCheckUtils]: 35: Hoare triple {32406#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {32406#false} is VALID [2022-04-27 10:24:00,795 INFO L290 TraceCheckUtils]: 36: Hoare triple {32406#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {32406#false} is VALID [2022-04-27 10:24:00,795 INFO L290 TraceCheckUtils]: 37: Hoare triple {32406#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {32406#false} is VALID [2022-04-27 10:24:00,795 INFO L290 TraceCheckUtils]: 38: Hoare triple {32406#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {32406#false} is VALID [2022-04-27 10:24:00,795 INFO L290 TraceCheckUtils]: 39: Hoare triple {32406#false} assume !(~i~0 < ~edgecount~0); {32406#false} is VALID [2022-04-27 10:24:00,795 INFO L290 TraceCheckUtils]: 40: Hoare triple {32406#false} ~i~0 := 0; {32406#false} is VALID [2022-04-27 10:24:00,795 INFO L290 TraceCheckUtils]: 41: Hoare triple {32406#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {32406#false} is VALID [2022-04-27 10:24:00,795 INFO L272 TraceCheckUtils]: 42: Hoare triple {32406#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {32406#false} is VALID [2022-04-27 10:24:00,795 INFO L290 TraceCheckUtils]: 43: Hoare triple {32406#false} ~cond := #in~cond; {32406#false} is VALID [2022-04-27 10:24:00,795 INFO L290 TraceCheckUtils]: 44: Hoare triple {32406#false} assume 0 == ~cond; {32406#false} is VALID [2022-04-27 10:24:00,795 INFO L290 TraceCheckUtils]: 45: Hoare triple {32406#false} assume !false; {32406#false} is VALID [2022-04-27 10:24:00,795 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 10:24:00,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:24:00,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102185359] [2022-04-27 10:24:00,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102185359] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:24:00,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697113889] [2022-04-27 10:24:00,796 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 10:24:00,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:24:00,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:24:00,797 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:24:00,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-27 10:24:00,917 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-04-27 10:24:00,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:24:00,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 10:24:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:24:00,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:24:01,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {32405#true} call ULTIMATE.init(); {32405#true} is VALID [2022-04-27 10:24:01,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {32405#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {32405#true} is VALID [2022-04-27 10:24:01,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {32405#true} assume true; {32405#true} is VALID [2022-04-27 10:24:01,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32405#true} {32405#true} #123#return; {32405#true} is VALID [2022-04-27 10:24:01,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {32405#true} call #t~ret22 := main(); {32405#true} is VALID [2022-04-27 10:24:01,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {32405#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {32405#true} is VALID [2022-04-27 10:24:01,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {32405#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {32405#true} is VALID [2022-04-27 10:24:01,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {32405#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {32405#true} is VALID [2022-04-27 10:24:01,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {32405#true} assume !!(~i~0 < ~nodecount~0); {32405#true} is VALID [2022-04-27 10:24:01,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {32405#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {32405#true} is VALID [2022-04-27 10:24:01,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {32405#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {32405#true} is VALID [2022-04-27 10:24:01,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {32405#true} assume !!(~i~0 < ~nodecount~0); {32405#true} is VALID [2022-04-27 10:24:01,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {32405#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {32405#true} is VALID [2022-04-27 10:24:01,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {32405#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {32405#true} is VALID [2022-04-27 10:24:01,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {32405#true} assume !(~i~0 < ~nodecount~0); {32405#true} is VALID [2022-04-27 10:24:01,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {32405#true} ~i~0 := 0; {32405#true} is VALID [2022-04-27 10:24:01,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {32405#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {32467#(<= 0 main_~j~0)} is VALID [2022-04-27 10:24:01,132 INFO L290 TraceCheckUtils]: 17: Hoare triple {32467#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32467#(<= 0 main_~j~0)} is VALID [2022-04-27 10:24:01,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {32467#(<= 0 main_~j~0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {32467#(<= 0 main_~j~0)} is VALID [2022-04-27 10:24:01,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {32467#(<= 0 main_~j~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {32411#(<= 1 main_~j~0)} is VALID [2022-04-27 10:24:01,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {32411#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32412#(<= 2 main_~edgecount~0)} is VALID [2022-04-27 10:24:01,134 INFO L290 TraceCheckUtils]: 21: Hoare triple {32412#(<= 2 main_~edgecount~0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {32412#(<= 2 main_~edgecount~0)} is VALID [2022-04-27 10:24:01,134 INFO L290 TraceCheckUtils]: 22: Hoare triple {32412#(<= 2 main_~edgecount~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {32412#(<= 2 main_~edgecount~0)} is VALID [2022-04-27 10:24:01,135 INFO L290 TraceCheckUtils]: 23: Hoare triple {32412#(<= 2 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {32412#(<= 2 main_~edgecount~0)} is VALID [2022-04-27 10:24:01,135 INFO L290 TraceCheckUtils]: 24: Hoare triple {32412#(<= 2 main_~edgecount~0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {32412#(<= 2 main_~edgecount~0)} is VALID [2022-04-27 10:24:01,135 INFO L290 TraceCheckUtils]: 25: Hoare triple {32412#(<= 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {32495#(and (<= 2 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-27 10:24:01,136 INFO L290 TraceCheckUtils]: 26: Hoare triple {32495#(and (<= 2 main_~edgecount~0) (<= main_~j~0 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32495#(and (<= 2 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-27 10:24:01,137 INFO L290 TraceCheckUtils]: 27: Hoare triple {32495#(and (<= 2 main_~edgecount~0) (<= main_~j~0 0))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {32495#(and (<= 2 main_~edgecount~0) (<= main_~j~0 0))} is VALID [2022-04-27 10:24:01,137 INFO L290 TraceCheckUtils]: 28: Hoare triple {32495#(and (<= 2 main_~edgecount~0) (<= main_~j~0 0))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {32505#(and (<= 2 main_~edgecount~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:24:01,137 INFO L290 TraceCheckUtils]: 29: Hoare triple {32505#(and (<= 2 main_~edgecount~0) (<= main_~j~0 1))} assume !(~j~0 < ~edgecount~0); {32406#false} is VALID [2022-04-27 10:24:01,138 INFO L290 TraceCheckUtils]: 30: Hoare triple {32406#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {32406#false} is VALID [2022-04-27 10:24:01,138 INFO L290 TraceCheckUtils]: 31: Hoare triple {32406#false} assume !(~i~0 < ~nodecount~0); {32406#false} is VALID [2022-04-27 10:24:01,138 INFO L290 TraceCheckUtils]: 32: Hoare triple {32406#false} ~i~0 := 0; {32406#false} is VALID [2022-04-27 10:24:01,138 INFO L290 TraceCheckUtils]: 33: Hoare triple {32406#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {32406#false} is VALID [2022-04-27 10:24:01,138 INFO L290 TraceCheckUtils]: 34: Hoare triple {32406#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {32406#false} is VALID [2022-04-27 10:24:01,138 INFO L290 TraceCheckUtils]: 35: Hoare triple {32406#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {32406#false} is VALID [2022-04-27 10:24:01,138 INFO L290 TraceCheckUtils]: 36: Hoare triple {32406#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {32406#false} is VALID [2022-04-27 10:24:01,138 INFO L290 TraceCheckUtils]: 37: Hoare triple {32406#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {32406#false} is VALID [2022-04-27 10:24:01,138 INFO L290 TraceCheckUtils]: 38: Hoare triple {32406#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {32406#false} is VALID [2022-04-27 10:24:01,138 INFO L290 TraceCheckUtils]: 39: Hoare triple {32406#false} assume !(~i~0 < ~edgecount~0); {32406#false} is VALID [2022-04-27 10:24:01,138 INFO L290 TraceCheckUtils]: 40: Hoare triple {32406#false} ~i~0 := 0; {32406#false} is VALID [2022-04-27 10:24:01,138 INFO L290 TraceCheckUtils]: 41: Hoare triple {32406#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {32406#false} is VALID [2022-04-27 10:24:01,138 INFO L272 TraceCheckUtils]: 42: Hoare triple {32406#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {32406#false} is VALID [2022-04-27 10:24:01,138 INFO L290 TraceCheckUtils]: 43: Hoare triple {32406#false} ~cond := #in~cond; {32406#false} is VALID [2022-04-27 10:24:01,138 INFO L290 TraceCheckUtils]: 44: Hoare triple {32406#false} assume 0 == ~cond; {32406#false} is VALID [2022-04-27 10:24:01,139 INFO L290 TraceCheckUtils]: 45: Hoare triple {32406#false} assume !false; {32406#false} is VALID [2022-04-27 10:24:01,139 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 10:24:01,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:24:01,305 INFO L290 TraceCheckUtils]: 45: Hoare triple {32406#false} assume !false; {32406#false} is VALID [2022-04-27 10:24:01,305 INFO L290 TraceCheckUtils]: 44: Hoare triple {32406#false} assume 0 == ~cond; {32406#false} is VALID [2022-04-27 10:24:01,305 INFO L290 TraceCheckUtils]: 43: Hoare triple {32406#false} ~cond := #in~cond; {32406#false} is VALID [2022-04-27 10:24:01,305 INFO L272 TraceCheckUtils]: 42: Hoare triple {32406#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {32406#false} is VALID [2022-04-27 10:24:01,305 INFO L290 TraceCheckUtils]: 41: Hoare triple {32406#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {32406#false} is VALID [2022-04-27 10:24:01,305 INFO L290 TraceCheckUtils]: 40: Hoare triple {32406#false} ~i~0 := 0; {32406#false} is VALID [2022-04-27 10:24:01,305 INFO L290 TraceCheckUtils]: 39: Hoare triple {32406#false} assume !(~i~0 < ~edgecount~0); {32406#false} is VALID [2022-04-27 10:24:01,305 INFO L290 TraceCheckUtils]: 38: Hoare triple {32406#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {32406#false} is VALID [2022-04-27 10:24:01,305 INFO L290 TraceCheckUtils]: 37: Hoare triple {32406#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {32406#false} is VALID [2022-04-27 10:24:01,305 INFO L290 TraceCheckUtils]: 36: Hoare triple {32406#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {32406#false} is VALID [2022-04-27 10:24:01,306 INFO L290 TraceCheckUtils]: 35: Hoare triple {32406#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {32406#false} is VALID [2022-04-27 10:24:01,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {32406#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {32406#false} is VALID [2022-04-27 10:24:01,306 INFO L290 TraceCheckUtils]: 33: Hoare triple {32406#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {32406#false} is VALID [2022-04-27 10:24:01,306 INFO L290 TraceCheckUtils]: 32: Hoare triple {32406#false} ~i~0 := 0; {32406#false} is VALID [2022-04-27 10:24:01,306 INFO L290 TraceCheckUtils]: 31: Hoare triple {32406#false} assume !(~i~0 < ~nodecount~0); {32406#false} is VALID [2022-04-27 10:24:01,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {32406#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {32406#false} is VALID [2022-04-27 10:24:01,306 INFO L290 TraceCheckUtils]: 29: Hoare triple {32414#(<= (+ main_~j~0 1) main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {32406#false} is VALID [2022-04-27 10:24:01,307 INFO L290 TraceCheckUtils]: 28: Hoare triple {32608#(<= (+ main_~j~0 2) main_~edgecount~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {32414#(<= (+ main_~j~0 1) main_~edgecount~0)} is VALID [2022-04-27 10:24:01,307 INFO L290 TraceCheckUtils]: 27: Hoare triple {32608#(<= (+ main_~j~0 2) main_~edgecount~0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {32608#(<= (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-27 10:24:01,308 INFO L290 TraceCheckUtils]: 26: Hoare triple {32608#(<= (+ main_~j~0 2) main_~edgecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32608#(<= (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-27 10:24:01,308 INFO L290 TraceCheckUtils]: 25: Hoare triple {32412#(<= 2 main_~edgecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {32608#(<= (+ main_~j~0 2) main_~edgecount~0)} is VALID [2022-04-27 10:24:01,309 INFO L290 TraceCheckUtils]: 24: Hoare triple {32412#(<= 2 main_~edgecount~0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {32412#(<= 2 main_~edgecount~0)} is VALID [2022-04-27 10:24:01,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {32412#(<= 2 main_~edgecount~0)} assume !(~j~0 < ~edgecount~0); {32412#(<= 2 main_~edgecount~0)} is VALID [2022-04-27 10:24:01,309 INFO L290 TraceCheckUtils]: 22: Hoare triple {32412#(<= 2 main_~edgecount~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {32412#(<= 2 main_~edgecount~0)} is VALID [2022-04-27 10:24:01,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {32412#(<= 2 main_~edgecount~0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {32412#(<= 2 main_~edgecount~0)} is VALID [2022-04-27 10:24:01,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {32411#(<= 1 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32412#(<= 2 main_~edgecount~0)} is VALID [2022-04-27 10:24:01,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {32467#(<= 0 main_~j~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {32411#(<= 1 main_~j~0)} is VALID [2022-04-27 10:24:01,311 INFO L290 TraceCheckUtils]: 18: Hoare triple {32467#(<= 0 main_~j~0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {32467#(<= 0 main_~j~0)} is VALID [2022-04-27 10:24:01,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {32467#(<= 0 main_~j~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {32467#(<= 0 main_~j~0)} is VALID [2022-04-27 10:24:01,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {32405#true} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {32467#(<= 0 main_~j~0)} is VALID [2022-04-27 10:24:01,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {32405#true} ~i~0 := 0; {32405#true} is VALID [2022-04-27 10:24:01,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {32405#true} assume !(~i~0 < ~nodecount~0); {32405#true} is VALID [2022-04-27 10:24:01,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {32405#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {32405#true} is VALID [2022-04-27 10:24:01,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {32405#true} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {32405#true} is VALID [2022-04-27 10:24:01,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {32405#true} assume !!(~i~0 < ~nodecount~0); {32405#true} is VALID [2022-04-27 10:24:01,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {32405#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {32405#true} is VALID [2022-04-27 10:24:01,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {32405#true} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {32405#true} is VALID [2022-04-27 10:24:01,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {32405#true} assume !!(~i~0 < ~nodecount~0); {32405#true} is VALID [2022-04-27 10:24:01,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {32405#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {32405#true} is VALID [2022-04-27 10:24:01,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {32405#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {32405#true} is VALID [2022-04-27 10:24:01,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {32405#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {32405#true} is VALID [2022-04-27 10:24:01,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {32405#true} call #t~ret22 := main(); {32405#true} is VALID [2022-04-27 10:24:01,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32405#true} {32405#true} #123#return; {32405#true} is VALID [2022-04-27 10:24:01,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {32405#true} assume true; {32405#true} is VALID [2022-04-27 10:24:01,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {32405#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {32405#true} is VALID [2022-04-27 10:24:01,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {32405#true} call ULTIMATE.init(); {32405#true} is VALID [2022-04-27 10:24:01,313 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 10:24:01,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697113889] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:24:01,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:24:01,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-04-27 10:24:01,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880153574] [2022-04-27 10:24:01,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:24:01,314 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-27 10:24:01,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:24:01,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:01,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:24:01,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 10:24:01,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:24:01,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 10:24:01,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:24:01,359 INFO L87 Difference]: Start difference. First operand 601 states and 794 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:04,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:24:04,230 INFO L93 Difference]: Finished difference Result 754 states and 972 transitions. [2022-04-27 10:24:04,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 10:24:04,230 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-27 10:24:04,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:24:04,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:04,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2022-04-27 10:24:04,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:04,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2022-04-27 10:24:04,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 107 transitions. [2022-04-27 10:24:04,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:24:04,327 INFO L225 Difference]: With dead ends: 754 [2022-04-27 10:24:04,327 INFO L226 Difference]: Without dead ends: 613 [2022-04-27 10:24:04,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2022-04-27 10:24:04,328 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 107 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:24:04,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 91 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 10:24:04,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2022-04-27 10:24:06,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 552. [2022-04-27 10:24:06,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:24:06,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 613 states. Second operand has 552 states, 539 states have (on average 1.300556586270872) internal successors, (701), 542 states have internal predecessors, (701), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:24:06,151 INFO L74 IsIncluded]: Start isIncluded. First operand 613 states. Second operand has 552 states, 539 states have (on average 1.300556586270872) internal successors, (701), 542 states have internal predecessors, (701), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:24:06,152 INFO L87 Difference]: Start difference. First operand 613 states. Second operand has 552 states, 539 states have (on average 1.300556586270872) internal successors, (701), 542 states have internal predecessors, (701), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:24:06,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:24:06,169 INFO L93 Difference]: Finished difference Result 613 states and 794 transitions. [2022-04-27 10:24:06,169 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 794 transitions. [2022-04-27 10:24:06,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:24:06,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:24:06,171 INFO L74 IsIncluded]: Start isIncluded. First operand has 552 states, 539 states have (on average 1.300556586270872) internal successors, (701), 542 states have internal predecessors, (701), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Second operand 613 states. [2022-04-27 10:24:06,171 INFO L87 Difference]: Start difference. First operand has 552 states, 539 states have (on average 1.300556586270872) internal successors, (701), 542 states have internal predecessors, (701), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Second operand 613 states. [2022-04-27 10:24:06,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:24:06,188 INFO L93 Difference]: Finished difference Result 613 states and 794 transitions. [2022-04-27 10:24:06,188 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 794 transitions. [2022-04-27 10:24:06,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:24:06,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:24:06,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:24:06,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:24:06,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 539 states have (on average 1.300556586270872) internal successors, (701), 542 states have internal predecessors, (701), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:24:06,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 715 transitions. [2022-04-27 10:24:06,207 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 715 transitions. Word has length 46 [2022-04-27 10:24:06,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:24:06,207 INFO L495 AbstractCegarLoop]: Abstraction has 552 states and 715 transitions. [2022-04-27 10:24:06,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:06,208 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 715 transitions. [2022-04-27 10:24:06,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-27 10:24:06,209 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:24:06,209 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:24:06,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-27 10:24:06,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-04-27 10:24:06,431 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:24:06,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:24:06,432 INFO L85 PathProgramCache]: Analyzing trace with hash 488480228, now seen corresponding path program 6 times [2022-04-27 10:24:06,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:24:06,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134516243] [2022-04-27 10:24:06,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:24:06,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:24:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:24:06,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:24:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:24:06,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {35798#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {35785#true} is VALID [2022-04-27 10:24:06,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {35785#true} assume true; {35785#true} is VALID [2022-04-27 10:24:06,544 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35785#true} {35785#true} #123#return; {35785#true} is VALID [2022-04-27 10:24:06,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {35785#true} call ULTIMATE.init(); {35798#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:24:06,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {35798#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {35785#true} is VALID [2022-04-27 10:24:06,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {35785#true} assume true; {35785#true} is VALID [2022-04-27 10:24:06,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35785#true} {35785#true} #123#return; {35785#true} is VALID [2022-04-27 10:24:06,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {35785#true} call #t~ret22 := main(); {35785#true} is VALID [2022-04-27 10:24:06,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {35785#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {35785#true} is VALID [2022-04-27 10:24:06,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {35785#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {35785#true} is VALID [2022-04-27 10:24:06,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {35785#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {35790#(= main_~i~0 0)} is VALID [2022-04-27 10:24:06,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {35790#(= main_~i~0 0)} assume !!(~i~0 < ~nodecount~0); {35790#(= main_~i~0 0)} is VALID [2022-04-27 10:24:06,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {35790#(= main_~i~0 0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35790#(= main_~i~0 0)} is VALID [2022-04-27 10:24:06,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {35790#(= main_~i~0 0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {35791#(<= 1 main_~i~0)} is VALID [2022-04-27 10:24:06,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {35791#(<= 1 main_~i~0)} assume !!(~i~0 < ~nodecount~0); {35791#(<= 1 main_~i~0)} is VALID [2022-04-27 10:24:06,548 INFO L290 TraceCheckUtils]: 12: Hoare triple {35791#(<= 1 main_~i~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35791#(<= 1 main_~i~0)} is VALID [2022-04-27 10:24:06,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {35791#(<= 1 main_~i~0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {35792#(<= 2 main_~i~0)} is VALID [2022-04-27 10:24:06,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {35792#(<= 2 main_~i~0)} assume !!(~i~0 < ~nodecount~0); {35792#(<= 2 main_~i~0)} is VALID [2022-04-27 10:24:06,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {35792#(<= 2 main_~i~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35792#(<= 2 main_~i~0)} is VALID [2022-04-27 10:24:06,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {35792#(<= 2 main_~i~0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {35793#(<= 3 main_~i~0)} is VALID [2022-04-27 10:24:06,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {35793#(<= 3 main_~i~0)} assume !!(~i~0 < ~nodecount~0); {35794#(<= 4 main_~nodecount~0)} is VALID [2022-04-27 10:24:06,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {35794#(<= 4 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35794#(<= 4 main_~nodecount~0)} is VALID [2022-04-27 10:24:06,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {35794#(<= 4 main_~nodecount~0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {35794#(<= 4 main_~nodecount~0)} is VALID [2022-04-27 10:24:06,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {35794#(<= 4 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {35794#(<= 4 main_~nodecount~0)} is VALID [2022-04-27 10:24:06,551 INFO L290 TraceCheckUtils]: 21: Hoare triple {35794#(<= 4 main_~nodecount~0)} ~i~0 := 0; {35795#(and (= main_~i~0 0) (<= 4 main_~nodecount~0))} is VALID [2022-04-27 10:24:06,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {35795#(and (= main_~i~0 0) (<= 4 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35795#(and (= main_~i~0 0) (<= 4 main_~nodecount~0))} is VALID [2022-04-27 10:24:06,553 INFO L290 TraceCheckUtils]: 23: Hoare triple {35795#(and (= main_~i~0 0) (<= 4 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35795#(and (= main_~i~0 0) (<= 4 main_~nodecount~0))} is VALID [2022-04-27 10:24:06,553 INFO L290 TraceCheckUtils]: 24: Hoare triple {35795#(and (= main_~i~0 0) (<= 4 main_~nodecount~0))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {35795#(and (= main_~i~0 0) (<= 4 main_~nodecount~0))} is VALID [2022-04-27 10:24:06,554 INFO L290 TraceCheckUtils]: 25: Hoare triple {35795#(and (= main_~i~0 0) (<= 4 main_~nodecount~0))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {35795#(and (= main_~i~0 0) (<= 4 main_~nodecount~0))} is VALID [2022-04-27 10:24:06,554 INFO L290 TraceCheckUtils]: 26: Hoare triple {35795#(and (= main_~i~0 0) (<= 4 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {35795#(and (= main_~i~0 0) (<= 4 main_~nodecount~0))} is VALID [2022-04-27 10:24:06,555 INFO L290 TraceCheckUtils]: 27: Hoare triple {35795#(and (= main_~i~0 0) (<= 4 main_~nodecount~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {35796#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:24:06,555 INFO L290 TraceCheckUtils]: 28: Hoare triple {35796#(<= (+ main_~i~0 3) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35796#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:24:06,555 INFO L290 TraceCheckUtils]: 29: Hoare triple {35796#(<= (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35796#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:24:06,556 INFO L290 TraceCheckUtils]: 30: Hoare triple {35796#(<= (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {35796#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:24:06,556 INFO L290 TraceCheckUtils]: 31: Hoare triple {35796#(<= (+ main_~i~0 3) main_~nodecount~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {35796#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:24:06,556 INFO L290 TraceCheckUtils]: 32: Hoare triple {35796#(<= (+ main_~i~0 3) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {35796#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:24:06,557 INFO L290 TraceCheckUtils]: 33: Hoare triple {35796#(<= (+ main_~i~0 3) main_~nodecount~0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {35797#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:24:06,557 INFO L290 TraceCheckUtils]: 34: Hoare triple {35797#(<= (+ main_~i~0 2) main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {35786#false} is VALID [2022-04-27 10:24:06,558 INFO L290 TraceCheckUtils]: 35: Hoare triple {35786#false} ~i~0 := 0; {35786#false} is VALID [2022-04-27 10:24:06,558 INFO L290 TraceCheckUtils]: 36: Hoare triple {35786#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {35786#false} is VALID [2022-04-27 10:24:06,558 INFO L290 TraceCheckUtils]: 37: Hoare triple {35786#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {35786#false} is VALID [2022-04-27 10:24:06,558 INFO L290 TraceCheckUtils]: 38: Hoare triple {35786#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {35786#false} is VALID [2022-04-27 10:24:06,558 INFO L290 TraceCheckUtils]: 39: Hoare triple {35786#false} assume !(~i~0 < ~edgecount~0); {35786#false} is VALID [2022-04-27 10:24:06,558 INFO L290 TraceCheckUtils]: 40: Hoare triple {35786#false} ~i~0 := 0; {35786#false} is VALID [2022-04-27 10:24:06,558 INFO L290 TraceCheckUtils]: 41: Hoare triple {35786#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35786#false} is VALID [2022-04-27 10:24:06,558 INFO L272 TraceCheckUtils]: 42: Hoare triple {35786#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {35786#false} is VALID [2022-04-27 10:24:06,558 INFO L290 TraceCheckUtils]: 43: Hoare triple {35786#false} ~cond := #in~cond; {35786#false} is VALID [2022-04-27 10:24:06,558 INFO L290 TraceCheckUtils]: 44: Hoare triple {35786#false} assume 0 == ~cond; {35786#false} is VALID [2022-04-27 10:24:06,558 INFO L290 TraceCheckUtils]: 45: Hoare triple {35786#false} assume !false; {35786#false} is VALID [2022-04-27 10:24:06,558 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 10:24:06,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:24:06,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134516243] [2022-04-27 10:24:06,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134516243] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:24:06,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537299442] [2022-04-27 10:24:06,559 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 10:24:06,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:24:06,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:24:06,563 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:24:06,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-27 10:24:06,691 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-27 10:24:06,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:24:06,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 10:24:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:24:06,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:24:06,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {35785#true} call ULTIMATE.init(); {35785#true} is VALID [2022-04-27 10:24:06,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {35785#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {35785#true} is VALID [2022-04-27 10:24:06,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {35785#true} assume true; {35785#true} is VALID [2022-04-27 10:24:06,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35785#true} {35785#true} #123#return; {35785#true} is VALID [2022-04-27 10:24:06,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {35785#true} call #t~ret22 := main(); {35785#true} is VALID [2022-04-27 10:24:06,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {35785#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {35785#true} is VALID [2022-04-27 10:24:06,980 INFO L290 TraceCheckUtils]: 6: Hoare triple {35785#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {35785#true} is VALID [2022-04-27 10:24:06,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {35785#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {35823#(<= 0 main_~i~0)} is VALID [2022-04-27 10:24:06,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {35823#(<= 0 main_~i~0)} assume !!(~i~0 < ~nodecount~0); {35823#(<= 0 main_~i~0)} is VALID [2022-04-27 10:24:06,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {35823#(<= 0 main_~i~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35823#(<= 0 main_~i~0)} is VALID [2022-04-27 10:24:06,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {35823#(<= 0 main_~i~0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {35791#(<= 1 main_~i~0)} is VALID [2022-04-27 10:24:06,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {35791#(<= 1 main_~i~0)} assume !!(~i~0 < ~nodecount~0); {35791#(<= 1 main_~i~0)} is VALID [2022-04-27 10:24:06,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {35791#(<= 1 main_~i~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35791#(<= 1 main_~i~0)} is VALID [2022-04-27 10:24:06,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {35791#(<= 1 main_~i~0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {35792#(<= 2 main_~i~0)} is VALID [2022-04-27 10:24:06,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {35792#(<= 2 main_~i~0)} assume !!(~i~0 < ~nodecount~0); {35845#(< 2 main_~nodecount~0)} is VALID [2022-04-27 10:24:06,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {35845#(< 2 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35845#(< 2 main_~nodecount~0)} is VALID [2022-04-27 10:24:06,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {35845#(< 2 main_~nodecount~0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {35845#(< 2 main_~nodecount~0)} is VALID [2022-04-27 10:24:06,985 INFO L290 TraceCheckUtils]: 17: Hoare triple {35845#(< 2 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {35845#(< 2 main_~nodecount~0)} is VALID [2022-04-27 10:24:06,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {35845#(< 2 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35845#(< 2 main_~nodecount~0)} is VALID [2022-04-27 10:24:06,986 INFO L290 TraceCheckUtils]: 19: Hoare triple {35845#(< 2 main_~nodecount~0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {35845#(< 2 main_~nodecount~0)} is VALID [2022-04-27 10:24:06,986 INFO L290 TraceCheckUtils]: 20: Hoare triple {35845#(< 2 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {35845#(< 2 main_~nodecount~0)} is VALID [2022-04-27 10:24:06,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {35845#(< 2 main_~nodecount~0)} ~i~0 := 0; {35867#(and (<= main_~i~0 0) (< 2 main_~nodecount~0))} is VALID [2022-04-27 10:24:06,987 INFO L290 TraceCheckUtils]: 22: Hoare triple {35867#(and (<= main_~i~0 0) (< 2 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35867#(and (<= main_~i~0 0) (< 2 main_~nodecount~0))} is VALID [2022-04-27 10:24:06,987 INFO L290 TraceCheckUtils]: 23: Hoare triple {35867#(and (<= main_~i~0 0) (< 2 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35867#(and (<= main_~i~0 0) (< 2 main_~nodecount~0))} is VALID [2022-04-27 10:24:06,988 INFO L290 TraceCheckUtils]: 24: Hoare triple {35867#(and (<= main_~i~0 0) (< 2 main_~nodecount~0))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {35867#(and (<= main_~i~0 0) (< 2 main_~nodecount~0))} is VALID [2022-04-27 10:24:06,988 INFO L290 TraceCheckUtils]: 25: Hoare triple {35867#(and (<= main_~i~0 0) (< 2 main_~nodecount~0))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {35867#(and (<= main_~i~0 0) (< 2 main_~nodecount~0))} is VALID [2022-04-27 10:24:06,988 INFO L290 TraceCheckUtils]: 26: Hoare triple {35867#(and (<= main_~i~0 0) (< 2 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {35867#(and (<= main_~i~0 0) (< 2 main_~nodecount~0))} is VALID [2022-04-27 10:24:06,989 INFO L290 TraceCheckUtils]: 27: Hoare triple {35867#(and (<= main_~i~0 0) (< 2 main_~nodecount~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {35886#(and (<= main_~i~0 1) (< 2 main_~nodecount~0))} is VALID [2022-04-27 10:24:06,989 INFO L290 TraceCheckUtils]: 28: Hoare triple {35886#(and (<= main_~i~0 1) (< 2 main_~nodecount~0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35886#(and (<= main_~i~0 1) (< 2 main_~nodecount~0))} is VALID [2022-04-27 10:24:06,990 INFO L290 TraceCheckUtils]: 29: Hoare triple {35886#(and (<= main_~i~0 1) (< 2 main_~nodecount~0))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35886#(and (<= main_~i~0 1) (< 2 main_~nodecount~0))} is VALID [2022-04-27 10:24:06,990 INFO L290 TraceCheckUtils]: 30: Hoare triple {35886#(and (<= main_~i~0 1) (< 2 main_~nodecount~0))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {35886#(and (<= main_~i~0 1) (< 2 main_~nodecount~0))} is VALID [2022-04-27 10:24:06,990 INFO L290 TraceCheckUtils]: 31: Hoare triple {35886#(and (<= main_~i~0 1) (< 2 main_~nodecount~0))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {35886#(and (<= main_~i~0 1) (< 2 main_~nodecount~0))} is VALID [2022-04-27 10:24:06,991 INFO L290 TraceCheckUtils]: 32: Hoare triple {35886#(and (<= main_~i~0 1) (< 2 main_~nodecount~0))} assume !(~j~0 < ~edgecount~0); {35886#(and (<= main_~i~0 1) (< 2 main_~nodecount~0))} is VALID [2022-04-27 10:24:06,991 INFO L290 TraceCheckUtils]: 33: Hoare triple {35886#(and (<= main_~i~0 1) (< 2 main_~nodecount~0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {35905#(and (< 2 main_~nodecount~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:24:06,991 INFO L290 TraceCheckUtils]: 34: Hoare triple {35905#(and (< 2 main_~nodecount~0) (<= main_~i~0 2))} assume !(~i~0 < ~nodecount~0); {35786#false} is VALID [2022-04-27 10:24:06,991 INFO L290 TraceCheckUtils]: 35: Hoare triple {35786#false} ~i~0 := 0; {35786#false} is VALID [2022-04-27 10:24:06,991 INFO L290 TraceCheckUtils]: 36: Hoare triple {35786#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {35786#false} is VALID [2022-04-27 10:24:06,992 INFO L290 TraceCheckUtils]: 37: Hoare triple {35786#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {35786#false} is VALID [2022-04-27 10:24:06,992 INFO L290 TraceCheckUtils]: 38: Hoare triple {35786#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {35786#false} is VALID [2022-04-27 10:24:06,992 INFO L290 TraceCheckUtils]: 39: Hoare triple {35786#false} assume !(~i~0 < ~edgecount~0); {35786#false} is VALID [2022-04-27 10:24:06,992 INFO L290 TraceCheckUtils]: 40: Hoare triple {35786#false} ~i~0 := 0; {35786#false} is VALID [2022-04-27 10:24:06,992 INFO L290 TraceCheckUtils]: 41: Hoare triple {35786#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35786#false} is VALID [2022-04-27 10:24:06,992 INFO L272 TraceCheckUtils]: 42: Hoare triple {35786#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {35786#false} is VALID [2022-04-27 10:24:06,992 INFO L290 TraceCheckUtils]: 43: Hoare triple {35786#false} ~cond := #in~cond; {35786#false} is VALID [2022-04-27 10:24:06,992 INFO L290 TraceCheckUtils]: 44: Hoare triple {35786#false} assume 0 == ~cond; {35786#false} is VALID [2022-04-27 10:24:06,992 INFO L290 TraceCheckUtils]: 45: Hoare triple {35786#false} assume !false; {35786#false} is VALID [2022-04-27 10:24:06,992 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 10:24:06,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:24:07,203 INFO L290 TraceCheckUtils]: 45: Hoare triple {35786#false} assume !false; {35786#false} is VALID [2022-04-27 10:24:07,203 INFO L290 TraceCheckUtils]: 44: Hoare triple {35786#false} assume 0 == ~cond; {35786#false} is VALID [2022-04-27 10:24:07,203 INFO L290 TraceCheckUtils]: 43: Hoare triple {35786#false} ~cond := #in~cond; {35786#false} is VALID [2022-04-27 10:24:07,203 INFO L272 TraceCheckUtils]: 42: Hoare triple {35786#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {35786#false} is VALID [2022-04-27 10:24:07,203 INFO L290 TraceCheckUtils]: 41: Hoare triple {35786#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35786#false} is VALID [2022-04-27 10:24:07,203 INFO L290 TraceCheckUtils]: 40: Hoare triple {35786#false} ~i~0 := 0; {35786#false} is VALID [2022-04-27 10:24:07,203 INFO L290 TraceCheckUtils]: 39: Hoare triple {35786#false} assume !(~i~0 < ~edgecount~0); {35786#false} is VALID [2022-04-27 10:24:07,203 INFO L290 TraceCheckUtils]: 38: Hoare triple {35786#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {35786#false} is VALID [2022-04-27 10:24:07,203 INFO L290 TraceCheckUtils]: 37: Hoare triple {35786#false} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {35786#false} is VALID [2022-04-27 10:24:07,204 INFO L290 TraceCheckUtils]: 36: Hoare triple {35786#false} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {35786#false} is VALID [2022-04-27 10:24:07,204 INFO L290 TraceCheckUtils]: 35: Hoare triple {35786#false} ~i~0 := 0; {35786#false} is VALID [2022-04-27 10:24:07,204 INFO L290 TraceCheckUtils]: 34: Hoare triple {35975#(< main_~i~0 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {35786#false} is VALID [2022-04-27 10:24:07,204 INFO L290 TraceCheckUtils]: 33: Hoare triple {35797#(<= (+ main_~i~0 2) main_~nodecount~0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {35975#(< main_~i~0 main_~nodecount~0)} is VALID [2022-04-27 10:24:07,205 INFO L290 TraceCheckUtils]: 32: Hoare triple {35797#(<= (+ main_~i~0 2) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {35797#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:24:07,205 INFO L290 TraceCheckUtils]: 31: Hoare triple {35797#(<= (+ main_~i~0 2) main_~nodecount~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {35797#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:24:07,205 INFO L290 TraceCheckUtils]: 30: Hoare triple {35797#(<= (+ main_~i~0 2) main_~nodecount~0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {35797#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:24:07,206 INFO L290 TraceCheckUtils]: 29: Hoare triple {35797#(<= (+ main_~i~0 2) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35797#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:24:07,206 INFO L290 TraceCheckUtils]: 28: Hoare triple {35797#(<= (+ main_~i~0 2) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35797#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:24:07,206 INFO L290 TraceCheckUtils]: 27: Hoare triple {35796#(<= (+ main_~i~0 3) main_~nodecount~0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {35797#(<= (+ main_~i~0 2) main_~nodecount~0)} is VALID [2022-04-27 10:24:07,207 INFO L290 TraceCheckUtils]: 26: Hoare triple {35796#(<= (+ main_~i~0 3) main_~nodecount~0)} assume !(~j~0 < ~edgecount~0); {35796#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:24:07,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {35796#(<= (+ main_~i~0 3) main_~nodecount~0)} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {35796#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:24:07,207 INFO L290 TraceCheckUtils]: 24: Hoare triple {35796#(<= (+ main_~i~0 3) main_~nodecount~0)} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {35796#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:24:07,207 INFO L290 TraceCheckUtils]: 23: Hoare triple {35796#(<= (+ main_~i~0 3) main_~nodecount~0)} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {35796#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:24:07,208 INFO L290 TraceCheckUtils]: 22: Hoare triple {35796#(<= (+ main_~i~0 3) main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {35796#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:24:07,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {35845#(< 2 main_~nodecount~0)} ~i~0 := 0; {35796#(<= (+ main_~i~0 3) main_~nodecount~0)} is VALID [2022-04-27 10:24:07,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {35845#(< 2 main_~nodecount~0)} assume !(~i~0 < ~nodecount~0); {35845#(< 2 main_~nodecount~0)} is VALID [2022-04-27 10:24:07,208 INFO L290 TraceCheckUtils]: 19: Hoare triple {35845#(< 2 main_~nodecount~0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {35845#(< 2 main_~nodecount~0)} is VALID [2022-04-27 10:24:07,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {35845#(< 2 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35845#(< 2 main_~nodecount~0)} is VALID [2022-04-27 10:24:07,209 INFO L290 TraceCheckUtils]: 17: Hoare triple {35845#(< 2 main_~nodecount~0)} assume !!(~i~0 < ~nodecount~0); {35845#(< 2 main_~nodecount~0)} is VALID [2022-04-27 10:24:07,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {35845#(< 2 main_~nodecount~0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {35845#(< 2 main_~nodecount~0)} is VALID [2022-04-27 10:24:07,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {35845#(< 2 main_~nodecount~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35845#(< 2 main_~nodecount~0)} is VALID [2022-04-27 10:24:07,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {35792#(<= 2 main_~i~0)} assume !!(~i~0 < ~nodecount~0); {35845#(< 2 main_~nodecount~0)} is VALID [2022-04-27 10:24:07,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {35791#(<= 1 main_~i~0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {35792#(<= 2 main_~i~0)} is VALID [2022-04-27 10:24:07,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {35791#(<= 1 main_~i~0)} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35791#(<= 1 main_~i~0)} is VALID [2022-04-27 10:24:07,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {35791#(<= 1 main_~i~0)} assume !!(~i~0 < ~nodecount~0); {35791#(<= 1 main_~i~0)} is VALID [2022-04-27 10:24:07,211 INFO L290 TraceCheckUtils]: 10: Hoare triple {35823#(<= 0 main_~i~0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {35791#(<= 1 main_~i~0)} is VALID [2022-04-27 10:24:07,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {35823#(<= 0 main_~i~0)} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {35823#(<= 0 main_~i~0)} is VALID [2022-04-27 10:24:07,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {35823#(<= 0 main_~i~0)} assume !!(~i~0 < ~nodecount~0); {35823#(<= 0 main_~i~0)} is VALID [2022-04-27 10:24:07,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {35785#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {35823#(<= 0 main_~i~0)} is VALID [2022-04-27 10:24:07,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {35785#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {35785#true} is VALID [2022-04-27 10:24:07,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {35785#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {35785#true} is VALID [2022-04-27 10:24:07,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {35785#true} call #t~ret22 := main(); {35785#true} is VALID [2022-04-27 10:24:07,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35785#true} {35785#true} #123#return; {35785#true} is VALID [2022-04-27 10:24:07,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {35785#true} assume true; {35785#true} is VALID [2022-04-27 10:24:07,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {35785#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {35785#true} is VALID [2022-04-27 10:24:07,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {35785#true} call ULTIMATE.init(); {35785#true} is VALID [2022-04-27 10:24:07,214 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 10:24:07,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537299442] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:24:07,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:24:07,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 17 [2022-04-27 10:24:07,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098894816] [2022-04-27 10:24:07,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:24:07,215 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 16 states have internal predecessors, (74), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-27 10:24:07,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:24:07,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 16 states have internal predecessors, (74), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:07,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:24:07,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 10:24:07,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:24:07,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 10:24:07,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-04-27 10:24:07,284 INFO L87 Difference]: Start difference. First operand 552 states and 715 transitions. Second operand has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 16 states have internal predecessors, (74), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:13,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:24:13,308 INFO L93 Difference]: Finished difference Result 1090 states and 1388 transitions. [2022-04-27 10:24:13,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-27 10:24:13,308 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 16 states have internal predecessors, (74), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-27 10:24:13,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:24:13,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 16 states have internal predecessors, (74), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:13,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 233 transitions. [2022-04-27 10:24:13,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 16 states have internal predecessors, (74), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:13,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 233 transitions. [2022-04-27 10:24:13,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 233 transitions. [2022-04-27 10:24:13,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 233 edges. 233 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:24:13,548 INFO L225 Difference]: With dead ends: 1090 [2022-04-27 10:24:13,548 INFO L226 Difference]: Without dead ends: 994 [2022-04-27 10:24:13,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=813, Unknown=0, NotChecked=0, Total=1056 [2022-04-27 10:24:13,548 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 264 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:24:13,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 144 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-27 10:24:13,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2022-04-27 10:24:15,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 569. [2022-04-27 10:24:15,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:24:15,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 994 states. Second operand has 569 states, 556 states have (on average 1.29136690647482) internal successors, (718), 559 states have internal predecessors, (718), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:24:15,608 INFO L74 IsIncluded]: Start isIncluded. First operand 994 states. Second operand has 569 states, 556 states have (on average 1.29136690647482) internal successors, (718), 559 states have internal predecessors, (718), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:24:15,609 INFO L87 Difference]: Start difference. First operand 994 states. Second operand has 569 states, 556 states have (on average 1.29136690647482) internal successors, (718), 559 states have internal predecessors, (718), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:24:15,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:24:15,651 INFO L93 Difference]: Finished difference Result 994 states and 1268 transitions. [2022-04-27 10:24:15,651 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1268 transitions. [2022-04-27 10:24:15,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:24:15,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:24:15,653 INFO L74 IsIncluded]: Start isIncluded. First operand has 569 states, 556 states have (on average 1.29136690647482) internal successors, (718), 559 states have internal predecessors, (718), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Second operand 994 states. [2022-04-27 10:24:15,653 INFO L87 Difference]: Start difference. First operand has 569 states, 556 states have (on average 1.29136690647482) internal successors, (718), 559 states have internal predecessors, (718), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Second operand 994 states. [2022-04-27 10:24:15,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:24:15,696 INFO L93 Difference]: Finished difference Result 994 states and 1268 transitions. [2022-04-27 10:24:15,696 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1268 transitions. [2022-04-27 10:24:15,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:24:15,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:24:15,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:24:15,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:24:15,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 556 states have (on average 1.29136690647482) internal successors, (718), 559 states have internal predecessors, (718), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:24:15,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 732 transitions. [2022-04-27 10:24:15,717 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 732 transitions. Word has length 46 [2022-04-27 10:24:15,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:24:15,718 INFO L495 AbstractCegarLoop]: Abstraction has 569 states and 732 transitions. [2022-04-27 10:24:15,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 16 states have internal predecessors, (74), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:24:15,718 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 732 transitions. [2022-04-27 10:24:15,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-27 10:24:15,719 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:24:15,719 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:24:15,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-27 10:24:15,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-27 10:24:15,944 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:24:15,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:24:15,944 INFO L85 PathProgramCache]: Analyzing trace with hash 983274622, now seen corresponding path program 1 times [2022-04-27 10:24:15,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:24:15,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988706655] [2022-04-27 10:24:15,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:24:15,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:24:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:24:17,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:24:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:24:17,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {40470#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {40449#true} is VALID [2022-04-27 10:24:17,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {40449#true} assume true; {40449#true} is VALID [2022-04-27 10:24:17,645 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40449#true} {40449#true} #123#return; {40449#true} is VALID [2022-04-27 10:24:17,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-27 10:24:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:24:17,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {40449#true} ~cond := #in~cond; {40449#true} is VALID [2022-04-27 10:24:17,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {40449#true} assume !(0 == ~cond); {40449#true} is VALID [2022-04-27 10:24:17,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {40449#true} assume true; {40449#true} is VALID [2022-04-27 10:24:17,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40449#true} {40450#false} #121#return; {40450#false} is VALID [2022-04-27 10:24:17,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {40449#true} call ULTIMATE.init(); {40470#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:24:17,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {40470#(and (= |old(~INFINITY~0)| ~INFINITY~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {40449#true} is VALID [2022-04-27 10:24:17,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {40449#true} assume true; {40449#true} is VALID [2022-04-27 10:24:17,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40449#true} {40449#true} #123#return; {40449#true} is VALID [2022-04-27 10:24:17,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {40449#true} call #t~ret22 := main(); {40449#true} is VALID [2022-04-27 10:24:17,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {40449#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {40449#true} is VALID [2022-04-27 10:24:17,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {40449#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {40449#true} is VALID [2022-04-27 10:24:17,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {40449#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {40454#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:17,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {40454#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} assume !!(~i~0 < ~nodecount~0); {40454#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:17,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {40454#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40454#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:17,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {40454#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {40455#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (<= main_~i~0 1) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (<= 1 main_~i~0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:17,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {40455#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (<= main_~i~0 1) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (<= 1 main_~i~0) (= |main_~#Source~0.offset| 0))} assume !!(~i~0 < ~nodecount~0); {40455#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (<= main_~i~0 1) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (<= 1 main_~i~0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:17,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {40455#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (<= main_~i~0 1) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (<= 1 main_~i~0) (= |main_~#Source~0.offset| 0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40455#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (<= main_~i~0 1) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (<= 1 main_~i~0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:17,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {40455#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (<= main_~i~0 1) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (<= 1 main_~i~0) (= |main_~#Source~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {40456#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (= |main_~#distance~0.offset| |main_~#Dest~0.offset|) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:17,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {40456#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (= |main_~#distance~0.offset| |main_~#Dest~0.offset|) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} assume !(~i~0 < ~nodecount~0); {40456#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (= |main_~#distance~0.offset| |main_~#Dest~0.offset|) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:17,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {40456#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (= |main_~#distance~0.offset| |main_~#Dest~0.offset|) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} ~i~0 := 0; {40456#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (= |main_~#distance~0.offset| |main_~#Dest~0.offset|) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:17,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {40456#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (= |main_~#distance~0.offset| |main_~#Dest~0.offset|) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40457#(and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (= |main_~#distance~0.offset| |main_~#Dest~0.offset|) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 1) (= main_~j~0 0) (<= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (<= 0 |main_~#Dest~0.offset|))} is VALID [2022-04-27 10:24:17,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {40457#(and (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (= |main_~#distance~0.offset| |main_~#Dest~0.offset|) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 1) (= main_~j~0 0) (<= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (<= 0 |main_~#Dest~0.offset|))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40458#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (= |main_~#distance~0.offset| |main_~#Dest~0.offset|) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (<= |main_~#Dest~0.offset| 0) (= main_~x~0 1) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (<= 0 |main_~#Dest~0.offset|))} is VALID [2022-04-27 10:24:17,665 INFO L290 TraceCheckUtils]: 18: Hoare triple {40458#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (= |main_~#distance~0.offset| |main_~#Dest~0.offset|) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (<= |main_~#Dest~0.offset| 0) (= main_~x~0 1) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (<= 0 |main_~#Dest~0.offset|))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {40459#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (= |main_~#distance~0.offset| |main_~#Dest~0.offset|) (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (<= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (<= 0 |main_~#Dest~0.offset|))} is VALID [2022-04-27 10:24:17,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {40459#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (= |main_~#distance~0.offset| |main_~#Dest~0.offset|) (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (<= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (<= 0 |main_~#Dest~0.offset|))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {40460#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (= |main_~#distance~0.offset| |main_~#Dest~0.offset|) (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:17,666 INFO L290 TraceCheckUtils]: 20: Hoare triple {40460#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (= |main_~#distance~0.offset| |main_~#Dest~0.offset|) (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} assume !(~j~0 < ~edgecount~0); {40460#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (= |main_~#distance~0.offset| |main_~#Dest~0.offset|) (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:17,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {40460#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (= |main_~#distance~0.offset| |main_~#Dest~0.offset|) (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {40460#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (= |main_~#distance~0.offset| |main_~#Dest~0.offset|) (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:17,668 INFO L290 TraceCheckUtils]: 22: Hoare triple {40460#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (= |main_~#distance~0.offset| |main_~#Dest~0.offset|) (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40459#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (= |main_~#distance~0.offset| |main_~#Dest~0.offset|) (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (<= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (<= 0 |main_~#Dest~0.offset|))} is VALID [2022-04-27 10:24:17,669 INFO L290 TraceCheckUtils]: 23: Hoare triple {40459#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (= |main_~#distance~0.offset| |main_~#Dest~0.offset|) (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (<= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (<= 0 |main_~#Dest~0.offset|))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40461#(and (= |main_#t~mem11| (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (<= (+ |main_#t~mem13| 1) 0) (= |main_#t~mem12| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (<= |main_~#Dest~0.offset| 0) (= main_~x~0 1) (= (+ (* main_~x~0 4) |main_~#distance~0.offset|) (+ 4 |main_~#Dest~0.offset|)) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (<= 0 |main_~#Dest~0.offset|))} is VALID [2022-04-27 10:24:17,670 INFO L290 TraceCheckUtils]: 24: Hoare triple {40461#(and (= |main_#t~mem11| (select (select |#memory_int| |main_~#distance~0.base|) 0)) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (<= (+ |main_#t~mem13| 1) 0) (= |main_#t~mem12| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (<= |main_~#Dest~0.offset| 0) (= main_~x~0 1) (= (+ (* main_~x~0 4) |main_~#distance~0.offset|) (+ 4 |main_~#Dest~0.offset|)) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (<= 0 |main_~#Dest~0.offset|))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {40462#(and (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) 0) 1) (select (select |#memory_int| |main_~#distance~0.base|) (+ 4 |main_~#Dest~0.offset|))) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (<= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (<= 0 |main_~#Dest~0.offset|))} is VALID [2022-04-27 10:24:17,671 INFO L290 TraceCheckUtils]: 25: Hoare triple {40462#(and (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) 0) 1) (select (select |#memory_int| |main_~#distance~0.base|) (+ 4 |main_~#Dest~0.offset|))) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (<= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (<= 0 |main_~#Dest~0.offset|))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {40463#(and (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) 0) 1) (select (select |#memory_int| |main_~#distance~0.base|) (+ 4 |main_~#Dest~0.offset|))) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:17,671 INFO L290 TraceCheckUtils]: 26: Hoare triple {40463#(and (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) 0) 1) (select (select |#memory_int| |main_~#distance~0.base|) (+ 4 |main_~#Dest~0.offset|))) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} assume !(~j~0 < ~edgecount~0); {40463#(and (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) 0) 1) (select (select |#memory_int| |main_~#distance~0.base|) (+ 4 |main_~#Dest~0.offset|))) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:17,672 INFO L290 TraceCheckUtils]: 27: Hoare triple {40463#(and (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) 0) 1) (select (select |#memory_int| |main_~#distance~0.base|) (+ 4 |main_~#Dest~0.offset|))) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {40463#(and (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) 0) 1) (select (select |#memory_int| |main_~#distance~0.base|) (+ 4 |main_~#Dest~0.offset|))) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:17,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {40463#(and (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) 0) 1) (select (select |#memory_int| |main_~#distance~0.base|) (+ 4 |main_~#Dest~0.offset|))) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} assume !(~i~0 < ~nodecount~0); {40463#(and (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) 0) 1) (select (select |#memory_int| |main_~#distance~0.base|) (+ 4 |main_~#Dest~0.offset|))) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:17,673 INFO L290 TraceCheckUtils]: 29: Hoare triple {40463#(and (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) 0) 1) (select (select |#memory_int| |main_~#distance~0.base|) (+ 4 |main_~#Dest~0.offset|))) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} ~i~0 := 0; {40464#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ |main_~#Dest~0.offset| (* main_~i~0 4))) 1) (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) 0) 1) (select (select |#memory_int| |main_~#distance~0.base|) (+ 4 |main_~#Dest~0.offset|))) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ |main_~#Weight~0.offset| (* main_~i~0 4))) 0) (<= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (<= 0 |main_~#Dest~0.offset|) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| (* main_~i~0 4))) 0))} is VALID [2022-04-27 10:24:17,674 INFO L290 TraceCheckUtils]: 30: Hoare triple {40464#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) (+ |main_~#Dest~0.offset| (* main_~i~0 4))) 1) (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) 0) 1) (select (select |#memory_int| |main_~#distance~0.base|) (+ 4 |main_~#Dest~0.offset|))) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= (select (select |#memory_int| |main_~#Weight~0.base|) (+ |main_~#Weight~0.offset| (* main_~i~0 4))) 0) (<= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (<= 0 |main_~#Dest~0.offset|) (= (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| (* main_~i~0 4))) 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {40465#(and (= |main_~#distance~0.offset| 0) (<= (+ |main_#t~mem17| 1) |main_#t~mem19|) (= |main_#t~mem18| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:24:17,675 INFO L290 TraceCheckUtils]: 31: Hoare triple {40465#(and (= |main_~#distance~0.offset| 0) (<= (+ |main_#t~mem17| 1) |main_#t~mem19|) (= |main_#t~mem18| 0) (= main_~i~0 0))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {40450#false} is VALID [2022-04-27 10:24:17,675 INFO L290 TraceCheckUtils]: 32: Hoare triple {40450#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {40450#false} is VALID [2022-04-27 10:24:17,675 INFO L290 TraceCheckUtils]: 33: Hoare triple {40450#false} assume !(~i~0 < ~edgecount~0); {40450#false} is VALID [2022-04-27 10:24:17,675 INFO L290 TraceCheckUtils]: 34: Hoare triple {40450#false} ~i~0 := 0; {40450#false} is VALID [2022-04-27 10:24:17,675 INFO L290 TraceCheckUtils]: 35: Hoare triple {40450#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40450#false} is VALID [2022-04-27 10:24:17,675 INFO L272 TraceCheckUtils]: 36: Hoare triple {40450#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {40449#true} is VALID [2022-04-27 10:24:17,675 INFO L290 TraceCheckUtils]: 37: Hoare triple {40449#true} ~cond := #in~cond; {40449#true} is VALID [2022-04-27 10:24:17,675 INFO L290 TraceCheckUtils]: 38: Hoare triple {40449#true} assume !(0 == ~cond); {40449#true} is VALID [2022-04-27 10:24:17,675 INFO L290 TraceCheckUtils]: 39: Hoare triple {40449#true} assume true; {40449#true} is VALID [2022-04-27 10:24:17,675 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {40449#true} {40450#false} #121#return; {40450#false} is VALID [2022-04-27 10:24:17,675 INFO L290 TraceCheckUtils]: 41: Hoare triple {40450#false} havoc #t~mem21; {40450#false} is VALID [2022-04-27 10:24:17,675 INFO L290 TraceCheckUtils]: 42: Hoare triple {40450#false} #t~post20 := ~i~0;~i~0 := 1 + #t~post20;havoc #t~post20; {40450#false} is VALID [2022-04-27 10:24:17,675 INFO L290 TraceCheckUtils]: 43: Hoare triple {40450#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40450#false} is VALID [2022-04-27 10:24:17,675 INFO L272 TraceCheckUtils]: 44: Hoare triple {40450#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {40450#false} is VALID [2022-04-27 10:24:17,675 INFO L290 TraceCheckUtils]: 45: Hoare triple {40450#false} ~cond := #in~cond; {40450#false} is VALID [2022-04-27 10:24:17,676 INFO L290 TraceCheckUtils]: 46: Hoare triple {40450#false} assume 0 == ~cond; {40450#false} is VALID [2022-04-27 10:24:17,676 INFO L290 TraceCheckUtils]: 47: Hoare triple {40450#false} assume !false; {40450#false} is VALID [2022-04-27 10:24:17,676 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 10:24:17,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:24:17,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988706655] [2022-04-27 10:24:17,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988706655] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:24:17,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901100413] [2022-04-27 10:24:17,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:24:17,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:24:17,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:24:17,678 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:24:17,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-27 10:24:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:24:17,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-27 10:24:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:24:17,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:24:17,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-04-27 10:24:17,924 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-04-27 10:24:17,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2022-04-27 10:24:18,029 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-04-27 10:24:18,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2022-04-27 10:24:18,304 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-04-27 10:24:18,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-04-27 10:24:18,808 INFO L356 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2022-04-27 10:24:18,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 84 treesize of output 66 [2022-04-27 10:24:19,441 INFO L356 Elim1Store]: treesize reduction 25, result has 49.0 percent of original size [2022-04-27 10:24:19,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 60 [2022-04-27 10:24:19,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {40449#true} call ULTIMATE.init(); {40449#true} is VALID [2022-04-27 10:24:19,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {40449#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {40449#true} is VALID [2022-04-27 10:24:19,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {40449#true} assume true; {40449#true} is VALID [2022-04-27 10:24:19,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40449#true} {40449#true} #123#return; {40449#true} is VALID [2022-04-27 10:24:19,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {40449#true} call #t~ret22 := main(); {40449#true} is VALID [2022-04-27 10:24:19,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {40449#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {40449#true} is VALID [2022-04-27 10:24:19,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {40449#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {40449#true} is VALID [2022-04-27 10:24:19,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {40449#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {40495#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:19,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {40495#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} assume !!(~i~0 < ~nodecount~0); {40495#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:19,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {40495#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40495#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:19,815 INFO L290 TraceCheckUtils]: 10: Hoare triple {40495#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {40495#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:19,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {40495#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} assume !!(~i~0 < ~nodecount~0); {40495#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:19,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {40495#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40495#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:19,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {40495#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {40495#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:19,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {40495#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} assume !(~i~0 < ~nodecount~0); {40495#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:19,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {40495#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} ~i~0 := 0; {40495#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:19,820 INFO L290 TraceCheckUtils]: 16: Hoare triple {40495#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40523#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:19,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {40523#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40527#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= main_~x~0 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:19,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {40527#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= main_~x~0 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {40531#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)) 1) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:19,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {40531#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)) 1) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {40531#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)) 1) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:19,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {40531#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)) 1) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} assume !(~j~0 < ~edgecount~0); {40531#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)) 1) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:19,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {40531#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)) 1) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {40531#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)) 1) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:19,826 INFO L290 TraceCheckUtils]: 22: Hoare triple {40531#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)) 1) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40544#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)) 1) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:19,827 INFO L290 TraceCheckUtils]: 23: Hoare triple {40544#(and (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)) 1) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (= main_~j~0 0) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40548#(and (<= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) |main_#t~mem12|) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)) 1) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (<= |main_#t~mem13| (select (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|))) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= main_~x~0 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) |main_#t~mem11|))} is VALID [2022-04-27 10:24:19,829 INFO L290 TraceCheckUtils]: 24: Hoare triple {40548#(and (<= (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) |main_#t~mem12|) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)) 1) 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (<= |main_#t~mem13| (select (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|))) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= main_~x~0 (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) |main_#t~mem11|))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {40552#(and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (< (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 1) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:19,830 INFO L290 TraceCheckUtils]: 25: Hoare triple {40552#(and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (< (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 1) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {40552#(and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (< (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 1) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:19,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {40552#(and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (< (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 1) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} assume !(~j~0 < ~edgecount~0); {40552#(and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (< (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 1) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:19,832 INFO L290 TraceCheckUtils]: 27: Hoare triple {40552#(and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (< (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 1) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {40552#(and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (< (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 1) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:19,833 INFO L290 TraceCheckUtils]: 28: Hoare triple {40552#(and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (< (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 1) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} assume !(~i~0 < ~nodecount~0); {40552#(and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (< (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 1) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:19,834 INFO L290 TraceCheckUtils]: 29: Hoare triple {40552#(and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (< (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 1) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} ~i~0 := 0; {40568#(and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (< (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 1) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} is VALID [2022-04-27 10:24:19,835 INFO L290 TraceCheckUtils]: 30: Hoare triple {40568#(and (<= 0 (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| 4)) 1)) (= (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 1) (not (= |main_~#Source~0.base| |main_~#distance~0.base|)) (= |main_~#distance~0.offset| 0) (not (= |main_~#Weight~0.base| |main_~#distance~0.base|)) (< (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|) 1) 0) (not (= |main_~#Dest~0.base| |main_~#distance~0.base|)) (<= (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 0) (= |main_~#Dest~0.offset| 0) (= main_~i~0 0) (= |main_~#Weight~0.offset| 0) (= |main_~#Source~0.offset| 0))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {40572#(and (< (+ |main_#t~mem18| |main_#t~mem17| 1) 0) (<= 0 (+ |main_#t~mem19| 1)))} is VALID [2022-04-27 10:24:19,835 INFO L290 TraceCheckUtils]: 31: Hoare triple {40572#(and (< (+ |main_#t~mem18| |main_#t~mem17| 1) 0) (<= 0 (+ |main_#t~mem19| 1)))} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {40450#false} is VALID [2022-04-27 10:24:19,836 INFO L290 TraceCheckUtils]: 32: Hoare triple {40450#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {40450#false} is VALID [2022-04-27 10:24:19,836 INFO L290 TraceCheckUtils]: 33: Hoare triple {40450#false} assume !(~i~0 < ~edgecount~0); {40450#false} is VALID [2022-04-27 10:24:19,836 INFO L290 TraceCheckUtils]: 34: Hoare triple {40450#false} ~i~0 := 0; {40450#false} is VALID [2022-04-27 10:24:19,836 INFO L290 TraceCheckUtils]: 35: Hoare triple {40450#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40450#false} is VALID [2022-04-27 10:24:19,836 INFO L272 TraceCheckUtils]: 36: Hoare triple {40450#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {40450#false} is VALID [2022-04-27 10:24:19,836 INFO L290 TraceCheckUtils]: 37: Hoare triple {40450#false} ~cond := #in~cond; {40450#false} is VALID [2022-04-27 10:24:19,836 INFO L290 TraceCheckUtils]: 38: Hoare triple {40450#false} assume !(0 == ~cond); {40450#false} is VALID [2022-04-27 10:24:19,836 INFO L290 TraceCheckUtils]: 39: Hoare triple {40450#false} assume true; {40450#false} is VALID [2022-04-27 10:24:19,836 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {40450#false} {40450#false} #121#return; {40450#false} is VALID [2022-04-27 10:24:19,836 INFO L290 TraceCheckUtils]: 41: Hoare triple {40450#false} havoc #t~mem21; {40450#false} is VALID [2022-04-27 10:24:19,836 INFO L290 TraceCheckUtils]: 42: Hoare triple {40450#false} #t~post20 := ~i~0;~i~0 := 1 + #t~post20;havoc #t~post20; {40450#false} is VALID [2022-04-27 10:24:19,836 INFO L290 TraceCheckUtils]: 43: Hoare triple {40450#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40450#false} is VALID [2022-04-27 10:24:19,836 INFO L272 TraceCheckUtils]: 44: Hoare triple {40450#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {40450#false} is VALID [2022-04-27 10:24:19,836 INFO L290 TraceCheckUtils]: 45: Hoare triple {40450#false} ~cond := #in~cond; {40450#false} is VALID [2022-04-27 10:24:19,837 INFO L290 TraceCheckUtils]: 46: Hoare triple {40450#false} assume 0 == ~cond; {40450#false} is VALID [2022-04-27 10:24:19,837 INFO L290 TraceCheckUtils]: 47: Hoare triple {40450#false} assume !false; {40450#false} is VALID [2022-04-27 10:24:19,837 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 10:24:19,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:24:35,504 INFO L290 TraceCheckUtils]: 47: Hoare triple {40450#false} assume !false; {40450#false} is VALID [2022-04-27 10:24:35,504 INFO L290 TraceCheckUtils]: 46: Hoare triple {40450#false} assume 0 == ~cond; {40450#false} is VALID [2022-04-27 10:24:35,504 INFO L290 TraceCheckUtils]: 45: Hoare triple {40450#false} ~cond := #in~cond; {40450#false} is VALID [2022-04-27 10:24:35,504 INFO L272 TraceCheckUtils]: 44: Hoare triple {40450#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {40450#false} is VALID [2022-04-27 10:24:35,504 INFO L290 TraceCheckUtils]: 43: Hoare triple {40450#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40450#false} is VALID [2022-04-27 10:24:35,504 INFO L290 TraceCheckUtils]: 42: Hoare triple {40450#false} #t~post20 := ~i~0;~i~0 := 1 + #t~post20;havoc #t~post20; {40450#false} is VALID [2022-04-27 10:24:35,504 INFO L290 TraceCheckUtils]: 41: Hoare triple {40450#false} havoc #t~mem21; {40450#false} is VALID [2022-04-27 10:24:35,504 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {40449#true} {40450#false} #121#return; {40450#false} is VALID [2022-04-27 10:24:35,504 INFO L290 TraceCheckUtils]: 39: Hoare triple {40449#true} assume true; {40449#true} is VALID [2022-04-27 10:24:35,504 INFO L290 TraceCheckUtils]: 38: Hoare triple {40449#true} assume !(0 == ~cond); {40449#true} is VALID [2022-04-27 10:24:35,504 INFO L290 TraceCheckUtils]: 37: Hoare triple {40449#true} ~cond := #in~cond; {40449#true} is VALID [2022-04-27 10:24:35,504 INFO L272 TraceCheckUtils]: 36: Hoare triple {40450#false} call __VERIFIER_assert((if #t~mem21 >= 0 then 1 else 0)); {40449#true} is VALID [2022-04-27 10:24:35,504 INFO L290 TraceCheckUtils]: 35: Hoare triple {40450#false} assume !!(~i~0 < ~nodecount~0);call #t~mem21 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40450#false} is VALID [2022-04-27 10:24:35,504 INFO L290 TraceCheckUtils]: 34: Hoare triple {40450#false} ~i~0 := 0; {40450#false} is VALID [2022-04-27 10:24:35,504 INFO L290 TraceCheckUtils]: 33: Hoare triple {40450#false} assume !(~i~0 < ~edgecount~0); {40450#false} is VALID [2022-04-27 10:24:35,505 INFO L290 TraceCheckUtils]: 32: Hoare triple {40450#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {40450#false} is VALID [2022-04-27 10:24:35,505 INFO L290 TraceCheckUtils]: 31: Hoare triple {40672#(< (+ |main_#t~mem18| |main_#t~mem17|) |main_#t~mem19|)} assume !(#t~mem19 > #t~mem17 + #t~mem18);havoc #t~mem19;havoc #t~mem17;havoc #t~mem18; {40450#false} is VALID [2022-04-27 10:24:35,505 INFO L290 TraceCheckUtils]: 30: Hoare triple {40676#(< (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| (* main_~i~0 4))) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) (+ |main_~#Weight~0.offset| (* main_~i~0 4)))) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ |main_~#Dest~0.offset| (* main_~i~0 4)))) |main_~#distance~0.offset|)))} assume !!(~i~0 < ~edgecount~0);call #t~mem15 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~i~0, 4);~x~0 := #t~mem15;havoc #t~mem15;call #t~mem16 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~i~0, 4);~y~0 := #t~mem16;havoc #t~mem16;call #t~mem19 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem17 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem18 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~i~0, 4); {40672#(< (+ |main_#t~mem18| |main_#t~mem17|) |main_#t~mem19|)} is VALID [2022-04-27 10:24:35,506 INFO L290 TraceCheckUtils]: 29: Hoare triple {40680#(< (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)))} ~i~0 := 0; {40676#(< (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) (+ |main_~#Source~0.offset| (* main_~i~0 4))) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) (+ |main_~#Weight~0.offset| (* main_~i~0 4)))) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* 4 (select (select |#memory_int| |main_~#Dest~0.base|) (+ |main_~#Dest~0.offset| (* main_~i~0 4)))) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:24:35,506 INFO L290 TraceCheckUtils]: 28: Hoare triple {40680#(< (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)))} assume !(~i~0 < ~nodecount~0); {40680#(< (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:24:35,507 INFO L290 TraceCheckUtils]: 27: Hoare triple {40680#(< (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {40680#(< (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:24:35,507 INFO L290 TraceCheckUtils]: 26: Hoare triple {40680#(< (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)))} assume !(~j~0 < ~edgecount~0); {40680#(< (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:24:35,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {40680#(< (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {40680#(< (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:24:35,510 INFO L290 TraceCheckUtils]: 24: Hoare triple {40696#(or (forall ((v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (< (+ (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|))) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|))))) (not (< (+ |main_#t~mem12| |main_#t~mem11|) |main_#t~mem13|)))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {40680#(< (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)))} is VALID [2022-04-27 10:24:35,511 INFO L290 TraceCheckUtils]: 23: Hoare triple {40700#(or (forall ((v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (< (+ (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1029) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4)))) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1029) (+ |main_~#distance~0.offset| (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|))))))) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4))) (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) (+ (* main_~j~0 4) |main_~#Source~0.offset|)) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) (+ (* main_~j~0 4) |main_~#Weight~0.offset|)))))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40696#(or (forall ((v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (< (+ (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|))) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|))))) (not (< (+ |main_#t~mem12| |main_#t~mem11|) |main_#t~mem13|)))} is VALID [2022-04-27 10:24:35,512 INFO L290 TraceCheckUtils]: 22: Hoare triple {40704#(or (forall ((v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (< (+ (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|)) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|))))) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)) (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|))))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40700#(or (forall ((v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (< (+ (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1029) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4)))) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1029) (+ |main_~#distance~0.offset| (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|))))))) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4))) (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) (+ (* main_~j~0 4) |main_~#Source~0.offset|)) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) (+ (* main_~j~0 4) |main_~#Weight~0.offset|)))))} is VALID [2022-04-27 10:24:35,512 INFO L290 TraceCheckUtils]: 21: Hoare triple {40704#(or (forall ((v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (< (+ (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|)) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|))))) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)) (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|))))} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {40704#(or (forall ((v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (< (+ (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|)) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|))))) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)) (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|))))} is VALID [2022-04-27 10:24:35,513 INFO L290 TraceCheckUtils]: 20: Hoare triple {40704#(or (forall ((v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (< (+ (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|)) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|))))) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)) (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|))))} assume !(~j~0 < ~edgecount~0); {40704#(or (forall ((v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (< (+ (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|)) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|))))) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)) (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|))))} is VALID [2022-04-27 10:24:35,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {40704#(or (forall ((v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (< (+ (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|)) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|))))) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)) (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|))))} #t~post8 := ~j~0;~j~0 := 1 + #t~post8;havoc #t~post8; {40704#(or (forall ((v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (< (+ (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|)) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|))))) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)) (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|))))} is VALID [2022-04-27 10:24:35,524 INFO L290 TraceCheckUtils]: 18: Hoare triple {40717#(forall ((v_ArrVal_1028 Int) (v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (< (+ (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|) (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4)))) (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|))) (not (<= (+ v_ArrVal_1028 1) 0)) (<= (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|)) (+ (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|))))))} assume #t~mem13 > #t~mem11 + #t~mem12;havoc #t~mem13;havoc #t~mem11;havoc #t~mem12;call write~int(-1, ~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4); {40704#(or (forall ((v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (< (+ (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|)) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|))))) (<= (select (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)) (+ (select (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) (select (select |#memory_int| |main_~#Weight~0.base|) |main_~#Weight~0.offset|))))} is VALID [2022-04-27 10:24:35,526 INFO L290 TraceCheckUtils]: 17: Hoare triple {40721#(forall ((v_ArrVal_1028 Int) (v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (not (<= (+ v_ArrVal_1028 1) 0)) (< (+ (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1028) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1028) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1028) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1028) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1028) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|))) (<= (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1028) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)) (+ (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1028)) |main_~#Source~0.base|) |main_~#Source~0.offset|)))) (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1028)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)))))} assume !!(~j~0 < ~edgecount~0);call #t~mem9 := read~int(~#Dest~0.base, ~#Dest~0.offset + 4 * ~j~0, 4);~x~0 := #t~mem9;havoc #t~mem9;call #t~mem10 := read~int(~#Source~0.base, ~#Source~0.offset + 4 * ~j~0, 4);~y~0 := #t~mem10;havoc #t~mem10;call #t~mem13 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#distance~0.base, ~#distance~0.offset + 4 * ~y~0, 4);call #t~mem12 := read~int(~#Weight~0.base, ~#Weight~0.offset + 4 * ~j~0, 4); {40717#(forall ((v_ArrVal_1028 Int) (v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (< (+ (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|) (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4)))) (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|))) (not (<= (+ v_ArrVal_1028 1) 0)) (<= (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|)) (+ (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* main_~x~0 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|))))))} is VALID [2022-04-27 10:24:35,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {40725#(forall ((v_ArrVal_1028 Int) (v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (< (+ (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)))) (<= (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|)) (+ (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)))) (not (<= (+ v_ArrVal_1028 1) 0))))} assume !!(~i~0 < ~nodecount~0);~j~0 := 0; {40721#(forall ((v_ArrVal_1028 Int) (v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (not (<= (+ v_ArrVal_1028 1) 0)) (< (+ (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1028) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1028) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4))) (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1028) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1028) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1028) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|))) (<= (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1028) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|)) (+ (select (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1028)) |main_~#Source~0.base|) |main_~#Source~0.offset|)))) (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ |main_~#distance~0.offset| (* (select (select |#memory_int| |main_~#Dest~0.base|) (+ (* main_~j~0 4) |main_~#Dest~0.offset|)) 4)) v_ArrVal_1028)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)))))} is VALID [2022-04-27 10:24:35,529 INFO L290 TraceCheckUtils]: 15: Hoare triple {40725#(forall ((v_ArrVal_1028 Int) (v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (< (+ (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)))) (<= (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|)) (+ (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)))) (not (<= (+ v_ArrVal_1028 1) 0))))} ~i~0 := 0; {40725#(forall ((v_ArrVal_1028 Int) (v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (< (+ (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)))) (<= (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|)) (+ (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)))) (not (<= (+ v_ArrVal_1028 1) 0))))} is VALID [2022-04-27 10:24:35,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {40725#(forall ((v_ArrVal_1028 Int) (v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (< (+ (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)))) (<= (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|)) (+ (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)))) (not (<= (+ v_ArrVal_1028 1) 0))))} assume !(~i~0 < ~nodecount~0); {40725#(forall ((v_ArrVal_1028 Int) (v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (< (+ (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)))) (<= (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|)) (+ (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)))) (not (<= (+ v_ArrVal_1028 1) 0))))} is VALID [2022-04-27 10:24:35,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {40725#(forall ((v_ArrVal_1028 Int) (v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (< (+ (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)))) (<= (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|)) (+ (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)))) (not (<= (+ v_ArrVal_1028 1) 0))))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {40725#(forall ((v_ArrVal_1028 Int) (v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (< (+ (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)))) (<= (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|)) (+ (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)))) (not (<= (+ v_ArrVal_1028 1) 0))))} is VALID [2022-04-27 10:24:35,546 WARN L290 TraceCheckUtils]: 12: Hoare triple {40738#(forall ((v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1028 Int) (v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (< (+ (select (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|))) (not (<= (+ v_ArrVal_1028 1) 0)) (<= (select (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4))) (+ (select (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)))))} assume !(~i~0 == ~source~0);call write~int(~INFINITY~0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40725#(forall ((v_ArrVal_1028 Int) (v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (< (+ (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)))) (<= (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|)) (+ (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|) (select (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (select |#memory_int| |main_~#distance~0.base|) (+ (* (select (select |#memory_int| |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)))) (not (<= (+ v_ArrVal_1028 1) 0))))} is UNKNOWN [2022-04-27 10:24:35,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {40738#(forall ((v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1028 Int) (v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (< (+ (select (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|))) (not (<= (+ v_ArrVal_1028 1) 0)) (<= (select (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4))) (+ (select (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)))))} assume !!(~i~0 < ~nodecount~0); {40738#(forall ((v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1028 Int) (v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (< (+ (select (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|))) (not (<= (+ v_ArrVal_1028 1) 0)) (<= (select (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4))) (+ (select (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)))))} is VALID [2022-04-27 10:24:35,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {40738#(forall ((v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1028 Int) (v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (< (+ (select (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|))) (not (<= (+ v_ArrVal_1028 1) 0)) (<= (select (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4))) (+ (select (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)))))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {40738#(forall ((v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1028 Int) (v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (< (+ (select (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|))) (not (<= (+ v_ArrVal_1028 1) 0)) (<= (select (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4))) (+ (select (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)))))} is VALID [2022-04-27 10:24:35,582 WARN L290 TraceCheckUtils]: 9: Hoare triple {40738#(forall ((v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1028 Int) (v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (< (+ (select (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|))) (not (<= (+ v_ArrVal_1028 1) 0)) (<= (select (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4))) (+ (select (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)))))} assume ~i~0 == ~source~0;call write~int(0, ~#distance~0.base, ~#distance~0.offset + 4 * ~i~0, 4); {40738#(forall ((v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1028 Int) (v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (< (+ (select (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|))) (not (<= (+ v_ArrVal_1028 1) 0)) (<= (select (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4))) (+ (select (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)))))} is UNKNOWN [2022-04-27 10:24:35,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {40738#(forall ((v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1028 Int) (v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (< (+ (select (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|))) (not (<= (+ v_ArrVal_1028 1) 0)) (<= (select (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4))) (+ (select (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)))))} assume !!(~i~0 < ~nodecount~0); {40738#(forall ((v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1028 Int) (v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (< (+ (select (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|))) (not (<= (+ v_ArrVal_1028 1) 0)) (<= (select (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4))) (+ (select (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)))))} is VALID [2022-04-27 10:24:35,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {40449#true} assume !!(0 <= ~edgecount~0 && ~edgecount~0 <= 19);~source~0 := 0;call ~#Source~0.base, ~#Source~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Source~0.base, ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 4 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 8 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 12 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 16 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 20 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 24 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 28 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 32 + ~#Source~0.offset, 4);call write~init~int(4, ~#Source~0.base, 36 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 40 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 44 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 48 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 52 + ~#Source~0.offset, 4);call write~init~int(0, ~#Source~0.base, 56 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 60 + ~#Source~0.offset, 4);call write~init~int(1, ~#Source~0.base, 64 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 68 + ~#Source~0.offset, 4);call write~init~int(2, ~#Source~0.base, 72 + ~#Source~0.offset, 4);call write~init~int(3, ~#Source~0.base, 76 + ~#Source~0.offset, 4);call ~#Dest~0.base, ~#Dest~0.offset := #Ultimate.allocOnStack(80);call write~init~int(1, ~#Dest~0.base, ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 4 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 8 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 12 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 16 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 20 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 24 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 28 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 32 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 36 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 40 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 44 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 48 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 52 + ~#Dest~0.offset, 4);call write~init~int(3, ~#Dest~0.base, 56 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 60 + ~#Dest~0.offset, 4);call write~init~int(2, ~#Dest~0.base, 64 + ~#Dest~0.offset, 4);call write~init~int(1, ~#Dest~0.base, 68 + ~#Dest~0.offset, 4);call write~init~int(0, ~#Dest~0.base, 72 + ~#Dest~0.offset, 4);call write~init~int(4, ~#Dest~0.base, 76 + ~#Dest~0.offset, 4);call ~#Weight~0.base, ~#Weight~0.offset := #Ultimate.allocOnStack(80);call write~init~int(0, ~#Weight~0.base, ~#Weight~0.offset, 4);call write~init~int(1, ~#Weight~0.base, 4 + ~#Weight~0.offset, 4);call write~init~int(2, ~#Weight~0.base, 8 + ~#Weight~0.offset, 4);call write~init~int(3, ~#Weight~0.base, 12 + ~#Weight~0.offset, 4);call write~init~int(4, ~#Weight~0.base, 16 + ~#Weight~0.offset, 4);call write~init~int(5, ~#Weight~0.base, 20 + ~#Weight~0.offset, 4);call write~init~int(6, ~#Weight~0.base, 24 + ~#Weight~0.offset, 4);call write~init~int(7, ~#Weight~0.base, 28 + ~#Weight~0.offset, 4);call write~init~int(8, ~#Weight~0.base, 32 + ~#Weight~0.offset, 4);call write~init~int(9, ~#Weight~0.base, 36 + ~#Weight~0.offset, 4);call write~init~int(10, ~#Weight~0.base, 40 + ~#Weight~0.offset, 4);call write~init~int(11, ~#Weight~0.base, 44 + ~#Weight~0.offset, 4);call write~init~int(12, ~#Weight~0.base, 48 + ~#Weight~0.offset, 4);call write~init~int(13, ~#Weight~0.base, 52 + ~#Weight~0.offset, 4);call write~init~int(14, ~#Weight~0.base, 56 + ~#Weight~0.offset, 4);call write~init~int(15, ~#Weight~0.base, 60 + ~#Weight~0.offset, 4);call write~init~int(16, ~#Weight~0.base, 64 + ~#Weight~0.offset, 4);call write~init~int(17, ~#Weight~0.base, 68 + ~#Weight~0.offset, 4);call write~init~int(18, ~#Weight~0.base, 72 + ~#Weight~0.offset, 4);call write~init~int(19, ~#Weight~0.base, 76 + ~#Weight~0.offset, 4);call ~#distance~0.base, ~#distance~0.offset := #Ultimate.allocOnStack(20);havoc ~x~0;havoc ~y~0;havoc ~i~0;havoc ~j~0;~i~0 := 0; {40738#(forall ((v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1028 Int) (v_ArrVal_1029 Int)) (or (not (<= 0 (+ v_ArrVal_1029 1))) (< (+ (select (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)) (select (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029) (+ (* 4 (select (select (store |#memory_int| |main_~#distance~0.base| (store (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4)) v_ArrVal_1029)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|)) |main_~#distance~0.offset|))) (not (<= (+ v_ArrVal_1028 1) 0)) (<= (select (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ |main_~#distance~0.offset| (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4))) (+ (select (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028) (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Source~0.base|) |main_~#Source~0.offset|) 4) |main_~#distance~0.offset|)) (select (select (store |#memory_int| |main_~#distance~0.base| (store v_ArrVal_1026 (+ (* (select (select (store |#memory_int| |main_~#distance~0.base| v_ArrVal_1026) |main_~#Dest~0.base|) |main_~#Dest~0.offset|) 4) |main_~#distance~0.offset|) v_ArrVal_1028)) |main_~#Weight~0.base|) |main_~#Weight~0.offset|)))))} is VALID [2022-04-27 10:24:35,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {40449#true} assume !!(0 <= ~nodecount~0 && ~nodecount~0 <= 4); {40449#true} is VALID [2022-04-27 10:24:35,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {40449#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~nodecount~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~edgecount~0 := #t~nondet5;havoc #t~nondet5; {40449#true} is VALID [2022-04-27 10:24:35,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {40449#true} call #t~ret22 := main(); {40449#true} is VALID [2022-04-27 10:24:35,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40449#true} {40449#true} #123#return; {40449#true} is VALID [2022-04-27 10:24:35,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {40449#true} assume true; {40449#true} is VALID [2022-04-27 10:24:35,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {40449#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~INFINITY~0 := 899; {40449#true} is VALID [2022-04-27 10:24:35,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {40449#true} call ULTIMATE.init(); {40449#true} is VALID [2022-04-27 10:24:35,591 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 10:24:35,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901100413] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:24:35,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:24:35,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 12] total 34 [2022-04-27 10:24:35,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780080841] [2022-04-27 10:24:35,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:24:35,592 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.676470588235294) internal successors, (91), 33 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2022-04-27 10:24:35,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:24:35,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 2.676470588235294) internal successors, (91), 33 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:24:35,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 97 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 10:24:35,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-27 10:24:35,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:24:35,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-27 10:24:35,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=918, Unknown=11, NotChecked=0, Total=1122 [2022-04-27 10:24:35,733 INFO L87 Difference]: Start difference. First operand 569 states and 732 transitions. Second operand has 34 states, 34 states have (on average 2.676470588235294) internal successors, (91), 33 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:24:46,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:24:46,254 INFO L93 Difference]: Finished difference Result 1064 states and 1351 transitions. [2022-04-27 10:24:46,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-27 10:24:46,254 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.676470588235294) internal successors, (91), 33 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2022-04-27 10:24:46,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:24:46,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.676470588235294) internal successors, (91), 33 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:24:46,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 270 transitions. [2022-04-27 10:24:46,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.676470588235294) internal successors, (91), 33 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:24:46,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 270 transitions. [2022-04-27 10:24:46,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 270 transitions. [2022-04-27 10:24:46,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 270 edges. 270 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:24:46,622 INFO L225 Difference]: With dead ends: 1064 [2022-04-27 10:24:46,622 INFO L226 Difference]: Without dead ends: 943 [2022-04-27 10:24:46,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 111 SyntacticMatches, 6 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1853 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=1155, Invalid=4840, Unknown=11, NotChecked=0, Total=6006 [2022-04-27 10:24:46,623 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 497 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 630 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-27 10:24:46,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 100 Invalid, 1946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 1121 Invalid, 0 Unknown, 630 Unchecked, 1.6s Time] [2022-04-27 10:24:46,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2022-04-27 10:24:49,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 771. [2022-04-27 10:24:49,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:24:49,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 943 states. Second operand has 771 states, 758 states have (on average 1.3100263852242744) internal successors, (993), 761 states have internal predecessors, (993), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:24:49,691 INFO L74 IsIncluded]: Start isIncluded. First operand 943 states. Second operand has 771 states, 758 states have (on average 1.3100263852242744) internal successors, (993), 761 states have internal predecessors, (993), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:24:49,691 INFO L87 Difference]: Start difference. First operand 943 states. Second operand has 771 states, 758 states have (on average 1.3100263852242744) internal successors, (993), 761 states have internal predecessors, (993), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:24:49,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:24:49,722 INFO L93 Difference]: Finished difference Result 943 states and 1205 transitions. [2022-04-27 10:24:49,722 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1205 transitions. [2022-04-27 10:24:49,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:24:49,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:24:49,723 INFO L74 IsIncluded]: Start isIncluded. First operand has 771 states, 758 states have (on average 1.3100263852242744) internal successors, (993), 761 states have internal predecessors, (993), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Second operand 943 states. [2022-04-27 10:24:49,724 INFO L87 Difference]: Start difference. First operand has 771 states, 758 states have (on average 1.3100263852242744) internal successors, (993), 761 states have internal predecessors, (993), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Second operand 943 states. [2022-04-27 10:24:49,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:24:49,764 INFO L93 Difference]: Finished difference Result 943 states and 1205 transitions. [2022-04-27 10:24:49,764 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1205 transitions. [2022-04-27 10:24:49,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:24:49,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:24:49,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:24:49,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:24:49,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 758 states have (on average 1.3100263852242744) internal successors, (993), 761 states have internal predecessors, (993), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 10:24:49,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1007 transitions. [2022-04-27 10:24:49,801 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1007 transitions. Word has length 48 [2022-04-27 10:24:49,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:24:49,801 INFO L495 AbstractCegarLoop]: Abstraction has 771 states and 1007 transitions. [2022-04-27 10:24:49,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.676470588235294) internal successors, (91), 33 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:24:49,801 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1007 transitions. [2022-04-27 10:24:49,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-27 10:24:49,802 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:24:49,803 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:24:49,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-27 10:24:50,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-27 10:24:50,026 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:24:50,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:24:50,026 INFO L85 PathProgramCache]: Analyzing trace with hash 849261116, now seen corresponding path program 1 times [2022-04-27 10:24:50,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:24:50,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018302637] [2022-04-27 10:24:50,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:24:50,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:24:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 10:24:50,068 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 10:24:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 10:24:50,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 10:24:50,113 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 10:24:50,114 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:24:50,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-27 10:24:50,119 INFO L356 BasicCegarLoop]: Path program histogram: [6, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:24:50,122 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:24:50,182 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:24:50,182 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 10:24:50,182 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 10:24:50,182 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 10:24:50,182 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 10:24:50,183 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 10:24:50,183 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 10:24:50,183 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 10:24:50,183 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:24:50,183 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 10:24:50,183 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 10:24:50,183 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2022-04-27 10:24:50,183 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2022-04-27 10:24:50,183 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-27 10:24:50,183 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-27 10:24:50,183 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 10:24:50,183 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 10:24:50,183 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:24:50,183 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:24:50,183 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2022-04-27 10:24:50,183 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:24:50,183 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-27 10:24:50,183 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-27 10:24:50,183 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 10:24:50,183 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 10:24:50,184 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-27 10:24:50,184 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:24:50,184 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2022-04-27 10:24:50,185 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2022-04-27 10:24:50,185 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2022-04-27 10:24:50,185 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:24:50,185 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2022-04-27 10:24:50,185 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-27 10:24:50,185 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-27 10:24:50,185 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2022-04-27 10:24:50,185 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-27 10:24:50,185 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-27 10:24:50,185 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-27 10:24:50,186 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2022-04-27 10:24:50,186 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-04-27 10:24:50,186 WARN L170 areAnnotationChecker]: L39-4 has no Hoare annotation [2022-04-27 10:24:50,186 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-04-27 10:24:50,186 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-04-27 10:24:50,186 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-04-27 10:24:50,186 WARN L170 areAnnotationChecker]: L61-3 has no Hoare annotation [2022-04-27 10:24:50,186 WARN L170 areAnnotationChecker]: L61-3 has no Hoare annotation [2022-04-27 10:24:50,186 WARN L170 areAnnotationChecker]: L61-3 has no Hoare annotation [2022-04-27 10:24:50,186 WARN L170 areAnnotationChecker]: L51-3 has no Hoare annotation [2022-04-27 10:24:50,186 WARN L170 areAnnotationChecker]: L51-3 has no Hoare annotation [2022-04-27 10:24:50,186 WARN L170 areAnnotationChecker]: L51-3 has no Hoare annotation [2022-04-27 10:24:50,186 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-04-27 10:24:50,186 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-27 10:24:50,186 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-27 10:24:50,186 WARN L170 areAnnotationChecker]: L61-4 has no Hoare annotation [2022-04-27 10:24:50,186 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-04-27 10:24:50,186 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-04-27 10:24:50,186 WARN L170 areAnnotationChecker]: L51-4 has no Hoare annotation [2022-04-27 10:24:50,186 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-04-27 10:24:50,186 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-04-27 10:24:50,186 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-04-27 10:24:50,187 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2022-04-27 10:24:50,187 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:24:50,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:24:50 BoogieIcfgContainer [2022-04-27 10:24:50,188 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:24:50,188 INFO L158 Benchmark]: Toolchain (without parser) took 478995.77ms. Allocated memory was 179.3MB in the beginning and 306.2MB in the end (delta: 126.9MB). Free memory was 122.7MB in the beginning and 201.0MB in the end (delta: -78.2MB). Peak memory consumption was 49.3MB. Max. memory is 8.0GB. [2022-04-27 10:24:50,188 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 179.3MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:24:50,189 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.72ms. Allocated memory was 179.3MB in the beginning and 254.8MB in the end (delta: 75.5MB). Free memory was 122.5MB in the beginning and 225.2MB in the end (delta: -102.7MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. [2022-04-27 10:24:50,189 INFO L158 Benchmark]: Boogie Preprocessor took 70.83ms. Allocated memory is still 254.8MB. Free memory was 225.2MB in the beginning and 222.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-27 10:24:50,189 INFO L158 Benchmark]: RCFGBuilder took 578.76ms. Allocated memory is still 254.8MB. Free memory was 222.6MB in the beginning and 202.6MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-04-27 10:24:50,189 INFO L158 Benchmark]: TraceAbstraction took 478064.02ms. Allocated memory was 254.8MB in the beginning and 306.2MB in the end (delta: 51.4MB). Free memory was 202.1MB in the beginning and 201.0MB in the end (delta: 1.1MB). Peak memory consumption was 54.1MB. Max. memory is 8.0GB. [2022-04-27 10:24:50,194 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 179.3MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 266.72ms. Allocated memory was 179.3MB in the beginning and 254.8MB in the end (delta: 75.5MB). Free memory was 122.5MB in the beginning and 225.2MB in the end (delta: -102.7MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 70.83ms. Allocated memory is still 254.8MB. Free memory was 225.2MB in the beginning and 222.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 578.76ms. Allocated memory is still 254.8MB. Free memory was 222.6MB in the beginning and 202.6MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 478064.02ms. Allocated memory was 254.8MB in the beginning and 306.2MB in the end (delta: 51.4MB). Free memory was 202.1MB in the beginning and 201.0MB in the end (delta: 1.1MB). Peak memory consumption was 54.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] int INFINITY = 899; VAL [\old(INFINITY)=901, INFINITY=899] [L18] int nodecount = __VERIFIER_nondet_int(); [L19] int edgecount = __VERIFIER_nondet_int(); [L20] COND FALSE !(!(0 <= nodecount && nodecount <= 4)) VAL [edgecount=1, INFINITY=899, nodecount=2] [L21] COND FALSE !(!(0 <= edgecount && edgecount <= 19)) [L22] int source = 0; [L23] int Source[20] = {0,4,1,1,0,0,1,3,4,4,2,2,3,0,0,3,1,2,2,3}; [L24] int Dest[20] = {1,3,4,1,1,4,3,4,3,0,0,0,0,2,3,0,2,1,0,4}; [L25] int Weight[20] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; [L26] int distance[5]; [L27] int x,y; [L28] int i,j; [L30] i = 0 VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, source=0, Source={22:0}, Weight={25:0}] [L30] COND TRUE i < nodecount VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, Source={22:0}, source=0, Weight={25:0}] [L31] COND TRUE i == source [L32] distance[i] = 0 VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, source=0, Source={22:0}, Weight={25:0}] [L30] i++ VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, nodecount=2, Source={22:0}, source=0, Weight={25:0}] [L30] COND TRUE i < nodecount VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, nodecount=2, source=0, Source={22:0}, Weight={25:0}] [L31] COND FALSE !(i == source) [L35] distance[i] = INFINITY VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, nodecount=2, source=0, Source={22:0}, Weight={25:0}] [L30] i++ VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=2, INFINITY=899, nodecount=2, Source={22:0}, source=0, Weight={25:0}] [L30] COND FALSE !(i < nodecount) VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=2, INFINITY=899, nodecount=2, source=0, Source={22:0}, Weight={25:0}] [L39] i = 0 VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, Source={22:0}, source=0, Weight={25:0}] [L39] COND TRUE i < nodecount [L41] j = 0 VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, j=0, nodecount=2, Source={22:0}, source=0, Weight={25:0}] [L41] COND TRUE j < edgecount [L43] EXPR Dest[j] [L43] x = Dest[j] [L44] EXPR Source[j] [L44] y = Source[j] [L45] EXPR distance[x] [L45] EXPR distance[y] [L45] EXPR Weight[j] VAL [Dest={23:0}, distance={21:0}, distance[x]=899, distance[y]=0, edgecount=1, i=0, INFINITY=899, j=0, nodecount=2, source=0, Source={22:0}, Weight={25:0}, Weight[j]=0, x=1, y=0] [L45] COND TRUE distance[x] > distance[y] + Weight[j] [L47] distance[x] = -1 VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, j=0, nodecount=2, source=0, Source={22:0}, Weight={25:0}, x=1, y=0] [L41] j++ VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, x=1, y=0] [L41] COND FALSE !(j < edgecount) VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L39] i++ VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L39] COND TRUE i < nodecount [L41] j = 0 VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, j=0, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L41] COND TRUE j < edgecount [L43] EXPR Dest[j] [L43] x = Dest[j] [L44] EXPR Source[j] [L44] y = Source[j] [L45] EXPR distance[x] [L45] EXPR distance[y] [L45] EXPR Weight[j] VAL [Dest={23:0}, distance={21:0}, distance[x]=-1, distance[y]=0, edgecount=1, i=1, INFINITY=899, j=0, nodecount=2, Source={22:0}, source=0, Weight={25:0}, Weight[j]=0, x=1, y=0] [L45] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L41] j++ VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, x=1, y=0] [L41] COND FALSE !(j < edgecount) VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, x=1, y=0] [L39] i++ VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=2, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, x=1, y=0] [L39] COND FALSE !(i < nodecount) VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=2, INFINITY=899, j=1, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L51] i = 0 VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, x=1, y=0] [L51] COND TRUE i < edgecount [L53] EXPR Dest[i] [L53] x = Dest[i] [L54] EXPR Source[i] [L54] y = Source[i] [L55] EXPR distance[x] [L55] EXPR distance[y] [L55] EXPR Weight[i] VAL [Dest={23:0}, distance={21:0}, distance[x]=-1, distance[y]=0, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, Weight[i]=0, x=1, y=0] [L55] COND FALSE !(distance[x] > distance[y] + Weight[i]) [L51] i++ VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L51] COND FALSE !(i < edgecount) VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L61] i = 0 VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={22:0}, source=0, Weight={25:0}, x=1, y=0] [L61] COND TRUE i < nodecount [L63] EXPR distance[i] VAL [Dest={23:0}, distance={21:0}, distance[i]=0, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, x=1, y=0] [L63] CALL __VERIFIER_assert(distance[i]>=0) VAL [\old(cond)=1, INFINITY=899] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, INFINITY=899] [L63] RET __VERIFIER_assert(distance[i]>=0) VAL [Dest={23:0}, distance={21:0}, distance[i]=0, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, x=1, y=0] [L61] i++ VAL [Dest={23:0}, distance={21:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, x=1, y=0] [L61] COND TRUE i < nodecount [L63] EXPR distance[i] VAL [Dest={23:0}, distance={21:0}, distance[i]=-1, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={22:0}, Weight={25:0}, x=1, y=0] [L63] CALL __VERIFIER_assert(distance[i]>=0) VAL [\old(cond)=0, INFINITY=899] [L11] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, INFINITY=899] [L12] reach_error() VAL [\old(cond)=0, cond=0, INFINITY=899] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 477.9s, OverallIterations: 27, TraceHistogramMax: 4, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 121.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4181 SdHoareTripleChecker+Valid, 11.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4167 mSDsluCounter, 2724 SdHoareTripleChecker+Invalid, 11.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 5902 IncrementalHoareTripleChecker+Unchecked, 1571 mSDsCounter, 1556 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10986 IncrementalHoareTripleChecker+Invalid, 18444 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1556 mSolverCounterUnsat, 1153 mSDtfsCounter, 10986 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2504 GetRequests, 1484 SyntacticMatches, 62 SemanticMatches, 958 ConstructedPredicates, 37 IntricatePredicates, 0 DeprecatedPredicates, 18370 ImplicationChecksByTransitivity, 269.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=771occurred in iteration=26, InterpolantAutomatonStates: 556, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 2288 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 305.4s InterpolantComputationTime, 1844 NumberOfCodeBlocks, 1807 NumberOfCodeBlocksAsserted, 75 NumberOfCheckSat, 2538 ConstructedInterpolants, 236 QuantifiedInterpolants, 32160 SizeOfPredicates, 214 NumberOfNonLiveVariables, 6559 ConjunctsInSsa, 448 ConjunctsInUnsatCore, 69 InterpolantComputations, 5 PerfectInterpolantSequences, 493/1151 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-27 10:24:50,405 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-04-27 10:24:50,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...