java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-regression/test22_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:54:16,323 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:54:16,326 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:54:16,342 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:54:16,342 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:54:16,343 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:54:16,345 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:54:16,348 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:54:16,351 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:54:16,352 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:54:16,353 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:54:16,353 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:54:16,356 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:54:16,358 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:54:16,364 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:54:16,365 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:54:16,366 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:54:16,372 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:54:16,375 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:54:16,377 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:54:16,378 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:54:16,380 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:54:16,384 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:54:16,384 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:54:16,384 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:54:16,385 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:54:16,386 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:54:16,388 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:54:16,388 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:54:16,389 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:54:16,391 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:54:16,393 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:54:16,393 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:54:16,393 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:54:16,395 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:54:16,395 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:54:16,396 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:54:16,420 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:54:16,421 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:54:16,421 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:54:16,422 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:54:16,423 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:54:16,423 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:54:16,423 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:54:16,424 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:54:16,424 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:54:16,424 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:54:16,424 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:54:16,424 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:54:16,424 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:54:16,425 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:54:16,426 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:54:16,426 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:54:16,426 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:54:16,426 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:54:16,426 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:54:16,427 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:54:16,427 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:54:16,427 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:54:16,427 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:54:16,427 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:54:16,427 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:54:16,429 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:54:16,429 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:54:16,429 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:54:16,429 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:54:16,429 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:54:16,430 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:54:16,482 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:54:16,495 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:54:16,499 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:54:16,500 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:54:16,501 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:54:16,502 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test22_false-unreach-call.c [2018-11-23 12:54:16,559 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/def5fd8b7/772ceb048f224bf89530a80d440d1d43/FLAGe3204f7fb [2018-11-23 12:54:17,045 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:54:17,046 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test22_false-unreach-call.c [2018-11-23 12:54:17,053 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/def5fd8b7/772ceb048f224bf89530a80d440d1d43/FLAGe3204f7fb [2018-11-23 12:54:17,397 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/def5fd8b7/772ceb048f224bf89530a80d440d1d43 [2018-11-23 12:54:17,407 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:54:17,408 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:54:17,409 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:54:17,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:54:17,414 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:54:17,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:54:17" (1/1) ... [2018-11-23 12:54:17,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d6e0a02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:17, skipping insertion in model container [2018-11-23 12:54:17,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:54:17" (1/1) ... [2018-11-23 12:54:17,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:54:17,451 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:54:17,685 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:54:17,699 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:54:17,730 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:54:17,753 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:54:17,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:17 WrapperNode [2018-11-23 12:54:17,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:54:17,754 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:54:17,754 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:54:17,754 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:54:17,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:17" (1/1) ... [2018-11-23 12:54:17,774 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:17" (1/1) ... [2018-11-23 12:54:17,782 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:54:17,783 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:54:17,783 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:54:17,783 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:54:17,791 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:17" (1/1) ... [2018-11-23 12:54:17,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:17" (1/1) ... [2018-11-23 12:54:17,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:17" (1/1) ... [2018-11-23 12:54:17,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:17" (1/1) ... [2018-11-23 12:54:17,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:17" (1/1) ... [2018-11-23 12:54:17,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:17" (1/1) ... [2018-11-23 12:54:17,815 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:17" (1/1) ... [2018-11-23 12:54:17,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:54:17,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:54:17,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:54:17,818 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:54:17,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:54:17,949 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-11-23 12:54:17,950 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-11-23 12:54:17,950 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:54:17,950 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:54:17,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-23 12:54:17,950 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-23 12:54:17,950 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-23 12:54:17,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:54:17,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:54:17,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:54:17,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:54:17,951 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2018-11-23 12:54:17,951 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2018-11-23 12:54:17,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:54:17,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:54:17,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:54:18,717 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:54:18,717 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 12:54:18,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:18 BoogieIcfgContainer [2018-11-23 12:54:18,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:54:18,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:54:18,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:54:18,721 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:54:18,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:54:17" (1/3) ... [2018-11-23 12:54:18,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5009077a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:54:18, skipping insertion in model container [2018-11-23 12:54:18,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:17" (2/3) ... [2018-11-23 12:54:18,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5009077a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:54:18, skipping insertion in model container [2018-11-23 12:54:18,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:18" (3/3) ... [2018-11-23 12:54:18,724 INFO L112 eAbstractionObserver]: Analyzing ICFG test22_false-unreach-call.c [2018-11-23 12:54:18,732 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:54:18,739 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:54:18,757 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:54:18,786 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:54:18,787 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:54:18,787 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:54:18,788 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:54:18,789 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:54:18,789 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:54:18,789 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:54:18,789 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:54:18,790 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:54:18,808 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-23 12:54:18,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:54:18,816 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:18,817 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-11-23 12:54:18,819 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:18,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:18,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1838243936, now seen corresponding path program 1 times [2018-11-23 12:54:18,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:18,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:18,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:18,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:18,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:19,101 INFO L256 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2018-11-23 12:54:19,104 INFO L273 TraceCheckUtils]: 1: Hoare triple {39#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8);call write~init~int(0, ~#d1~0.base, ~#d1~0.offset, 4);call write~init~int(0, ~#d1~0.base, 4 + ~#d1~0.offset, 4);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8);call write~init~int(0, ~#d2~0.base, ~#d2~0.offset, 4);call write~init~int(0, ~#d2~0.base, 4 + ~#d2~0.offset, 4); {39#true} is VALID [2018-11-23 12:54:19,105 INFO L273 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-23 12:54:19,105 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #61#return; {39#true} is VALID [2018-11-23 12:54:19,106 INFO L256 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret17 := main(); {39#true} is VALID [2018-11-23 12:54:19,106 INFO L256 TraceCheckUtils]: 5: Hoare triple {39#true} call init(); {39#true} is VALID [2018-11-23 12:54:19,106 INFO L273 TraceCheckUtils]: 6: Hoare triple {39#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4);havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#d1~0.base, 4 + ~#d1~0.offset, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#d2~0.base, 4 + ~#d2~0.offset, 4);havoc #t~nondet3; {39#true} is VALID [2018-11-23 12:54:19,107 INFO L273 TraceCheckUtils]: 7: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-23 12:54:19,107 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {39#true} {39#true} #65#return; {39#true} is VALID [2018-11-23 12:54:19,107 INFO L256 TraceCheckUtils]: 9: Hoare triple {39#true} call #t~ret7.base, #t~ret7.offset := get_dummy(); {39#true} is VALID [2018-11-23 12:54:19,107 INFO L273 TraceCheckUtils]: 10: Hoare triple {39#true} assume 0 != #t~nondet4 % 256;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {39#true} is VALID [2018-11-23 12:54:19,108 INFO L273 TraceCheckUtils]: 11: Hoare triple {39#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {39#true} is VALID [2018-11-23 12:54:19,108 INFO L273 TraceCheckUtils]: 12: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-23 12:54:19,109 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {39#true} {39#true} #67#return; {39#true} is VALID [2018-11-23 12:54:19,109 INFO L273 TraceCheckUtils]: 14: Hoare triple {39#true} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {39#true} is VALID [2018-11-23 12:54:19,109 INFO L256 TraceCheckUtils]: 15: Hoare triple {39#true} call #t~ret8.base, #t~ret8.offset := get_dummy(); {39#true} is VALID [2018-11-23 12:54:19,109 INFO L273 TraceCheckUtils]: 16: Hoare triple {39#true} assume 0 != #t~nondet4 % 256;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {39#true} is VALID [2018-11-23 12:54:19,110 INFO L273 TraceCheckUtils]: 17: Hoare triple {39#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {39#true} is VALID [2018-11-23 12:54:19,110 INFO L273 TraceCheckUtils]: 18: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-23 12:54:19,110 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {39#true} {39#true} #69#return; {39#true} is VALID [2018-11-23 12:54:19,111 INFO L273 TraceCheckUtils]: 20: Hoare triple {39#true} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset; {39#true} is VALID [2018-11-23 12:54:19,111 INFO L256 TraceCheckUtils]: 21: Hoare triple {39#true} call #t~ret9.base, #t~ret9.offset := get_dummy(); {39#true} is VALID [2018-11-23 12:54:19,111 INFO L273 TraceCheckUtils]: 22: Hoare triple {39#true} assume 0 != #t~nondet4 % 256;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {39#true} is VALID [2018-11-23 12:54:19,112 INFO L273 TraceCheckUtils]: 23: Hoare triple {39#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {39#true} is VALID [2018-11-23 12:54:19,112 INFO L273 TraceCheckUtils]: 24: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-23 12:54:19,112 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {39#true} {39#true} #71#return; {39#true} is VALID [2018-11-23 12:54:19,112 INFO L273 TraceCheckUtils]: 26: Hoare triple {39#true} ~pd3~0.base, ~pd3~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~i~0 := #t~nondet10;havoc #t~nondet10;#t~short12 := (~pd1~0.base != 0 || ~pd1~0.offset != 0) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset; {39#true} is VALID [2018-11-23 12:54:19,113 INFO L273 TraceCheckUtils]: 27: Hoare triple {39#true} assume #t~short12;call #t~mem11 := read~int(~pd2~0.base, ~pd2~0.offset, 4);#t~short12 := #t~mem11 > 0; {39#true} is VALID [2018-11-23 12:54:19,113 INFO L273 TraceCheckUtils]: 28: Hoare triple {39#true} assume #t~short12;havoc #t~short12;havoc #t~mem11;~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~pd1~0.offset;call #t~mem13 := read~int(~pd3~0.base, ~pd3~0.offset, 4);~i~0 := #t~mem13 - 10;havoc #t~mem13; {39#true} is VALID [2018-11-23 12:54:19,115 INFO L273 TraceCheckUtils]: 29: Hoare triple {39#true} assume !true; {40#false} is VALID [2018-11-23 12:54:19,115 INFO L256 TraceCheckUtils]: 30: Hoare triple {40#false} call #t~ret16 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {39#true} is VALID [2018-11-23 12:54:19,115 INFO L273 TraceCheckUtils]: 31: Hoare triple {39#true} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~i := #in~i;call #t~mem6 := read~int(~s1.base, ~s1.offset, 4);#res := (if #t~mem6 == ~i then 1 else 0);havoc #t~mem6; {39#true} is VALID [2018-11-23 12:54:19,116 INFO L273 TraceCheckUtils]: 32: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-23 12:54:19,116 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {39#true} {40#false} #73#return; {40#false} is VALID [2018-11-23 12:54:19,116 INFO L273 TraceCheckUtils]: 34: Hoare triple {40#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {40#false} is VALID [2018-11-23 12:54:19,117 INFO L273 TraceCheckUtils]: 35: Hoare triple {40#false} assume 0 == #t~ret16;havoc #t~ret16; {40#false} is VALID [2018-11-23 12:54:19,117 INFO L273 TraceCheckUtils]: 36: Hoare triple {40#false} assume !false; {40#false} is VALID [2018-11-23 12:54:19,124 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 12:54:19,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:54:19,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:54:19,133 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-11-23 12:54:19,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:19,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:54:19,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:19,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:54:19,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:54:19,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:54:19,424 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-11-23 12:54:19,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:19,773 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-11-23 12:54:19,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:54:19,773 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-11-23 12:54:19,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:19,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:54:19,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2018-11-23 12:54:19,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:54:19,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2018-11-23 12:54:19,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 56 transitions. [2018-11-23 12:54:20,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:20,061 INFO L225 Difference]: With dead ends: 49 [2018-11-23 12:54:20,061 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 12:54:20,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:54:20,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 12:54:20,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 12:54:20,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:20,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-23 12:54:20,153 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 12:54:20,153 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 12:54:20,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:20,160 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 12:54:20,160 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 12:54:20,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:20,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:20,162 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 12:54:20,162 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 12:54:20,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:20,168 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 12:54:20,168 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 12:54:20,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:20,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:20,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:20,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:20,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:54:20,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-23 12:54:20,176 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 37 [2018-11-23 12:54:20,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:20,176 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-23 12:54:20,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:54:20,177 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 12:54:20,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 12:54:20,178 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:20,179 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2018-11-23 12:54:20,179 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:20,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:20,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1291679579, now seen corresponding path program 1 times [2018-11-23 12:54:20,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:20,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:20,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:20,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:20,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:21,103 INFO L256 TraceCheckUtils]: 0: Hoare triple {214#true} call ULTIMATE.init(); {214#true} is VALID [2018-11-23 12:54:21,103 INFO L273 TraceCheckUtils]: 1: Hoare triple {214#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8);call write~init~int(0, ~#d1~0.base, ~#d1~0.offset, 4);call write~init~int(0, ~#d1~0.base, 4 + ~#d1~0.offset, 4);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8);call write~init~int(0, ~#d2~0.base, ~#d2~0.offset, 4);call write~init~int(0, ~#d2~0.base, 4 + ~#d2~0.offset, 4); {214#true} is VALID [2018-11-23 12:54:21,104 INFO L273 TraceCheckUtils]: 2: Hoare triple {214#true} assume true; {214#true} is VALID [2018-11-23 12:54:21,105 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {214#true} {214#true} #61#return; {214#true} is VALID [2018-11-23 12:54:21,105 INFO L256 TraceCheckUtils]: 4: Hoare triple {214#true} call #t~ret17 := main(); {214#true} is VALID [2018-11-23 12:54:21,106 INFO L256 TraceCheckUtils]: 5: Hoare triple {214#true} call init(); {214#true} is VALID [2018-11-23 12:54:21,106 INFO L273 TraceCheckUtils]: 6: Hoare triple {214#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4);havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#d1~0.base, 4 + ~#d1~0.offset, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#d2~0.base, 4 + ~#d2~0.offset, 4);havoc #t~nondet3; {214#true} is VALID [2018-11-23 12:54:21,107 INFO L273 TraceCheckUtils]: 7: Hoare triple {214#true} assume true; {214#true} is VALID [2018-11-23 12:54:21,107 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {214#true} {214#true} #65#return; {214#true} is VALID [2018-11-23 12:54:21,108 INFO L256 TraceCheckUtils]: 9: Hoare triple {214#true} call #t~ret7.base, #t~ret7.offset := get_dummy(); {214#true} is VALID [2018-11-23 12:54:21,110 INFO L273 TraceCheckUtils]: 10: Hoare triple {214#true} assume 0 != #t~nondet4 % 256;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {216#(and (= |~#d1~0.offset| |get_dummy_#t~ite5.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} is VALID [2018-11-23 12:54:21,110 INFO L273 TraceCheckUtils]: 11: Hoare triple {216#(and (= |~#d1~0.offset| |get_dummy_#t~ite5.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {217#(and (= |~#d1~0.offset| |get_dummy_#res.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2018-11-23 12:54:21,112 INFO L273 TraceCheckUtils]: 12: Hoare triple {217#(and (= |~#d1~0.offset| |get_dummy_#res.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} assume true; {217#(and (= |~#d1~0.offset| |get_dummy_#res.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2018-11-23 12:54:21,116 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {217#(and (= |~#d1~0.offset| |get_dummy_#res.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} {214#true} #67#return; {218#(and (= |~#d1~0.base| |main_#t~ret7.base|) (= |~#d1~0.offset| |main_#t~ret7.offset|))} is VALID [2018-11-23 12:54:21,118 INFO L273 TraceCheckUtils]: 14: Hoare triple {218#(and (= |~#d1~0.base| |main_#t~ret7.base|) (= |~#d1~0.offset| |main_#t~ret7.offset|))} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {219#(and (= |~#d1~0.offset| main_~pd1~0.offset) (= |~#d1~0.base| main_~pd1~0.base))} is VALID [2018-11-23 12:54:21,118 INFO L256 TraceCheckUtils]: 15: Hoare triple {219#(and (= |~#d1~0.offset| main_~pd1~0.offset) (= |~#d1~0.base| main_~pd1~0.base))} call #t~ret8.base, #t~ret8.offset := get_dummy(); {214#true} is VALID [2018-11-23 12:54:21,118 INFO L273 TraceCheckUtils]: 16: Hoare triple {214#true} assume 0 != #t~nondet4 % 256;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {214#true} is VALID [2018-11-23 12:54:21,119 INFO L273 TraceCheckUtils]: 17: Hoare triple {214#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {214#true} is VALID [2018-11-23 12:54:21,119 INFO L273 TraceCheckUtils]: 18: Hoare triple {214#true} assume true; {214#true} is VALID [2018-11-23 12:54:21,120 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {214#true} {219#(and (= |~#d1~0.offset| main_~pd1~0.offset) (= |~#d1~0.base| main_~pd1~0.base))} #69#return; {219#(and (= |~#d1~0.offset| main_~pd1~0.offset) (= |~#d1~0.base| main_~pd1~0.base))} is VALID [2018-11-23 12:54:21,125 INFO L273 TraceCheckUtils]: 20: Hoare triple {219#(and (= |~#d1~0.offset| main_~pd1~0.offset) (= |~#d1~0.base| main_~pd1~0.base))} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset; {219#(and (= |~#d1~0.offset| main_~pd1~0.offset) (= |~#d1~0.base| main_~pd1~0.base))} is VALID [2018-11-23 12:54:21,125 INFO L256 TraceCheckUtils]: 21: Hoare triple {219#(and (= |~#d1~0.offset| main_~pd1~0.offset) (= |~#d1~0.base| main_~pd1~0.base))} call #t~ret9.base, #t~ret9.offset := get_dummy(); {214#true} is VALID [2018-11-23 12:54:21,126 INFO L273 TraceCheckUtils]: 22: Hoare triple {214#true} assume 0 != #t~nondet4 % 256;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {216#(and (= |~#d1~0.offset| |get_dummy_#t~ite5.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} is VALID [2018-11-23 12:54:21,143 INFO L273 TraceCheckUtils]: 23: Hoare triple {216#(and (= |~#d1~0.offset| |get_dummy_#t~ite5.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {217#(and (= |~#d1~0.offset| |get_dummy_#res.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2018-11-23 12:54:21,158 INFO L273 TraceCheckUtils]: 24: Hoare triple {217#(and (= |~#d1~0.offset| |get_dummy_#res.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} assume true; {217#(and (= |~#d1~0.offset| |get_dummy_#res.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2018-11-23 12:54:21,176 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {217#(and (= |~#d1~0.offset| |get_dummy_#res.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} {219#(and (= |~#d1~0.offset| main_~pd1~0.offset) (= |~#d1~0.base| main_~pd1~0.base))} #71#return; {220#(and (= |main_#t~ret9.base| main_~pd1~0.base) (= |main_#t~ret9.offset| main_~pd1~0.offset))} is VALID [2018-11-23 12:54:21,190 INFO L273 TraceCheckUtils]: 26: Hoare triple {220#(and (= |main_#t~ret9.base| main_~pd1~0.base) (= |main_#t~ret9.offset| main_~pd1~0.offset))} ~pd3~0.base, ~pd3~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~i~0 := #t~nondet10;havoc #t~nondet10;#t~short12 := (~pd1~0.base != 0 || ~pd1~0.offset != 0) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset; {221#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} is VALID [2018-11-23 12:54:21,196 INFO L273 TraceCheckUtils]: 27: Hoare triple {221#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} assume #t~short12;call #t~mem11 := read~int(~pd2~0.base, ~pd2~0.offset, 4);#t~short12 := #t~mem11 > 0; {221#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} is VALID [2018-11-23 12:54:21,197 INFO L273 TraceCheckUtils]: 28: Hoare triple {221#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} assume #t~short12;havoc #t~short12;havoc #t~mem11;~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~pd1~0.offset;call #t~mem13 := read~int(~pd3~0.base, ~pd3~0.offset, 4);~i~0 := #t~mem13 - 10;havoc #t~mem13; {222#(= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:21,205 INFO L273 TraceCheckUtils]: 29: Hoare triple {222#(= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem14 := read~int(~pa~0.base, ~pa~0.offset, 4); {223#(= (+ main_~i~0 10) |main_#t~mem14|)} is VALID [2018-11-23 12:54:21,207 INFO L273 TraceCheckUtils]: 30: Hoare triple {223#(= (+ main_~i~0 10) |main_#t~mem14|)} assume !(~i~0 < #t~mem14);havoc #t~mem14; {215#false} is VALID [2018-11-23 12:54:21,207 INFO L256 TraceCheckUtils]: 31: Hoare triple {215#false} call #t~ret16 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {214#true} is VALID [2018-11-23 12:54:21,207 INFO L273 TraceCheckUtils]: 32: Hoare triple {214#true} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~i := #in~i;call #t~mem6 := read~int(~s1.base, ~s1.offset, 4);#res := (if #t~mem6 == ~i then 1 else 0);havoc #t~mem6; {214#true} is VALID [2018-11-23 12:54:21,207 INFO L273 TraceCheckUtils]: 33: Hoare triple {214#true} assume true; {214#true} is VALID [2018-11-23 12:54:21,208 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {214#true} {215#false} #73#return; {215#false} is VALID [2018-11-23 12:54:21,208 INFO L273 TraceCheckUtils]: 35: Hoare triple {215#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {215#false} is VALID [2018-11-23 12:54:21,208 INFO L273 TraceCheckUtils]: 36: Hoare triple {215#false} assume 0 == #t~ret16;havoc #t~ret16; {215#false} is VALID [2018-11-23 12:54:21,209 INFO L273 TraceCheckUtils]: 37: Hoare triple {215#false} assume !false; {215#false} is VALID [2018-11-23 12:54:21,213 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:54:21,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:21,213 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:21,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:21,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:21,969 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-11-23 12:54:22,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 17 treesize of output 13 [2018-11-23 12:54:22,168 INFO L478 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 13 treesize of output 9 [2018-11-23 12:54:22,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:54:22,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:54:22,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:54:22,193 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:5 [2018-11-23 12:54:22,196 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:54:22,196 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~pa~0.base]. (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) 0))) (and (not (= 0 main_~pa~0.base)) (<= .cse0 |main_#t~mem14|) (<= (+ main_~i~0 10) .cse0))) [2018-11-23 12:54:22,196 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (+ main_~i~0 10) |main_#t~mem14|) [2018-11-23 12:54:22,443 INFO L256 TraceCheckUtils]: 0: Hoare triple {214#true} call ULTIMATE.init(); {214#true} is VALID [2018-11-23 12:54:22,445 INFO L273 TraceCheckUtils]: 1: Hoare triple {214#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8);call write~init~int(0, ~#d1~0.base, ~#d1~0.offset, 4);call write~init~int(0, ~#d1~0.base, 4 + ~#d1~0.offset, 4);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8);call write~init~int(0, ~#d2~0.base, ~#d2~0.offset, 4);call write~init~int(0, ~#d2~0.base, 4 + ~#d2~0.offset, 4); {230#(= 0 |~#d1~0.offset|)} is VALID [2018-11-23 12:54:22,445 INFO L273 TraceCheckUtils]: 2: Hoare triple {230#(= 0 |~#d1~0.offset|)} assume true; {230#(= 0 |~#d1~0.offset|)} is VALID [2018-11-23 12:54:22,446 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {230#(= 0 |~#d1~0.offset|)} {214#true} #61#return; {230#(= 0 |~#d1~0.offset|)} is VALID [2018-11-23 12:54:22,446 INFO L256 TraceCheckUtils]: 4: Hoare triple {230#(= 0 |~#d1~0.offset|)} call #t~ret17 := main(); {230#(= 0 |~#d1~0.offset|)} is VALID [2018-11-23 12:54:22,447 INFO L256 TraceCheckUtils]: 5: Hoare triple {230#(= 0 |~#d1~0.offset|)} call init(); {230#(= 0 |~#d1~0.offset|)} is VALID [2018-11-23 12:54:22,448 INFO L273 TraceCheckUtils]: 6: Hoare triple {230#(= 0 |~#d1~0.offset|)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4);havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#d1~0.base, 4 + ~#d1~0.offset, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#d2~0.base, 4 + ~#d2~0.offset, 4);havoc #t~nondet3; {230#(= 0 |~#d1~0.offset|)} is VALID [2018-11-23 12:54:22,448 INFO L273 TraceCheckUtils]: 7: Hoare triple {230#(= 0 |~#d1~0.offset|)} assume true; {230#(= 0 |~#d1~0.offset|)} is VALID [2018-11-23 12:54:22,455 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {230#(= 0 |~#d1~0.offset|)} {230#(= 0 |~#d1~0.offset|)} #65#return; {230#(= 0 |~#d1~0.offset|)} is VALID [2018-11-23 12:54:22,474 INFO L256 TraceCheckUtils]: 9: Hoare triple {230#(= 0 |~#d1~0.offset|)} call #t~ret7.base, #t~ret7.offset := get_dummy(); {230#(= 0 |~#d1~0.offset|)} is VALID [2018-11-23 12:54:22,488 INFO L273 TraceCheckUtils]: 10: Hoare triple {230#(= 0 |~#d1~0.offset|)} assume 0 != #t~nondet4 % 256;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {258#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= 0 |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} is VALID [2018-11-23 12:54:22,497 INFO L273 TraceCheckUtils]: 11: Hoare triple {258#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= 0 |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {262#(and (= 0 |~#d1~0.offset|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2018-11-23 12:54:22,503 INFO L273 TraceCheckUtils]: 12: Hoare triple {262#(and (= 0 |~#d1~0.offset|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} assume true; {262#(and (= 0 |~#d1~0.offset|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2018-11-23 12:54:22,505 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {262#(and (= 0 |~#d1~0.offset|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} {230#(= 0 |~#d1~0.offset|)} #67#return; {269#(and (= |main_#t~ret7.offset| |~#d1~0.offset|) (= |~#d1~0.base| |main_#t~ret7.base|) (= 0 |~#d1~0.offset|))} is VALID [2018-11-23 12:54:22,507 INFO L273 TraceCheckUtils]: 14: Hoare triple {269#(and (= |main_#t~ret7.offset| |~#d1~0.offset|) (= |~#d1~0.base| |main_#t~ret7.base|) (= 0 |~#d1~0.offset|))} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {273#(and (= 0 |~#d1~0.offset|) (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} is VALID [2018-11-23 12:54:22,507 INFO L256 TraceCheckUtils]: 15: Hoare triple {273#(and (= 0 |~#d1~0.offset|) (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} call #t~ret8.base, #t~ret8.offset := get_dummy(); {230#(= 0 |~#d1~0.offset|)} is VALID [2018-11-23 12:54:22,508 INFO L273 TraceCheckUtils]: 16: Hoare triple {230#(= 0 |~#d1~0.offset|)} assume 0 != #t~nondet4 % 256;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {230#(= 0 |~#d1~0.offset|)} is VALID [2018-11-23 12:54:22,509 INFO L273 TraceCheckUtils]: 17: Hoare triple {230#(= 0 |~#d1~0.offset|)} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {230#(= 0 |~#d1~0.offset|)} is VALID [2018-11-23 12:54:22,509 INFO L273 TraceCheckUtils]: 18: Hoare triple {230#(= 0 |~#d1~0.offset|)} assume true; {230#(= 0 |~#d1~0.offset|)} is VALID [2018-11-23 12:54:22,510 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {230#(= 0 |~#d1~0.offset|)} {273#(and (= 0 |~#d1~0.offset|) (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} #69#return; {273#(and (= 0 |~#d1~0.offset|) (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} is VALID [2018-11-23 12:54:22,511 INFO L273 TraceCheckUtils]: 20: Hoare triple {273#(and (= 0 |~#d1~0.offset|) (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset; {273#(and (= 0 |~#d1~0.offset|) (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} is VALID [2018-11-23 12:54:22,513 INFO L256 TraceCheckUtils]: 21: Hoare triple {273#(and (= 0 |~#d1~0.offset|) (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} call #t~ret9.base, #t~ret9.offset := get_dummy(); {230#(= 0 |~#d1~0.offset|)} is VALID [2018-11-23 12:54:22,514 INFO L273 TraceCheckUtils]: 22: Hoare triple {230#(= 0 |~#d1~0.offset|)} assume 0 != #t~nondet4 % 256;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {258#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= 0 |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} is VALID [2018-11-23 12:54:22,515 INFO L273 TraceCheckUtils]: 23: Hoare triple {258#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= 0 |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {262#(and (= 0 |~#d1~0.offset|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2018-11-23 12:54:22,516 INFO L273 TraceCheckUtils]: 24: Hoare triple {262#(and (= 0 |~#d1~0.offset|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} assume true; {262#(and (= 0 |~#d1~0.offset|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2018-11-23 12:54:22,518 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {262#(and (= 0 |~#d1~0.offset|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} {273#(and (= 0 |~#d1~0.offset|) (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} #71#return; {307#(and (= |main_#t~ret9.base| main_~pd1~0.base) (= 0 |main_#t~ret9.offset|) (= main_~pd1~0.offset 0))} is VALID [2018-11-23 12:54:22,519 INFO L273 TraceCheckUtils]: 26: Hoare triple {307#(and (= |main_#t~ret9.base| main_~pd1~0.base) (= 0 |main_#t~ret9.offset|) (= main_~pd1~0.offset 0))} ~pd3~0.base, ~pd3~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~i~0 := #t~nondet10;havoc #t~nondet10;#t~short12 := (~pd1~0.base != 0 || ~pd1~0.offset != 0) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset; {311#(and (= main_~pd3~0.base main_~pd1~0.base) (or (not (= 0 main_~pd1~0.base)) (not |main_#t~short12|)) (= main_~pd1~0.offset 0) (= main_~pd3~0.offset 0))} is VALID [2018-11-23 12:54:22,521 INFO L273 TraceCheckUtils]: 27: Hoare triple {311#(and (= main_~pd3~0.base main_~pd1~0.base) (or (not (= 0 main_~pd1~0.base)) (not |main_#t~short12|)) (= main_~pd1~0.offset 0) (= main_~pd3~0.offset 0))} assume #t~short12;call #t~mem11 := read~int(~pd2~0.base, ~pd2~0.offset, 4);#t~short12 := #t~mem11 > 0; {315#(and (= main_~pd3~0.base main_~pd1~0.base) (not (= 0 main_~pd1~0.base)) (= main_~pd1~0.offset 0) (= main_~pd3~0.offset 0))} is VALID [2018-11-23 12:54:22,536 INFO L273 TraceCheckUtils]: 28: Hoare triple {315#(and (= main_~pd3~0.base main_~pd1~0.base) (not (= 0 main_~pd1~0.base)) (= main_~pd1~0.offset 0) (= main_~pd3~0.offset 0))} assume #t~short12;havoc #t~short12;havoc #t~mem11;~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~pd1~0.offset;call #t~mem13 := read~int(~pd3~0.base, ~pd3~0.offset, 4);~i~0 := #t~mem13 - 10;havoc #t~mem13; {319#(and (not (= 0 main_~pa~0.base)) (= 0 main_~pa~0.offset) (<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) 0)))} is VALID [2018-11-23 12:54:22,537 INFO L273 TraceCheckUtils]: 29: Hoare triple {319#(and (not (= 0 main_~pa~0.base)) (= 0 main_~pa~0.offset) (<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) 0)))} call #t~mem14 := read~int(~pa~0.base, ~pa~0.offset, 4); {323#(<= (+ main_~i~0 10) |main_#t~mem14|)} is VALID [2018-11-23 12:54:22,538 INFO L273 TraceCheckUtils]: 30: Hoare triple {323#(<= (+ main_~i~0 10) |main_#t~mem14|)} assume !(~i~0 < #t~mem14);havoc #t~mem14; {215#false} is VALID [2018-11-23 12:54:22,538 INFO L256 TraceCheckUtils]: 31: Hoare triple {215#false} call #t~ret16 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {215#false} is VALID [2018-11-23 12:54:22,538 INFO L273 TraceCheckUtils]: 32: Hoare triple {215#false} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~i := #in~i;call #t~mem6 := read~int(~s1.base, ~s1.offset, 4);#res := (if #t~mem6 == ~i then 1 else 0);havoc #t~mem6; {215#false} is VALID [2018-11-23 12:54:22,539 INFO L273 TraceCheckUtils]: 33: Hoare triple {215#false} assume true; {215#false} is VALID [2018-11-23 12:54:22,539 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {215#false} {215#false} #73#return; {215#false} is VALID [2018-11-23 12:54:22,539 INFO L273 TraceCheckUtils]: 35: Hoare triple {215#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {215#false} is VALID [2018-11-23 12:54:22,540 INFO L273 TraceCheckUtils]: 36: Hoare triple {215#false} assume 0 == #t~ret16;havoc #t~ret16; {215#false} is VALID [2018-11-23 12:54:22,540 INFO L273 TraceCheckUtils]: 37: Hoare triple {215#false} assume !false; {215#false} is VALID [2018-11-23 12:54:22,546 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:54:22,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:22,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2018-11-23 12:54:22,573 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-11-23 12:54:22,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:22,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:54:22,705 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:22,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:54:22,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:54:22,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:54:22,706 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 20 states. [2018-11-23 12:54:25,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:25,351 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2018-11-23 12:54:25,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:54:25,351 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-11-23 12:54:25,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:25,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:54:25,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 83 transitions. [2018-11-23 12:54:25,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:54:25,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 83 transitions. [2018-11-23 12:54:25,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 83 transitions. [2018-11-23 12:54:25,573 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:25,577 INFO L225 Difference]: With dead ends: 69 [2018-11-23 12:54:25,577 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 12:54:25,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:54:25,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 12:54:25,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 43. [2018-11-23 12:54:25,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:25,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 43 states. [2018-11-23 12:54:25,692 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 43 states. [2018-11-23 12:54:25,692 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 43 states. [2018-11-23 12:54:25,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:25,700 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2018-11-23 12:54:25,700 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2018-11-23 12:54:25,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:25,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:25,702 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 61 states. [2018-11-23 12:54:25,702 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 61 states. [2018-11-23 12:54:25,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:25,709 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2018-11-23 12:54:25,709 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2018-11-23 12:54:25,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:25,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:25,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:25,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:25,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:54:25,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2018-11-23 12:54:25,717 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 38 [2018-11-23 12:54:25,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:25,718 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2018-11-23 12:54:25,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:54:25,718 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2018-11-23 12:54:25,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 12:54:25,722 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:25,722 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:25,722 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:25,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:25,723 INFO L82 PathProgramCache]: Analyzing trace with hash 270611225, now seen corresponding path program 1 times [2018-11-23 12:54:25,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:25,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:25,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:25,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:25,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:54:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:54:25,874 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=23, |#NULL.offset|=18, |old(#NULL.base)|=23, |old(#NULL.offset)|=18, |old(~#d1~0.base)|=19, |old(~#d1~0.offset)|=25, |old(~#d2~0.base)|=21, |old(~#d2~0.offset)|=24, |~#d1~0.base|=19, |~#d1~0.offset|=25, |~#d2~0.base|=21, |~#d2~0.offset|=24] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8);call write~init~int(0, ~#d1~0.base, ~#d1~0.offset, 4);call write~init~int(0, ~#d1~0.base, 4 + ~#d1~0.offset, 4);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8);call write~init~int(0, ~#d2~0.base, ~#d2~0.offset, 4);call write~init~int(0, ~#d2~0.base, 4 + ~#d2~0.offset, 4); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=23, |old(#NULL.offset)|=18, |old(~#d1~0.base)|=19, |old(~#d1~0.offset)|=25, |old(~#d2~0.base)|=21, |old(~#d2~0.offset)|=24, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=23, |old(#NULL.offset)|=18, |old(~#d1~0.base)|=19, |old(~#d1~0.offset)|=25, |old(~#d2~0.base)|=21, |old(~#d2~0.offset)|=24, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] RET #61#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] CALL call #t~ret17 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] CALL call init(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4);havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#d1~0.base, 4 + ~#d1~0.offset, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#d2~0.base, 4 + ~#d2~0.offset, 4);havoc #t~nondet3; VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] RET #65#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] CALL call #t~ret7.base, #t~ret7.offset := get_dummy(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] assume 0 != #t~nondet4 % 256;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; VAL [|#NULL.base|=0, |#NULL.offset|=0, |get_dummy_#t~ite5.base|=20, |get_dummy_#t~ite5.offset|=0, |get_dummy_#t~nondet4|=1, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; VAL [|#NULL.base|=0, |#NULL.offset|=0, |get_dummy_#res.base|=20, |get_dummy_#res.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |get_dummy_#res.base|=20, |get_dummy_#res.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] RET #67#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7.base|=20, |main_#t~ret7.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; VAL [main_~pd1~0.base=20, main_~pd1~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] CALL call #t~ret8.base, #t~ret8.offset := get_dummy(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] assume 0 != #t~nondet4 % 256;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; VAL [|#NULL.base|=0, |#NULL.offset|=0, |get_dummy_#t~ite5.base|=20, |get_dummy_#t~ite5.offset|=0, |get_dummy_#t~nondet4|=1, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; VAL [|#NULL.base|=0, |#NULL.offset|=0, |get_dummy_#res.base|=20, |get_dummy_#res.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |get_dummy_#res.base|=20, |get_dummy_#res.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] RET #69#return; VAL [main_~pd1~0.base=20, main_~pd1~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret8.base|=20, |main_#t~ret8.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset; VAL [main_~pd1~0.base=20, main_~pd1~0.offset=0, main_~pd2~0.base=20, main_~pd2~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] CALL call #t~ret9.base, #t~ret9.offset := get_dummy(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] assume !(0 != #t~nondet4 % 256);#t~ite5.base, #t~ite5.offset := ~#d2~0.base, ~#d2~0.offset; VAL [|#NULL.base|=0, |#NULL.offset|=0, |get_dummy_#t~ite5.base|=22, |get_dummy_#t~ite5.offset|=0, |get_dummy_#t~nondet4|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; VAL [|#NULL.base|=0, |#NULL.offset|=0, |get_dummy_#res.base|=22, |get_dummy_#res.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |get_dummy_#res.base|=22, |get_dummy_#res.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] RET #71#return; VAL [main_~pd1~0.base=20, main_~pd1~0.offset=0, main_~pd2~0.base=20, main_~pd2~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret9.base|=22, |main_#t~ret9.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] ~pd3~0.base, ~pd3~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~i~0 := #t~nondet10;havoc #t~nondet10;#t~short12 := (~pd1~0.base != 0 || ~pd1~0.offset != 0) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset; VAL [main_~i~0=0, main_~pd1~0.base=20, main_~pd1~0.offset=0, main_~pd2~0.base=20, main_~pd2~0.offset=0, main_~pd3~0.base=22, main_~pd3~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short12|=true, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] assume #t~short12;call #t~mem11 := read~int(~pd2~0.base, ~pd2~0.offset, 4);#t~short12 := #t~mem11 > 0; VAL [main_~i~0=0, main_~pd1~0.base=20, main_~pd1~0.offset=0, main_~pd2~0.base=20, main_~pd2~0.offset=0, main_~pd3~0.base=22, main_~pd3~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem11|=6, |main_#t~short12|=true, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] assume #t~short12;havoc #t~short12;havoc #t~mem11;~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~pd1~0.offset;call #t~mem13 := read~int(~pd3~0.base, ~pd3~0.offset, 4);~i~0 := #t~mem13 - 10;havoc #t~mem13; VAL [main_~i~0=7, main_~pa~0.base=20, main_~pa~0.offset=0, main_~pd1~0.base=20, main_~pd1~0.offset=0, main_~pd2~0.base=20, main_~pd2~0.offset=0, main_~pd3~0.base=22, main_~pd3~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] call #t~mem14 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=7, main_~pa~0.base=20, main_~pa~0.offset=0, main_~pd1~0.base=20, main_~pd1~0.offset=0, main_~pd2~0.base=20, main_~pd2~0.offset=0, main_~pd3~0.base=22, main_~pd3~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem14|=6, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] assume !(~i~0 < #t~mem14);havoc #t~mem14; VAL [main_~i~0=7, main_~pa~0.base=20, main_~pa~0.offset=0, main_~pd1~0.base=20, main_~pd1~0.offset=0, main_~pd2~0.base=20, main_~pd2~0.offset=0, main_~pd3~0.base=22, main_~pd3~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] CALL call #t~ret16 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |check_#in~i|=7, |check_#in~s1.base|=20, |check_#in~s1.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~i := #in~i;call #t~mem6 := read~int(~s1.base, ~s1.offset, 4);#res := (if #t~mem6 == ~i then 1 else 0);havoc #t~mem6; VAL [check_~i=7, check_~s1.base=20, check_~s1.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |check_#in~i|=7, |check_#in~s1.base|=20, |check_#in~s1.offset|=0, |check_#res|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] assume true; VAL [check_~i=7, check_~s1.base=20, check_~s1.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |check_#in~i|=7, |check_#in~s1.base|=20, |check_#in~s1.offset|=0, |check_#res|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] RET #73#return; VAL [main_~i~0=7, main_~pa~0.base=20, main_~pa~0.offset=0, main_~pd1~0.base=20, main_~pd1~0.offset=0, main_~pd2~0.base=20, main_~pd2~0.offset=0, main_~pd3~0.base=22, main_~pd3~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret16|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; VAL [main_~i~0=7, main_~pa~0.base=20, main_~pa~0.offset=0, main_~pd1~0.base=20, main_~pd1~0.offset=0, main_~pd2~0.base=20, main_~pd2~0.offset=0, main_~pd3~0.base=22, main_~pd3~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret16|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] assume 0 == #t~ret16;havoc #t~ret16; VAL [main_~i~0=7, main_~pa~0.base=20, main_~pa~0.offset=0, main_~pd1~0.base=20, main_~pd1~0.offset=0, main_~pd2~0.base=20, main_~pd2~0.offset=0, main_~pd3~0.base=22, main_~pd3~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] assume !false; VAL [main_~i~0=7, main_~pa~0.base=20, main_~pa~0.offset=0, main_~pd1~0.base=20, main_~pd1~0.offset=0, main_~pd2~0.base=20, main_~pd2~0.offset=0, main_~pd3~0.base=22, main_~pd3~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=23, #NULL.offset=18, old(#NULL.base)=23, old(#NULL.offset)=18, old(~#d1~0.base)=19, old(~#d1~0.offset)=25, old(~#d2~0.base)=21, old(~#d2~0.offset)=24, ~#d1~0.base=19, ~#d1~0.offset=25, ~#d2~0.base=21, ~#d2~0.offset=24] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L9] call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8); [L9] call write~init~int(0, ~#d1~0.base, ~#d1~0.offset, 4); [L9] call write~init~int(0, ~#d1~0.base, 4 + ~#d1~0.offset, 4); [L9] call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8); [L9] call write~init~int(0, ~#d2~0.base, ~#d2~0.offset, 4); [L9] call write~init~int(0, ~#d2~0.base, 4 + ~#d2~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=23, old(#NULL.offset)=18, old(~#d1~0.base)=19, old(~#d1~0.offset)=25, old(~#d2~0.base)=21, old(~#d2~0.offset)=24, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=23, old(#NULL.offset)=18, old(~#d1~0.base)=19, old(~#d1~0.offset)=25, old(~#d2~0.base)=21, old(~#d2~0.offset)=24, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L32] CALL call init(); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] call write~int(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4); [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] call write~int(#t~nondet1, ~#d1~0.base, 4 + ~#d1~0.offset, 4); [L14] havoc #t~nondet1; [L16] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L16] call write~int(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4); [L16] havoc #t~nondet2; [L17] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L17] call write~int(#t~nondet3, ~#d2~0.base, 4 + ~#d2~0.offset, 4); [L17] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L11-L18] ensures true; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L32] RET call init(); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L33] CALL call #t~ret7.base, #t~ret7.offset := get_dummy(); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L22] assume 0 != #t~nondet4 % 256; [L22] #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~ite5.base=20, #t~ite5.offset=0, #t~nondet4=1, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L22] #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; [L22] havoc #t~nondet4; [L22] havoc #t~ite5.base, #t~ite5.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=20, #res.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L20-L23] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=20, #res.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L33] RET call #t~ret7.base, #t~ret7.offset := get_dummy(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7.base=20, #t~ret7.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L33] ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset; [L33] havoc #t~ret7.base, #t~ret7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0] [L33] CALL call #t~ret8.base, #t~ret8.offset := get_dummy(); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L22] assume 0 != #t~nondet4 % 256; [L22] #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~ite5.base=20, #t~ite5.offset=0, #t~nondet4=1, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L22] #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; [L22] havoc #t~nondet4; [L22] havoc #t~ite5.base, #t~ite5.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=20, #res.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L20-L23] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=20, #res.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L33] RET call #t~ret8.base, #t~ret8.offset := get_dummy(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8.base=20, #t~ret8.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0] [L33] ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset; [L33] havoc #t~ret8.base, #t~ret8.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0] [L33] CALL call #t~ret9.base, #t~ret9.offset := get_dummy(); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L22] assume !(0 != #t~nondet4 % 256); [L22] #t~ite5.base, #t~ite5.offset := ~#d2~0.base, ~#d2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~ite5.base=22, #t~ite5.offset=0, #t~nondet4=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L22] #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; [L22] havoc #t~nondet4; [L22] havoc #t~ite5.base, #t~ite5.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=22, #res.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L20-L23] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=22, #res.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L33] RET call #t~ret9.base, #t~ret9.offset := get_dummy(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret9.base=22, #t~ret9.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0] [L33] ~pd3~0.base, ~pd3~0.offset := #t~ret9.base, #t~ret9.offset; [L33] havoc #t~ret9.base, #t~ret9.offset; [L34] assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; [L34] ~i~0 := #t~nondet10; [L34] havoc #t~nondet10; [L35] #t~short12 := (~pd1~0.base != 0 || ~pd1~0.offset != 0) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~short12=true, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [L35] assume #t~short12; [L35] call #t~mem11 := read~int(~pd2~0.base, ~pd2~0.offset, 4); [L35] #t~short12 := #t~mem11 > 0; VAL [#NULL.base=0, #NULL.offset=0, #t~mem11=6, #t~short12=true, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [L35-L44] assume #t~short12; [L35] havoc #t~short12; [L35] havoc #t~mem11; [L36] ~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~pd1~0.offset; [L37] call #t~mem13 := read~int(~pd3~0.base, ~pd3~0.offset, 4); [L37] ~i~0 := #t~mem13 - 10; [L37] havoc #t~mem13; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=7, ~pa~0.base=20, ~pa~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [L38] call #t~mem14 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem14=6, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=7, ~pa~0.base=20, ~pa~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [L38-L40] assume !(~i~0 < #t~mem14); [L38] havoc #t~mem14; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=7, ~pa~0.base=20, ~pa~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [L41] CALL call #t~ret16 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); VAL [#in~i=7, #in~s1.base=20, #in~s1.offset=0, #NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L25-L28] ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset; [L25-L28] ~i := #in~i; [L27] call #t~mem6 := read~int(~s1.base, ~s1.offset, 4); [L27] #res := (if #t~mem6 == ~i then 1 else 0); [L27] havoc #t~mem6; VAL [#in~i=7, #in~s1.base=20, #in~s1.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i=7, ~s1.base=20, ~s1.offset=0] [L25-L28] ensures true; VAL [#in~i=7, #in~s1.base=20, #in~s1.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i=7, ~s1.base=20, ~s1.offset=0] [L41] RET call #t~ret16 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret16=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=7, ~pa~0.base=20, ~pa~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [L41] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret16=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=7, ~pa~0.base=20, ~pa~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [L41-L43] assume 0 == #t~ret16; [L41] havoc #t~ret16; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=7, ~pa~0.base=20, ~pa~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [L48] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=7, ~pa~0.base=20, ~pa~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=23, #NULL.offset=18, old(#NULL.base)=23, old(#NULL.offset)=18, old(~#d1~0.base)=19, old(~#d1~0.offset)=25, old(~#d2~0.base)=21, old(~#d2~0.offset)=24, ~#d1~0.base=19, ~#d1~0.offset=25, ~#d2~0.base=21, ~#d2~0.offset=24] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L9] call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8); [L9] call write~init~int(0, ~#d1~0.base, ~#d1~0.offset, 4); [L9] call write~init~int(0, ~#d1~0.base, 4 + ~#d1~0.offset, 4); [L9] call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8); [L9] call write~init~int(0, ~#d2~0.base, ~#d2~0.offset, 4); [L9] call write~init~int(0, ~#d2~0.base, 4 + ~#d2~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=23, old(#NULL.offset)=18, old(~#d1~0.base)=19, old(~#d1~0.offset)=25, old(~#d2~0.base)=21, old(~#d2~0.offset)=24, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=23, old(#NULL.offset)=18, old(~#d1~0.base)=19, old(~#d1~0.offset)=25, old(~#d2~0.base)=21, old(~#d2~0.offset)=24, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L32] CALL call init(); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] call write~int(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4); [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] call write~int(#t~nondet1, ~#d1~0.base, 4 + ~#d1~0.offset, 4); [L14] havoc #t~nondet1; [L16] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L16] call write~int(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4); [L16] havoc #t~nondet2; [L17] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L17] call write~int(#t~nondet3, ~#d2~0.base, 4 + ~#d2~0.offset, 4); [L17] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L11-L18] ensures true; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L32] RET call init(); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L33] CALL call #t~ret7.base, #t~ret7.offset := get_dummy(); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L22] assume 0 != #t~nondet4 % 256; [L22] #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~ite5.base=20, #t~ite5.offset=0, #t~nondet4=1, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L22] #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; [L22] havoc #t~nondet4; [L22] havoc #t~ite5.base, #t~ite5.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=20, #res.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L20-L23] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=20, #res.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L33] RET call #t~ret7.base, #t~ret7.offset := get_dummy(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7.base=20, #t~ret7.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L33] ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset; [L33] havoc #t~ret7.base, #t~ret7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0] [L33] CALL call #t~ret8.base, #t~ret8.offset := get_dummy(); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L22] assume 0 != #t~nondet4 % 256; [L22] #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~ite5.base=20, #t~ite5.offset=0, #t~nondet4=1, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L22] #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; [L22] havoc #t~nondet4; [L22] havoc #t~ite5.base, #t~ite5.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=20, #res.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L20-L23] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=20, #res.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L33] RET call #t~ret8.base, #t~ret8.offset := get_dummy(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8.base=20, #t~ret8.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0] [L33] ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset; [L33] havoc #t~ret8.base, #t~ret8.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0] [L33] CALL call #t~ret9.base, #t~ret9.offset := get_dummy(); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L22] assume !(0 != #t~nondet4 % 256); [L22] #t~ite5.base, #t~ite5.offset := ~#d2~0.base, ~#d2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~ite5.base=22, #t~ite5.offset=0, #t~nondet4=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L22] #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; [L22] havoc #t~nondet4; [L22] havoc #t~ite5.base, #t~ite5.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=22, #res.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L20-L23] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=22, #res.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L33] RET call #t~ret9.base, #t~ret9.offset := get_dummy(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret9.base=22, #t~ret9.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0] [L33] ~pd3~0.base, ~pd3~0.offset := #t~ret9.base, #t~ret9.offset; [L33] havoc #t~ret9.base, #t~ret9.offset; [L34] assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; [L34] ~i~0 := #t~nondet10; [L34] havoc #t~nondet10; [L35] #t~short12 := (~pd1~0.base != 0 || ~pd1~0.offset != 0) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~short12=true, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [L35] assume #t~short12; [L35] call #t~mem11 := read~int(~pd2~0.base, ~pd2~0.offset, 4); [L35] #t~short12 := #t~mem11 > 0; VAL [#NULL.base=0, #NULL.offset=0, #t~mem11=6, #t~short12=true, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [L35-L44] assume #t~short12; [L35] havoc #t~short12; [L35] havoc #t~mem11; [L36] ~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~pd1~0.offset; [L37] call #t~mem13 := read~int(~pd3~0.base, ~pd3~0.offset, 4); [L37] ~i~0 := #t~mem13 - 10; [L37] havoc #t~mem13; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=7, ~pa~0.base=20, ~pa~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [L38] call #t~mem14 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem14=6, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=7, ~pa~0.base=20, ~pa~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [L38-L40] assume !(~i~0 < #t~mem14); [L38] havoc #t~mem14; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=7, ~pa~0.base=20, ~pa~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [L41] CALL call #t~ret16 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); VAL [#in~i=7, #in~s1.base=20, #in~s1.offset=0, #NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L25-L28] ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset; [L25-L28] ~i := #in~i; [L27] call #t~mem6 := read~int(~s1.base, ~s1.offset, 4); [L27] #res := (if #t~mem6 == ~i then 1 else 0); [L27] havoc #t~mem6; VAL [#in~i=7, #in~s1.base=20, #in~s1.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i=7, ~s1.base=20, ~s1.offset=0] [L25-L28] ensures true; VAL [#in~i=7, #in~s1.base=20, #in~s1.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i=7, ~s1.base=20, ~s1.offset=0] [L41] RET call #t~ret16 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret16=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=7, ~pa~0.base=20, ~pa~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [L41] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret16=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=7, ~pa~0.base=20, ~pa~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [L41-L43] assume 0 == #t~ret16; [L41] havoc #t~ret16; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=7, ~pa~0.base=20, ~pa~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [L48] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=7, ~pa~0.base=20, ~pa~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=23, #NULL!offset=18, old(#NULL!base)=23, old(#NULL!offset)=18, old(~#d1~0!base)=19, old(~#d1~0!offset)=25, old(~#d2~0!base)=21, old(~#d2~0!offset)=24, ~#d1~0!base=19, ~#d1~0!offset=25, ~#d2~0!base=21, ~#d2~0!offset=24] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L9] FCALL call ~#d1~0 := #Ultimate.alloc(8); [L9] FCALL call write~init~int(0, { base: ~#d1~0!base, offset: ~#d1~0!offset }, 4); [L9] FCALL call write~init~int(0, { base: ~#d1~0!base, offset: 4 + ~#d1~0!offset }, 4); [L9] FCALL call ~#d2~0 := #Ultimate.alloc(8); [L9] FCALL call write~init~int(0, { base: ~#d2~0!base, offset: ~#d2~0!offset }, 4); [L9] FCALL call write~init~int(0, { base: ~#d2~0!base, offset: 4 + ~#d2~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=23, old(#NULL!offset)=18, old(~#d1~0!base)=19, old(~#d1~0!offset)=25, old(~#d2~0!base)=21, old(~#d2~0!offset)=24, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L32] CALL call init(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] FCALL call write~int(#t~nondet0, { base: ~#d1~0!base, offset: ~#d1~0!offset }, 4); [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] FCALL call write~int(#t~nondet1, { base: ~#d1~0!base, offset: 4 + ~#d1~0!offset }, 4); [L14] havoc #t~nondet1; [L16] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L16] FCALL call write~int(#t~nondet2, { base: ~#d2~0!base, offset: ~#d2~0!offset }, 4); [L16] havoc #t~nondet2; [L17] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L17] FCALL call write~int(#t~nondet3, { base: ~#d2~0!base, offset: 4 + ~#d2~0!offset }, 4); [L17] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L32] RET call init(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] CALL call #t~ret7 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] COND TRUE 0 != #t~nondet4 % 256 [L22] #t~ite5 := ~#d1~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite5!base=20, #t~ite5!offset=0, #t~nondet4=1, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] #res := #t~ite5; [L22] havoc #t~nondet4; [L22] havoc #t~ite5; VAL [#NULL!base=0, #NULL!offset=0, #res!base=20, #res!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] RET call #t~ret7 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7!base=20, #t~ret7!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] ~pd1~0 := #t~ret7; [L33] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0] [L33] CALL call #t~ret8 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] COND TRUE 0 != #t~nondet4 % 256 [L22] #t~ite5 := ~#d1~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite5!base=20, #t~ite5!offset=0, #t~nondet4=1, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] #res := #t~ite5; [L22] havoc #t~nondet4; [L22] havoc #t~ite5; VAL [#NULL!base=0, #NULL!offset=0, #res!base=20, #res!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] RET call #t~ret8 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8!base=20, #t~ret8!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0] [L33] ~pd2~0 := #t~ret8; [L33] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0] [L33] CALL call #t~ret9 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] COND FALSE !(0 != #t~nondet4 % 256) [L22] #t~ite5 := ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite5!base=22, #t~ite5!offset=0, #t~nondet4=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] #res := #t~ite5; [L22] havoc #t~nondet4; [L22] havoc #t~ite5; VAL [#NULL!base=0, #NULL!offset=0, #res!base=22, #res!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] RET call #t~ret9 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9!base=22, #t~ret9!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0] [L33] ~pd3~0 := #t~ret9; [L33] havoc #t~ret9; [L34] assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; [L34] ~i~0 := #t~nondet10; [L34] havoc #t~nondet10; [L35] #t~short12 := ~pd1~0 != { base: 0, offset: 0 } && ~pd1~0 == ~pd2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short12=true, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L35] COND TRUE #t~short12 [L35] FCALL call #t~mem11 := read~int({ base: ~pd2~0!base, offset: ~pd2~0!offset }, 4); [L35] #t~short12 := #t~mem11 > 0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem11=6, #t~short12=true, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L35] COND TRUE #t~short12 [L35] havoc #t~short12; [L35] havoc #t~mem11; [L36] ~pa~0 := { base: ~pd1~0!base, offset: ~pd1~0!offset }; [L37] FCALL call #t~mem13 := read~int({ base: ~pd3~0!base, offset: ~pd3~0!offset }, 4); [L37] ~i~0 := #t~mem13 - 10; [L37] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L38] FCALL call #t~mem14 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem14=6, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L38-L40] COND TRUE !(~i~0 < #t~mem14) [L38] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L41] CALL call #t~ret16 := check(~pd2~0, ~i~0); VAL [#in~i=7, #in~s1!base=20, #in~s1!offset=0, #NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L25-L28] ~s1 := #in~s1; [L25-L28] ~i := #in~i; [L27] FCALL call #t~mem6 := read~int({ base: ~s1!base, offset: ~s1!offset }, 4); [L27] #res := (if #t~mem6 == ~i then 1 else 0); [L27] havoc #t~mem6; VAL [#in~i=7, #in~s1!base=20, #in~s1!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i=7, ~s1!base=20, ~s1!offset=0] [L41] RET call #t~ret16 := check(~pd2~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret16=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L41] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret16=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L41] COND TRUE 0 == #t~ret16 [L41] havoc #t~ret16; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L48] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=23, #NULL!offset=18, old(#NULL!base)=23, old(#NULL!offset)=18, old(~#d1~0!base)=19, old(~#d1~0!offset)=25, old(~#d2~0!base)=21, old(~#d2~0!offset)=24, ~#d1~0!base=19, ~#d1~0!offset=25, ~#d2~0!base=21, ~#d2~0!offset=24] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L9] FCALL call ~#d1~0 := #Ultimate.alloc(8); [L9] FCALL call write~init~int(0, { base: ~#d1~0!base, offset: ~#d1~0!offset }, 4); [L9] FCALL call write~init~int(0, { base: ~#d1~0!base, offset: 4 + ~#d1~0!offset }, 4); [L9] FCALL call ~#d2~0 := #Ultimate.alloc(8); [L9] FCALL call write~init~int(0, { base: ~#d2~0!base, offset: ~#d2~0!offset }, 4); [L9] FCALL call write~init~int(0, { base: ~#d2~0!base, offset: 4 + ~#d2~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=23, old(#NULL!offset)=18, old(~#d1~0!base)=19, old(~#d1~0!offset)=25, old(~#d2~0!base)=21, old(~#d2~0!offset)=24, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L32] CALL call init(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] FCALL call write~int(#t~nondet0, { base: ~#d1~0!base, offset: ~#d1~0!offset }, 4); [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] FCALL call write~int(#t~nondet1, { base: ~#d1~0!base, offset: 4 + ~#d1~0!offset }, 4); [L14] havoc #t~nondet1; [L16] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L16] FCALL call write~int(#t~nondet2, { base: ~#d2~0!base, offset: ~#d2~0!offset }, 4); [L16] havoc #t~nondet2; [L17] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L17] FCALL call write~int(#t~nondet3, { base: ~#d2~0!base, offset: 4 + ~#d2~0!offset }, 4); [L17] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L32] RET call init(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] CALL call #t~ret7 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] COND TRUE 0 != #t~nondet4 % 256 [L22] #t~ite5 := ~#d1~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite5!base=20, #t~ite5!offset=0, #t~nondet4=1, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] #res := #t~ite5; [L22] havoc #t~nondet4; [L22] havoc #t~ite5; VAL [#NULL!base=0, #NULL!offset=0, #res!base=20, #res!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] RET call #t~ret7 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7!base=20, #t~ret7!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] ~pd1~0 := #t~ret7; [L33] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0] [L33] CALL call #t~ret8 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] COND TRUE 0 != #t~nondet4 % 256 [L22] #t~ite5 := ~#d1~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite5!base=20, #t~ite5!offset=0, #t~nondet4=1, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] #res := #t~ite5; [L22] havoc #t~nondet4; [L22] havoc #t~ite5; VAL [#NULL!base=0, #NULL!offset=0, #res!base=20, #res!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] RET call #t~ret8 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8!base=20, #t~ret8!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0] [L33] ~pd2~0 := #t~ret8; [L33] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0] [L33] CALL call #t~ret9 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] COND FALSE !(0 != #t~nondet4 % 256) [L22] #t~ite5 := ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite5!base=22, #t~ite5!offset=0, #t~nondet4=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] #res := #t~ite5; [L22] havoc #t~nondet4; [L22] havoc #t~ite5; VAL [#NULL!base=0, #NULL!offset=0, #res!base=22, #res!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] RET call #t~ret9 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9!base=22, #t~ret9!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0] [L33] ~pd3~0 := #t~ret9; [L33] havoc #t~ret9; [L34] assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; [L34] ~i~0 := #t~nondet10; [L34] havoc #t~nondet10; [L35] #t~short12 := ~pd1~0 != { base: 0, offset: 0 } && ~pd1~0 == ~pd2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short12=true, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L35] COND TRUE #t~short12 [L35] FCALL call #t~mem11 := read~int({ base: ~pd2~0!base, offset: ~pd2~0!offset }, 4); [L35] #t~short12 := #t~mem11 > 0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem11=6, #t~short12=true, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L35] COND TRUE #t~short12 [L35] havoc #t~short12; [L35] havoc #t~mem11; [L36] ~pa~0 := { base: ~pd1~0!base, offset: ~pd1~0!offset }; [L37] FCALL call #t~mem13 := read~int({ base: ~pd3~0!base, offset: ~pd3~0!offset }, 4); [L37] ~i~0 := #t~mem13 - 10; [L37] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L38] FCALL call #t~mem14 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem14=6, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L38-L40] COND TRUE !(~i~0 < #t~mem14) [L38] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L41] CALL call #t~ret16 := check(~pd2~0, ~i~0); VAL [#in~i=7, #in~s1!base=20, #in~s1!offset=0, #NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L25-L28] ~s1 := #in~s1; [L25-L28] ~i := #in~i; [L27] FCALL call #t~mem6 := read~int({ base: ~s1!base, offset: ~s1!offset }, 4); [L27] #res := (if #t~mem6 == ~i then 1 else 0); [L27] havoc #t~mem6; VAL [#in~i=7, #in~s1!base=20, #in~s1!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i=7, ~s1!base=20, ~s1!offset=0] [L41] RET call #t~ret16 := check(~pd2~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret16=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L41] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret16=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L41] COND TRUE 0 == #t~ret16 [L41] havoc #t~ret16; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L48] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=23, #NULL!offset=18, old(#NULL!base)=23, old(#NULL!offset)=18, old(~#d1~0!base)=19, old(~#d1~0!offset)=25, old(~#d2~0!base)=21, old(~#d2~0!offset)=24, ~#d1~0!base=19, ~#d1~0!offset=25, ~#d2~0!base=21, ~#d2~0!offset=24] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L9] FCALL call ~#d1~0 := #Ultimate.alloc(8); [L9] FCALL call write~init~int(0, { base: ~#d1~0!base, offset: ~#d1~0!offset }, 4); [L9] FCALL call write~init~int(0, { base: ~#d1~0!base, offset: 4 + ~#d1~0!offset }, 4); [L9] FCALL call ~#d2~0 := #Ultimate.alloc(8); [L9] FCALL call write~init~int(0, { base: ~#d2~0!base, offset: ~#d2~0!offset }, 4); [L9] FCALL call write~init~int(0, { base: ~#d2~0!base, offset: 4 + ~#d2~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=23, old(#NULL!offset)=18, old(~#d1~0!base)=19, old(~#d1~0!offset)=25, old(~#d2~0!base)=21, old(~#d2~0!offset)=24, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L32] CALL call init(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] FCALL call write~int(#t~nondet0, { base: ~#d1~0!base, offset: ~#d1~0!offset }, 4); [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] FCALL call write~int(#t~nondet1, { base: ~#d1~0!base, offset: 4 + ~#d1~0!offset }, 4); [L14] havoc #t~nondet1; [L16] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L16] FCALL call write~int(#t~nondet2, { base: ~#d2~0!base, offset: ~#d2~0!offset }, 4); [L16] havoc #t~nondet2; [L17] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L17] FCALL call write~int(#t~nondet3, { base: ~#d2~0!base, offset: 4 + ~#d2~0!offset }, 4); [L17] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L32] RET call init(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] CALL call #t~ret7 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] COND TRUE 0 != #t~nondet4 % 256 [L22] #t~ite5 := ~#d1~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite5!base=20, #t~ite5!offset=0, #t~nondet4=1, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] #res := #t~ite5; [L22] havoc #t~nondet4; [L22] havoc #t~ite5; VAL [#NULL!base=0, #NULL!offset=0, #res!base=20, #res!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] RET call #t~ret7 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7!base=20, #t~ret7!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] ~pd1~0 := #t~ret7; [L33] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0] [L33] CALL call #t~ret8 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] COND TRUE 0 != #t~nondet4 % 256 [L22] #t~ite5 := ~#d1~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite5!base=20, #t~ite5!offset=0, #t~nondet4=1, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] #res := #t~ite5; [L22] havoc #t~nondet4; [L22] havoc #t~ite5; VAL [#NULL!base=0, #NULL!offset=0, #res!base=20, #res!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] RET call #t~ret8 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8!base=20, #t~ret8!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0] [L33] ~pd2~0 := #t~ret8; [L33] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0] [L33] CALL call #t~ret9 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] COND FALSE !(0 != #t~nondet4 % 256) [L22] #t~ite5 := ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite5!base=22, #t~ite5!offset=0, #t~nondet4=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] #res := #t~ite5; [L22] havoc #t~nondet4; [L22] havoc #t~ite5; VAL [#NULL!base=0, #NULL!offset=0, #res!base=22, #res!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] RET call #t~ret9 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9!base=22, #t~ret9!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0] [L33] ~pd3~0 := #t~ret9; [L33] havoc #t~ret9; [L34] assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; [L34] ~i~0 := #t~nondet10; [L34] havoc #t~nondet10; [L35] #t~short12 := ~pd1~0 != { base: 0, offset: 0 } && ~pd1~0 == ~pd2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short12=true, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L35] COND TRUE #t~short12 [L35] FCALL call #t~mem11 := read~int({ base: ~pd2~0!base, offset: ~pd2~0!offset }, 4); [L35] #t~short12 := #t~mem11 > 0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem11=6, #t~short12=true, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L35] COND TRUE #t~short12 [L35] havoc #t~short12; [L35] havoc #t~mem11; [L36] ~pa~0 := { base: ~pd1~0!base, offset: ~pd1~0!offset }; [L37] FCALL call #t~mem13 := read~int({ base: ~pd3~0!base, offset: ~pd3~0!offset }, 4); [L37] ~i~0 := #t~mem13 - 10; [L37] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L38] FCALL call #t~mem14 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem14=6, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L38-L40] COND TRUE !(~i~0 < #t~mem14) [L38] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L41] CALL call #t~ret16 := check(~pd2~0, ~i~0); VAL [#in~i=7, #in~s1!base=20, #in~s1!offset=0, #NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L25-L28] ~s1 := #in~s1; [L25-L28] ~i := #in~i; [L27] FCALL call #t~mem6 := read~int({ base: ~s1!base, offset: ~s1!offset }, 4); [L27] #res := (if #t~mem6 == ~i then 1 else 0); [L27] havoc #t~mem6; VAL [#in~i=7, #in~s1!base=20, #in~s1!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i=7, ~s1!base=20, ~s1!offset=0] [L41] RET call #t~ret16 := check(~pd2~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret16=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L41] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret16=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L41] COND TRUE 0 == #t~ret16 [L41] havoc #t~ret16; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L48] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=23, #NULL!offset=18, old(#NULL!base)=23, old(#NULL!offset)=18, old(~#d1~0!base)=19, old(~#d1~0!offset)=25, old(~#d2~0!base)=21, old(~#d2~0!offset)=24, ~#d1~0!base=19, ~#d1~0!offset=25, ~#d2~0!base=21, ~#d2~0!offset=24] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L9] FCALL call ~#d1~0 := #Ultimate.alloc(8); [L9] FCALL call write~init~int(0, { base: ~#d1~0!base, offset: ~#d1~0!offset }, 4); [L9] FCALL call write~init~int(0, { base: ~#d1~0!base, offset: 4 + ~#d1~0!offset }, 4); [L9] FCALL call ~#d2~0 := #Ultimate.alloc(8); [L9] FCALL call write~init~int(0, { base: ~#d2~0!base, offset: ~#d2~0!offset }, 4); [L9] FCALL call write~init~int(0, { base: ~#d2~0!base, offset: 4 + ~#d2~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=23, old(#NULL!offset)=18, old(~#d1~0!base)=19, old(~#d1~0!offset)=25, old(~#d2~0!base)=21, old(~#d2~0!offset)=24, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L32] CALL call init(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] FCALL call write~int(#t~nondet0, { base: ~#d1~0!base, offset: ~#d1~0!offset }, 4); [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] FCALL call write~int(#t~nondet1, { base: ~#d1~0!base, offset: 4 + ~#d1~0!offset }, 4); [L14] havoc #t~nondet1; [L16] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L16] FCALL call write~int(#t~nondet2, { base: ~#d2~0!base, offset: ~#d2~0!offset }, 4); [L16] havoc #t~nondet2; [L17] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L17] FCALL call write~int(#t~nondet3, { base: ~#d2~0!base, offset: 4 + ~#d2~0!offset }, 4); [L17] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L32] RET call init(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] CALL call #t~ret7 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] COND TRUE 0 != #t~nondet4 % 256 [L22] #t~ite5 := ~#d1~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite5!base=20, #t~ite5!offset=0, #t~nondet4=1, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] #res := #t~ite5; [L22] havoc #t~nondet4; [L22] havoc #t~ite5; VAL [#NULL!base=0, #NULL!offset=0, #res!base=20, #res!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] RET call #t~ret7 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7!base=20, #t~ret7!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] ~pd1~0 := #t~ret7; [L33] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0] [L33] CALL call #t~ret8 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] COND TRUE 0 != #t~nondet4 % 256 [L22] #t~ite5 := ~#d1~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite5!base=20, #t~ite5!offset=0, #t~nondet4=1, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] #res := #t~ite5; [L22] havoc #t~nondet4; [L22] havoc #t~ite5; VAL [#NULL!base=0, #NULL!offset=0, #res!base=20, #res!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] RET call #t~ret8 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8!base=20, #t~ret8!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0] [L33] ~pd2~0 := #t~ret8; [L33] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0] [L33] CALL call #t~ret9 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] COND FALSE !(0 != #t~nondet4 % 256) [L22] #t~ite5 := ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite5!base=22, #t~ite5!offset=0, #t~nondet4=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] #res := #t~ite5; [L22] havoc #t~nondet4; [L22] havoc #t~ite5; VAL [#NULL!base=0, #NULL!offset=0, #res!base=22, #res!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] RET call #t~ret9 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9!base=22, #t~ret9!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0] [L33] ~pd3~0 := #t~ret9; [L33] havoc #t~ret9; [L34] assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; [L34] ~i~0 := #t~nondet10; [L34] havoc #t~nondet10; [L35] #t~short12 := ~pd1~0 != { base: 0, offset: 0 } && ~pd1~0 == ~pd2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short12=true, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L35] COND TRUE #t~short12 [L35] FCALL call #t~mem11 := read~int({ base: ~pd2~0!base, offset: ~pd2~0!offset }, 4); [L35] #t~short12 := #t~mem11 > 0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem11=6, #t~short12=true, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L35] COND TRUE #t~short12 [L35] havoc #t~short12; [L35] havoc #t~mem11; [L36] ~pa~0 := { base: ~pd1~0!base, offset: ~pd1~0!offset }; [L37] FCALL call #t~mem13 := read~int({ base: ~pd3~0!base, offset: ~pd3~0!offset }, 4); [L37] ~i~0 := #t~mem13 - 10; [L37] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L38] FCALL call #t~mem14 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem14=6, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L38-L40] COND TRUE !(~i~0 < #t~mem14) [L38] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L41] CALL call #t~ret16 := check(~pd2~0, ~i~0); VAL [#in~i=7, #in~s1!base=20, #in~s1!offset=0, #NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L25-L28] ~s1 := #in~s1; [L25-L28] ~i := #in~i; [L27] FCALL call #t~mem6 := read~int({ base: ~s1!base, offset: ~s1!offset }, 4); [L27] #res := (if #t~mem6 == ~i then 1 else 0); [L27] havoc #t~mem6; VAL [#in~i=7, #in~s1!base=20, #in~s1!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i=7, ~s1!base=20, ~s1!offset=0] [L41] RET call #t~ret16 := check(~pd2~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret16=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L41] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret16=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L41] COND TRUE 0 == #t~ret16 [L41] havoc #t~ret16; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L48] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L9] struct dummy d1, d2; VAL [\old(d1)=25, \old(d1)=19, \old(d2)=21, \old(d2)=24, d1={20:0}, d2={22:0}] [L32] CALL init() VAL [d1={20:0}, d2={22:0}] [L13] d1.a = __VERIFIER_nondet_int() [L14] d1.b = __VERIFIER_nondet_int() [L16] d2.a = __VERIFIER_nondet_int() [L17] d2.b = __VERIFIER_nondet_int() [L32] RET init() VAL [d1={20:0}, d2={22:0}] [L33] CALL, EXPR get_dummy() VAL [d1={20:0}, d2={22:0}] [L22] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={20:0}, d1={20:0}, d2={22:0}] [L22] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L33] RET, EXPR get_dummy() VAL [d1={20:0}, d2={22:0}, get_dummy()={20:0}] [L33] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(), *pd3 = get_dummy(); [L33] CALL, EXPR get_dummy() VAL [d1={20:0}, d2={22:0}] [L22] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={20:0}, d1={20:0}, d2={22:0}] [L22] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L33] RET, EXPR get_dummy() VAL [d1={20:0}, d2={22:0}, get_dummy()={20:0}, pd1={20:0}] [L33] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(), *pd3 = get_dummy(); [L33] CALL, EXPR get_dummy() VAL [d1={20:0}, d2={22:0}] [L22] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=0, __VERIFIER_nondet_bool() ? &d1 : &d2={22:0}, d1={20:0}, d2={22:0}] [L22] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L33] RET, EXPR get_dummy() VAL [d1={20:0}, d2={22:0}, get_dummy()={22:0}, pd1={20:0}, pd2={20:0}] [L33] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(), *pd3 = get_dummy(); [L34] int i = __VERIFIER_nondet_int(); [L35] pd1 != 0 && pd1 == pd2 && (*pd2).a > 0 [L35] EXPR (*pd2).a [L35] pd1 != 0 && pd1 == pd2 && (*pd2).a > 0 VAL [(*pd2).a=6, d1={20:0}, d2={22:0}, i=0, pd1={20:0}, pd1 != 0 && pd1 == pd2 && (*pd2).a > 0=1, pd2={20:0}, pd3={22:0}] [L35] COND TRUE pd1 != 0 && pd1 == pd2 && (*pd2).a > 0 [L36] int *pa = &pd1->a; [L37] EXPR pd3->a [L37] i = pd3->a - 10 [L38] EXPR \read(*pa) VAL [\read(*pa)=6, d1={20:0}, d2={22:0}, i=7, pa={20:0}, pd1={20:0}, pd2={20:0}, pd3={22:0}] [L38] COND FALSE !(i < *pa) [L41] CALL, EXPR check(pd2, i) VAL [\old(i)=7, d1={20:0}, d2={22:0}, s1={20:0}] [L27] EXPR s1->a [L27] return s1->a == i; [L41] RET, EXPR check(pd2, i) VAL [check(pd2, i)=0, d1={20:0}, d2={22:0}, i=7, pa={20:0}, pd1={20:0}, pd2={20:0}, pd3={22:0}] [L41] COND TRUE !check(pd2, i) [L48] __VERIFIER_error() VAL [d1={20:0}, d2={22:0}, i=7, pa={20:0}, pd1={20:0}, pd2={20:0}, pd3={22:0}] ----- [2018-11-23 12:54:26,044 WARN L170 areAnnotationChecker]: initENTRY has no Hoare annotation [2018-11-23 12:54:26,045 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 12:54:26,045 WARN L170 areAnnotationChecker]: get_dummyENTRY has no Hoare annotation [2018-11-23 12:54:26,045 WARN L170 areAnnotationChecker]: get_dummyENTRY has no Hoare annotation [2018-11-23 12:54:26,045 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:54:26,045 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:54:26,046 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 12:54:26,046 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 12:54:26,046 WARN L170 areAnnotationChecker]: checkENTRY has no Hoare annotation [2018-11-23 12:54:26,046 WARN L170 areAnnotationChecker]: initFINAL has no Hoare annotation [2018-11-23 12:54:26,046 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:54:26,046 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2018-11-23 12:54:26,046 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:54:26,052 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:54:26,052 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-23 12:54:26,052 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-23 12:54:26,052 WARN L170 areAnnotationChecker]: checkFINAL has no Hoare annotation [2018-11-23 12:54:26,052 WARN L170 areAnnotationChecker]: initEXIT has no Hoare annotation [2018-11-23 12:54:26,052 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:54:26,053 WARN L170 areAnnotationChecker]: get_dummyFINAL has no Hoare annotation [2018-11-23 12:54:26,053 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:54:26,053 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2018-11-23 12:54:26,053 WARN L170 areAnnotationChecker]: checkEXIT has no Hoare annotation [2018-11-23 12:54:26,053 WARN L170 areAnnotationChecker]: get_dummyEXIT has no Hoare annotation [2018-11-23 12:54:26,053 WARN L170 areAnnotationChecker]: get_dummyEXIT has no Hoare annotation [2018-11-23 12:54:26,054 WARN L170 areAnnotationChecker]: get_dummyEXIT has no Hoare annotation [2018-11-23 12:54:26,054 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2018-11-23 12:54:26,054 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2018-11-23 12:54:26,054 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-23 12:54:26,054 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2018-11-23 12:54:26,054 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2018-11-23 12:54:26,054 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2018-11-23 12:54:26,055 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2018-11-23 12:54:26,055 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2018-11-23 12:54:26,055 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2018-11-23 12:54:26,055 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-23 12:54:26,055 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-23 12:54:26,055 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2018-11-23 12:54:26,055 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2018-11-23 12:54:26,056 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2018-11-23 12:54:26,056 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2018-11-23 12:54:26,056 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2018-11-23 12:54:26,056 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:54:26,056 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2018-11-23 12:54:26,056 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2018-11-23 12:54:26,056 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:54:26,057 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2018-11-23 12:54:26,057 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2018-11-23 12:54:26,057 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2018-11-23 12:54:26,057 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2018-11-23 12:54:26,057 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. [2018-11-23 12:54:26,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:54:26 BoogieIcfgContainer [2018-11-23 12:54:26,061 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:54:26,061 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:54:26,062 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:54:26,062 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:54:26,062 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:18" (3/4) ... [2018-11-23 12:54:26,065 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=23, |#NULL.offset|=18, |old(#NULL.base)|=23, |old(#NULL.offset)|=18, |old(~#d1~0.base)|=19, |old(~#d1~0.offset)|=25, |old(~#d2~0.base)|=21, |old(~#d2~0.offset)|=24, |~#d1~0.base|=19, |~#d1~0.offset|=25, |~#d2~0.base|=21, |~#d2~0.offset|=24] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8);call write~init~int(0, ~#d1~0.base, ~#d1~0.offset, 4);call write~init~int(0, ~#d1~0.base, 4 + ~#d1~0.offset, 4);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8);call write~init~int(0, ~#d2~0.base, ~#d2~0.offset, 4);call write~init~int(0, ~#d2~0.base, 4 + ~#d2~0.offset, 4); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=23, |old(#NULL.offset)|=18, |old(~#d1~0.base)|=19, |old(~#d1~0.offset)|=25, |old(~#d2~0.base)|=21, |old(~#d2~0.offset)|=24, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=23, |old(#NULL.offset)|=18, |old(~#d1~0.base)|=19, |old(~#d1~0.offset)|=25, |old(~#d2~0.base)|=21, |old(~#d2~0.offset)|=24, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] RET #61#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] CALL call #t~ret17 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] CALL call init(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4);havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#d1~0.base, 4 + ~#d1~0.offset, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#d2~0.base, 4 + ~#d2~0.offset, 4);havoc #t~nondet3; VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] RET #65#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] CALL call #t~ret7.base, #t~ret7.offset := get_dummy(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] assume 0 != #t~nondet4 % 256;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; VAL [|#NULL.base|=0, |#NULL.offset|=0, |get_dummy_#t~ite5.base|=20, |get_dummy_#t~ite5.offset|=0, |get_dummy_#t~nondet4|=1, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; VAL [|#NULL.base|=0, |#NULL.offset|=0, |get_dummy_#res.base|=20, |get_dummy_#res.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |get_dummy_#res.base|=20, |get_dummy_#res.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] RET #67#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7.base|=20, |main_#t~ret7.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; VAL [main_~pd1~0.base=20, main_~pd1~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] CALL call #t~ret8.base, #t~ret8.offset := get_dummy(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] assume 0 != #t~nondet4 % 256;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; VAL [|#NULL.base|=0, |#NULL.offset|=0, |get_dummy_#t~ite5.base|=20, |get_dummy_#t~ite5.offset|=0, |get_dummy_#t~nondet4|=1, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; VAL [|#NULL.base|=0, |#NULL.offset|=0, |get_dummy_#res.base|=20, |get_dummy_#res.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |get_dummy_#res.base|=20, |get_dummy_#res.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] RET #69#return; VAL [main_~pd1~0.base=20, main_~pd1~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret8.base|=20, |main_#t~ret8.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset; VAL [main_~pd1~0.base=20, main_~pd1~0.offset=0, main_~pd2~0.base=20, main_~pd2~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] CALL call #t~ret9.base, #t~ret9.offset := get_dummy(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] assume !(0 != #t~nondet4 % 256);#t~ite5.base, #t~ite5.offset := ~#d2~0.base, ~#d2~0.offset; VAL [|#NULL.base|=0, |#NULL.offset|=0, |get_dummy_#t~ite5.base|=22, |get_dummy_#t~ite5.offset|=0, |get_dummy_#t~nondet4|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; VAL [|#NULL.base|=0, |#NULL.offset|=0, |get_dummy_#res.base|=22, |get_dummy_#res.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |get_dummy_#res.base|=22, |get_dummy_#res.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] RET #71#return; VAL [main_~pd1~0.base=20, main_~pd1~0.offset=0, main_~pd2~0.base=20, main_~pd2~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret9.base|=22, |main_#t~ret9.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] ~pd3~0.base, ~pd3~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~i~0 := #t~nondet10;havoc #t~nondet10;#t~short12 := (~pd1~0.base != 0 || ~pd1~0.offset != 0) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset; VAL [main_~i~0=0, main_~pd1~0.base=20, main_~pd1~0.offset=0, main_~pd2~0.base=20, main_~pd2~0.offset=0, main_~pd3~0.base=22, main_~pd3~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short12|=true, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] assume #t~short12;call #t~mem11 := read~int(~pd2~0.base, ~pd2~0.offset, 4);#t~short12 := #t~mem11 > 0; VAL [main_~i~0=0, main_~pd1~0.base=20, main_~pd1~0.offset=0, main_~pd2~0.base=20, main_~pd2~0.offset=0, main_~pd3~0.base=22, main_~pd3~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem11|=6, |main_#t~short12|=true, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] assume #t~short12;havoc #t~short12;havoc #t~mem11;~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~pd1~0.offset;call #t~mem13 := read~int(~pd3~0.base, ~pd3~0.offset, 4);~i~0 := #t~mem13 - 10;havoc #t~mem13; VAL [main_~i~0=7, main_~pa~0.base=20, main_~pa~0.offset=0, main_~pd1~0.base=20, main_~pd1~0.offset=0, main_~pd2~0.base=20, main_~pd2~0.offset=0, main_~pd3~0.base=22, main_~pd3~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] call #t~mem14 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=7, main_~pa~0.base=20, main_~pa~0.offset=0, main_~pd1~0.base=20, main_~pd1~0.offset=0, main_~pd2~0.base=20, main_~pd2~0.offset=0, main_~pd3~0.base=22, main_~pd3~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem14|=6, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] assume !(~i~0 < #t~mem14);havoc #t~mem14; VAL [main_~i~0=7, main_~pa~0.base=20, main_~pa~0.offset=0, main_~pd1~0.base=20, main_~pd1~0.offset=0, main_~pd2~0.base=20, main_~pd2~0.offset=0, main_~pd3~0.base=22, main_~pd3~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] CALL call #t~ret16 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |check_#in~i|=7, |check_#in~s1.base|=20, |check_#in~s1.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~i := #in~i;call #t~mem6 := read~int(~s1.base, ~s1.offset, 4);#res := (if #t~mem6 == ~i then 1 else 0);havoc #t~mem6; VAL [check_~i=7, check_~s1.base=20, check_~s1.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |check_#in~i|=7, |check_#in~s1.base|=20, |check_#in~s1.offset|=0, |check_#res|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] assume true; VAL [check_~i=7, check_~s1.base=20, check_~s1.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |check_#in~i|=7, |check_#in~s1.base|=20, |check_#in~s1.offset|=0, |check_#res|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] RET #73#return; VAL [main_~i~0=7, main_~pa~0.base=20, main_~pa~0.offset=0, main_~pd1~0.base=20, main_~pd1~0.offset=0, main_~pd2~0.base=20, main_~pd2~0.offset=0, main_~pd3~0.base=22, main_~pd3~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret16|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; VAL [main_~i~0=7, main_~pa~0.base=20, main_~pa~0.offset=0, main_~pd1~0.base=20, main_~pd1~0.offset=0, main_~pd2~0.base=20, main_~pd2~0.offset=0, main_~pd3~0.base=22, main_~pd3~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret16|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] assume 0 == #t~ret16;havoc #t~ret16; VAL [main_~i~0=7, main_~pa~0.base=20, main_~pa~0.offset=0, main_~pd1~0.base=20, main_~pd1~0.offset=0, main_~pd2~0.base=20, main_~pd2~0.offset=0, main_~pd3~0.base=22, main_~pd3~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] assume !false; VAL [main_~i~0=7, main_~pa~0.base=20, main_~pa~0.offset=0, main_~pd1~0.base=20, main_~pd1~0.offset=0, main_~pd2~0.base=20, main_~pd2~0.offset=0, main_~pd3~0.base=22, main_~pd3~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |~#d1~0.base|=20, |~#d1~0.offset|=0, |~#d2~0.base|=22, |~#d2~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=23, #NULL.offset=18, old(#NULL.base)=23, old(#NULL.offset)=18, old(~#d1~0.base)=19, old(~#d1~0.offset)=25, old(~#d2~0.base)=21, old(~#d2~0.offset)=24, ~#d1~0.base=19, ~#d1~0.offset=25, ~#d2~0.base=21, ~#d2~0.offset=24] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L9] call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8); [L9] call write~init~int(0, ~#d1~0.base, ~#d1~0.offset, 4); [L9] call write~init~int(0, ~#d1~0.base, 4 + ~#d1~0.offset, 4); [L9] call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8); [L9] call write~init~int(0, ~#d2~0.base, ~#d2~0.offset, 4); [L9] call write~init~int(0, ~#d2~0.base, 4 + ~#d2~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=23, old(#NULL.offset)=18, old(~#d1~0.base)=19, old(~#d1~0.offset)=25, old(~#d2~0.base)=21, old(~#d2~0.offset)=24, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=23, old(#NULL.offset)=18, old(~#d1~0.base)=19, old(~#d1~0.offset)=25, old(~#d2~0.base)=21, old(~#d2~0.offset)=24, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L32] CALL call init(); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] call write~int(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4); [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] call write~int(#t~nondet1, ~#d1~0.base, 4 + ~#d1~0.offset, 4); [L14] havoc #t~nondet1; [L16] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L16] call write~int(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4); [L16] havoc #t~nondet2; [L17] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L17] call write~int(#t~nondet3, ~#d2~0.base, 4 + ~#d2~0.offset, 4); [L17] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L11-L18] ensures true; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L32] RET call init(); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L33] CALL call #t~ret7.base, #t~ret7.offset := get_dummy(); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L22] assume 0 != #t~nondet4 % 256; [L22] #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~ite5.base=20, #t~ite5.offset=0, #t~nondet4=1, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L22] #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; [L22] havoc #t~nondet4; [L22] havoc #t~ite5.base, #t~ite5.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=20, #res.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L20-L23] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=20, #res.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L33] RET call #t~ret7.base, #t~ret7.offset := get_dummy(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7.base=20, #t~ret7.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L33] ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset; [L33] havoc #t~ret7.base, #t~ret7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0] [L33] CALL call #t~ret8.base, #t~ret8.offset := get_dummy(); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L22] assume 0 != #t~nondet4 % 256; [L22] #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~ite5.base=20, #t~ite5.offset=0, #t~nondet4=1, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L22] #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; [L22] havoc #t~nondet4; [L22] havoc #t~ite5.base, #t~ite5.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=20, #res.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L20-L23] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=20, #res.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L33] RET call #t~ret8.base, #t~ret8.offset := get_dummy(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8.base=20, #t~ret8.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0] [L33] ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset; [L33] havoc #t~ret8.base, #t~ret8.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0] [L33] CALL call #t~ret9.base, #t~ret9.offset := get_dummy(); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L22] assume !(0 != #t~nondet4 % 256); [L22] #t~ite5.base, #t~ite5.offset := ~#d2~0.base, ~#d2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~ite5.base=22, #t~ite5.offset=0, #t~nondet4=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L22] #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; [L22] havoc #t~nondet4; [L22] havoc #t~ite5.base, #t~ite5.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=22, #res.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L20-L23] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=22, #res.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L33] RET call #t~ret9.base, #t~ret9.offset := get_dummy(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret9.base=22, #t~ret9.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0] [L33] ~pd3~0.base, ~pd3~0.offset := #t~ret9.base, #t~ret9.offset; [L33] havoc #t~ret9.base, #t~ret9.offset; [L34] assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; [L34] ~i~0 := #t~nondet10; [L34] havoc #t~nondet10; [L35] #t~short12 := (~pd1~0.base != 0 || ~pd1~0.offset != 0) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~short12=true, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [L35] assume #t~short12; [L35] call #t~mem11 := read~int(~pd2~0.base, ~pd2~0.offset, 4); [L35] #t~short12 := #t~mem11 > 0; VAL [#NULL.base=0, #NULL.offset=0, #t~mem11=6, #t~short12=true, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [L35-L44] assume #t~short12; [L35] havoc #t~short12; [L35] havoc #t~mem11; [L36] ~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~pd1~0.offset; [L37] call #t~mem13 := read~int(~pd3~0.base, ~pd3~0.offset, 4); [L37] ~i~0 := #t~mem13 - 10; [L37] havoc #t~mem13; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=7, ~pa~0.base=20, ~pa~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [L38] call #t~mem14 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem14=6, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=7, ~pa~0.base=20, ~pa~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [L38-L40] assume !(~i~0 < #t~mem14); [L38] havoc #t~mem14; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=7, ~pa~0.base=20, ~pa~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [L41] CALL call #t~ret16 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); VAL [#in~i=7, #in~s1.base=20, #in~s1.offset=0, #NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L25-L28] ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset; [L25-L28] ~i := #in~i; [L27] call #t~mem6 := read~int(~s1.base, ~s1.offset, 4); [L27] #res := (if #t~mem6 == ~i then 1 else 0); [L27] havoc #t~mem6; VAL [#in~i=7, #in~s1.base=20, #in~s1.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i=7, ~s1.base=20, ~s1.offset=0] [L25-L28] ensures true; VAL [#in~i=7, #in~s1.base=20, #in~s1.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i=7, ~s1.base=20, ~s1.offset=0] [L41] RET call #t~ret16 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret16=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=7, ~pa~0.base=20, ~pa~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [L41] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret16=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=7, ~pa~0.base=20, ~pa~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [L41-L43] assume 0 == #t~ret16; [L41] havoc #t~ret16; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=7, ~pa~0.base=20, ~pa~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [L48] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=7, ~pa~0.base=20, ~pa~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=23, #NULL.offset=18, old(#NULL.base)=23, old(#NULL.offset)=18, old(~#d1~0.base)=19, old(~#d1~0.offset)=25, old(~#d2~0.base)=21, old(~#d2~0.offset)=24, ~#d1~0.base=19, ~#d1~0.offset=25, ~#d2~0.base=21, ~#d2~0.offset=24] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L9] call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8); [L9] call write~init~int(0, ~#d1~0.base, ~#d1~0.offset, 4); [L9] call write~init~int(0, ~#d1~0.base, 4 + ~#d1~0.offset, 4); [L9] call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8); [L9] call write~init~int(0, ~#d2~0.base, ~#d2~0.offset, 4); [L9] call write~init~int(0, ~#d2~0.base, 4 + ~#d2~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=23, old(#NULL.offset)=18, old(~#d1~0.base)=19, old(~#d1~0.offset)=25, old(~#d2~0.base)=21, old(~#d2~0.offset)=24, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=23, old(#NULL.offset)=18, old(~#d1~0.base)=19, old(~#d1~0.offset)=25, old(~#d2~0.base)=21, old(~#d2~0.offset)=24, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L32] CALL call init(); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] call write~int(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4); [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] call write~int(#t~nondet1, ~#d1~0.base, 4 + ~#d1~0.offset, 4); [L14] havoc #t~nondet1; [L16] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L16] call write~int(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4); [L16] havoc #t~nondet2; [L17] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L17] call write~int(#t~nondet3, ~#d2~0.base, 4 + ~#d2~0.offset, 4); [L17] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L11-L18] ensures true; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L32] RET call init(); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L33] CALL call #t~ret7.base, #t~ret7.offset := get_dummy(); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L22] assume 0 != #t~nondet4 % 256; [L22] #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~ite5.base=20, #t~ite5.offset=0, #t~nondet4=1, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L22] #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; [L22] havoc #t~nondet4; [L22] havoc #t~ite5.base, #t~ite5.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=20, #res.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L20-L23] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=20, #res.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L33] RET call #t~ret7.base, #t~ret7.offset := get_dummy(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7.base=20, #t~ret7.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L33] ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset; [L33] havoc #t~ret7.base, #t~ret7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0] [L33] CALL call #t~ret8.base, #t~ret8.offset := get_dummy(); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L22] assume 0 != #t~nondet4 % 256; [L22] #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~ite5.base=20, #t~ite5.offset=0, #t~nondet4=1, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L22] #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; [L22] havoc #t~nondet4; [L22] havoc #t~ite5.base, #t~ite5.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=20, #res.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L20-L23] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=20, #res.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L33] RET call #t~ret8.base, #t~ret8.offset := get_dummy(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8.base=20, #t~ret8.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0] [L33] ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset; [L33] havoc #t~ret8.base, #t~ret8.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0] [L33] CALL call #t~ret9.base, #t~ret9.offset := get_dummy(); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L22] assume !(0 != #t~nondet4 % 256); [L22] #t~ite5.base, #t~ite5.offset := ~#d2~0.base, ~#d2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~ite5.base=22, #t~ite5.offset=0, #t~nondet4=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L22] #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; [L22] havoc #t~nondet4; [L22] havoc #t~ite5.base, #t~ite5.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=22, #res.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L20-L23] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=22, #res.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L33] RET call #t~ret9.base, #t~ret9.offset := get_dummy(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret9.base=22, #t~ret9.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0] [L33] ~pd3~0.base, ~pd3~0.offset := #t~ret9.base, #t~ret9.offset; [L33] havoc #t~ret9.base, #t~ret9.offset; [L34] assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; [L34] ~i~0 := #t~nondet10; [L34] havoc #t~nondet10; [L35] #t~short12 := (~pd1~0.base != 0 || ~pd1~0.offset != 0) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~short12=true, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [L35] assume #t~short12; [L35] call #t~mem11 := read~int(~pd2~0.base, ~pd2~0.offset, 4); [L35] #t~short12 := #t~mem11 > 0; VAL [#NULL.base=0, #NULL.offset=0, #t~mem11=6, #t~short12=true, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [L35-L44] assume #t~short12; [L35] havoc #t~short12; [L35] havoc #t~mem11; [L36] ~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~pd1~0.offset; [L37] call #t~mem13 := read~int(~pd3~0.base, ~pd3~0.offset, 4); [L37] ~i~0 := #t~mem13 - 10; [L37] havoc #t~mem13; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=7, ~pa~0.base=20, ~pa~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [L38] call #t~mem14 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem14=6, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=7, ~pa~0.base=20, ~pa~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [L38-L40] assume !(~i~0 < #t~mem14); [L38] havoc #t~mem14; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=7, ~pa~0.base=20, ~pa~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [L41] CALL call #t~ret16 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); VAL [#in~i=7, #in~s1.base=20, #in~s1.offset=0, #NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0] [L25-L28] ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset; [L25-L28] ~i := #in~i; [L27] call #t~mem6 := read~int(~s1.base, ~s1.offset, 4); [L27] #res := (if #t~mem6 == ~i then 1 else 0); [L27] havoc #t~mem6; VAL [#in~i=7, #in~s1.base=20, #in~s1.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i=7, ~s1.base=20, ~s1.offset=0] [L25-L28] ensures true; VAL [#in~i=7, #in~s1.base=20, #in~s1.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i=7, ~s1.base=20, ~s1.offset=0] [L41] RET call #t~ret16 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret16=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=7, ~pa~0.base=20, ~pa~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [L41] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret16=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=7, ~pa~0.base=20, ~pa~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [L41-L43] assume 0 == #t~ret16; [L41] havoc #t~ret16; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=7, ~pa~0.base=20, ~pa~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [L48] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=20, ~#d1~0.offset=0, ~#d2~0.base=22, ~#d2~0.offset=0, ~i~0=7, ~pa~0.base=20, ~pa~0.offset=0, ~pd1~0.base=20, ~pd1~0.offset=0, ~pd2~0.base=20, ~pd2~0.offset=0, ~pd3~0.base=22, ~pd3~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=23, #NULL!offset=18, old(#NULL!base)=23, old(#NULL!offset)=18, old(~#d1~0!base)=19, old(~#d1~0!offset)=25, old(~#d2~0!base)=21, old(~#d2~0!offset)=24, ~#d1~0!base=19, ~#d1~0!offset=25, ~#d2~0!base=21, ~#d2~0!offset=24] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L9] FCALL call ~#d1~0 := #Ultimate.alloc(8); [L9] FCALL call write~init~int(0, { base: ~#d1~0!base, offset: ~#d1~0!offset }, 4); [L9] FCALL call write~init~int(0, { base: ~#d1~0!base, offset: 4 + ~#d1~0!offset }, 4); [L9] FCALL call ~#d2~0 := #Ultimate.alloc(8); [L9] FCALL call write~init~int(0, { base: ~#d2~0!base, offset: ~#d2~0!offset }, 4); [L9] FCALL call write~init~int(0, { base: ~#d2~0!base, offset: 4 + ~#d2~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=23, old(#NULL!offset)=18, old(~#d1~0!base)=19, old(~#d1~0!offset)=25, old(~#d2~0!base)=21, old(~#d2~0!offset)=24, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L32] CALL call init(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] FCALL call write~int(#t~nondet0, { base: ~#d1~0!base, offset: ~#d1~0!offset }, 4); [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] FCALL call write~int(#t~nondet1, { base: ~#d1~0!base, offset: 4 + ~#d1~0!offset }, 4); [L14] havoc #t~nondet1; [L16] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L16] FCALL call write~int(#t~nondet2, { base: ~#d2~0!base, offset: ~#d2~0!offset }, 4); [L16] havoc #t~nondet2; [L17] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L17] FCALL call write~int(#t~nondet3, { base: ~#d2~0!base, offset: 4 + ~#d2~0!offset }, 4); [L17] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L32] RET call init(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] CALL call #t~ret7 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] COND TRUE 0 != #t~nondet4 % 256 [L22] #t~ite5 := ~#d1~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite5!base=20, #t~ite5!offset=0, #t~nondet4=1, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] #res := #t~ite5; [L22] havoc #t~nondet4; [L22] havoc #t~ite5; VAL [#NULL!base=0, #NULL!offset=0, #res!base=20, #res!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] RET call #t~ret7 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7!base=20, #t~ret7!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] ~pd1~0 := #t~ret7; [L33] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0] [L33] CALL call #t~ret8 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] COND TRUE 0 != #t~nondet4 % 256 [L22] #t~ite5 := ~#d1~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite5!base=20, #t~ite5!offset=0, #t~nondet4=1, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] #res := #t~ite5; [L22] havoc #t~nondet4; [L22] havoc #t~ite5; VAL [#NULL!base=0, #NULL!offset=0, #res!base=20, #res!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] RET call #t~ret8 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8!base=20, #t~ret8!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0] [L33] ~pd2~0 := #t~ret8; [L33] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0] [L33] CALL call #t~ret9 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] COND FALSE !(0 != #t~nondet4 % 256) [L22] #t~ite5 := ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite5!base=22, #t~ite5!offset=0, #t~nondet4=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] #res := #t~ite5; [L22] havoc #t~nondet4; [L22] havoc #t~ite5; VAL [#NULL!base=0, #NULL!offset=0, #res!base=22, #res!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] RET call #t~ret9 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9!base=22, #t~ret9!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0] [L33] ~pd3~0 := #t~ret9; [L33] havoc #t~ret9; [L34] assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; [L34] ~i~0 := #t~nondet10; [L34] havoc #t~nondet10; [L35] #t~short12 := ~pd1~0 != { base: 0, offset: 0 } && ~pd1~0 == ~pd2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short12=true, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L35] COND TRUE #t~short12 [L35] FCALL call #t~mem11 := read~int({ base: ~pd2~0!base, offset: ~pd2~0!offset }, 4); [L35] #t~short12 := #t~mem11 > 0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem11=6, #t~short12=true, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L35] COND TRUE #t~short12 [L35] havoc #t~short12; [L35] havoc #t~mem11; [L36] ~pa~0 := { base: ~pd1~0!base, offset: ~pd1~0!offset }; [L37] FCALL call #t~mem13 := read~int({ base: ~pd3~0!base, offset: ~pd3~0!offset }, 4); [L37] ~i~0 := #t~mem13 - 10; [L37] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L38] FCALL call #t~mem14 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem14=6, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L38-L40] COND TRUE !(~i~0 < #t~mem14) [L38] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L41] CALL call #t~ret16 := check(~pd2~0, ~i~0); VAL [#in~i=7, #in~s1!base=20, #in~s1!offset=0, #NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L25-L28] ~s1 := #in~s1; [L25-L28] ~i := #in~i; [L27] FCALL call #t~mem6 := read~int({ base: ~s1!base, offset: ~s1!offset }, 4); [L27] #res := (if #t~mem6 == ~i then 1 else 0); [L27] havoc #t~mem6; VAL [#in~i=7, #in~s1!base=20, #in~s1!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i=7, ~s1!base=20, ~s1!offset=0] [L41] RET call #t~ret16 := check(~pd2~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret16=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L41] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret16=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L41] COND TRUE 0 == #t~ret16 [L41] havoc #t~ret16; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L48] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=23, #NULL!offset=18, old(#NULL!base)=23, old(#NULL!offset)=18, old(~#d1~0!base)=19, old(~#d1~0!offset)=25, old(~#d2~0!base)=21, old(~#d2~0!offset)=24, ~#d1~0!base=19, ~#d1~0!offset=25, ~#d2~0!base=21, ~#d2~0!offset=24] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L9] FCALL call ~#d1~0 := #Ultimate.alloc(8); [L9] FCALL call write~init~int(0, { base: ~#d1~0!base, offset: ~#d1~0!offset }, 4); [L9] FCALL call write~init~int(0, { base: ~#d1~0!base, offset: 4 + ~#d1~0!offset }, 4); [L9] FCALL call ~#d2~0 := #Ultimate.alloc(8); [L9] FCALL call write~init~int(0, { base: ~#d2~0!base, offset: ~#d2~0!offset }, 4); [L9] FCALL call write~init~int(0, { base: ~#d2~0!base, offset: 4 + ~#d2~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=23, old(#NULL!offset)=18, old(~#d1~0!base)=19, old(~#d1~0!offset)=25, old(~#d2~0!base)=21, old(~#d2~0!offset)=24, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L32] CALL call init(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] FCALL call write~int(#t~nondet0, { base: ~#d1~0!base, offset: ~#d1~0!offset }, 4); [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] FCALL call write~int(#t~nondet1, { base: ~#d1~0!base, offset: 4 + ~#d1~0!offset }, 4); [L14] havoc #t~nondet1; [L16] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L16] FCALL call write~int(#t~nondet2, { base: ~#d2~0!base, offset: ~#d2~0!offset }, 4); [L16] havoc #t~nondet2; [L17] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L17] FCALL call write~int(#t~nondet3, { base: ~#d2~0!base, offset: 4 + ~#d2~0!offset }, 4); [L17] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L32] RET call init(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] CALL call #t~ret7 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] COND TRUE 0 != #t~nondet4 % 256 [L22] #t~ite5 := ~#d1~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite5!base=20, #t~ite5!offset=0, #t~nondet4=1, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] #res := #t~ite5; [L22] havoc #t~nondet4; [L22] havoc #t~ite5; VAL [#NULL!base=0, #NULL!offset=0, #res!base=20, #res!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] RET call #t~ret7 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7!base=20, #t~ret7!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] ~pd1~0 := #t~ret7; [L33] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0] [L33] CALL call #t~ret8 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] COND TRUE 0 != #t~nondet4 % 256 [L22] #t~ite5 := ~#d1~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite5!base=20, #t~ite5!offset=0, #t~nondet4=1, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] #res := #t~ite5; [L22] havoc #t~nondet4; [L22] havoc #t~ite5; VAL [#NULL!base=0, #NULL!offset=0, #res!base=20, #res!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] RET call #t~ret8 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8!base=20, #t~ret8!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0] [L33] ~pd2~0 := #t~ret8; [L33] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0] [L33] CALL call #t~ret9 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] COND FALSE !(0 != #t~nondet4 % 256) [L22] #t~ite5 := ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite5!base=22, #t~ite5!offset=0, #t~nondet4=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] #res := #t~ite5; [L22] havoc #t~nondet4; [L22] havoc #t~ite5; VAL [#NULL!base=0, #NULL!offset=0, #res!base=22, #res!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] RET call #t~ret9 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9!base=22, #t~ret9!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0] [L33] ~pd3~0 := #t~ret9; [L33] havoc #t~ret9; [L34] assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; [L34] ~i~0 := #t~nondet10; [L34] havoc #t~nondet10; [L35] #t~short12 := ~pd1~0 != { base: 0, offset: 0 } && ~pd1~0 == ~pd2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short12=true, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L35] COND TRUE #t~short12 [L35] FCALL call #t~mem11 := read~int({ base: ~pd2~0!base, offset: ~pd2~0!offset }, 4); [L35] #t~short12 := #t~mem11 > 0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem11=6, #t~short12=true, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L35] COND TRUE #t~short12 [L35] havoc #t~short12; [L35] havoc #t~mem11; [L36] ~pa~0 := { base: ~pd1~0!base, offset: ~pd1~0!offset }; [L37] FCALL call #t~mem13 := read~int({ base: ~pd3~0!base, offset: ~pd3~0!offset }, 4); [L37] ~i~0 := #t~mem13 - 10; [L37] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L38] FCALL call #t~mem14 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem14=6, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L38-L40] COND TRUE !(~i~0 < #t~mem14) [L38] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L41] CALL call #t~ret16 := check(~pd2~0, ~i~0); VAL [#in~i=7, #in~s1!base=20, #in~s1!offset=0, #NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L25-L28] ~s1 := #in~s1; [L25-L28] ~i := #in~i; [L27] FCALL call #t~mem6 := read~int({ base: ~s1!base, offset: ~s1!offset }, 4); [L27] #res := (if #t~mem6 == ~i then 1 else 0); [L27] havoc #t~mem6; VAL [#in~i=7, #in~s1!base=20, #in~s1!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i=7, ~s1!base=20, ~s1!offset=0] [L41] RET call #t~ret16 := check(~pd2~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret16=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L41] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret16=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L41] COND TRUE 0 == #t~ret16 [L41] havoc #t~ret16; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L48] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=23, #NULL!offset=18, old(#NULL!base)=23, old(#NULL!offset)=18, old(~#d1~0!base)=19, old(~#d1~0!offset)=25, old(~#d2~0!base)=21, old(~#d2~0!offset)=24, ~#d1~0!base=19, ~#d1~0!offset=25, ~#d2~0!base=21, ~#d2~0!offset=24] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L9] FCALL call ~#d1~0 := #Ultimate.alloc(8); [L9] FCALL call write~init~int(0, { base: ~#d1~0!base, offset: ~#d1~0!offset }, 4); [L9] FCALL call write~init~int(0, { base: ~#d1~0!base, offset: 4 + ~#d1~0!offset }, 4); [L9] FCALL call ~#d2~0 := #Ultimate.alloc(8); [L9] FCALL call write~init~int(0, { base: ~#d2~0!base, offset: ~#d2~0!offset }, 4); [L9] FCALL call write~init~int(0, { base: ~#d2~0!base, offset: 4 + ~#d2~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=23, old(#NULL!offset)=18, old(~#d1~0!base)=19, old(~#d1~0!offset)=25, old(~#d2~0!base)=21, old(~#d2~0!offset)=24, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L32] CALL call init(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] FCALL call write~int(#t~nondet0, { base: ~#d1~0!base, offset: ~#d1~0!offset }, 4); [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] FCALL call write~int(#t~nondet1, { base: ~#d1~0!base, offset: 4 + ~#d1~0!offset }, 4); [L14] havoc #t~nondet1; [L16] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L16] FCALL call write~int(#t~nondet2, { base: ~#d2~0!base, offset: ~#d2~0!offset }, 4); [L16] havoc #t~nondet2; [L17] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L17] FCALL call write~int(#t~nondet3, { base: ~#d2~0!base, offset: 4 + ~#d2~0!offset }, 4); [L17] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L32] RET call init(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] CALL call #t~ret7 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] COND TRUE 0 != #t~nondet4 % 256 [L22] #t~ite5 := ~#d1~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite5!base=20, #t~ite5!offset=0, #t~nondet4=1, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] #res := #t~ite5; [L22] havoc #t~nondet4; [L22] havoc #t~ite5; VAL [#NULL!base=0, #NULL!offset=0, #res!base=20, #res!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] RET call #t~ret7 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7!base=20, #t~ret7!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] ~pd1~0 := #t~ret7; [L33] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0] [L33] CALL call #t~ret8 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] COND TRUE 0 != #t~nondet4 % 256 [L22] #t~ite5 := ~#d1~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite5!base=20, #t~ite5!offset=0, #t~nondet4=1, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] #res := #t~ite5; [L22] havoc #t~nondet4; [L22] havoc #t~ite5; VAL [#NULL!base=0, #NULL!offset=0, #res!base=20, #res!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] RET call #t~ret8 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8!base=20, #t~ret8!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0] [L33] ~pd2~0 := #t~ret8; [L33] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0] [L33] CALL call #t~ret9 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] COND FALSE !(0 != #t~nondet4 % 256) [L22] #t~ite5 := ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite5!base=22, #t~ite5!offset=0, #t~nondet4=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] #res := #t~ite5; [L22] havoc #t~nondet4; [L22] havoc #t~ite5; VAL [#NULL!base=0, #NULL!offset=0, #res!base=22, #res!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] RET call #t~ret9 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9!base=22, #t~ret9!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0] [L33] ~pd3~0 := #t~ret9; [L33] havoc #t~ret9; [L34] assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; [L34] ~i~0 := #t~nondet10; [L34] havoc #t~nondet10; [L35] #t~short12 := ~pd1~0 != { base: 0, offset: 0 } && ~pd1~0 == ~pd2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short12=true, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L35] COND TRUE #t~short12 [L35] FCALL call #t~mem11 := read~int({ base: ~pd2~0!base, offset: ~pd2~0!offset }, 4); [L35] #t~short12 := #t~mem11 > 0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem11=6, #t~short12=true, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L35] COND TRUE #t~short12 [L35] havoc #t~short12; [L35] havoc #t~mem11; [L36] ~pa~0 := { base: ~pd1~0!base, offset: ~pd1~0!offset }; [L37] FCALL call #t~mem13 := read~int({ base: ~pd3~0!base, offset: ~pd3~0!offset }, 4); [L37] ~i~0 := #t~mem13 - 10; [L37] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L38] FCALL call #t~mem14 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem14=6, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L38-L40] COND TRUE !(~i~0 < #t~mem14) [L38] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L41] CALL call #t~ret16 := check(~pd2~0, ~i~0); VAL [#in~i=7, #in~s1!base=20, #in~s1!offset=0, #NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L25-L28] ~s1 := #in~s1; [L25-L28] ~i := #in~i; [L27] FCALL call #t~mem6 := read~int({ base: ~s1!base, offset: ~s1!offset }, 4); [L27] #res := (if #t~mem6 == ~i then 1 else 0); [L27] havoc #t~mem6; VAL [#in~i=7, #in~s1!base=20, #in~s1!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i=7, ~s1!base=20, ~s1!offset=0] [L41] RET call #t~ret16 := check(~pd2~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret16=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L41] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret16=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L41] COND TRUE 0 == #t~ret16 [L41] havoc #t~ret16; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L48] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=23, #NULL!offset=18, old(#NULL!base)=23, old(#NULL!offset)=18, old(~#d1~0!base)=19, old(~#d1~0!offset)=25, old(~#d2~0!base)=21, old(~#d2~0!offset)=24, ~#d1~0!base=19, ~#d1~0!offset=25, ~#d2~0!base=21, ~#d2~0!offset=24] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L9] FCALL call ~#d1~0 := #Ultimate.alloc(8); [L9] FCALL call write~init~int(0, { base: ~#d1~0!base, offset: ~#d1~0!offset }, 4); [L9] FCALL call write~init~int(0, { base: ~#d1~0!base, offset: 4 + ~#d1~0!offset }, 4); [L9] FCALL call ~#d2~0 := #Ultimate.alloc(8); [L9] FCALL call write~init~int(0, { base: ~#d2~0!base, offset: ~#d2~0!offset }, 4); [L9] FCALL call write~init~int(0, { base: ~#d2~0!base, offset: 4 + ~#d2~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=23, old(#NULL!offset)=18, old(~#d1~0!base)=19, old(~#d1~0!offset)=25, old(~#d2~0!base)=21, old(~#d2~0!offset)=24, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L32] CALL call init(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] FCALL call write~int(#t~nondet0, { base: ~#d1~0!base, offset: ~#d1~0!offset }, 4); [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] FCALL call write~int(#t~nondet1, { base: ~#d1~0!base, offset: 4 + ~#d1~0!offset }, 4); [L14] havoc #t~nondet1; [L16] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L16] FCALL call write~int(#t~nondet2, { base: ~#d2~0!base, offset: ~#d2~0!offset }, 4); [L16] havoc #t~nondet2; [L17] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L17] FCALL call write~int(#t~nondet3, { base: ~#d2~0!base, offset: 4 + ~#d2~0!offset }, 4); [L17] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L32] RET call init(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] CALL call #t~ret7 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] COND TRUE 0 != #t~nondet4 % 256 [L22] #t~ite5 := ~#d1~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite5!base=20, #t~ite5!offset=0, #t~nondet4=1, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] #res := #t~ite5; [L22] havoc #t~nondet4; [L22] havoc #t~ite5; VAL [#NULL!base=0, #NULL!offset=0, #res!base=20, #res!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] RET call #t~ret7 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7!base=20, #t~ret7!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] ~pd1~0 := #t~ret7; [L33] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0] [L33] CALL call #t~ret8 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] COND TRUE 0 != #t~nondet4 % 256 [L22] #t~ite5 := ~#d1~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite5!base=20, #t~ite5!offset=0, #t~nondet4=1, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] #res := #t~ite5; [L22] havoc #t~nondet4; [L22] havoc #t~ite5; VAL [#NULL!base=0, #NULL!offset=0, #res!base=20, #res!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] RET call #t~ret8 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8!base=20, #t~ret8!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0] [L33] ~pd2~0 := #t~ret8; [L33] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0] [L33] CALL call #t~ret9 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] COND FALSE !(0 != #t~nondet4 % 256) [L22] #t~ite5 := ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite5!base=22, #t~ite5!offset=0, #t~nondet4=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L22] #res := #t~ite5; [L22] havoc #t~nondet4; [L22] havoc #t~ite5; VAL [#NULL!base=0, #NULL!offset=0, #res!base=22, #res!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L33] RET call #t~ret9 := get_dummy(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9!base=22, #t~ret9!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0] [L33] ~pd3~0 := #t~ret9; [L33] havoc #t~ret9; [L34] assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; [L34] ~i~0 := #t~nondet10; [L34] havoc #t~nondet10; [L35] #t~short12 := ~pd1~0 != { base: 0, offset: 0 } && ~pd1~0 == ~pd2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short12=true, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L35] COND TRUE #t~short12 [L35] FCALL call #t~mem11 := read~int({ base: ~pd2~0!base, offset: ~pd2~0!offset }, 4); [L35] #t~short12 := #t~mem11 > 0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem11=6, #t~short12=true, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L35] COND TRUE #t~short12 [L35] havoc #t~short12; [L35] havoc #t~mem11; [L36] ~pa~0 := { base: ~pd1~0!base, offset: ~pd1~0!offset }; [L37] FCALL call #t~mem13 := read~int({ base: ~pd3~0!base, offset: ~pd3~0!offset }, 4); [L37] ~i~0 := #t~mem13 - 10; [L37] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L38] FCALL call #t~mem14 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem14=6, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L38-L40] COND TRUE !(~i~0 < #t~mem14) [L38] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L41] CALL call #t~ret16 := check(~pd2~0, ~i~0); VAL [#in~i=7, #in~s1!base=20, #in~s1!offset=0, #NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0] [L25-L28] ~s1 := #in~s1; [L25-L28] ~i := #in~i; [L27] FCALL call #t~mem6 := read~int({ base: ~s1!base, offset: ~s1!offset }, 4); [L27] #res := (if #t~mem6 == ~i then 1 else 0); [L27] havoc #t~mem6; VAL [#in~i=7, #in~s1!base=20, #in~s1!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i=7, ~s1!base=20, ~s1!offset=0] [L41] RET call #t~ret16 := check(~pd2~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret16=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L41] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret16=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L41] COND TRUE 0 == #t~ret16 [L41] havoc #t~ret16; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L48] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=20, ~#d1~0!offset=0, ~#d2~0!base=22, ~#d2~0!offset=0, ~i~0=7, ~pa~0!base=20, ~pa~0!offset=0, ~pd1~0!base=20, ~pd1~0!offset=0, ~pd2~0!base=20, ~pd2~0!offset=0, ~pd3~0!base=22, ~pd3~0!offset=0] [L9] struct dummy d1, d2; VAL [\old(d1)=19, \old(d1)=25, \old(d2)=24, \old(d2)=21, d1={20:0}, d2={22:0}] [L32] CALL init() VAL [d1={20:0}, d2={22:0}] [L13] d1.a = __VERIFIER_nondet_int() [L14] d1.b = __VERIFIER_nondet_int() [L16] d2.a = __VERIFIER_nondet_int() [L17] d2.b = __VERIFIER_nondet_int() [L32] RET init() VAL [d1={20:0}, d2={22:0}] [L33] CALL, EXPR get_dummy() VAL [d1={20:0}, d2={22:0}] [L22] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={20:0}, d1={20:0}, d2={22:0}] [L22] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L33] RET, EXPR get_dummy() VAL [d1={20:0}, d2={22:0}, get_dummy()={20:0}] [L33] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(), *pd3 = get_dummy(); [L33] CALL, EXPR get_dummy() VAL [d1={20:0}, d2={22:0}] [L22] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={20:0}, d1={20:0}, d2={22:0}] [L22] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L33] RET, EXPR get_dummy() VAL [d1={20:0}, d2={22:0}, get_dummy()={20:0}, pd1={20:0}] [L33] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(), *pd3 = get_dummy(); [L33] CALL, EXPR get_dummy() VAL [d1={20:0}, d2={22:0}] [L22] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=0, __VERIFIER_nondet_bool() ? &d1 : &d2={22:0}, d1={20:0}, d2={22:0}] [L22] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L33] RET, EXPR get_dummy() VAL [d1={20:0}, d2={22:0}, get_dummy()={22:0}, pd1={20:0}, pd2={20:0}] [L33] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(), *pd3 = get_dummy(); [L34] int i = __VERIFIER_nondet_int(); [L35] pd1 != 0 && pd1 == pd2 && (*pd2).a > 0 [L35] EXPR (*pd2).a [L35] pd1 != 0 && pd1 == pd2 && (*pd2).a > 0 VAL [(*pd2).a=6, d1={20:0}, d2={22:0}, i=0, pd1={20:0}, pd1 != 0 && pd1 == pd2 && (*pd2).a > 0=1, pd2={20:0}, pd3={22:0}] [L35] COND TRUE pd1 != 0 && pd1 == pd2 && (*pd2).a > 0 [L36] int *pa = &pd1->a; [L37] EXPR pd3->a [L37] i = pd3->a - 10 [L38] EXPR \read(*pa) VAL [\read(*pa)=6, d1={20:0}, d2={22:0}, i=7, pa={20:0}, pd1={20:0}, pd2={20:0}, pd3={22:0}] [L38] COND FALSE !(i < *pa) [L41] CALL, EXPR check(pd2, i) VAL [\old(i)=7, d1={20:0}, d2={22:0}, s1={20:0}] [L27] EXPR s1->a [L27] return s1->a == i; [L41] RET, EXPR check(pd2, i) VAL [check(pd2, i)=0, d1={20:0}, d2={22:0}, i=7, pa={20:0}, pd1={20:0}, pd2={20:0}, pd3={22:0}] [L41] COND TRUE !check(pd2, i) [L48] __VERIFIER_error() VAL [d1={20:0}, d2={22:0}, i=7, pa={20:0}, pd1={20:0}, pd2={20:0}, pd3={22:0}] ----- [2018-11-23 12:54:26,160 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/test22_false-unreach-call.c-witness.graphml [2018-11-23 12:54:26,160 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:54:26,161 INFO L168 Benchmark]: Toolchain (without parser) took 8754.22 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 666.4 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -111.3 MB). Peak memory consumption was 555.1 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:26,163 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:54:26,163 INFO L168 Benchmark]: CACSL2BoogieTranslator took 344.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:26,164 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.35 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:54:26,164 INFO L168 Benchmark]: Boogie Preprocessor took 34.92 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:54:26,164 INFO L168 Benchmark]: RCFGBuilder took 899.82 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 666.4 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -683.3 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:26,165 INFO L168 Benchmark]: TraceAbstraction took 7342.79 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.5 GB in the end (delta: 547.6 MB). Peak memory consumption was 547.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:26,166 INFO L168 Benchmark]: Witness Printer took 98.61 ms. Allocated memory is still 2.2 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:26,170 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 344.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 28.35 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.92 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 899.82 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 666.4 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -683.3 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7342.79 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.5 GB in the end (delta: 547.6 MB). Peak memory consumption was 547.6 MB. Max. memory is 7.1 GB. * Witness Printer took 98.61 ms. Allocated memory is still 2.2 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 48]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L9] struct dummy d1, d2; VAL [\old(d1)=25, \old(d1)=19, \old(d2)=21, \old(d2)=24, d1={20:0}, d2={22:0}] [L32] CALL init() VAL [d1={20:0}, d2={22:0}] [L13] d1.a = __VERIFIER_nondet_int() [L14] d1.b = __VERIFIER_nondet_int() [L16] d2.a = __VERIFIER_nondet_int() [L17] d2.b = __VERIFIER_nondet_int() [L32] RET init() VAL [d1={20:0}, d2={22:0}] [L33] CALL, EXPR get_dummy() VAL [d1={20:0}, d2={22:0}] [L22] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={20:0}, d1={20:0}, d2={22:0}] [L22] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L33] RET, EXPR get_dummy() VAL [d1={20:0}, d2={22:0}, get_dummy()={20:0}] [L33] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(), *pd3 = get_dummy(); [L33] CALL, EXPR get_dummy() VAL [d1={20:0}, d2={22:0}] [L22] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={20:0}, d1={20:0}, d2={22:0}] [L22] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L33] RET, EXPR get_dummy() VAL [d1={20:0}, d2={22:0}, get_dummy()={20:0}, pd1={20:0}] [L33] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(), *pd3 = get_dummy(); [L33] CALL, EXPR get_dummy() VAL [d1={20:0}, d2={22:0}] [L22] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=0, __VERIFIER_nondet_bool() ? &d1 : &d2={22:0}, d1={20:0}, d2={22:0}] [L22] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L33] RET, EXPR get_dummy() VAL [d1={20:0}, d2={22:0}, get_dummy()={22:0}, pd1={20:0}, pd2={20:0}] [L33] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(), *pd3 = get_dummy(); [L34] int i = __VERIFIER_nondet_int(); [L35] pd1 != 0 && pd1 == pd2 && (*pd2).a > 0 [L35] EXPR (*pd2).a [L35] pd1 != 0 && pd1 == pd2 && (*pd2).a > 0 VAL [(*pd2).a=6, d1={20:0}, d2={22:0}, i=0, pd1={20:0}, pd1 != 0 && pd1 == pd2 && (*pd2).a > 0=1, pd2={20:0}, pd3={22:0}] [L35] COND TRUE pd1 != 0 && pd1 == pd2 && (*pd2).a > 0 [L36] int *pa = &pd1->a; [L37] EXPR pd3->a [L37] i = pd3->a - 10 [L38] EXPR \read(*pa) VAL [\read(*pa)=6, d1={20:0}, d2={22:0}, i=7, pa={20:0}, pd1={20:0}, pd2={20:0}, pd3={22:0}] [L38] COND FALSE !(i < *pa) [L41] CALL, EXPR check(pd2, i) VAL [\old(i)=7, d1={20:0}, d2={22:0}, s1={20:0}] [L27] EXPR s1->a [L27] return s1->a == i; [L41] RET, EXPR check(pd2, i) VAL [check(pd2, i)=0, d1={20:0}, d2={22:0}, i=7, pa={20:0}, pd1={20:0}, pd2={20:0}, pd3={22:0}] [L41] COND TRUE !check(pd2, i) [L48] __VERIFIER_error() VAL [d1={20:0}, d2={22:0}, i=7, pa={20:0}, pd1={20:0}, pd2={20:0}, pd3={22:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 36 locations, 1 error locations. UNSAFE Result, 7.2s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 71 SDtfs, 68 SDslu, 334 SDs, 0 SdLazy, 337 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 2 MinimizatonAttempts, 18 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 13876 SizeOfPredicates, 12 NumberOfNonLiveVariables, 180 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 30/36 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...