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/test06_false-unreach-call_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:54:14,797 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:54:14,799 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:54:14,811 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:54:14,811 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:54:14,813 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:54:14,814 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:54:14,816 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:54:14,818 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:54:14,819 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:54:14,820 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:54:14,820 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:54:14,821 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:54:14,822 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:54:14,824 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:54:14,825 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:54:14,825 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:54:14,828 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:54:14,830 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:54:14,832 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:54:14,833 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:54:14,835 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:54:14,838 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:54:14,838 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:54:14,838 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:54:14,840 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:54:14,841 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:54:14,842 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:54:14,843 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:54:14,847 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:54:14,848 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:54:14,851 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:54:14,851 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:54:14,851 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:54:14,853 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:54:14,857 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:54:14,857 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:14,889 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:54:14,891 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:54:14,892 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:54:14,892 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:54:14,893 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:54:14,893 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:54:14,893 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:54:14,894 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:54:14,894 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:54:14,894 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:54:14,894 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:54:14,894 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:54:14,895 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:54:14,895 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:54:14,895 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:54:14,895 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:54:14,895 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:54:14,897 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:54:14,897 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:54:14,897 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:54:14,898 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:54:14,898 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:54:14,898 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:54:14,898 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:54:14,898 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:54:14,899 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:54:14,899 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:54:14,899 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:54:14,899 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:54:14,900 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:54:14,900 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:54:14,959 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:54:14,972 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:54:14,977 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:54:14,978 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:54:14,978 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:54:14,979 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test06_false-unreach-call_true-termination.c [2018-11-23 12:54:15,046 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21c448cd7/92c337d7ea0243bdadafe965484e8265/FLAG7e8deb974 [2018-11-23 12:54:15,554 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:54:15,555 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test06_false-unreach-call_true-termination.c [2018-11-23 12:54:15,563 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21c448cd7/92c337d7ea0243bdadafe965484e8265/FLAG7e8deb974 [2018-11-23 12:54:15,890 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21c448cd7/92c337d7ea0243bdadafe965484e8265 [2018-11-23 12:54:15,900 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:54:15,902 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:54:15,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:54:15,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:54:15,908 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:54:15,910 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:54:15" (1/1) ... [2018-11-23 12:54:15,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f539da3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:15, skipping insertion in model container [2018-11-23 12:54:15,914 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:54:15" (1/1) ... [2018-11-23 12:54:15,923 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:54:15,945 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:54:16,154 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:54:16,172 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:54:16,193 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:54:16,211 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:54:16,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:16 WrapperNode [2018-11-23 12:54:16,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:54:16,213 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:54:16,213 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:54:16,213 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:54:16,223 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:16" (1/1) ... [2018-11-23 12:54:16,233 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:16" (1/1) ... [2018-11-23 12:54:16,241 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:54:16,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:54:16,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:54:16,242 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:54:16,250 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:16" (1/1) ... [2018-11-23 12:54:16,250 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:16" (1/1) ... [2018-11-23 12:54:16,253 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:16" (1/1) ... [2018-11-23 12:54:16,253 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:16" (1/1) ... [2018-11-23 12:54:16,269 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:16" (1/1) ... [2018-11-23 12:54:16,272 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:16" (1/1) ... [2018-11-23 12:54:16,273 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:16" (1/1) ... [2018-11-23 12:54:16,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:54:16,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:54:16,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:54:16,282 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:54:16,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:16" (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:16,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:54:16,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:54:16,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:54:16,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:54:16,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:54:16,414 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-23 12:54:16,414 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-23 12:54:16,414 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-11-23 12:54:16,414 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-11-23 12:54:16,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:54:16,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:54:16,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:54:16,415 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:54:16,415 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:54:16,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:54:16,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:54:17,090 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:54:17,091 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 12:54:17,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:17 BoogieIcfgContainer [2018-11-23 12:54:17,091 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:54:17,092 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:54:17,093 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:54:17,096 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:54:17,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:54:15" (1/3) ... [2018-11-23 12:54:17,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e342e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:54:17, skipping insertion in model container [2018-11-23 12:54:17,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:16" (2/3) ... [2018-11-23 12:54:17,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e342e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:54:17, skipping insertion in model container [2018-11-23 12:54:17,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:17" (3/3) ... [2018-11-23 12:54:17,100 INFO L112 eAbstractionObserver]: Analyzing ICFG test06_false-unreach-call_true-termination.c [2018-11-23 12:54:17,111 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:54:17,119 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:54:17,138 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:54:17,172 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:54:17,173 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:54:17,173 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:54:17,173 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:54:17,174 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:54:17,174 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:54:17,174 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:54:17,174 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:54:17,174 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:54:17,194 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-23 12:54:17,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 12:54:17,202 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:17,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:17,205 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:17,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:17,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1199829752, now seen corresponding path program 1 times [2018-11-23 12:54:17,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:17,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:17,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:17,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:17,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:17,758 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-23 12:54:17,763 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27#true} is VALID [2018-11-23 12:54:17,764 INFO L273 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-23 12:54:17,765 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #29#return; {27#true} is VALID [2018-11-23 12:54:17,765 INFO L256 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret8 := main(); {27#true} is VALID [2018-11-23 12:54:17,785 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4);call ~#p1~0.base, ~#p1~0.offset := #Ultimate.alloc(4);call ~#p2~0.base, ~#p2~0.offset := #Ultimate.alloc(4);call write~$Pointer$(~#a~0.base, ~#a~0.offset, ~#p1~0.base, ~#p1~0.offset, 4);call write~$Pointer$(~#b~0.base, ~#b~0.offset, ~#p2~0.base, ~#p2~0.offset, 4);call write~int(1, ~#b~0.base, ~#b~0.offset, 4);call write~int(5, ~#a~0.base, ~#a~0.offset, 4);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4);#t~post3 := #t~mem2;call write~int(#t~post3 - 1, ~#a~0.base, ~#a~0.offset, 4);havoc #t~mem2;havoc #t~post3;call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset, 4); {29#(= 4 |main_#t~mem4|)} is VALID [2018-11-23 12:54:17,786 INFO L256 TraceCheckUtils]: 6: Hoare triple {29#(= 4 |main_#t~mem4|)} call #t~ret5 := f(#t~mem4, ~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset); {27#true} is VALID [2018-11-23 12:54:17,803 INFO L273 TraceCheckUtils]: 7: Hoare triple {27#true} ~a := #in~a;~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; {30#(= f_~a |f_#in~a|)} is VALID [2018-11-23 12:54:17,813 INFO L273 TraceCheckUtils]: 8: Hoare triple {30#(= f_~a |f_#in~a|)} assume !(4 == ~a);#res := 0; {31#(not (= 4 |f_#in~a|))} is VALID [2018-11-23 12:54:17,824 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#(not (= 4 |f_#in~a|))} assume true; {31#(not (= 4 |f_#in~a|))} is VALID [2018-11-23 12:54:17,828 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {31#(not (= 4 |f_#in~a|))} {29#(= 4 |main_#t~mem4|)} #33#return; {28#false} is VALID [2018-11-23 12:54:17,828 INFO L273 TraceCheckUtils]: 11: Hoare triple {28#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;call write~int(#t~ret5, ~#a~0.base, ~#a~0.offset, 4);havoc #t~mem4;havoc #t~ret5;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#p1~0.base, ~#p1~0.offset, 4);call #t~mem7 := read~int(#t~mem6.base, #t~mem6.offset, 4); {28#false} is VALID [2018-11-23 12:54:17,829 INFO L273 TraceCheckUtils]: 12: Hoare triple {28#false} assume 0 == #t~mem7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem7; {28#false} is VALID [2018-11-23 12:54:17,829 INFO L273 TraceCheckUtils]: 13: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-23 12:54:17,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:17,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:54:17,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:54:17,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 12:54:17,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:17,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:54:18,003 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:18,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:54:18,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:54:18,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:54:18,017 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2018-11-23 12:54:18,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:18,698 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-23 12:54:18,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:54:18,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 12:54:18,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:18,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:54:18,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2018-11-23 12:54:18,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:54:18,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2018-11-23 12:54:18,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2018-11-23 12:54:18,829 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:18,840 INFO L225 Difference]: With dead ends: 34 [2018-11-23 12:54:18,840 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 12:54:18,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:54:18,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 12:54:18,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 12:54:18,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:18,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 12:54:18,891 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 12:54:18,891 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 12:54:18,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:18,895 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2018-11-23 12:54:18,895 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2018-11-23 12:54:18,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:18,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:18,896 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 12:54:18,896 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 12:54:18,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:18,900 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2018-11-23 12:54:18,900 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2018-11-23 12:54:18,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:18,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:18,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:18,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:18,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:54:18,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 19 transitions. [2018-11-23 12:54:18,906 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 19 transitions. Word has length 14 [2018-11-23 12:54:18,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:18,907 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 19 transitions. [2018-11-23 12:54:18,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:54:18,907 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2018-11-23 12:54:18,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:54:18,908 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:18,908 INFO L402 BasicCegarLoop]: trace histogram [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,908 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:18,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:18,909 INFO L82 PathProgramCache]: Analyzing trace with hash -2114164890, now seen corresponding path program 1 times [2018-11-23 12:54:18,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:18,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:18,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:18,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:18,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:54:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:54:19,184 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=12, |#NULL.offset|=5, |old(#NULL.base)|=12, |old(#NULL.offset)|=5] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=5] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=5] [?] RET #29#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret8 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4);call ~#p1~0.base, ~#p1~0.offset := #Ultimate.alloc(4);call ~#p2~0.base, ~#p2~0.offset := #Ultimate.alloc(4);call write~$Pointer$(~#a~0.base, ~#a~0.offset, ~#p1~0.base, ~#p1~0.offset, 4);call write~$Pointer$(~#b~0.base, ~#b~0.offset, ~#p2~0.base, ~#p2~0.offset, 4);call write~int(1, ~#b~0.base, ~#b~0.offset, 4);call write~int(5, ~#a~0.base, ~#a~0.offset, 4);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4);#t~post3 := #t~mem2;call write~int(#t~post3 - 1, ~#a~0.base, ~#a~0.offset, 4);havoc #t~mem2;havoc #t~post3;call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset, 4); VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem4|=4, |main_~#a~0.base|=20, |main_~#a~0.offset|=0, |main_~#b~0.base|=8, |main_~#b~0.offset|=0, |main_~#p1~0.base|=19, |main_~#p1~0.offset|=0, |main_~#p2~0.base|=18, |main_~#p2~0.offset|=0] [?] CALL call #t~ret5 := f(#t~mem4, ~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |f_#in~a|=4, |f_#in~p1.base|=19, |f_#in~p1.offset|=0, |f_#in~p2.base|=18, |f_#in~p2.offset|=0] [?] ~a := #in~a;~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; VAL [f_~a=4, f_~p1.base=19, f_~p1.offset=0, f_~p2.base=18, f_~p2.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |f_#in~a|=4, |f_#in~p1.base|=19, |f_#in~p1.offset|=0, |f_#in~p2.base|=18, |f_#in~p2.offset|=0] [?] assume 4 == ~a; VAL [f_~a=4, f_~p1.base=19, f_~p1.offset=0, f_~p2.base=18, f_~p2.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |f_#in~a|=4, |f_#in~p1.base|=19, |f_#in~p1.offset|=0, |f_#in~p2.base|=18, |f_#in~p2.offset|=0] [?] CALL call g(~p1.base, ~p1.offset, ~p2.base, ~p2.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |g_#in~p1.base|=19, |g_#in~p1.offset|=0, |g_#in~p2.base|=18, |g_#in~p2.offset|=0] [?] ~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);~pq~0.base, ~pq~0.offset := #t~mem0.base, #t~mem0.offset;havoc #t~mem0.base, #t~mem0.offset;call #t~mem1.base, #t~mem1.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);call write~$Pointer$(#t~mem1.base, #t~mem1.offset, ~p1.base, ~p1.offset, 4);havoc #t~mem1.base, #t~mem1.offset;call write~int(0, ~pq~0.base, ~pq~0.offset, 4); VAL [g_~p1.base=19, g_~p1.offset=0, g_~p2.base=18, g_~p2.offset=0, g_~pq~0.base=8, g_~pq~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |g_#in~p1.base|=19, |g_#in~p1.offset|=0, |g_#in~p2.base|=18, |g_#in~p2.offset|=0] [?] assume true; VAL [g_~p1.base=19, g_~p1.offset=0, g_~p2.base=18, g_~p2.offset=0, g_~pq~0.base=8, g_~pq~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |g_#in~p1.base|=19, |g_#in~p1.offset|=0, |g_#in~p2.base|=18, |g_#in~p2.offset|=0] [?] RET #27#return; VAL [f_~a=4, f_~p1.base=19, f_~p1.offset=0, f_~p2.base=18, f_~p2.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |f_#in~a|=4, |f_#in~p1.base|=19, |f_#in~p1.offset|=0, |f_#in~p2.base|=18, |f_#in~p2.offset|=0] [?] #res := 1; VAL [f_~a=4, f_~p1.base=19, f_~p1.offset=0, f_~p2.base=18, f_~p2.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |f_#in~a|=4, |f_#in~p1.base|=19, |f_#in~p1.offset|=0, |f_#in~p2.base|=18, |f_#in~p2.offset|=0, |f_#res|=1] [?] assume true; VAL [f_~a=4, f_~p1.base=19, f_~p1.offset=0, f_~p2.base=18, f_~p2.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |f_#in~a|=4, |f_#in~p1.base|=19, |f_#in~p1.offset|=0, |f_#in~p2.base|=18, |f_#in~p2.offset|=0, |f_#res|=1] [?] RET #33#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem4|=4, |main_#t~ret5|=1, |main_~#a~0.base|=20, |main_~#a~0.offset|=0, |main_~#b~0.base|=8, |main_~#b~0.offset|=0, |main_~#p1~0.base|=19, |main_~#p1~0.offset|=0, |main_~#p2~0.base|=18, |main_~#p2~0.offset|=0] [?] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;call write~int(#t~ret5, ~#a~0.base, ~#a~0.offset, 4);havoc #t~mem4;havoc #t~ret5;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#p1~0.base, ~#p1~0.offset, 4);call #t~mem7 := read~int(#t~mem6.base, #t~mem6.offset, 4); VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem6.base|=8, |main_#t~mem6.offset|=0, |main_#t~mem7|=0, |main_~#a~0.base|=20, |main_~#a~0.offset|=0, |main_~#b~0.base|=8, |main_~#b~0.offset|=0, |main_~#p1~0.base|=19, |main_~#p1~0.offset|=0, |main_~#p2~0.base|=18, |main_~#p2~0.offset|=0] [?] assume 0 == #t~mem7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem7; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=20, |main_~#a~0.offset|=0, |main_~#b~0.base|=8, |main_~#b~0.offset|=0, |main_~#p1~0.base|=19, |main_~#p1~0.offset|=0, |main_~#p2~0.base|=18, |main_~#p2~0.offset|=0] [?] assume !false; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=20, |main_~#a~0.offset|=0, |main_~#b~0.base|=8, |main_~#b~0.offset|=0, |main_~#p1~0.base|=19, |main_~#p1~0.offset|=0, |main_~#p2~0.base|=18, |main_~#p2~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=5, old(#NULL.base)=12, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L21] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4); [L21] call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4); [L22] call ~#p1~0.base, ~#p1~0.offset := #Ultimate.alloc(4); [L22] call ~#p2~0.base, ~#p2~0.offset := #Ultimate.alloc(4); [L24] call write~$Pointer$(~#a~0.base, ~#a~0.offset, ~#p1~0.base, ~#p1~0.offset, 4); [L25] call write~$Pointer$(~#b~0.base, ~#b~0.offset, ~#p2~0.base, ~#p2~0.offset, 4); [L27] call write~int(1, ~#b~0.base, ~#b~0.offset, 4); [L28] call write~int(5, ~#a~0.base, ~#a~0.offset, 4); [L30] call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4); [L30] #t~post3 := #t~mem2; [L30] call write~int(#t~post3 - 1, ~#a~0.base, ~#a~0.offset, 4); [L30] havoc #t~mem2; [L30] havoc #t~post3; [L32] call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem4=4, ~#a~0.base=20, ~#a~0.offset=0, ~#b~0.base=8, ~#b~0.offset=0, ~#p1~0.base=19, ~#p1~0.offset=0, ~#p2~0.base=18, ~#p2~0.offset=0] [L32] CALL call #t~ret5 := f(#t~mem4, ~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset); VAL [#in~a=4, #in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0] [L11-L18] ~a := #in~a; [L11-L18] ~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset; [L11-L18] ~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; VAL [#in~a=4, #in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0, ~a=4, ~p1.base=19, ~p1.offset=0, ~p2.base=18, ~p2.offset=0] [L12-L17] assume 4 == ~a; VAL [#in~a=4, #in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0, ~a=4, ~p1.base=19, ~p1.offset=0, ~p2.base=18, ~p2.offset=0] [L13] CALL call g(~p1.base, ~p1.offset, ~p2.base, ~p2.offset); VAL [#in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0] [L4-L9] ~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset; [L4-L9] ~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; [L5] call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~p2.base, ~p2.offset, 4); [L5] ~pq~0.base, ~pq~0.offset := #t~mem0.base, #t~mem0.offset; [L5] havoc #t~mem0.base, #t~mem0.offset; [L7] call #t~mem1.base, #t~mem1.offset := read~$Pointer$(~p2.base, ~p2.offset, 4); [L7] call write~$Pointer$(#t~mem1.base, #t~mem1.offset, ~p1.base, ~p1.offset, 4); [L7] havoc #t~mem1.base, #t~mem1.offset; [L8] call write~int(0, ~pq~0.base, ~pq~0.offset, 4); VAL [#in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0, ~p1.base=19, ~p1.offset=0, ~p2.base=18, ~p2.offset=0, ~pq~0.base=8, ~pq~0.offset=0] [L4-L9] ensures true; VAL [#in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0, ~p1.base=19, ~p1.offset=0, ~p2.base=18, ~p2.offset=0, ~pq~0.base=8, ~pq~0.offset=0] [L13] RET call g(~p1.base, ~p1.offset, ~p2.base, ~p2.offset); VAL [#in~a=4, #in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0, ~a=4, ~p1.base=19, ~p1.offset=0, ~p2.base=18, ~p2.offset=0] [L14] #res := 1; VAL [#in~a=4, #in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0, #res=1, ~a=4, ~p1.base=19, ~p1.offset=0, ~p2.base=18, ~p2.offset=0] [L11-L18] ensures true; VAL [#in~a=4, #in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0, #res=1, ~a=4, ~p1.base=19, ~p1.offset=0, ~p2.base=18, ~p2.offset=0] [L32] RET call #t~ret5 := f(#t~mem4, ~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~mem4=4, #t~ret5=1, ~#a~0.base=20, ~#a~0.offset=0, ~#b~0.base=8, ~#b~0.offset=0, ~#p1~0.base=19, ~#p1~0.offset=0, ~#p2~0.base=18, ~#p2~0.offset=0] [L32] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L32] call write~int(#t~ret5, ~#a~0.base, ~#a~0.offset, 4); [L32] havoc #t~mem4; [L32] havoc #t~ret5; [L34] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#p1~0.base, ~#p1~0.offset, 4); [L34] call #t~mem7 := read~int(#t~mem6.base, #t~mem6.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem6.base=8, #t~mem6.offset=0, #t~mem7=0, ~#a~0.base=20, ~#a~0.offset=0, ~#b~0.base=8, ~#b~0.offset=0, ~#p1~0.base=19, ~#p1~0.offset=0, ~#p2~0.base=18, ~#p2~0.offset=0] [L34-L36] assume 0 == #t~mem7; [L34] havoc #t~mem6.base, #t~mem6.offset; [L34] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=20, ~#a~0.offset=0, ~#b~0.base=8, ~#b~0.offset=0, ~#p1~0.base=19, ~#p1~0.offset=0, ~#p2~0.base=18, ~#p2~0.offset=0] [L40] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=20, ~#a~0.offset=0, ~#b~0.base=8, ~#b~0.offset=0, ~#p1~0.base=19, ~#p1~0.offset=0, ~#p2~0.base=18, ~#p2~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=5, old(#NULL.base)=12, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L21] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4); [L21] call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4); [L22] call ~#p1~0.base, ~#p1~0.offset := #Ultimate.alloc(4); [L22] call ~#p2~0.base, ~#p2~0.offset := #Ultimate.alloc(4); [L24] call write~$Pointer$(~#a~0.base, ~#a~0.offset, ~#p1~0.base, ~#p1~0.offset, 4); [L25] call write~$Pointer$(~#b~0.base, ~#b~0.offset, ~#p2~0.base, ~#p2~0.offset, 4); [L27] call write~int(1, ~#b~0.base, ~#b~0.offset, 4); [L28] call write~int(5, ~#a~0.base, ~#a~0.offset, 4); [L30] call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4); [L30] #t~post3 := #t~mem2; [L30] call write~int(#t~post3 - 1, ~#a~0.base, ~#a~0.offset, 4); [L30] havoc #t~mem2; [L30] havoc #t~post3; [L32] call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem4=4, ~#a~0.base=20, ~#a~0.offset=0, ~#b~0.base=8, ~#b~0.offset=0, ~#p1~0.base=19, ~#p1~0.offset=0, ~#p2~0.base=18, ~#p2~0.offset=0] [L32] CALL call #t~ret5 := f(#t~mem4, ~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset); VAL [#in~a=4, #in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0] [L11-L18] ~a := #in~a; [L11-L18] ~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset; [L11-L18] ~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; VAL [#in~a=4, #in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0, ~a=4, ~p1.base=19, ~p1.offset=0, ~p2.base=18, ~p2.offset=0] [L12-L17] assume 4 == ~a; VAL [#in~a=4, #in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0, ~a=4, ~p1.base=19, ~p1.offset=0, ~p2.base=18, ~p2.offset=0] [L13] CALL call g(~p1.base, ~p1.offset, ~p2.base, ~p2.offset); VAL [#in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0] [L4-L9] ~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset; [L4-L9] ~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; [L5] call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~p2.base, ~p2.offset, 4); [L5] ~pq~0.base, ~pq~0.offset := #t~mem0.base, #t~mem0.offset; [L5] havoc #t~mem0.base, #t~mem0.offset; [L7] call #t~mem1.base, #t~mem1.offset := read~$Pointer$(~p2.base, ~p2.offset, 4); [L7] call write~$Pointer$(#t~mem1.base, #t~mem1.offset, ~p1.base, ~p1.offset, 4); [L7] havoc #t~mem1.base, #t~mem1.offset; [L8] call write~int(0, ~pq~0.base, ~pq~0.offset, 4); VAL [#in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0, ~p1.base=19, ~p1.offset=0, ~p2.base=18, ~p2.offset=0, ~pq~0.base=8, ~pq~0.offset=0] [L4-L9] ensures true; VAL [#in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0, ~p1.base=19, ~p1.offset=0, ~p2.base=18, ~p2.offset=0, ~pq~0.base=8, ~pq~0.offset=0] [L13] RET call g(~p1.base, ~p1.offset, ~p2.base, ~p2.offset); VAL [#in~a=4, #in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0, ~a=4, ~p1.base=19, ~p1.offset=0, ~p2.base=18, ~p2.offset=0] [L14] #res := 1; VAL [#in~a=4, #in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0, #res=1, ~a=4, ~p1.base=19, ~p1.offset=0, ~p2.base=18, ~p2.offset=0] [L11-L18] ensures true; VAL [#in~a=4, #in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0, #res=1, ~a=4, ~p1.base=19, ~p1.offset=0, ~p2.base=18, ~p2.offset=0] [L32] RET call #t~ret5 := f(#t~mem4, ~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~mem4=4, #t~ret5=1, ~#a~0.base=20, ~#a~0.offset=0, ~#b~0.base=8, ~#b~0.offset=0, ~#p1~0.base=19, ~#p1~0.offset=0, ~#p2~0.base=18, ~#p2~0.offset=0] [L32] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L32] call write~int(#t~ret5, ~#a~0.base, ~#a~0.offset, 4); [L32] havoc #t~mem4; [L32] havoc #t~ret5; [L34] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#p1~0.base, ~#p1~0.offset, 4); [L34] call #t~mem7 := read~int(#t~mem6.base, #t~mem6.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem6.base=8, #t~mem6.offset=0, #t~mem7=0, ~#a~0.base=20, ~#a~0.offset=0, ~#b~0.base=8, ~#b~0.offset=0, ~#p1~0.base=19, ~#p1~0.offset=0, ~#p2~0.base=18, ~#p2~0.offset=0] [L34-L36] assume 0 == #t~mem7; [L34] havoc #t~mem6.base, #t~mem6.offset; [L34] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=20, ~#a~0.offset=0, ~#b~0.base=8, ~#b~0.offset=0, ~#p1~0.base=19, ~#p1~0.offset=0, ~#p2~0.base=18, ~#p2~0.offset=0] [L40] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=20, ~#a~0.offset=0, ~#b~0.base=8, ~#b~0.offset=0, ~#p1~0.base=19, ~#p1~0.offset=0, ~#p2~0.base=18, ~#p2~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=5, old(#NULL!base)=12, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L21] FCALL call ~#a~0 := #Ultimate.alloc(4); [L21] FCALL call ~#b~0 := #Ultimate.alloc(4); [L22] FCALL call ~#p1~0 := #Ultimate.alloc(4); [L22] FCALL call ~#p2~0 := #Ultimate.alloc(4); [L24] FCALL call write~$Pointer$(~#a~0, ~#p1~0, 4); [L25] FCALL call write~$Pointer$(~#b~0, ~#p2~0, 4); [L27] FCALL call write~int(1, ~#b~0, 4); [L28] FCALL call write~int(5, ~#a~0, 4); [L30] FCALL call #t~mem2 := read~int(~#a~0, 4); [L30] #t~post3 := #t~mem2; [L30] FCALL call write~int(#t~post3 - 1, ~#a~0, 4); [L30] havoc #t~mem2; [L30] havoc #t~post3; [L32] FCALL call #t~mem4 := read~int(~#a~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=4, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L32] CALL call #t~ret5 := f(#t~mem4, ~#p1~0, ~#p2~0); VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L18] ~a := #in~a; [L11-L18] ~p1 := #in~p1; [L11-L18] ~p2 := #in~p2; VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, ~a=4, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0] [L12] COND TRUE 4 == ~a VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, ~a=4, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0] [L13] CALL call g(~p1, ~p2); VAL [#in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~p1 := #in~p1; [L4-L9] ~p2 := #in~p2; [L5] FCALL call #t~mem0 := read~$Pointer$(~p2, 4); [L5] ~pq~0 := #t~mem0; [L5] havoc #t~mem0; [L7] FCALL call #t~mem1 := read~$Pointer$(~p2, 4); [L7] FCALL call write~$Pointer$(#t~mem1, ~p1, 4); [L7] havoc #t~mem1; [L8] FCALL call write~int(0, ~pq~0, 4); VAL [#in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0, ~pq~0!base=8, ~pq~0!offset=0] [L13] RET call g(~p1, ~p2); VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, ~a=4, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0] [L14] #res := 1; VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, #res=1, ~a=4, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0] [L32] RET call #t~ret5 := f(#t~mem4, ~#p1~0, ~#p2~0); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=4, #t~ret5=1, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L32] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L32] FCALL call write~int(#t~ret5, ~#a~0, 4); [L32] havoc #t~mem4; [L32] havoc #t~ret5; [L34] FCALL call #t~mem6 := read~$Pointer$(~#p1~0, 4); [L34] FCALL call #t~mem7 := read~int(#t~mem6, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6!base=8, #t~mem6!offset=0, #t~mem7=0, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L34] COND TRUE 0 == #t~mem7 [L34] havoc #t~mem6; [L34] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L40] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=5, old(#NULL!base)=12, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L21] FCALL call ~#a~0 := #Ultimate.alloc(4); [L21] FCALL call ~#b~0 := #Ultimate.alloc(4); [L22] FCALL call ~#p1~0 := #Ultimate.alloc(4); [L22] FCALL call ~#p2~0 := #Ultimate.alloc(4); [L24] FCALL call write~$Pointer$(~#a~0, ~#p1~0, 4); [L25] FCALL call write~$Pointer$(~#b~0, ~#p2~0, 4); [L27] FCALL call write~int(1, ~#b~0, 4); [L28] FCALL call write~int(5, ~#a~0, 4); [L30] FCALL call #t~mem2 := read~int(~#a~0, 4); [L30] #t~post3 := #t~mem2; [L30] FCALL call write~int(#t~post3 - 1, ~#a~0, 4); [L30] havoc #t~mem2; [L30] havoc #t~post3; [L32] FCALL call #t~mem4 := read~int(~#a~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=4, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L32] CALL call #t~ret5 := f(#t~mem4, ~#p1~0, ~#p2~0); VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L18] ~a := #in~a; [L11-L18] ~p1 := #in~p1; [L11-L18] ~p2 := #in~p2; VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, ~a=4, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0] [L12] COND TRUE 4 == ~a VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, ~a=4, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0] [L13] CALL call g(~p1, ~p2); VAL [#in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~p1 := #in~p1; [L4-L9] ~p2 := #in~p2; [L5] FCALL call #t~mem0 := read~$Pointer$(~p2, 4); [L5] ~pq~0 := #t~mem0; [L5] havoc #t~mem0; [L7] FCALL call #t~mem1 := read~$Pointer$(~p2, 4); [L7] FCALL call write~$Pointer$(#t~mem1, ~p1, 4); [L7] havoc #t~mem1; [L8] FCALL call write~int(0, ~pq~0, 4); VAL [#in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0, ~pq~0!base=8, ~pq~0!offset=0] [L13] RET call g(~p1, ~p2); VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, ~a=4, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0] [L14] #res := 1; VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, #res=1, ~a=4, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0] [L32] RET call #t~ret5 := f(#t~mem4, ~#p1~0, ~#p2~0); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=4, #t~ret5=1, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L32] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L32] FCALL call write~int(#t~ret5, ~#a~0, 4); [L32] havoc #t~mem4; [L32] havoc #t~ret5; [L34] FCALL call #t~mem6 := read~$Pointer$(~#p1~0, 4); [L34] FCALL call #t~mem7 := read~int(#t~mem6, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6!base=8, #t~mem6!offset=0, #t~mem7=0, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L34] COND TRUE 0 == #t~mem7 [L34] havoc #t~mem6; [L34] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L40] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=5, old(#NULL!base)=12, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L21] FCALL call ~#a~0 := #Ultimate.alloc(4); [L21] FCALL call ~#b~0 := #Ultimate.alloc(4); [L22] FCALL call ~#p1~0 := #Ultimate.alloc(4); [L22] FCALL call ~#p2~0 := #Ultimate.alloc(4); [L24] FCALL call write~$Pointer$(~#a~0, ~#p1~0, 4); [L25] FCALL call write~$Pointer$(~#b~0, ~#p2~0, 4); [L27] FCALL call write~int(1, ~#b~0, 4); [L28] FCALL call write~int(5, ~#a~0, 4); [L30] FCALL call #t~mem2 := read~int(~#a~0, 4); [L30] #t~post3 := #t~mem2; [L30] FCALL call write~int(#t~post3 - 1, ~#a~0, 4); [L30] havoc #t~mem2; [L30] havoc #t~post3; [L32] FCALL call #t~mem4 := read~int(~#a~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=4, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L32] CALL call #t~ret5 := f(#t~mem4, ~#p1~0, ~#p2~0); VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L18] ~a := #in~a; [L11-L18] ~p1 := #in~p1; [L11-L18] ~p2 := #in~p2; VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, ~a=4, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0] [L12] COND TRUE 4 == ~a VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, ~a=4, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0] [L13] CALL call g(~p1, ~p2); VAL [#in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~p1 := #in~p1; [L4-L9] ~p2 := #in~p2; [L5] FCALL call #t~mem0 := read~$Pointer$(~p2, 4); [L5] ~pq~0 := #t~mem0; [L5] havoc #t~mem0; [L7] FCALL call #t~mem1 := read~$Pointer$(~p2, 4); [L7] FCALL call write~$Pointer$(#t~mem1, ~p1, 4); [L7] havoc #t~mem1; [L8] FCALL call write~int(0, ~pq~0, 4); VAL [#in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0, ~pq~0!base=8, ~pq~0!offset=0] [L13] RET call g(~p1, ~p2); VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, ~a=4, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0] [L14] #res := 1; VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, #res=1, ~a=4, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0] [L32] RET call #t~ret5 := f(#t~mem4, ~#p1~0, ~#p2~0); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=4, #t~ret5=1, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L32] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L32] FCALL call write~int(#t~ret5, ~#a~0, 4); [L32] havoc #t~mem4; [L32] havoc #t~ret5; [L34] FCALL call #t~mem6 := read~$Pointer$(~#p1~0, 4); [L34] FCALL call #t~mem7 := read~int(#t~mem6, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6!base=8, #t~mem6!offset=0, #t~mem7=0, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L34] COND TRUE 0 == #t~mem7 [L34] havoc #t~mem6; [L34] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L40] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=5, old(#NULL!base)=12, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L21] FCALL call ~#a~0 := #Ultimate.alloc(4); [L21] FCALL call ~#b~0 := #Ultimate.alloc(4); [L22] FCALL call ~#p1~0 := #Ultimate.alloc(4); [L22] FCALL call ~#p2~0 := #Ultimate.alloc(4); [L24] FCALL call write~$Pointer$(~#a~0, ~#p1~0, 4); [L25] FCALL call write~$Pointer$(~#b~0, ~#p2~0, 4); [L27] FCALL call write~int(1, ~#b~0, 4); [L28] FCALL call write~int(5, ~#a~0, 4); [L30] FCALL call #t~mem2 := read~int(~#a~0, 4); [L30] #t~post3 := #t~mem2; [L30] FCALL call write~int(#t~post3 - 1, ~#a~0, 4); [L30] havoc #t~mem2; [L30] havoc #t~post3; [L32] FCALL call #t~mem4 := read~int(~#a~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=4, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L32] CALL call #t~ret5 := f(#t~mem4, ~#p1~0, ~#p2~0); VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L18] ~a := #in~a; [L11-L18] ~p1 := #in~p1; [L11-L18] ~p2 := #in~p2; VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, ~a=4, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0] [L12] COND TRUE 4 == ~a VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, ~a=4, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0] [L13] CALL call g(~p1, ~p2); VAL [#in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~p1 := #in~p1; [L4-L9] ~p2 := #in~p2; [L5] FCALL call #t~mem0 := read~$Pointer$(~p2, 4); [L5] ~pq~0 := #t~mem0; [L5] havoc #t~mem0; [L7] FCALL call #t~mem1 := read~$Pointer$(~p2, 4); [L7] FCALL call write~$Pointer$(#t~mem1, ~p1, 4); [L7] havoc #t~mem1; [L8] FCALL call write~int(0, ~pq~0, 4); VAL [#in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0, ~pq~0!base=8, ~pq~0!offset=0] [L13] RET call g(~p1, ~p2); VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, ~a=4, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0] [L14] #res := 1; VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, #res=1, ~a=4, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0] [L32] RET call #t~ret5 := f(#t~mem4, ~#p1~0, ~#p2~0); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=4, #t~ret5=1, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L32] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L32] FCALL call write~int(#t~ret5, ~#a~0, 4); [L32] havoc #t~mem4; [L32] havoc #t~ret5; [L34] FCALL call #t~mem6 := read~$Pointer$(~#p1~0, 4); [L34] FCALL call #t~mem7 := read~int(#t~mem6, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6!base=8, #t~mem6!offset=0, #t~mem7=0, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L34] COND TRUE 0 == #t~mem7 [L34] havoc #t~mem6; [L34] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L40] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L21] int a, b; [L22] int *p1, *p2; [L24] p1 = &a [L25] p2 = &b [L27] b = 1 [L28] a = 5 [L30] EXPR \read(a) [L30] a-- [L32] EXPR \read(a) VAL [\read(a)=4, a={20:0}, b={8:0}, p1={19:0}, p2={18:0}] [L32] CALL, EXPR f(a, &p1, &p2) VAL [\old(a)=4, p1={19:0}, p2={18:0}] [L12] COND TRUE a == 4 VAL [\old(a)=4, a=4, p1={19:0}, p1={19:0}, p2={18:0}, p2={18:0}] [L13] CALL g(p1, p2) VAL [p1={19:0}, p2={18:0}] [L5] EXPR \read(**p2) [L5] int *pq = *p2; [L7] EXPR \read(**p2) [L7] *p1 = *p2 [L8] *pq = 0 VAL [p1={19:0}, p1={19:0}, p2={18:0}, p2={18:0}, pq={8:0}] [L13] RET g(p1, p2) VAL [\old(a)=4, a=4, p1={19:0}, p1={19:0}, p2={18:0}, p2={18:0}] [L14] return 1; VAL [\old(a)=4, \result=1, a=4, p1={19:0}, p1={19:0}, p2={18:0}, p2={18:0}] [L32] RET, EXPR f(a, &p1, &p2) VAL [\read(a)=4, a={20:0}, b={8:0}, f(a, &p1, &p2)=1, p1={19:0}, p2={18:0}] [L32] a = f(a, &p1, &p2) [L34] EXPR \read(*p1) VAL [\read(*p1)=0, \read(*p1)={8:0}, a={20:0}, b={8:0}, p1={19:0}, p2={18:0}] [L34] COND TRUE *p1 == 0 [L40] __VERIFIER_error() VAL [a={20:0}, b={8:0}, p1={19:0}, p2={18:0}] ----- [2018-11-23 12:54:19,258 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 12:54:19,258 WARN L170 areAnnotationChecker]: fENTRY has no Hoare annotation [2018-11-23 12:54:19,258 WARN L170 areAnnotationChecker]: gENTRY has no Hoare annotation [2018-11-23 12:54:19,259 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:54:19,259 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:54:19,260 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 12:54:19,260 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:54:19,260 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2018-11-23 12:54:19,260 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2018-11-23 12:54:19,260 WARN L170 areAnnotationChecker]: gFINAL has no Hoare annotation [2018-11-23 12:54:19,260 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:54:19,261 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:54:19,261 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-23 12:54:19,261 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-23 12:54:19,261 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:54:19,261 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-23 12:54:19,261 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-23 12:54:19,262 WARN L170 areAnnotationChecker]: fFINAL has no Hoare annotation [2018-11-23 12:54:19,262 WARN L170 areAnnotationChecker]: gEXIT has no Hoare annotation [2018-11-23 12:54:19,262 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:54:19,262 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-11-23 12:54:19,262 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-23 12:54:19,262 WARN L170 areAnnotationChecker]: fEXIT has no Hoare annotation [2018-11-23 12:54:19,263 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2018-11-23 12:54:19,263 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2018-11-23 12:54:19,263 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-23 12:54:19,263 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-23 12:54:19,263 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:54:19,263 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:54:19,264 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:19,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:54:19 BoogieIcfgContainer [2018-11-23 12:54:19,266 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:54:19,267 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:54:19,267 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:54:19,267 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:54:19,268 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:17" (3/4) ... [2018-11-23 12:54:19,270 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|=12, |#NULL.offset|=5, |old(#NULL.base)|=12, |old(#NULL.offset)|=5] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=5] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=5] [?] RET #29#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret8 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4);call ~#p1~0.base, ~#p1~0.offset := #Ultimate.alloc(4);call ~#p2~0.base, ~#p2~0.offset := #Ultimate.alloc(4);call write~$Pointer$(~#a~0.base, ~#a~0.offset, ~#p1~0.base, ~#p1~0.offset, 4);call write~$Pointer$(~#b~0.base, ~#b~0.offset, ~#p2~0.base, ~#p2~0.offset, 4);call write~int(1, ~#b~0.base, ~#b~0.offset, 4);call write~int(5, ~#a~0.base, ~#a~0.offset, 4);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4);#t~post3 := #t~mem2;call write~int(#t~post3 - 1, ~#a~0.base, ~#a~0.offset, 4);havoc #t~mem2;havoc #t~post3;call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset, 4); VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem4|=4, |main_~#a~0.base|=20, |main_~#a~0.offset|=0, |main_~#b~0.base|=8, |main_~#b~0.offset|=0, |main_~#p1~0.base|=19, |main_~#p1~0.offset|=0, |main_~#p2~0.base|=18, |main_~#p2~0.offset|=0] [?] CALL call #t~ret5 := f(#t~mem4, ~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |f_#in~a|=4, |f_#in~p1.base|=19, |f_#in~p1.offset|=0, |f_#in~p2.base|=18, |f_#in~p2.offset|=0] [?] ~a := #in~a;~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; VAL [f_~a=4, f_~p1.base=19, f_~p1.offset=0, f_~p2.base=18, f_~p2.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |f_#in~a|=4, |f_#in~p1.base|=19, |f_#in~p1.offset|=0, |f_#in~p2.base|=18, |f_#in~p2.offset|=0] [?] assume 4 == ~a; VAL [f_~a=4, f_~p1.base=19, f_~p1.offset=0, f_~p2.base=18, f_~p2.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |f_#in~a|=4, |f_#in~p1.base|=19, |f_#in~p1.offset|=0, |f_#in~p2.base|=18, |f_#in~p2.offset|=0] [?] CALL call g(~p1.base, ~p1.offset, ~p2.base, ~p2.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |g_#in~p1.base|=19, |g_#in~p1.offset|=0, |g_#in~p2.base|=18, |g_#in~p2.offset|=0] [?] ~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);~pq~0.base, ~pq~0.offset := #t~mem0.base, #t~mem0.offset;havoc #t~mem0.base, #t~mem0.offset;call #t~mem1.base, #t~mem1.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);call write~$Pointer$(#t~mem1.base, #t~mem1.offset, ~p1.base, ~p1.offset, 4);havoc #t~mem1.base, #t~mem1.offset;call write~int(0, ~pq~0.base, ~pq~0.offset, 4); VAL [g_~p1.base=19, g_~p1.offset=0, g_~p2.base=18, g_~p2.offset=0, g_~pq~0.base=8, g_~pq~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |g_#in~p1.base|=19, |g_#in~p1.offset|=0, |g_#in~p2.base|=18, |g_#in~p2.offset|=0] [?] assume true; VAL [g_~p1.base=19, g_~p1.offset=0, g_~p2.base=18, g_~p2.offset=0, g_~pq~0.base=8, g_~pq~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |g_#in~p1.base|=19, |g_#in~p1.offset|=0, |g_#in~p2.base|=18, |g_#in~p2.offset|=0] [?] RET #27#return; VAL [f_~a=4, f_~p1.base=19, f_~p1.offset=0, f_~p2.base=18, f_~p2.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |f_#in~a|=4, |f_#in~p1.base|=19, |f_#in~p1.offset|=0, |f_#in~p2.base|=18, |f_#in~p2.offset|=0] [?] #res := 1; VAL [f_~a=4, f_~p1.base=19, f_~p1.offset=0, f_~p2.base=18, f_~p2.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |f_#in~a|=4, |f_#in~p1.base|=19, |f_#in~p1.offset|=0, |f_#in~p2.base|=18, |f_#in~p2.offset|=0, |f_#res|=1] [?] assume true; VAL [f_~a=4, f_~p1.base=19, f_~p1.offset=0, f_~p2.base=18, f_~p2.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |f_#in~a|=4, |f_#in~p1.base|=19, |f_#in~p1.offset|=0, |f_#in~p2.base|=18, |f_#in~p2.offset|=0, |f_#res|=1] [?] RET #33#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem4|=4, |main_#t~ret5|=1, |main_~#a~0.base|=20, |main_~#a~0.offset|=0, |main_~#b~0.base|=8, |main_~#b~0.offset|=0, |main_~#p1~0.base|=19, |main_~#p1~0.offset|=0, |main_~#p2~0.base|=18, |main_~#p2~0.offset|=0] [?] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;call write~int(#t~ret5, ~#a~0.base, ~#a~0.offset, 4);havoc #t~mem4;havoc #t~ret5;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#p1~0.base, ~#p1~0.offset, 4);call #t~mem7 := read~int(#t~mem6.base, #t~mem6.offset, 4); VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem6.base|=8, |main_#t~mem6.offset|=0, |main_#t~mem7|=0, |main_~#a~0.base|=20, |main_~#a~0.offset|=0, |main_~#b~0.base|=8, |main_~#b~0.offset|=0, |main_~#p1~0.base|=19, |main_~#p1~0.offset|=0, |main_~#p2~0.base|=18, |main_~#p2~0.offset|=0] [?] assume 0 == #t~mem7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem7; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=20, |main_~#a~0.offset|=0, |main_~#b~0.base|=8, |main_~#b~0.offset|=0, |main_~#p1~0.base|=19, |main_~#p1~0.offset|=0, |main_~#p2~0.base|=18, |main_~#p2~0.offset|=0] [?] assume !false; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=20, |main_~#a~0.offset|=0, |main_~#b~0.base|=8, |main_~#b~0.offset|=0, |main_~#p1~0.base|=19, |main_~#p1~0.offset|=0, |main_~#p2~0.base|=18, |main_~#p2~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=5, old(#NULL.base)=12, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L21] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4); [L21] call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4); [L22] call ~#p1~0.base, ~#p1~0.offset := #Ultimate.alloc(4); [L22] call ~#p2~0.base, ~#p2~0.offset := #Ultimate.alloc(4); [L24] call write~$Pointer$(~#a~0.base, ~#a~0.offset, ~#p1~0.base, ~#p1~0.offset, 4); [L25] call write~$Pointer$(~#b~0.base, ~#b~0.offset, ~#p2~0.base, ~#p2~0.offset, 4); [L27] call write~int(1, ~#b~0.base, ~#b~0.offset, 4); [L28] call write~int(5, ~#a~0.base, ~#a~0.offset, 4); [L30] call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4); [L30] #t~post3 := #t~mem2; [L30] call write~int(#t~post3 - 1, ~#a~0.base, ~#a~0.offset, 4); [L30] havoc #t~mem2; [L30] havoc #t~post3; [L32] call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem4=4, ~#a~0.base=20, ~#a~0.offset=0, ~#b~0.base=8, ~#b~0.offset=0, ~#p1~0.base=19, ~#p1~0.offset=0, ~#p2~0.base=18, ~#p2~0.offset=0] [L32] CALL call #t~ret5 := f(#t~mem4, ~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset); VAL [#in~a=4, #in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0] [L11-L18] ~a := #in~a; [L11-L18] ~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset; [L11-L18] ~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; VAL [#in~a=4, #in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0, ~a=4, ~p1.base=19, ~p1.offset=0, ~p2.base=18, ~p2.offset=0] [L12-L17] assume 4 == ~a; VAL [#in~a=4, #in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0, ~a=4, ~p1.base=19, ~p1.offset=0, ~p2.base=18, ~p2.offset=0] [L13] CALL call g(~p1.base, ~p1.offset, ~p2.base, ~p2.offset); VAL [#in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0] [L4-L9] ~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset; [L4-L9] ~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; [L5] call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~p2.base, ~p2.offset, 4); [L5] ~pq~0.base, ~pq~0.offset := #t~mem0.base, #t~mem0.offset; [L5] havoc #t~mem0.base, #t~mem0.offset; [L7] call #t~mem1.base, #t~mem1.offset := read~$Pointer$(~p2.base, ~p2.offset, 4); [L7] call write~$Pointer$(#t~mem1.base, #t~mem1.offset, ~p1.base, ~p1.offset, 4); [L7] havoc #t~mem1.base, #t~mem1.offset; [L8] call write~int(0, ~pq~0.base, ~pq~0.offset, 4); VAL [#in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0, ~p1.base=19, ~p1.offset=0, ~p2.base=18, ~p2.offset=0, ~pq~0.base=8, ~pq~0.offset=0] [L4-L9] ensures true; VAL [#in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0, ~p1.base=19, ~p1.offset=0, ~p2.base=18, ~p2.offset=0, ~pq~0.base=8, ~pq~0.offset=0] [L13] RET call g(~p1.base, ~p1.offset, ~p2.base, ~p2.offset); VAL [#in~a=4, #in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0, ~a=4, ~p1.base=19, ~p1.offset=0, ~p2.base=18, ~p2.offset=0] [L14] #res := 1; VAL [#in~a=4, #in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0, #res=1, ~a=4, ~p1.base=19, ~p1.offset=0, ~p2.base=18, ~p2.offset=0] [L11-L18] ensures true; VAL [#in~a=4, #in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0, #res=1, ~a=4, ~p1.base=19, ~p1.offset=0, ~p2.base=18, ~p2.offset=0] [L32] RET call #t~ret5 := f(#t~mem4, ~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~mem4=4, #t~ret5=1, ~#a~0.base=20, ~#a~0.offset=0, ~#b~0.base=8, ~#b~0.offset=0, ~#p1~0.base=19, ~#p1~0.offset=0, ~#p2~0.base=18, ~#p2~0.offset=0] [L32] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L32] call write~int(#t~ret5, ~#a~0.base, ~#a~0.offset, 4); [L32] havoc #t~mem4; [L32] havoc #t~ret5; [L34] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#p1~0.base, ~#p1~0.offset, 4); [L34] call #t~mem7 := read~int(#t~mem6.base, #t~mem6.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem6.base=8, #t~mem6.offset=0, #t~mem7=0, ~#a~0.base=20, ~#a~0.offset=0, ~#b~0.base=8, ~#b~0.offset=0, ~#p1~0.base=19, ~#p1~0.offset=0, ~#p2~0.base=18, ~#p2~0.offset=0] [L34-L36] assume 0 == #t~mem7; [L34] havoc #t~mem6.base, #t~mem6.offset; [L34] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=20, ~#a~0.offset=0, ~#b~0.base=8, ~#b~0.offset=0, ~#p1~0.base=19, ~#p1~0.offset=0, ~#p2~0.base=18, ~#p2~0.offset=0] [L40] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=20, ~#a~0.offset=0, ~#b~0.base=8, ~#b~0.offset=0, ~#p1~0.base=19, ~#p1~0.offset=0, ~#p2~0.base=18, ~#p2~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=5, old(#NULL.base)=12, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L21] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4); [L21] call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4); [L22] call ~#p1~0.base, ~#p1~0.offset := #Ultimate.alloc(4); [L22] call ~#p2~0.base, ~#p2~0.offset := #Ultimate.alloc(4); [L24] call write~$Pointer$(~#a~0.base, ~#a~0.offset, ~#p1~0.base, ~#p1~0.offset, 4); [L25] call write~$Pointer$(~#b~0.base, ~#b~0.offset, ~#p2~0.base, ~#p2~0.offset, 4); [L27] call write~int(1, ~#b~0.base, ~#b~0.offset, 4); [L28] call write~int(5, ~#a~0.base, ~#a~0.offset, 4); [L30] call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4); [L30] #t~post3 := #t~mem2; [L30] call write~int(#t~post3 - 1, ~#a~0.base, ~#a~0.offset, 4); [L30] havoc #t~mem2; [L30] havoc #t~post3; [L32] call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem4=4, ~#a~0.base=20, ~#a~0.offset=0, ~#b~0.base=8, ~#b~0.offset=0, ~#p1~0.base=19, ~#p1~0.offset=0, ~#p2~0.base=18, ~#p2~0.offset=0] [L32] CALL call #t~ret5 := f(#t~mem4, ~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset); VAL [#in~a=4, #in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0] [L11-L18] ~a := #in~a; [L11-L18] ~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset; [L11-L18] ~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; VAL [#in~a=4, #in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0, ~a=4, ~p1.base=19, ~p1.offset=0, ~p2.base=18, ~p2.offset=0] [L12-L17] assume 4 == ~a; VAL [#in~a=4, #in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0, ~a=4, ~p1.base=19, ~p1.offset=0, ~p2.base=18, ~p2.offset=0] [L13] CALL call g(~p1.base, ~p1.offset, ~p2.base, ~p2.offset); VAL [#in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0] [L4-L9] ~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset; [L4-L9] ~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; [L5] call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~p2.base, ~p2.offset, 4); [L5] ~pq~0.base, ~pq~0.offset := #t~mem0.base, #t~mem0.offset; [L5] havoc #t~mem0.base, #t~mem0.offset; [L7] call #t~mem1.base, #t~mem1.offset := read~$Pointer$(~p2.base, ~p2.offset, 4); [L7] call write~$Pointer$(#t~mem1.base, #t~mem1.offset, ~p1.base, ~p1.offset, 4); [L7] havoc #t~mem1.base, #t~mem1.offset; [L8] call write~int(0, ~pq~0.base, ~pq~0.offset, 4); VAL [#in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0, ~p1.base=19, ~p1.offset=0, ~p2.base=18, ~p2.offset=0, ~pq~0.base=8, ~pq~0.offset=0] [L4-L9] ensures true; VAL [#in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0, ~p1.base=19, ~p1.offset=0, ~p2.base=18, ~p2.offset=0, ~pq~0.base=8, ~pq~0.offset=0] [L13] RET call g(~p1.base, ~p1.offset, ~p2.base, ~p2.offset); VAL [#in~a=4, #in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0, ~a=4, ~p1.base=19, ~p1.offset=0, ~p2.base=18, ~p2.offset=0] [L14] #res := 1; VAL [#in~a=4, #in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0, #res=1, ~a=4, ~p1.base=19, ~p1.offset=0, ~p2.base=18, ~p2.offset=0] [L11-L18] ensures true; VAL [#in~a=4, #in~p1.base=19, #in~p1.offset=0, #in~p2.base=18, #in~p2.offset=0, #NULL.base=0, #NULL.offset=0, #res=1, ~a=4, ~p1.base=19, ~p1.offset=0, ~p2.base=18, ~p2.offset=0] [L32] RET call #t~ret5 := f(#t~mem4, ~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~mem4=4, #t~ret5=1, ~#a~0.base=20, ~#a~0.offset=0, ~#b~0.base=8, ~#b~0.offset=0, ~#p1~0.base=19, ~#p1~0.offset=0, ~#p2~0.base=18, ~#p2~0.offset=0] [L32] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L32] call write~int(#t~ret5, ~#a~0.base, ~#a~0.offset, 4); [L32] havoc #t~mem4; [L32] havoc #t~ret5; [L34] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#p1~0.base, ~#p1~0.offset, 4); [L34] call #t~mem7 := read~int(#t~mem6.base, #t~mem6.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem6.base=8, #t~mem6.offset=0, #t~mem7=0, ~#a~0.base=20, ~#a~0.offset=0, ~#b~0.base=8, ~#b~0.offset=0, ~#p1~0.base=19, ~#p1~0.offset=0, ~#p2~0.base=18, ~#p2~0.offset=0] [L34-L36] assume 0 == #t~mem7; [L34] havoc #t~mem6.base, #t~mem6.offset; [L34] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=20, ~#a~0.offset=0, ~#b~0.base=8, ~#b~0.offset=0, ~#p1~0.base=19, ~#p1~0.offset=0, ~#p2~0.base=18, ~#p2~0.offset=0] [L40] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=20, ~#a~0.offset=0, ~#b~0.base=8, ~#b~0.offset=0, ~#p1~0.base=19, ~#p1~0.offset=0, ~#p2~0.base=18, ~#p2~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=5, old(#NULL!base)=12, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L21] FCALL call ~#a~0 := #Ultimate.alloc(4); [L21] FCALL call ~#b~0 := #Ultimate.alloc(4); [L22] FCALL call ~#p1~0 := #Ultimate.alloc(4); [L22] FCALL call ~#p2~0 := #Ultimate.alloc(4); [L24] FCALL call write~$Pointer$(~#a~0, ~#p1~0, 4); [L25] FCALL call write~$Pointer$(~#b~0, ~#p2~0, 4); [L27] FCALL call write~int(1, ~#b~0, 4); [L28] FCALL call write~int(5, ~#a~0, 4); [L30] FCALL call #t~mem2 := read~int(~#a~0, 4); [L30] #t~post3 := #t~mem2; [L30] FCALL call write~int(#t~post3 - 1, ~#a~0, 4); [L30] havoc #t~mem2; [L30] havoc #t~post3; [L32] FCALL call #t~mem4 := read~int(~#a~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=4, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L32] CALL call #t~ret5 := f(#t~mem4, ~#p1~0, ~#p2~0); VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L18] ~a := #in~a; [L11-L18] ~p1 := #in~p1; [L11-L18] ~p2 := #in~p2; VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, ~a=4, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0] [L12] COND TRUE 4 == ~a VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, ~a=4, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0] [L13] CALL call g(~p1, ~p2); VAL [#in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~p1 := #in~p1; [L4-L9] ~p2 := #in~p2; [L5] FCALL call #t~mem0 := read~$Pointer$(~p2, 4); [L5] ~pq~0 := #t~mem0; [L5] havoc #t~mem0; [L7] FCALL call #t~mem1 := read~$Pointer$(~p2, 4); [L7] FCALL call write~$Pointer$(#t~mem1, ~p1, 4); [L7] havoc #t~mem1; [L8] FCALL call write~int(0, ~pq~0, 4); VAL [#in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0, ~pq~0!base=8, ~pq~0!offset=0] [L13] RET call g(~p1, ~p2); VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, ~a=4, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0] [L14] #res := 1; VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, #res=1, ~a=4, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0] [L32] RET call #t~ret5 := f(#t~mem4, ~#p1~0, ~#p2~0); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=4, #t~ret5=1, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L32] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L32] FCALL call write~int(#t~ret5, ~#a~0, 4); [L32] havoc #t~mem4; [L32] havoc #t~ret5; [L34] FCALL call #t~mem6 := read~$Pointer$(~#p1~0, 4); [L34] FCALL call #t~mem7 := read~int(#t~mem6, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6!base=8, #t~mem6!offset=0, #t~mem7=0, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L34] COND TRUE 0 == #t~mem7 [L34] havoc #t~mem6; [L34] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L40] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=5, old(#NULL!base)=12, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L21] FCALL call ~#a~0 := #Ultimate.alloc(4); [L21] FCALL call ~#b~0 := #Ultimate.alloc(4); [L22] FCALL call ~#p1~0 := #Ultimate.alloc(4); [L22] FCALL call ~#p2~0 := #Ultimate.alloc(4); [L24] FCALL call write~$Pointer$(~#a~0, ~#p1~0, 4); [L25] FCALL call write~$Pointer$(~#b~0, ~#p2~0, 4); [L27] FCALL call write~int(1, ~#b~0, 4); [L28] FCALL call write~int(5, ~#a~0, 4); [L30] FCALL call #t~mem2 := read~int(~#a~0, 4); [L30] #t~post3 := #t~mem2; [L30] FCALL call write~int(#t~post3 - 1, ~#a~0, 4); [L30] havoc #t~mem2; [L30] havoc #t~post3; [L32] FCALL call #t~mem4 := read~int(~#a~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=4, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L32] CALL call #t~ret5 := f(#t~mem4, ~#p1~0, ~#p2~0); VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L18] ~a := #in~a; [L11-L18] ~p1 := #in~p1; [L11-L18] ~p2 := #in~p2; VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, ~a=4, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0] [L12] COND TRUE 4 == ~a VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, ~a=4, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0] [L13] CALL call g(~p1, ~p2); VAL [#in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~p1 := #in~p1; [L4-L9] ~p2 := #in~p2; [L5] FCALL call #t~mem0 := read~$Pointer$(~p2, 4); [L5] ~pq~0 := #t~mem0; [L5] havoc #t~mem0; [L7] FCALL call #t~mem1 := read~$Pointer$(~p2, 4); [L7] FCALL call write~$Pointer$(#t~mem1, ~p1, 4); [L7] havoc #t~mem1; [L8] FCALL call write~int(0, ~pq~0, 4); VAL [#in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0, ~pq~0!base=8, ~pq~0!offset=0] [L13] RET call g(~p1, ~p2); VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, ~a=4, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0] [L14] #res := 1; VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, #res=1, ~a=4, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0] [L32] RET call #t~ret5 := f(#t~mem4, ~#p1~0, ~#p2~0); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=4, #t~ret5=1, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L32] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L32] FCALL call write~int(#t~ret5, ~#a~0, 4); [L32] havoc #t~mem4; [L32] havoc #t~ret5; [L34] FCALL call #t~mem6 := read~$Pointer$(~#p1~0, 4); [L34] FCALL call #t~mem7 := read~int(#t~mem6, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6!base=8, #t~mem6!offset=0, #t~mem7=0, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L34] COND TRUE 0 == #t~mem7 [L34] havoc #t~mem6; [L34] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L40] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=5, old(#NULL!base)=12, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L21] FCALL call ~#a~0 := #Ultimate.alloc(4); [L21] FCALL call ~#b~0 := #Ultimate.alloc(4); [L22] FCALL call ~#p1~0 := #Ultimate.alloc(4); [L22] FCALL call ~#p2~0 := #Ultimate.alloc(4); [L24] FCALL call write~$Pointer$(~#a~0, ~#p1~0, 4); [L25] FCALL call write~$Pointer$(~#b~0, ~#p2~0, 4); [L27] FCALL call write~int(1, ~#b~0, 4); [L28] FCALL call write~int(5, ~#a~0, 4); [L30] FCALL call #t~mem2 := read~int(~#a~0, 4); [L30] #t~post3 := #t~mem2; [L30] FCALL call write~int(#t~post3 - 1, ~#a~0, 4); [L30] havoc #t~mem2; [L30] havoc #t~post3; [L32] FCALL call #t~mem4 := read~int(~#a~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=4, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L32] CALL call #t~ret5 := f(#t~mem4, ~#p1~0, ~#p2~0); VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L18] ~a := #in~a; [L11-L18] ~p1 := #in~p1; [L11-L18] ~p2 := #in~p2; VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, ~a=4, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0] [L12] COND TRUE 4 == ~a VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, ~a=4, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0] [L13] CALL call g(~p1, ~p2); VAL [#in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~p1 := #in~p1; [L4-L9] ~p2 := #in~p2; [L5] FCALL call #t~mem0 := read~$Pointer$(~p2, 4); [L5] ~pq~0 := #t~mem0; [L5] havoc #t~mem0; [L7] FCALL call #t~mem1 := read~$Pointer$(~p2, 4); [L7] FCALL call write~$Pointer$(#t~mem1, ~p1, 4); [L7] havoc #t~mem1; [L8] FCALL call write~int(0, ~pq~0, 4); VAL [#in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0, ~pq~0!base=8, ~pq~0!offset=0] [L13] RET call g(~p1, ~p2); VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, ~a=4, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0] [L14] #res := 1; VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, #res=1, ~a=4, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0] [L32] RET call #t~ret5 := f(#t~mem4, ~#p1~0, ~#p2~0); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=4, #t~ret5=1, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L32] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L32] FCALL call write~int(#t~ret5, ~#a~0, 4); [L32] havoc #t~mem4; [L32] havoc #t~ret5; [L34] FCALL call #t~mem6 := read~$Pointer$(~#p1~0, 4); [L34] FCALL call #t~mem7 := read~int(#t~mem6, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6!base=8, #t~mem6!offset=0, #t~mem7=0, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L34] COND TRUE 0 == #t~mem7 [L34] havoc #t~mem6; [L34] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L40] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=5, old(#NULL!base)=12, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L21] FCALL call ~#a~0 := #Ultimate.alloc(4); [L21] FCALL call ~#b~0 := #Ultimate.alloc(4); [L22] FCALL call ~#p1~0 := #Ultimate.alloc(4); [L22] FCALL call ~#p2~0 := #Ultimate.alloc(4); [L24] FCALL call write~$Pointer$(~#a~0, ~#p1~0, 4); [L25] FCALL call write~$Pointer$(~#b~0, ~#p2~0, 4); [L27] FCALL call write~int(1, ~#b~0, 4); [L28] FCALL call write~int(5, ~#a~0, 4); [L30] FCALL call #t~mem2 := read~int(~#a~0, 4); [L30] #t~post3 := #t~mem2; [L30] FCALL call write~int(#t~post3 - 1, ~#a~0, 4); [L30] havoc #t~mem2; [L30] havoc #t~post3; [L32] FCALL call #t~mem4 := read~int(~#a~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=4, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L32] CALL call #t~ret5 := f(#t~mem4, ~#p1~0, ~#p2~0); VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0] [L11-L18] ~a := #in~a; [L11-L18] ~p1 := #in~p1; [L11-L18] ~p2 := #in~p2; VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, ~a=4, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0] [L12] COND TRUE 4 == ~a VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, ~a=4, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0] [L13] CALL call g(~p1, ~p2); VAL [#in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~p1 := #in~p1; [L4-L9] ~p2 := #in~p2; [L5] FCALL call #t~mem0 := read~$Pointer$(~p2, 4); [L5] ~pq~0 := #t~mem0; [L5] havoc #t~mem0; [L7] FCALL call #t~mem1 := read~$Pointer$(~p2, 4); [L7] FCALL call write~$Pointer$(#t~mem1, ~p1, 4); [L7] havoc #t~mem1; [L8] FCALL call write~int(0, ~pq~0, 4); VAL [#in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0, ~pq~0!base=8, ~pq~0!offset=0] [L13] RET call g(~p1, ~p2); VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, ~a=4, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0] [L14] #res := 1; VAL [#in~a=4, #in~p1!base=19, #in~p1!offset=0, #in~p2!base=18, #in~p2!offset=0, #NULL!base=0, #NULL!offset=0, #res=1, ~a=4, ~p1!base=19, ~p1!offset=0, ~p2!base=18, ~p2!offset=0] [L32] RET call #t~ret5 := f(#t~mem4, ~#p1~0, ~#p2~0); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=4, #t~ret5=1, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L32] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L32] FCALL call write~int(#t~ret5, ~#a~0, 4); [L32] havoc #t~mem4; [L32] havoc #t~ret5; [L34] FCALL call #t~mem6 := read~$Pointer$(~#p1~0, 4); [L34] FCALL call #t~mem7 := read~int(#t~mem6, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6!base=8, #t~mem6!offset=0, #t~mem7=0, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L34] COND TRUE 0 == #t~mem7 [L34] havoc #t~mem6; [L34] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L40] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=20, ~#a~0!offset=0, ~#b~0!base=8, ~#b~0!offset=0, ~#p1~0!base=19, ~#p1~0!offset=0, ~#p2~0!base=18, ~#p2~0!offset=0] [L21] int a, b; [L22] int *p1, *p2; [L24] p1 = &a [L25] p2 = &b [L27] b = 1 [L28] a = 5 [L30] EXPR \read(a) [L30] a-- [L32] EXPR \read(a) VAL [\read(a)=4, a={20:0}, b={8:0}, p1={19:0}, p2={18:0}] [L32] CALL, EXPR f(a, &p1, &p2) VAL [\old(a)=4, p1={19:0}, p2={18:0}] [L12] COND TRUE a == 4 VAL [\old(a)=4, a=4, p1={19:0}, p1={19:0}, p2={18:0}, p2={18:0}] [L13] CALL g(p1, p2) VAL [p1={19:0}, p2={18:0}] [L5] EXPR \read(**p2) [L5] int *pq = *p2; [L7] EXPR \read(**p2) [L7] *p1 = *p2 [L8] *pq = 0 VAL [p1={19:0}, p1={19:0}, p2={18:0}, p2={18:0}, pq={8:0}] [L13] RET g(p1, p2) VAL [\old(a)=4, a=4, p1={19:0}, p1={19:0}, p2={18:0}, p2={18:0}] [L14] return 1; VAL [\old(a)=4, \result=1, a=4, p1={19:0}, p1={19:0}, p2={18:0}, p2={18:0}] [L32] RET, EXPR f(a, &p1, &p2) VAL [\read(a)=4, a={20:0}, b={8:0}, f(a, &p1, &p2)=1, p1={19:0}, p2={18:0}] [L32] a = f(a, &p1, &p2) [L34] EXPR \read(*p1) VAL [\read(*p1)={8:0}, \read(*p1)=0, a={20:0}, b={8:0}, p1={19:0}, p2={18:0}] [L34] COND TRUE *p1 == 0 [L40] __VERIFIER_error() VAL [a={20:0}, b={8:0}, p1={19:0}, p2={18:0}] ----- [2018-11-23 12:54:19,363 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/test06_false-unreach-call_true-termination.c-witness.graphml [2018-11-23 12:54:19,363 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:54:19,365 INFO L168 Benchmark]: Toolchain (without parser) took 3464.42 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 722.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -653.1 MB). Peak memory consumption was 69.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:19,367 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:54:19,369 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.03 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:19,372 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.17 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:19,375 INFO L168 Benchmark]: Boogie Preprocessor took 36.71 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:19,376 INFO L168 Benchmark]: RCFGBuilder took 813.20 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 722.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -756.1 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:19,377 INFO L168 Benchmark]: TraceAbstraction took 2174.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 79.2 MB). Peak memory consumption was 79.2 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:19,377 INFO L168 Benchmark]: Witness Printer took 96.68 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:19,381 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 310.03 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.17 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 36.71 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 813.20 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 722.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -756.1 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2174.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 79.2 MB). Peak memory consumption was 79.2 MB. Max. memory is 7.1 GB. * Witness Printer took 96.68 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 40]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L21] int a, b; [L22] int *p1, *p2; [L24] p1 = &a [L25] p2 = &b [L27] b = 1 [L28] a = 5 [L30] EXPR \read(a) [L30] a-- [L32] EXPR \read(a) VAL [\read(a)=4, a={20:0}, b={8:0}, p1={19:0}, p2={18:0}] [L32] CALL, EXPR f(a, &p1, &p2) VAL [\old(a)=4, p1={19:0}, p2={18:0}] [L12] COND TRUE a == 4 VAL [\old(a)=4, a=4, p1={19:0}, p1={19:0}, p2={18:0}, p2={18:0}] [L13] CALL g(p1, p2) VAL [p1={19:0}, p2={18:0}] [L5] EXPR \read(**p2) [L5] int *pq = *p2; [L7] EXPR \read(**p2) [L7] *p1 = *p2 [L8] *pq = 0 VAL [p1={19:0}, p1={19:0}, p2={18:0}, p2={18:0}, pq={8:0}] [L13] RET g(p1, p2) VAL [\old(a)=4, a=4, p1={19:0}, p1={19:0}, p2={18:0}, p2={18:0}] [L14] return 1; VAL [\old(a)=4, \result=1, a=4, p1={19:0}, p1={19:0}, p2={18:0}, p2={18:0}] [L32] RET, EXPR f(a, &p1, &p2) VAL [\read(a)=4, a={20:0}, b={8:0}, f(a, &p1, &p2)=1, p1={19:0}, p2={18:0}] [L32] a = f(a, &p1, &p2) [L34] EXPR \read(*p1) VAL [\read(*p1)=0, \read(*p1)={8:0}, a={20:0}, b={8:0}, p1={19:0}, p2={18:0}] [L34] COND TRUE *p1 == 0 [L40] __VERIFIER_error() VAL [a={20:0}, b={8:0}, p1={19:0}, p2={18:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 24 locations, 1 error locations. UNSAFE Result, 2.0s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 21 SDtfs, 5 SDslu, 53 SDs, 0 SdLazy, 13 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=0, 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.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 33 NumberOfCodeBlocks, 33 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 299 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...