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/list-properties/splice_false-unreach-call_false-valid-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:52:58,166 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:52:58,172 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:52:58,187 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:52:58,187 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:52:58,188 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:52:58,189 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:52:58,191 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:52:58,193 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:52:58,194 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:52:58,195 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:52:58,195 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:52:58,196 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:52:58,198 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:52:58,204 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:52:58,205 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:52:58,206 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:52:58,211 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:52:58,213 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:52:58,215 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:52:58,216 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:52:58,217 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:52:58,219 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:52:58,220 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:52:58,220 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:52:58,221 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:52:58,222 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:52:58,222 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:52:58,223 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:52:58,224 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:52:58,225 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:52:58,225 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:52:58,226 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:52:58,226 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:52:58,227 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:52:58,227 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:52:58,228 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:52:58,246 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:52:58,246 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:52:58,247 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:52:58,247 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:52:58,248 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:52:58,248 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:52:58,248 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:52:58,249 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:52:58,249 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:52:58,249 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:52:58,249 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:52:58,249 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:52:58,249 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:52:58,250 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:52:58,250 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:52:58,250 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:52:58,250 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:52:58,250 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:52:58,250 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:52:58,254 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:52:58,254 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:52:58,254 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:52:58,254 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:52:58,255 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:52:58,255 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:52:58,255 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:52:58,255 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:52:58,255 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:52:58,256 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:52:58,256 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:52:58,256 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:52:58,310 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:52:58,328 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:52:58,333 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:52:58,334 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:52:58,335 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:52:58,335 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/splice_false-unreach-call_false-valid-memcleanup.i [2018-11-23 12:52:58,406 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beb95c32a/5a0f13d8ecfb47d6800dc766ca230178/FLAGf37978737 [2018-11-23 12:52:58,929 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:52:58,930 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/splice_false-unreach-call_false-valid-memcleanup.i [2018-11-23 12:52:58,946 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beb95c32a/5a0f13d8ecfb47d6800dc766ca230178/FLAGf37978737 [2018-11-23 12:52:59,228 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beb95c32a/5a0f13d8ecfb47d6800dc766ca230178 [2018-11-23 12:52:59,238 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:52:59,239 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:52:59,240 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:52:59,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:52:59,244 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:52:59,250 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:52:59" (1/1) ... [2018-11-23 12:52:59,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b45ab75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:59, skipping insertion in model container [2018-11-23 12:52:59,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:52:59" (1/1) ... [2018-11-23 12:52:59,264 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:52:59,332 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:52:59,716 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:52:59,728 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:52:59,810 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:52:59,873 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:52:59,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:59 WrapperNode [2018-11-23 12:52:59,874 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:52:59,875 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:52:59,876 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:52:59,876 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:52:59,886 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:52:59" (1/1) ... [2018-11-23 12:52:59,977 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:52:59" (1/1) ... [2018-11-23 12:52:59,985 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:52:59,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:52:59,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:52:59,986 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:52:59,994 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:59" (1/1) ... [2018-11-23 12:52:59,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:59" (1/1) ... [2018-11-23 12:52:59,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:59" (1/1) ... [2018-11-23 12:52:59,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:59" (1/1) ... [2018-11-23 12:53:00,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:59" (1/1) ... [2018-11-23 12:53:00,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:59" (1/1) ... [2018-11-23 12:53:00,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:59" (1/1) ... [2018-11-23 12:53:00,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:53:00,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:53:00,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:53:00,028 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:53:00,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:59" (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:53:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:53:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:53:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 12:53:00,085 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 12:53:00,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:53:00,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:53:00,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:53:00,085 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:53:00,085 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:53:00,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:53:00,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:53:00,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:53:00,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:53:01,047 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:53:01,048 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 12:53:01,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:53:01 BoogieIcfgContainer [2018-11-23 12:53:01,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:53:01,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:53:01,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:53:01,053 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:53:01,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:52:59" (1/3) ... [2018-11-23 12:53:01,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d7808f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:53:01, skipping insertion in model container [2018-11-23 12:53:01,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:59" (2/3) ... [2018-11-23 12:53:01,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d7808f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:53:01, skipping insertion in model container [2018-11-23 12:53:01,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:53:01" (3/3) ... [2018-11-23 12:53:01,057 INFO L112 eAbstractionObserver]: Analyzing ICFG splice_false-unreach-call_false-valid-memcleanup.i [2018-11-23 12:53:01,066 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:53:01,075 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:53:01,094 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:53:01,128 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:53:01,129 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:53:01,129 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:53:01,130 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:53:01,132 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:53:01,132 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:53:01,132 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:53:01,133 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:53:01,133 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:53:01,153 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-23 12:53:01,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:53:01,160 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:01,162 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:01,165 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:01,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:01,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1069133742, now seen corresponding path program 1 times [2018-11-23 12:53:01,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:01,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:01,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:01,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:01,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:01,322 INFO L256 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2018-11-23 12:53:01,326 INFO L273 TraceCheckUtils]: 1: Hoare triple {39#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39#true} is VALID [2018-11-23 12:53:01,327 INFO L273 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-23 12:53:01,328 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #112#return; {39#true} is VALID [2018-11-23 12:53:01,328 INFO L256 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret11 := main(); {39#true} is VALID [2018-11-23 12:53:01,328 INFO L273 TraceCheckUtils]: 5: Hoare triple {39#true} ~flag~0 := 1;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {39#true} is VALID [2018-11-23 12:53:01,328 INFO L273 TraceCheckUtils]: 6: Hoare triple {39#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {39#true} is VALID [2018-11-23 12:53:01,329 INFO L273 TraceCheckUtils]: 7: Hoare triple {39#true} havoc ~t~0.base, ~t~0.offset;havoc ~l1~0.base, ~l1~0.offset;havoc ~l2~0.base, ~l2~0.offset;havoc ~b~0.base, ~b~0.offset;havoc ~u~0.base, ~u~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {39#true} is VALID [2018-11-23 12:53:01,330 INFO L273 TraceCheckUtils]: 8: Hoare triple {39#true} assume !true; {40#false} is VALID [2018-11-23 12:53:01,330 INFO L273 TraceCheckUtils]: 9: Hoare triple {40#false} call write~int(3, ~p~0.base, ~p~0.offset, 4);call #t~mem4 := read~int(~a~0.base, ~a~0.offset, 4); {40#false} is VALID [2018-11-23 12:53:01,330 INFO L273 TraceCheckUtils]: 10: Hoare triple {40#false} assume !(3 == #t~mem4);havoc #t~mem4;~flag~0 := 1;~l1~0.base, ~l1~0.offset := 0, 0;~l2~0.base, ~l2~0.offset := 0, 0;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {40#false} is VALID [2018-11-23 12:53:01,331 INFO L273 TraceCheckUtils]: 11: Hoare triple {40#false} assume !true; {40#false} is VALID [2018-11-23 12:53:01,331 INFO L273 TraceCheckUtils]: 12: Hoare triple {40#false} ~p~0.base, ~p~0.offset := ~l1~0.base, ~l1~0.offset; {40#false} is VALID [2018-11-23 12:53:01,331 INFO L273 TraceCheckUtils]: 13: Hoare triple {40#false} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {40#false} is VALID [2018-11-23 12:53:01,332 INFO L273 TraceCheckUtils]: 14: Hoare triple {40#false} assume 2 != #t~mem7;havoc #t~mem7; {40#false} is VALID [2018-11-23 12:53:01,332 INFO L273 TraceCheckUtils]: 15: Hoare triple {40#false} assume !false; {40#false} is VALID [2018-11-23 12:53:01,336 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:53:01,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:01,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:53:01,344 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 12:53:01,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:01,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:53:01,434 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:01,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:53:01,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:53:01,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:53:01,446 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-11-23 12:53:01,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:01,820 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2018-11-23 12:53:01,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:53:01,821 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 12:53:01,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:01,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:53:01,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 77 transitions. [2018-11-23 12:53:01,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:53:01,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 77 transitions. [2018-11-23 12:53:01,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 77 transitions. [2018-11-23 12:53:02,267 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:02,281 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:53:02,281 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 12:53:02,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:53:02,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 12:53:02,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 12:53:02,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:02,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-23 12:53:02,335 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 12:53:02,335 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 12:53:02,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:02,339 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2018-11-23 12:53:02,339 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2018-11-23 12:53:02,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:02,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:02,340 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 12:53:02,340 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 12:53:02,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:02,345 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2018-11-23 12:53:02,345 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2018-11-23 12:53:02,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:02,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:02,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:02,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:02,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:53:02,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-11-23 12:53:02,351 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 16 [2018-11-23 12:53:02,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:02,351 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-11-23 12:53:02,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:53:02,351 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2018-11-23 12:53:02,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:53:02,352 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:02,353 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:02,353 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:02,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:02,353 INFO L82 PathProgramCache]: Analyzing trace with hash 764108808, now seen corresponding path program 1 times [2018-11-23 12:53:02,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:02,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:02,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:02,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:02,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:02,615 INFO L256 TraceCheckUtils]: 0: Hoare triple {204#true} call ULTIMATE.init(); {204#true} is VALID [2018-11-23 12:53:02,616 INFO L273 TraceCheckUtils]: 1: Hoare triple {204#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {204#true} is VALID [2018-11-23 12:53:02,616 INFO L273 TraceCheckUtils]: 2: Hoare triple {204#true} assume true; {204#true} is VALID [2018-11-23 12:53:02,617 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {204#true} {204#true} #112#return; {204#true} is VALID [2018-11-23 12:53:02,617 INFO L256 TraceCheckUtils]: 4: Hoare triple {204#true} call #t~ret11 := main(); {204#true} is VALID [2018-11-23 12:53:02,618 INFO L273 TraceCheckUtils]: 5: Hoare triple {204#true} ~flag~0 := 1;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {204#true} is VALID [2018-11-23 12:53:02,618 INFO L273 TraceCheckUtils]: 6: Hoare triple {204#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {204#true} is VALID [2018-11-23 12:53:02,618 INFO L273 TraceCheckUtils]: 7: Hoare triple {204#true} havoc ~t~0.base, ~t~0.offset;havoc ~l1~0.base, ~l1~0.offset;havoc ~l2~0.base, ~l2~0.offset;havoc ~b~0.base, ~b~0.offset;havoc ~u~0.base, ~u~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {204#true} is VALID [2018-11-23 12:53:02,619 INFO L273 TraceCheckUtils]: 8: Hoare triple {204#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {204#true} is VALID [2018-11-23 12:53:02,619 INFO L273 TraceCheckUtils]: 9: Hoare triple {204#true} assume !(0 != #t~nondet1);havoc #t~nondet1; {204#true} is VALID [2018-11-23 12:53:02,619 INFO L273 TraceCheckUtils]: 10: Hoare triple {204#true} call write~int(3, ~p~0.base, ~p~0.offset, 4);call #t~mem4 := read~int(~a~0.base, ~a~0.offset, 4); {204#true} is VALID [2018-11-23 12:53:02,623 INFO L273 TraceCheckUtils]: 11: Hoare triple {204#true} assume !(3 == #t~mem4);havoc #t~mem4;~flag~0 := 1;~l1~0.base, ~l1~0.offset := 0, 0;~l2~0.base, ~l2~0.offset := 0, 0;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {206#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} is VALID [2018-11-23 12:53:02,623 INFO L273 TraceCheckUtils]: 12: Hoare triple {206#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); {206#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} is VALID [2018-11-23 12:53:02,630 INFO L273 TraceCheckUtils]: 13: Hoare triple {206#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} assume !(3 != #t~mem5);havoc #t~mem5; {206#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} is VALID [2018-11-23 12:53:02,635 INFO L273 TraceCheckUtils]: 14: Hoare triple {206#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} ~p~0.base, ~p~0.offset := ~l1~0.base, ~l1~0.offset; {207#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} is VALID [2018-11-23 12:53:02,636 INFO L273 TraceCheckUtils]: 15: Hoare triple {207#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {205#false} is VALID [2018-11-23 12:53:02,636 INFO L273 TraceCheckUtils]: 16: Hoare triple {205#false} assume 2 != #t~mem7;havoc #t~mem7; {205#false} is VALID [2018-11-23 12:53:02,636 INFO L273 TraceCheckUtils]: 17: Hoare triple {205#false} assume !false; {205#false} is VALID [2018-11-23 12:53:02,642 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:53:02,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:02,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:53:02,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 12:53:02,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:02,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:53:02,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:02,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:53:02,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:53:02,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:53:02,872 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 4 states. [2018-11-23 12:53:03,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:03,271 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2018-11-23 12:53:03,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:53:03,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 12:53:03,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:03,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:53:03,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2018-11-23 12:53:03,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:53:03,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2018-11-23 12:53:03,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2018-11-23 12:53:03,368 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:03,371 INFO L225 Difference]: With dead ends: 44 [2018-11-23 12:53:03,371 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 12:53:03,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:53:03,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 12:53:03,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2018-11-23 12:53:03,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:03,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 32 states. [2018-11-23 12:53:03,427 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 32 states. [2018-11-23 12:53:03,428 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 32 states. [2018-11-23 12:53:03,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:03,431 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2018-11-23 12:53:03,431 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-23 12:53:03,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:03,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:03,432 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 37 states. [2018-11-23 12:53:03,433 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 37 states. [2018-11-23 12:53:03,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:03,436 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2018-11-23 12:53:03,436 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-23 12:53:03,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:03,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:03,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:03,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:03,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:53:03,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2018-11-23 12:53:03,440 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 18 [2018-11-23 12:53:03,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:03,441 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2018-11-23 12:53:03,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:53:03,441 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2018-11-23 12:53:03,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:53:03,442 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:03,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:03,444 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:03,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:03,444 INFO L82 PathProgramCache]: Analyzing trace with hash -132517795, now seen corresponding path program 1 times [2018-11-23 12:53:03,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:03,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:03,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:03,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:03,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:03,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:03,578 INFO L256 TraceCheckUtils]: 0: Hoare triple {389#true} call ULTIMATE.init(); {389#true} is VALID [2018-11-23 12:53:03,578 INFO L273 TraceCheckUtils]: 1: Hoare triple {389#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {389#true} is VALID [2018-11-23 12:53:03,579 INFO L273 TraceCheckUtils]: 2: Hoare triple {389#true} assume true; {389#true} is VALID [2018-11-23 12:53:03,579 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {389#true} {389#true} #112#return; {389#true} is VALID [2018-11-23 12:53:03,579 INFO L256 TraceCheckUtils]: 4: Hoare triple {389#true} call #t~ret11 := main(); {389#true} is VALID [2018-11-23 12:53:03,580 INFO L273 TraceCheckUtils]: 5: Hoare triple {389#true} ~flag~0 := 1;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {389#true} is VALID [2018-11-23 12:53:03,580 INFO L273 TraceCheckUtils]: 6: Hoare triple {389#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {389#true} is VALID [2018-11-23 12:53:03,580 INFO L273 TraceCheckUtils]: 7: Hoare triple {389#true} havoc ~t~0.base, ~t~0.offset;havoc ~l1~0.base, ~l1~0.offset;havoc ~l2~0.base, ~l2~0.offset;havoc ~b~0.base, ~b~0.offset;havoc ~u~0.base, ~u~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {389#true} is VALID [2018-11-23 12:53:03,580 INFO L273 TraceCheckUtils]: 8: Hoare triple {389#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {389#true} is VALID [2018-11-23 12:53:03,581 INFO L273 TraceCheckUtils]: 9: Hoare triple {389#true} assume !(0 != #t~nondet1);havoc #t~nondet1; {389#true} is VALID [2018-11-23 12:53:03,581 INFO L273 TraceCheckUtils]: 10: Hoare triple {389#true} call write~int(3, ~p~0.base, ~p~0.offset, 4);call #t~mem4 := read~int(~a~0.base, ~a~0.offset, 4); {389#true} is VALID [2018-11-23 12:53:03,586 INFO L273 TraceCheckUtils]: 11: Hoare triple {389#true} assume !(3 == #t~mem4);havoc #t~mem4;~flag~0 := 1;~l1~0.base, ~l1~0.offset := 0, 0;~l2~0.base, ~l2~0.offset := 0, 0;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {391#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} is VALID [2018-11-23 12:53:03,588 INFO L273 TraceCheckUtils]: 12: Hoare triple {391#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); {391#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} is VALID [2018-11-23 12:53:03,588 INFO L273 TraceCheckUtils]: 13: Hoare triple {391#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} assume !(3 != #t~mem5);havoc #t~mem5; {391#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} is VALID [2018-11-23 12:53:03,590 INFO L273 TraceCheckUtils]: 14: Hoare triple {391#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} ~p~0.base, ~p~0.offset := ~l1~0.base, ~l1~0.offset; {391#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} is VALID [2018-11-23 12:53:03,592 INFO L273 TraceCheckUtils]: 15: Hoare triple {391#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} assume !(~p~0.base != 0 || ~p~0.offset != 0); {391#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} is VALID [2018-11-23 12:53:03,592 INFO L273 TraceCheckUtils]: 16: Hoare triple {391#(and (= 0 main_~l2~0.offset) (= 0 main_~l2~0.base))} ~p~0.base, ~p~0.offset := ~l2~0.base, ~l2~0.offset; {392#(and (= main_~p~0.base 0) (= main_~p~0.offset 0))} is VALID [2018-11-23 12:53:03,598 INFO L273 TraceCheckUtils]: 17: Hoare triple {392#(and (= main_~p~0.base 0) (= main_~p~0.offset 0))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {390#false} is VALID [2018-11-23 12:53:03,598 INFO L273 TraceCheckUtils]: 18: Hoare triple {390#false} assume 1 != #t~mem9;havoc #t~mem9; {390#false} is VALID [2018-11-23 12:53:03,599 INFO L273 TraceCheckUtils]: 19: Hoare triple {390#false} assume !false; {390#false} is VALID [2018-11-23 12:53:03,600 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:53:03,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:03,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:53:03,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-23 12:53:03,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:03,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:53:03,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:03,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:53:03,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:53:03,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:53:03,632 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 4 states. [2018-11-23 12:53:03,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:03,971 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2018-11-23 12:53:03,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:53:03,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-23 12:53:03,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:03,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:53:03,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2018-11-23 12:53:03,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:53:03,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2018-11-23 12:53:03,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2018-11-23 12:53:04,081 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:04,083 INFO L225 Difference]: With dead ends: 51 [2018-11-23 12:53:04,083 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 12:53:04,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:53:04,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 12:53:04,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-11-23 12:53:04,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:04,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 41 states. [2018-11-23 12:53:04,136 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 41 states. [2018-11-23 12:53:04,136 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 41 states. [2018-11-23 12:53:04,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:04,140 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-11-23 12:53:04,140 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2018-11-23 12:53:04,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:04,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:04,141 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 43 states. [2018-11-23 12:53:04,141 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 43 states. [2018-11-23 12:53:04,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:04,146 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-11-23 12:53:04,146 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2018-11-23 12:53:04,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:04,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:04,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:04,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:04,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:53:04,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2018-11-23 12:53:04,153 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 20 [2018-11-23 12:53:04,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:04,153 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2018-11-23 12:53:04,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:53:04,154 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2018-11-23 12:53:04,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:53:04,155 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:04,155 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:04,155 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:04,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:04,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1096605693, now seen corresponding path program 1 times [2018-11-23 12:53:04,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:04,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:04,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:04,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:04,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:04,329 INFO L256 TraceCheckUtils]: 0: Hoare triple {608#true} call ULTIMATE.init(); {608#true} is VALID [2018-11-23 12:53:04,329 INFO L273 TraceCheckUtils]: 1: Hoare triple {608#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {608#true} is VALID [2018-11-23 12:53:04,330 INFO L273 TraceCheckUtils]: 2: Hoare triple {608#true} assume true; {608#true} is VALID [2018-11-23 12:53:04,330 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {608#true} {608#true} #112#return; {608#true} is VALID [2018-11-23 12:53:04,330 INFO L256 TraceCheckUtils]: 4: Hoare triple {608#true} call #t~ret11 := main(); {608#true} is VALID [2018-11-23 12:53:04,330 INFO L273 TraceCheckUtils]: 5: Hoare triple {608#true} ~flag~0 := 1;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {608#true} is VALID [2018-11-23 12:53:04,331 INFO L273 TraceCheckUtils]: 6: Hoare triple {608#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {608#true} is VALID [2018-11-23 12:53:04,331 INFO L273 TraceCheckUtils]: 7: Hoare triple {608#true} havoc ~t~0.base, ~t~0.offset;havoc ~l1~0.base, ~l1~0.offset;havoc ~l2~0.base, ~l2~0.offset;havoc ~b~0.base, ~b~0.offset;havoc ~u~0.base, ~u~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {610#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:04,333 INFO L273 TraceCheckUtils]: 8: Hoare triple {610#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {610#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:04,337 INFO L273 TraceCheckUtils]: 9: Hoare triple {610#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {610#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:53:04,338 INFO L273 TraceCheckUtils]: 10: Hoare triple {610#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~int(3, ~p~0.base, ~p~0.offset, 4);call #t~mem4 := read~int(~a~0.base, ~a~0.offset, 4); {611#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-23 12:53:04,339 INFO L273 TraceCheckUtils]: 11: Hoare triple {611#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} assume !(3 == #t~mem4);havoc #t~mem4;~flag~0 := 1;~l1~0.base, ~l1~0.offset := 0, 0;~l2~0.base, ~l2~0.offset := 0, 0;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {612#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:53:04,340 INFO L273 TraceCheckUtils]: 12: Hoare triple {612#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); {613#(= |main_#t~mem5| 3)} is VALID [2018-11-23 12:53:04,340 INFO L273 TraceCheckUtils]: 13: Hoare triple {613#(= |main_#t~mem5| 3)} assume !!(3 != #t~mem5);havoc #t~mem5;~t~0.base, ~t~0.offset := ~p~0.base, ~p~0.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {609#false} is VALID [2018-11-23 12:53:04,341 INFO L273 TraceCheckUtils]: 14: Hoare triple {609#false} assume 0 != ~flag~0;call write~$Pointer$(~l1~0.base, ~l1~0.offset, ~t~0.base, 4 + ~t~0.offset, 4);~l1~0.base, ~l1~0.offset := ~t~0.base, ~t~0.offset;~flag~0 := 0; {609#false} is VALID [2018-11-23 12:53:04,341 INFO L273 TraceCheckUtils]: 15: Hoare triple {609#false} call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); {609#false} is VALID [2018-11-23 12:53:04,341 INFO L273 TraceCheckUtils]: 16: Hoare triple {609#false} assume !(3 != #t~mem5);havoc #t~mem5; {609#false} is VALID [2018-11-23 12:53:04,341 INFO L273 TraceCheckUtils]: 17: Hoare triple {609#false} ~p~0.base, ~p~0.offset := ~l1~0.base, ~l1~0.offset; {609#false} is VALID [2018-11-23 12:53:04,342 INFO L273 TraceCheckUtils]: 18: Hoare triple {609#false} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {609#false} is VALID [2018-11-23 12:53:04,342 INFO L273 TraceCheckUtils]: 19: Hoare triple {609#false} assume 2 != #t~mem7;havoc #t~mem7; {609#false} is VALID [2018-11-23 12:53:04,342 INFO L273 TraceCheckUtils]: 20: Hoare triple {609#false} assume !false; {609#false} is VALID [2018-11-23 12:53:04,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:04,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:04,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:53:04,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 12:53:04,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:04,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:53:04,376 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:04,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:53:04,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:53:04,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:53:04,377 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand 6 states. [2018-11-23 12:53:04,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:04,855 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2018-11-23 12:53:04,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:53:04,856 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 12:53:04,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:04,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:53:04,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2018-11-23 12:53:04,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:53:04,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2018-11-23 12:53:04,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 62 transitions. [2018-11-23 12:53:05,016 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:05,019 INFO L225 Difference]: With dead ends: 74 [2018-11-23 12:53:05,019 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 12:53:05,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:53:05,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 12:53:05,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-11-23 12:53:05,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:05,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 43 states. [2018-11-23 12:53:05,065 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 43 states. [2018-11-23 12:53:05,065 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 43 states. [2018-11-23 12:53:05,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:05,068 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2018-11-23 12:53:05,068 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2018-11-23 12:53:05,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:05,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:05,069 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 47 states. [2018-11-23 12:53:05,069 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 47 states. [2018-11-23 12:53:05,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:05,074 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2018-11-23 12:53:05,074 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2018-11-23 12:53:05,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:05,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:05,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:05,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:05,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:53:05,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2018-11-23 12:53:05,078 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 21 [2018-11-23 12:53:05,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:05,078 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2018-11-23 12:53:05,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:53:05,078 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2018-11-23 12:53:05,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:53:05,079 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:05,079 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:05,080 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:05,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:05,080 INFO L82 PathProgramCache]: Analyzing trace with hash -803094924, now seen corresponding path program 1 times [2018-11-23 12:53:05,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:05,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:05,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:05,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:05,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:05,144 INFO L256 TraceCheckUtils]: 0: Hoare triple {870#true} call ULTIMATE.init(); {870#true} is VALID [2018-11-23 12:53:05,144 INFO L273 TraceCheckUtils]: 1: Hoare triple {870#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {870#true} is VALID [2018-11-23 12:53:05,144 INFO L273 TraceCheckUtils]: 2: Hoare triple {870#true} assume true; {870#true} is VALID [2018-11-23 12:53:05,145 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {870#true} {870#true} #112#return; {870#true} is VALID [2018-11-23 12:53:05,145 INFO L256 TraceCheckUtils]: 4: Hoare triple {870#true} call #t~ret11 := main(); {870#true} is VALID [2018-11-23 12:53:05,146 INFO L273 TraceCheckUtils]: 5: Hoare triple {870#true} ~flag~0 := 1;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {872#(= main_~flag~0 1)} is VALID [2018-11-23 12:53:05,146 INFO L273 TraceCheckUtils]: 6: Hoare triple {872#(= main_~flag~0 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {872#(= main_~flag~0 1)} is VALID [2018-11-23 12:53:05,149 INFO L273 TraceCheckUtils]: 7: Hoare triple {872#(= main_~flag~0 1)} havoc ~t~0.base, ~t~0.offset;havoc ~l1~0.base, ~l1~0.offset;havoc ~l2~0.base, ~l2~0.offset;havoc ~b~0.base, ~b~0.offset;havoc ~u~0.base, ~u~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {872#(= main_~flag~0 1)} is VALID [2018-11-23 12:53:05,149 INFO L273 TraceCheckUtils]: 8: Hoare triple {872#(= main_~flag~0 1)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {872#(= main_~flag~0 1)} is VALID [2018-11-23 12:53:05,150 INFO L273 TraceCheckUtils]: 9: Hoare triple {872#(= main_~flag~0 1)} assume !!(0 != #t~nondet1);havoc #t~nondet1; {872#(= main_~flag~0 1)} is VALID [2018-11-23 12:53:05,151 INFO L273 TraceCheckUtils]: 10: Hoare triple {872#(= main_~flag~0 1)} assume !(0 != ~flag~0);call write~int(2, ~p~0.base, ~p~0.offset, 4);~flag~0 := 1; {871#false} is VALID [2018-11-23 12:53:05,151 INFO L273 TraceCheckUtils]: 11: Hoare triple {871#false} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; {871#false} is VALID [2018-11-23 12:53:05,152 INFO L273 TraceCheckUtils]: 12: Hoare triple {871#false} assume !(~t~0.base == 0 && ~t~0.offset == 0); {871#false} is VALID [2018-11-23 12:53:05,152 INFO L273 TraceCheckUtils]: 13: Hoare triple {871#false} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {871#false} is VALID [2018-11-23 12:53:05,153 INFO L273 TraceCheckUtils]: 14: Hoare triple {871#false} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {871#false} is VALID [2018-11-23 12:53:05,154 INFO L273 TraceCheckUtils]: 15: Hoare triple {871#false} assume !(0 != #t~nondet1);havoc #t~nondet1; {871#false} is VALID [2018-11-23 12:53:05,154 INFO L273 TraceCheckUtils]: 16: Hoare triple {871#false} call write~int(3, ~p~0.base, ~p~0.offset, 4);call #t~mem4 := read~int(~a~0.base, ~a~0.offset, 4); {871#false} is VALID [2018-11-23 12:53:05,154 INFO L273 TraceCheckUtils]: 17: Hoare triple {871#false} assume !(3 == #t~mem4);havoc #t~mem4;~flag~0 := 1;~l1~0.base, ~l1~0.offset := 0, 0;~l2~0.base, ~l2~0.offset := 0, 0;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {871#false} is VALID [2018-11-23 12:53:05,155 INFO L273 TraceCheckUtils]: 18: Hoare triple {871#false} call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); {871#false} is VALID [2018-11-23 12:53:05,155 INFO L273 TraceCheckUtils]: 19: Hoare triple {871#false} assume !!(3 != #t~mem5);havoc #t~mem5;~t~0.base, ~t~0.offset := ~p~0.base, ~p~0.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {871#false} is VALID [2018-11-23 12:53:05,155 INFO L273 TraceCheckUtils]: 20: Hoare triple {871#false} assume 0 != ~flag~0;call write~$Pointer$(~l1~0.base, ~l1~0.offset, ~t~0.base, 4 + ~t~0.offset, 4);~l1~0.base, ~l1~0.offset := ~t~0.base, ~t~0.offset;~flag~0 := 0; {871#false} is VALID [2018-11-23 12:53:05,156 INFO L273 TraceCheckUtils]: 21: Hoare triple {871#false} call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); {871#false} is VALID [2018-11-23 12:53:05,156 INFO L273 TraceCheckUtils]: 22: Hoare triple {871#false} assume !(3 != #t~mem5);havoc #t~mem5; {871#false} is VALID [2018-11-23 12:53:05,156 INFO L273 TraceCheckUtils]: 23: Hoare triple {871#false} ~p~0.base, ~p~0.offset := ~l1~0.base, ~l1~0.offset; {871#false} is VALID [2018-11-23 12:53:05,157 INFO L273 TraceCheckUtils]: 24: Hoare triple {871#false} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {871#false} is VALID [2018-11-23 12:53:05,157 INFO L273 TraceCheckUtils]: 25: Hoare triple {871#false} assume 2 != #t~mem7;havoc #t~mem7; {871#false} is VALID [2018-11-23 12:53:05,157 INFO L273 TraceCheckUtils]: 26: Hoare triple {871#false} assume !false; {871#false} is VALID [2018-11-23 12:53:05,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:53:05,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:05,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:53:05,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:53:05,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:05,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:53:05,203 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:05,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:53:05,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:53:05,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:53:05,204 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand 3 states. [2018-11-23 12:53:05,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:05,415 INFO L93 Difference]: Finished difference Result 90 states and 118 transitions. [2018-11-23 12:53:05,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:53:05,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:53:05,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:05,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:53:05,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2018-11-23 12:53:05,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:53:05,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2018-11-23 12:53:05,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 83 transitions. [2018-11-23 12:53:05,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:05,578 INFO L225 Difference]: With dead ends: 90 [2018-11-23 12:53:05,579 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:53:05,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:53:05,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:53:05,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2018-11-23 12:53:05,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:05,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 47 states. [2018-11-23 12:53:05,606 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 47 states. [2018-11-23 12:53:05,606 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 47 states. [2018-11-23 12:53:05,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:05,609 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2018-11-23 12:53:05,610 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2018-11-23 12:53:05,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:05,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:05,611 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 57 states. [2018-11-23 12:53:05,611 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 57 states. [2018-11-23 12:53:05,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:05,614 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2018-11-23 12:53:05,614 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2018-11-23 12:53:05,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:05,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:05,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:05,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:05,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:53:05,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2018-11-23 12:53:05,617 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 27 [2018-11-23 12:53:05,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:05,618 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2018-11-23 12:53:05,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:53:05,618 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2018-11-23 12:53:05,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:53:05,619 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:05,619 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:05,619 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:05,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:05,620 INFO L82 PathProgramCache]: Analyzing trace with hash 785252978, now seen corresponding path program 1 times [2018-11-23 12:53:05,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:05,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:05,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:05,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:05,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:53:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:53:05,724 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=16, |#NULL.offset|=10, |old(#NULL.base)|=16, |old(#NULL.offset)|=10] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=16, |old(#NULL.offset)|=10] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=16, |old(#NULL.offset)|=10] [?] RET #112#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret11 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~flag~0 := 1;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0] [?] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0] [?] havoc ~t~0.base, ~t~0.offset;havoc ~l1~0.base, ~l1~0.offset;havoc ~l2~0.base, ~l2~0.offset;havoc ~b~0.base, ~b~0.offset;havoc ~u~0.base, ~u~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=1, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=1, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=1] [?] assume !!(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=1, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0] [?] assume 0 != ~flag~0;call write~int(1, ~p~0.base, ~p~0.offset, 4);~flag~0 := 0; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0] [?] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] call write~int(3, ~p~0.base, ~p~0.offset, 4);call #t~mem4 := read~int(~a~0.base, ~a~0.offset, 4); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem4|=1] [?] assume !(3 == #t~mem4);havoc #t~mem4;~flag~0 := 1;~l1~0.base, ~l1~0.offset := 0, 0;~l2~0.base, ~l2~0.offset := 0, 0;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=1, main_~l1~0.base=0, main_~l1~0.offset=0, main_~l2~0.base=0, main_~l2~0.offset=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=1, main_~l1~0.base=0, main_~l1~0.offset=0, main_~l2~0.base=0, main_~l2~0.offset=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem5|=1] [?] assume !!(3 != #t~mem5);havoc #t~mem5;~t~0.base, ~t~0.offset := ~p~0.base, ~p~0.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=1, main_~l1~0.base=0, main_~l1~0.offset=0, main_~l2~0.base=0, main_~l2~0.offset=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=14, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume 0 != ~flag~0;call write~$Pointer$(~l1~0.base, ~l1~0.offset, ~t~0.base, 4 + ~t~0.offset, 4);~l1~0.base, ~l1~0.offset := ~t~0.base, ~t~0.offset;~flag~0 := 0; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~l1~0.base=14, main_~l1~0.offset=0, main_~l2~0.base=0, main_~l2~0.offset=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=14, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~l1~0.base=14, main_~l1~0.offset=0, main_~l2~0.base=0, main_~l2~0.offset=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=14, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem5|=3] [?] assume !(3 != #t~mem5);havoc #t~mem5; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~l1~0.base=14, main_~l1~0.offset=0, main_~l2~0.base=0, main_~l2~0.offset=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=14, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] ~p~0.base, ~p~0.offset := ~l1~0.base, ~l1~0.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~l1~0.base=14, main_~l1~0.offset=0, main_~l2~0.base=0, main_~l2~0.offset=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=14, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~l1~0.base=14, main_~l1~0.offset=0, main_~l2~0.base=0, main_~l2~0.offset=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=14, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem7|=1] [?] assume 2 != #t~mem7;havoc #t~mem7; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~l1~0.base=14, main_~l1~0.offset=0, main_~l2~0.base=0, main_~l2~0.offset=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=14, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume !false; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~l1~0.base=14, main_~l1~0.offset=0, main_~l2~0.base=0, main_~l2~0.offset=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=14, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=16, #NULL.offset=10, old(#NULL.base)=16, old(#NULL.offset)=10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] ~flag~0 := 1; [L628] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L628] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1] [L629] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1] [L630] havoc ~t~0.base, ~t~0.offset; [L631] havoc ~l1~0.base, ~l1~0.offset; [L632] havoc ~l2~0.base, ~l2~0.offset; [L633] havoc ~b~0.base, ~b~0.offset; [L634] havoc ~u~0.base, ~u~0.offset; [L635] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0] [L636] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~nondet1=1, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0] [L636-L648] assume !!(0 != #t~nondet1); [L636] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0] [L637-L643] assume 0 != ~flag~0; [L638] call write~int(1, ~p~0.base, ~p~0.offset, 4); [L639] ~flag~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L644] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L644] ~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L645] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L646] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L647] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L647] ~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset; [L647] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L636] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~nondet1=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L636-L648] assume !(0 != #t~nondet1); [L636] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L649] call write~int(3, ~p~0.base, ~p~0.offset, 4); [L650] call #t~mem4 := read~int(~a~0.base, ~a~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem4=1, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L650] assume !(3 == #t~mem4); [L650] havoc #t~mem4; [L651] ~flag~0 := 1; [L652] ~l1~0.base, ~l1~0.offset := 0, 0; [L653] ~l2~0.base, ~l2~0.offset := 0, 0; [L654] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~l1~0.base=0, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L655] call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem5=1, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~l1~0.base=0, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L655-L667] assume !!(3 != #t~mem5); [L655] havoc #t~mem5; [L656] ~t~0.base, ~t~0.offset := ~p~0.base, ~p~0.offset; [L657] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L657] ~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset; [L657] havoc #t~mem6.base, #t~mem6.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~l1~0.base=0, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=14, ~t~0.offset=0] [L658-L666] assume 0 != ~flag~0; [L659] call write~$Pointer$(~l1~0.base, ~l1~0.offset, ~t~0.base, 4 + ~t~0.offset, 4); [L660] ~l1~0.base, ~l1~0.offset := ~t~0.base, ~t~0.offset; [L661] ~flag~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~l1~0.base=14, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=14, ~t~0.offset=0] [L655] call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem5=3, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~l1~0.base=14, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=14, ~t~0.offset=0] [L655-L667] assume !(3 != #t~mem5); [L655] havoc #t~mem5; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~l1~0.base=14, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=14, ~t~0.offset=0] [L668] ~p~0.base, ~p~0.offset := ~l1~0.base, ~l1~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~l1~0.base=14, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=14, ~t~0.offset=0] [L669-L672] assume !!(~p~0.base != 0 || ~p~0.offset != 0); [L670] call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem7=1, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~l1~0.base=14, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=14, ~t~0.offset=0] [L670] assume 2 != #t~mem7; [L670] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~l1~0.base=14, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=14, ~t~0.offset=0] [L679] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~l1~0.base=14, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=14, ~t~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=16, #NULL.offset=10, old(#NULL.base)=16, old(#NULL.offset)=10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] ~flag~0 := 1; [L628] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L628] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1] [L629] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1] [L630] havoc ~t~0.base, ~t~0.offset; [L631] havoc ~l1~0.base, ~l1~0.offset; [L632] havoc ~l2~0.base, ~l2~0.offset; [L633] havoc ~b~0.base, ~b~0.offset; [L634] havoc ~u~0.base, ~u~0.offset; [L635] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0] [L636] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~nondet1=1, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0] [L636-L648] assume !!(0 != #t~nondet1); [L636] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0] [L637-L643] assume 0 != ~flag~0; [L638] call write~int(1, ~p~0.base, ~p~0.offset, 4); [L639] ~flag~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L644] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L644] ~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L645] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L646] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L647] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L647] ~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset; [L647] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L636] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~nondet1=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L636-L648] assume !(0 != #t~nondet1); [L636] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L649] call write~int(3, ~p~0.base, ~p~0.offset, 4); [L650] call #t~mem4 := read~int(~a~0.base, ~a~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem4=1, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L650] assume !(3 == #t~mem4); [L650] havoc #t~mem4; [L651] ~flag~0 := 1; [L652] ~l1~0.base, ~l1~0.offset := 0, 0; [L653] ~l2~0.base, ~l2~0.offset := 0, 0; [L654] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~l1~0.base=0, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L655] call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem5=1, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~l1~0.base=0, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L655-L667] assume !!(3 != #t~mem5); [L655] havoc #t~mem5; [L656] ~t~0.base, ~t~0.offset := ~p~0.base, ~p~0.offset; [L657] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L657] ~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset; [L657] havoc #t~mem6.base, #t~mem6.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~l1~0.base=0, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=14, ~t~0.offset=0] [L658-L666] assume 0 != ~flag~0; [L659] call write~$Pointer$(~l1~0.base, ~l1~0.offset, ~t~0.base, 4 + ~t~0.offset, 4); [L660] ~l1~0.base, ~l1~0.offset := ~t~0.base, ~t~0.offset; [L661] ~flag~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~l1~0.base=14, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=14, ~t~0.offset=0] [L655] call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem5=3, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~l1~0.base=14, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=14, ~t~0.offset=0] [L655-L667] assume !(3 != #t~mem5); [L655] havoc #t~mem5; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~l1~0.base=14, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=14, ~t~0.offset=0] [L668] ~p~0.base, ~p~0.offset := ~l1~0.base, ~l1~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~l1~0.base=14, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=14, ~t~0.offset=0] [L669-L672] assume !!(~p~0.base != 0 || ~p~0.offset != 0); [L670] call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem7=1, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~l1~0.base=14, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=14, ~t~0.offset=0] [L670] assume 2 != #t~mem7; [L670] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~l1~0.base=14, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=14, ~t~0.offset=0] [L679] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~l1~0.base=14, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=14, ~t~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] ~flag~0 := 1; [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1] [L629] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1] [L630] havoc ~t~0; [L631] havoc ~l1~0; [L632] havoc ~l2~0; [L633] havoc ~b~0; [L634] havoc ~u~0; [L635] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L636] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L636-L648] COND FALSE !(!(0 != #t~nondet1)) [L636] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L637-L643] COND TRUE 0 != ~flag~0 [L638] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L639] ~flag~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L644] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L644] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L645] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L646] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L647] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L647] ~p~0 := #t~mem3; [L647] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L636] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L636-L648] COND TRUE !(0 != #t~nondet1) [L636] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L650] FCALL call #t~mem4 := read~int({ base: ~a~0!base, offset: ~a~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem4=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L650] COND FALSE !(3 == #t~mem4) [L650] havoc #t~mem4; [L651] ~flag~0 := 1; [L652] ~l1~0 := { base: 0, offset: 0 }; [L653] ~l2~0 := { base: 0, offset: 0 }; [L654] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~l1~0!base=0, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L655] FCALL call #t~mem5 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~l1~0!base=0, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L655-L667] COND FALSE !(!(3 != #t~mem5)) [L655] havoc #t~mem5; [L656] ~t~0 := ~p~0; [L657] FCALL call #t~mem6 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L657] ~p~0 := #t~mem6; [L657] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~l1~0!base=0, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L658-L666] COND TRUE 0 != ~flag~0 [L659] FCALL call write~$Pointer$(~l1~0, { base: ~t~0!base, offset: 4 + ~t~0!offset }, 4); [L660] ~l1~0 := ~t~0; [L661] ~flag~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L655] FCALL call #t~mem5 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5=3, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L655-L667] COND TRUE !(3 != #t~mem5) [L655] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L668] ~p~0 := ~l1~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L669-L672] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L670] FCALL call #t~mem7 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem7=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L670] COND TRUE 2 != #t~mem7 [L670] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L679] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] ~flag~0 := 1; [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1] [L629] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1] [L630] havoc ~t~0; [L631] havoc ~l1~0; [L632] havoc ~l2~0; [L633] havoc ~b~0; [L634] havoc ~u~0; [L635] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L636] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L636-L648] COND FALSE !(!(0 != #t~nondet1)) [L636] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L637-L643] COND TRUE 0 != ~flag~0 [L638] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L639] ~flag~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L644] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L644] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L645] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L646] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L647] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L647] ~p~0 := #t~mem3; [L647] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L636] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L636-L648] COND TRUE !(0 != #t~nondet1) [L636] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L650] FCALL call #t~mem4 := read~int({ base: ~a~0!base, offset: ~a~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem4=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L650] COND FALSE !(3 == #t~mem4) [L650] havoc #t~mem4; [L651] ~flag~0 := 1; [L652] ~l1~0 := { base: 0, offset: 0 }; [L653] ~l2~0 := { base: 0, offset: 0 }; [L654] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~l1~0!base=0, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L655] FCALL call #t~mem5 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~l1~0!base=0, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L655-L667] COND FALSE !(!(3 != #t~mem5)) [L655] havoc #t~mem5; [L656] ~t~0 := ~p~0; [L657] FCALL call #t~mem6 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L657] ~p~0 := #t~mem6; [L657] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~l1~0!base=0, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L658-L666] COND TRUE 0 != ~flag~0 [L659] FCALL call write~$Pointer$(~l1~0, { base: ~t~0!base, offset: 4 + ~t~0!offset }, 4); [L660] ~l1~0 := ~t~0; [L661] ~flag~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L655] FCALL call #t~mem5 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5=3, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L655-L667] COND TRUE !(3 != #t~mem5) [L655] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L668] ~p~0 := ~l1~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L669-L672] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L670] FCALL call #t~mem7 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem7=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L670] COND TRUE 2 != #t~mem7 [L670] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L679] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] ~flag~0 := 1; [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1] [L629] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1] [L630] havoc ~t~0; [L631] havoc ~l1~0; [L632] havoc ~l2~0; [L633] havoc ~b~0; [L634] havoc ~u~0; [L635] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L636] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L636-L648] COND FALSE !(!(0 != #t~nondet1)) [L636] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L637-L643] COND TRUE 0 != ~flag~0 [L638] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L639] ~flag~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L644] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L644] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L645] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L646] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L647] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L647] ~p~0 := #t~mem3; [L647] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L636] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L636-L648] COND TRUE !(0 != #t~nondet1) [L636] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L650] FCALL call #t~mem4 := read~int({ base: ~a~0!base, offset: ~a~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem4=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L650] COND FALSE !(3 == #t~mem4) [L650] havoc #t~mem4; [L651] ~flag~0 := 1; [L652] ~l1~0 := { base: 0, offset: 0 }; [L653] ~l2~0 := { base: 0, offset: 0 }; [L654] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~l1~0!base=0, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L655] FCALL call #t~mem5 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~l1~0!base=0, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L655-L667] COND FALSE !(!(3 != #t~mem5)) [L655] havoc #t~mem5; [L656] ~t~0 := ~p~0; [L657] FCALL call #t~mem6 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L657] ~p~0 := #t~mem6; [L657] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~l1~0!base=0, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L658-L666] COND TRUE 0 != ~flag~0 [L659] FCALL call write~$Pointer$(~l1~0, { base: ~t~0!base, offset: 4 + ~t~0!offset }, 4); [L660] ~l1~0 := ~t~0; [L661] ~flag~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L655] FCALL call #t~mem5 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5=3, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L655-L667] COND TRUE !(3 != #t~mem5) [L655] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L668] ~p~0 := ~l1~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L669-L672] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L670] FCALL call #t~mem7 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem7=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L670] COND TRUE 2 != #t~mem7 [L670] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L679] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] ~flag~0 := 1; [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1] [L629] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1] [L630] havoc ~t~0; [L631] havoc ~l1~0; [L632] havoc ~l2~0; [L633] havoc ~b~0; [L634] havoc ~u~0; [L635] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L636] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L636-L648] COND FALSE !(!(0 != #t~nondet1)) [L636] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L637-L643] COND TRUE 0 != ~flag~0 [L638] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L639] ~flag~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L644] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L644] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L645] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L646] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L647] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L647] ~p~0 := #t~mem3; [L647] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L636] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L636-L648] COND TRUE !(0 != #t~nondet1) [L636] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L650] FCALL call #t~mem4 := read~int({ base: ~a~0!base, offset: ~a~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem4=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L650] COND FALSE !(3 == #t~mem4) [L650] havoc #t~mem4; [L651] ~flag~0 := 1; [L652] ~l1~0 := { base: 0, offset: 0 }; [L653] ~l2~0 := { base: 0, offset: 0 }; [L654] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~l1~0!base=0, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L655] FCALL call #t~mem5 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~l1~0!base=0, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L655-L667] COND FALSE !(!(3 != #t~mem5)) [L655] havoc #t~mem5; [L656] ~t~0 := ~p~0; [L657] FCALL call #t~mem6 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L657] ~p~0 := #t~mem6; [L657] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~l1~0!base=0, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L658-L666] COND TRUE 0 != ~flag~0 [L659] FCALL call write~$Pointer$(~l1~0, { base: ~t~0!base, offset: 4 + ~t~0!offset }, 4); [L660] ~l1~0 := ~t~0; [L661] ~flag~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L655] FCALL call #t~mem5 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5=3, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L655-L667] COND TRUE !(3 != #t~mem5) [L655] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L668] ~p~0 := ~l1~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L669-L672] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L670] FCALL call #t~mem7 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem7=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L670] COND TRUE 2 != #t~mem7 [L670] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L679] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L627] int flag = 1; [L628] List a = (List) malloc(sizeof(struct node)); VAL [a={14:0}, flag=1, malloc(sizeof(struct node))={14:0}] [L629] COND FALSE !(a == 0) VAL [a={14:0}, flag=1, malloc(sizeof(struct node))={14:0}] [L630] List t; [L631] List l1; [L632] List l2; [L633] List b; [L634] List u; [L635] List p = a; VAL [a={14:0}, flag=1, malloc(sizeof(struct node))={14:0}, p={14:0}] [L636] COND TRUE __VERIFIER_nondet_int() [L637] COND TRUE \read(flag) [L638] p->h = 1 [L639] flag = 0 VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, p={14:0}] [L644] t = (List) malloc(sizeof(struct node)) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, t={17:0}] [L645] COND FALSE !(t == 0) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, t={17:0}] [L646] p->n = t [L647] EXPR p->n [L647] p = p->n [L636] COND FALSE !(__VERIFIER_nondet_int()) [L649] p->h = 3 [L650] EXPR a->h VAL [a={14:0}, a->h=1, flag=0, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={17:0}, t={17:0}] [L650] COND FALSE !(a->h == 3) [L651] flag = 1 [L652] l1 = 0 [L653] l2 = 0 [L654] p = a VAL [a={14:0}, flag=1, l1={0:0}, l2={0:0}, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, t={17:0}] [L655] EXPR p->h VAL [a={14:0}, flag=1, l1={0:0}, l2={0:0}, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, p->h=1, t={17:0}] [L655] COND TRUE p->h != 3 [L656] t = p [L657] EXPR p->n [L657] p = p->n [L658] COND TRUE \read(flag) [L659] t->n = l1 [L660] l1 = t [L661] flag = 0 VAL [a={14:0}, flag=0, l1={14:0}, l2={0:0}, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={17:0}, t={14:0}] [L655] EXPR p->h VAL [a={14:0}, flag=0, l1={14:0}, l2={0:0}, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={17:0}, p->h=3, t={14:0}] [L655] COND FALSE !(p->h != 3) [L668] p = l1 VAL [a={14:0}, flag=0, l1={14:0}, l2={0:0}, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, t={14:0}] [L669] COND TRUE p != 0 [L670] EXPR p->h VAL [a={14:0}, flag=0, l1={14:0}, l2={0:0}, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, p->h=1, t={14:0}] [L670] COND TRUE p->h != 2 [L679] __VERIFIER_error() VAL [a={14:0}, flag=0, l1={14:0}, l2={0:0}, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, t={14:0}] ----- [2018-11-23 12:53:05,853 WARN L170 areAnnotationChecker]: exitENTRY has no Hoare annotation [2018-11-23 12:53:05,854 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 12:53:05,854 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:53:05,854 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:53:05,854 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 12:53:05,854 WARN L170 areAnnotationChecker]: L620 has no Hoare annotation [2018-11-23 12:53:05,854 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:53:05,855 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:53:05,855 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:53:05,855 WARN L170 areAnnotationChecker]: L629 has no Hoare annotation [2018-11-23 12:53:05,855 WARN L170 areAnnotationChecker]: L629 has no Hoare annotation [2018-11-23 12:53:05,855 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:53:05,855 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:53:05,855 WARN L170 areAnnotationChecker]: L629-1 has no Hoare annotation [2018-11-23 12:53:05,855 WARN L170 areAnnotationChecker]: L629-1 has no Hoare annotation [2018-11-23 12:53:05,856 WARN L170 areAnnotationChecker]: L629-3 has no Hoare annotation [2018-11-23 12:53:05,856 WARN L170 areAnnotationChecker]: L636-3 has no Hoare annotation [2018-11-23 12:53:05,856 WARN L170 areAnnotationChecker]: L636-3 has no Hoare annotation [2018-11-23 12:53:05,856 WARN L170 areAnnotationChecker]: L636-4 has no Hoare annotation [2018-11-23 12:53:05,856 WARN L170 areAnnotationChecker]: L636-1 has no Hoare annotation [2018-11-23 12:53:05,857 WARN L170 areAnnotationChecker]: L636-1 has no Hoare annotation [2018-11-23 12:53:05,857 WARN L170 areAnnotationChecker]: L650 has no Hoare annotation [2018-11-23 12:53:05,857 WARN L170 areAnnotationChecker]: L650 has no Hoare annotation [2018-11-23 12:53:05,857 WARN L170 areAnnotationChecker]: L637 has no Hoare annotation [2018-11-23 12:53:05,857 WARN L170 areAnnotationChecker]: L637 has no Hoare annotation [2018-11-23 12:53:05,857 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:53:05,857 WARN L170 areAnnotationChecker]: L658-2 has no Hoare annotation [2018-11-23 12:53:05,857 WARN L170 areAnnotationChecker]: L658-2 has no Hoare annotation [2018-11-23 12:53:05,858 WARN L170 areAnnotationChecker]: L637-2 has no Hoare annotation [2018-11-23 12:53:05,858 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:53:05,858 WARN L170 areAnnotationChecker]: L655-3 has no Hoare annotation [2018-11-23 12:53:05,858 WARN L170 areAnnotationChecker]: L655-1 has no Hoare annotation [2018-11-23 12:53:05,858 WARN L170 areAnnotationChecker]: L655-1 has no Hoare annotation [2018-11-23 12:53:05,858 WARN L170 areAnnotationChecker]: L645 has no Hoare annotation [2018-11-23 12:53:05,858 WARN L170 areAnnotationChecker]: L645 has no Hoare annotation [2018-11-23 12:53:05,859 WARN L170 areAnnotationChecker]: L669-2 has no Hoare annotation [2018-11-23 12:53:05,859 WARN L170 areAnnotationChecker]: L669-2 has no Hoare annotation [2018-11-23 12:53:05,859 WARN L170 areAnnotationChecker]: L669-2 has no Hoare annotation [2018-11-23 12:53:05,859 WARN L170 areAnnotationChecker]: L658 has no Hoare annotation [2018-11-23 12:53:05,859 WARN L170 areAnnotationChecker]: L658 has no Hoare annotation [2018-11-23 12:53:05,859 WARN L170 areAnnotationChecker]: L645-1 has no Hoare annotation [2018-11-23 12:53:05,859 WARN L170 areAnnotationChecker]: L645-1 has no Hoare annotation [2018-11-23 12:53:05,859 WARN L170 areAnnotationChecker]: L645-3 has no Hoare annotation [2018-11-23 12:53:05,860 WARN L170 areAnnotationChecker]: L669-3 has no Hoare annotation [2018-11-23 12:53:05,860 WARN L170 areAnnotationChecker]: L670 has no Hoare annotation [2018-11-23 12:53:05,860 WARN L170 areAnnotationChecker]: L670 has no Hoare annotation [2018-11-23 12:53:05,860 WARN L170 areAnnotationChecker]: L674-2 has no Hoare annotation [2018-11-23 12:53:05,860 WARN L170 areAnnotationChecker]: L674-2 has no Hoare annotation [2018-11-23 12:53:05,860 WARN L170 areAnnotationChecker]: L674-2 has no Hoare annotation [2018-11-23 12:53:05,860 WARN L170 areAnnotationChecker]: L675-1 has no Hoare annotation [2018-11-23 12:53:05,863 WARN L170 areAnnotationChecker]: L675-1 has no Hoare annotation [2018-11-23 12:53:05,864 WARN L170 areAnnotationChecker]: L674-3 has no Hoare annotation [2018-11-23 12:53:05,864 WARN L170 areAnnotationChecker]: L675 has no Hoare annotation [2018-11-23 12:53:05,864 WARN L170 areAnnotationChecker]: L675 has no Hoare annotation [2018-11-23 12:53:05,864 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:53:05,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:53:05 BoogieIcfgContainer [2018-11-23 12:53:05,868 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:53:05,868 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:53:05,868 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:53:05,868 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:53:05,869 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:53:01" (3/4) ... [2018-11-23 12:53:05,871 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|=16, |#NULL.offset|=10, |old(#NULL.base)|=16, |old(#NULL.offset)|=10] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=16, |old(#NULL.offset)|=10] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=16, |old(#NULL.offset)|=10] [?] RET #112#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret11 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~flag~0 := 1;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0] [?] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0] [?] havoc ~t~0.base, ~t~0.offset;havoc ~l1~0.base, ~l1~0.offset;havoc ~l2~0.base, ~l2~0.offset;havoc ~b~0.base, ~b~0.offset;havoc ~u~0.base, ~u~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=1, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=1, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=1] [?] assume !!(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=1, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0] [?] assume 0 != ~flag~0;call write~int(1, ~p~0.base, ~p~0.offset, 4);~flag~0 := 0; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0] [?] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] call write~int(3, ~p~0.base, ~p~0.offset, 4);call #t~mem4 := read~int(~a~0.base, ~a~0.offset, 4); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem4|=1] [?] assume !(3 == #t~mem4);havoc #t~mem4;~flag~0 := 1;~l1~0.base, ~l1~0.offset := 0, 0;~l2~0.base, ~l2~0.offset := 0, 0;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=1, main_~l1~0.base=0, main_~l1~0.offset=0, main_~l2~0.base=0, main_~l2~0.offset=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=1, main_~l1~0.base=0, main_~l1~0.offset=0, main_~l2~0.base=0, main_~l2~0.offset=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem5|=1] [?] assume !!(3 != #t~mem5);havoc #t~mem5;~t~0.base, ~t~0.offset := ~p~0.base, ~p~0.offset;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=1, main_~l1~0.base=0, main_~l1~0.offset=0, main_~l2~0.base=0, main_~l2~0.offset=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=14, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume 0 != ~flag~0;call write~$Pointer$(~l1~0.base, ~l1~0.offset, ~t~0.base, 4 + ~t~0.offset, 4);~l1~0.base, ~l1~0.offset := ~t~0.base, ~t~0.offset;~flag~0 := 0; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~l1~0.base=14, main_~l1~0.offset=0, main_~l2~0.base=0, main_~l2~0.offset=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=14, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~l1~0.base=14, main_~l1~0.offset=0, main_~l2~0.base=0, main_~l2~0.offset=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=14, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem5|=3] [?] assume !(3 != #t~mem5);havoc #t~mem5; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~l1~0.base=14, main_~l1~0.offset=0, main_~l2~0.base=0, main_~l2~0.offset=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=14, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] ~p~0.base, ~p~0.offset := ~l1~0.base, ~l1~0.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~l1~0.base=14, main_~l1~0.offset=0, main_~l2~0.base=0, main_~l2~0.offset=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=14, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~l1~0.base=14, main_~l1~0.offset=0, main_~l2~0.base=0, main_~l2~0.offset=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=14, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem7|=1] [?] assume 2 != #t~mem7;havoc #t~mem7; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~l1~0.base=14, main_~l1~0.offset=0, main_~l2~0.base=0, main_~l2~0.offset=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=14, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume !false; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~l1~0.base=14, main_~l1~0.offset=0, main_~l2~0.base=0, main_~l2~0.offset=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=14, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=16, #NULL.offset=10, old(#NULL.base)=16, old(#NULL.offset)=10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] ~flag~0 := 1; [L628] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L628] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1] [L629] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1] [L630] havoc ~t~0.base, ~t~0.offset; [L631] havoc ~l1~0.base, ~l1~0.offset; [L632] havoc ~l2~0.base, ~l2~0.offset; [L633] havoc ~b~0.base, ~b~0.offset; [L634] havoc ~u~0.base, ~u~0.offset; [L635] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0] [L636] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~nondet1=1, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0] [L636-L648] assume !!(0 != #t~nondet1); [L636] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0] [L637-L643] assume 0 != ~flag~0; [L638] call write~int(1, ~p~0.base, ~p~0.offset, 4); [L639] ~flag~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L644] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L644] ~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L645] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L646] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L647] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L647] ~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset; [L647] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L636] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~nondet1=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L636-L648] assume !(0 != #t~nondet1); [L636] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L649] call write~int(3, ~p~0.base, ~p~0.offset, 4); [L650] call #t~mem4 := read~int(~a~0.base, ~a~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem4=1, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L650] assume !(3 == #t~mem4); [L650] havoc #t~mem4; [L651] ~flag~0 := 1; [L652] ~l1~0.base, ~l1~0.offset := 0, 0; [L653] ~l2~0.base, ~l2~0.offset := 0, 0; [L654] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~l1~0.base=0, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L655] call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem5=1, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~l1~0.base=0, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L655-L667] assume !!(3 != #t~mem5); [L655] havoc #t~mem5; [L656] ~t~0.base, ~t~0.offset := ~p~0.base, ~p~0.offset; [L657] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L657] ~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset; [L657] havoc #t~mem6.base, #t~mem6.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~l1~0.base=0, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=14, ~t~0.offset=0] [L658-L666] assume 0 != ~flag~0; [L659] call write~$Pointer$(~l1~0.base, ~l1~0.offset, ~t~0.base, 4 + ~t~0.offset, 4); [L660] ~l1~0.base, ~l1~0.offset := ~t~0.base, ~t~0.offset; [L661] ~flag~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~l1~0.base=14, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=14, ~t~0.offset=0] [L655] call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem5=3, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~l1~0.base=14, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=14, ~t~0.offset=0] [L655-L667] assume !(3 != #t~mem5); [L655] havoc #t~mem5; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~l1~0.base=14, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=14, ~t~0.offset=0] [L668] ~p~0.base, ~p~0.offset := ~l1~0.base, ~l1~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~l1~0.base=14, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=14, ~t~0.offset=0] [L669-L672] assume !!(~p~0.base != 0 || ~p~0.offset != 0); [L670] call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem7=1, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~l1~0.base=14, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=14, ~t~0.offset=0] [L670] assume 2 != #t~mem7; [L670] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~l1~0.base=14, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=14, ~t~0.offset=0] [L679] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~l1~0.base=14, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=14, ~t~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=16, #NULL.offset=10, old(#NULL.base)=16, old(#NULL.offset)=10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] ~flag~0 := 1; [L628] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L628] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1] [L629] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1] [L630] havoc ~t~0.base, ~t~0.offset; [L631] havoc ~l1~0.base, ~l1~0.offset; [L632] havoc ~l2~0.base, ~l2~0.offset; [L633] havoc ~b~0.base, ~b~0.offset; [L634] havoc ~u~0.base, ~u~0.offset; [L635] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0] [L636] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~nondet1=1, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0] [L636-L648] assume !!(0 != #t~nondet1); [L636] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~p~0.base=14, ~p~0.offset=0] [L637-L643] assume 0 != ~flag~0; [L638] call write~int(1, ~p~0.base, ~p~0.offset, 4); [L639] ~flag~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L644] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L644] ~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L645] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L646] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L647] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L647] ~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset; [L647] havoc #t~mem3.base, #t~mem3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L636] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~nondet1=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L636-L648] assume !(0 != #t~nondet1); [L636] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L649] call write~int(3, ~p~0.base, ~p~0.offset, 4); [L650] call #t~mem4 := read~int(~a~0.base, ~a~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem4=1, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L650] assume !(3 == #t~mem4); [L650] havoc #t~mem4; [L651] ~flag~0 := 1; [L652] ~l1~0.base, ~l1~0.offset := 0, 0; [L653] ~l2~0.base, ~l2~0.offset := 0, 0; [L654] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~l1~0.base=0, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L655] call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem5=1, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~l1~0.base=0, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L655-L667] assume !!(3 != #t~mem5); [L655] havoc #t~mem5; [L656] ~t~0.base, ~t~0.offset := ~p~0.base, ~p~0.offset; [L657] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L657] ~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset; [L657] havoc #t~mem6.base, #t~mem6.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=1, ~l1~0.base=0, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=14, ~t~0.offset=0] [L658-L666] assume 0 != ~flag~0; [L659] call write~$Pointer$(~l1~0.base, ~l1~0.offset, ~t~0.base, 4 + ~t~0.offset, 4); [L660] ~l1~0.base, ~l1~0.offset := ~t~0.base, ~t~0.offset; [L661] ~flag~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~l1~0.base=14, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=14, ~t~0.offset=0] [L655] call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem5=3, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~l1~0.base=14, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=14, ~t~0.offset=0] [L655-L667] assume !(3 != #t~mem5); [L655] havoc #t~mem5; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~l1~0.base=14, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=14, ~t~0.offset=0] [L668] ~p~0.base, ~p~0.offset := ~l1~0.base, ~l1~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~l1~0.base=14, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=14, ~t~0.offset=0] [L669-L672] assume !!(~p~0.base != 0 || ~p~0.offset != 0); [L670] call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem7=1, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~l1~0.base=14, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=14, ~t~0.offset=0] [L670] assume 2 != #t~mem7; [L670] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~l1~0.base=14, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=14, ~t~0.offset=0] [L679] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~l1~0.base=14, ~l1~0.offset=0, ~l2~0.base=0, ~l2~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=14, ~t~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] ~flag~0 := 1; [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1] [L629] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1] [L630] havoc ~t~0; [L631] havoc ~l1~0; [L632] havoc ~l2~0; [L633] havoc ~b~0; [L634] havoc ~u~0; [L635] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L636] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L636-L648] COND FALSE !(!(0 != #t~nondet1)) [L636] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L637-L643] COND TRUE 0 != ~flag~0 [L638] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L639] ~flag~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L644] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L644] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L645] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L646] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L647] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L647] ~p~0 := #t~mem3; [L647] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L636] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L636-L648] COND TRUE !(0 != #t~nondet1) [L636] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L650] FCALL call #t~mem4 := read~int({ base: ~a~0!base, offset: ~a~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem4=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L650] COND FALSE !(3 == #t~mem4) [L650] havoc #t~mem4; [L651] ~flag~0 := 1; [L652] ~l1~0 := { base: 0, offset: 0 }; [L653] ~l2~0 := { base: 0, offset: 0 }; [L654] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~l1~0!base=0, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L655] FCALL call #t~mem5 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~l1~0!base=0, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L655-L667] COND FALSE !(!(3 != #t~mem5)) [L655] havoc #t~mem5; [L656] ~t~0 := ~p~0; [L657] FCALL call #t~mem6 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L657] ~p~0 := #t~mem6; [L657] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~l1~0!base=0, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L658-L666] COND TRUE 0 != ~flag~0 [L659] FCALL call write~$Pointer$(~l1~0, { base: ~t~0!base, offset: 4 + ~t~0!offset }, 4); [L660] ~l1~0 := ~t~0; [L661] ~flag~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L655] FCALL call #t~mem5 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5=3, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L655-L667] COND TRUE !(3 != #t~mem5) [L655] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L668] ~p~0 := ~l1~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L669-L672] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L670] FCALL call #t~mem7 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem7=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L670] COND TRUE 2 != #t~mem7 [L670] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L679] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] ~flag~0 := 1; [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1] [L629] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1] [L630] havoc ~t~0; [L631] havoc ~l1~0; [L632] havoc ~l2~0; [L633] havoc ~b~0; [L634] havoc ~u~0; [L635] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L636] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L636-L648] COND FALSE !(!(0 != #t~nondet1)) [L636] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L637-L643] COND TRUE 0 != ~flag~0 [L638] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L639] ~flag~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L644] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L644] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L645] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L646] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L647] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L647] ~p~0 := #t~mem3; [L647] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L636] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L636-L648] COND TRUE !(0 != #t~nondet1) [L636] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L650] FCALL call #t~mem4 := read~int({ base: ~a~0!base, offset: ~a~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem4=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L650] COND FALSE !(3 == #t~mem4) [L650] havoc #t~mem4; [L651] ~flag~0 := 1; [L652] ~l1~0 := { base: 0, offset: 0 }; [L653] ~l2~0 := { base: 0, offset: 0 }; [L654] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~l1~0!base=0, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L655] FCALL call #t~mem5 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~l1~0!base=0, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L655-L667] COND FALSE !(!(3 != #t~mem5)) [L655] havoc #t~mem5; [L656] ~t~0 := ~p~0; [L657] FCALL call #t~mem6 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L657] ~p~0 := #t~mem6; [L657] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~l1~0!base=0, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L658-L666] COND TRUE 0 != ~flag~0 [L659] FCALL call write~$Pointer$(~l1~0, { base: ~t~0!base, offset: 4 + ~t~0!offset }, 4); [L660] ~l1~0 := ~t~0; [L661] ~flag~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L655] FCALL call #t~mem5 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5=3, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L655-L667] COND TRUE !(3 != #t~mem5) [L655] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L668] ~p~0 := ~l1~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L669-L672] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L670] FCALL call #t~mem7 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem7=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L670] COND TRUE 2 != #t~mem7 [L670] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L679] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] ~flag~0 := 1; [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1] [L629] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1] [L630] havoc ~t~0; [L631] havoc ~l1~0; [L632] havoc ~l2~0; [L633] havoc ~b~0; [L634] havoc ~u~0; [L635] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L636] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L636-L648] COND FALSE !(!(0 != #t~nondet1)) [L636] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L637-L643] COND TRUE 0 != ~flag~0 [L638] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L639] ~flag~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L644] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L644] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L645] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L646] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L647] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L647] ~p~0 := #t~mem3; [L647] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L636] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L636-L648] COND TRUE !(0 != #t~nondet1) [L636] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L650] FCALL call #t~mem4 := read~int({ base: ~a~0!base, offset: ~a~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem4=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L650] COND FALSE !(3 == #t~mem4) [L650] havoc #t~mem4; [L651] ~flag~0 := 1; [L652] ~l1~0 := { base: 0, offset: 0 }; [L653] ~l2~0 := { base: 0, offset: 0 }; [L654] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~l1~0!base=0, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L655] FCALL call #t~mem5 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~l1~0!base=0, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L655-L667] COND FALSE !(!(3 != #t~mem5)) [L655] havoc #t~mem5; [L656] ~t~0 := ~p~0; [L657] FCALL call #t~mem6 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L657] ~p~0 := #t~mem6; [L657] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~l1~0!base=0, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L658-L666] COND TRUE 0 != ~flag~0 [L659] FCALL call write~$Pointer$(~l1~0, { base: ~t~0!base, offset: 4 + ~t~0!offset }, 4); [L660] ~l1~0 := ~t~0; [L661] ~flag~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L655] FCALL call #t~mem5 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5=3, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L655-L667] COND TRUE !(3 != #t~mem5) [L655] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L668] ~p~0 := ~l1~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L669-L672] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L670] FCALL call #t~mem7 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem7=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L670] COND TRUE 2 != #t~mem7 [L670] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L679] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] ~flag~0 := 1; [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1] [L629] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1] [L630] havoc ~t~0; [L631] havoc ~l1~0; [L632] havoc ~l2~0; [L633] havoc ~b~0; [L634] havoc ~u~0; [L635] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L636] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet1=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L636-L648] COND FALSE !(!(0 != #t~nondet1)) [L636] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~p~0!base=14, ~p~0!offset=0] [L637-L643] COND TRUE 0 != ~flag~0 [L638] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L639] ~flag~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L644] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L644] ~t~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L645] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L646] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L647] FCALL call #t~mem3 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L647] ~p~0 := #t~mem3; [L647] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L636] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet1=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L636-L648] COND TRUE !(0 != #t~nondet1) [L636] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L650] FCALL call #t~mem4 := read~int({ base: ~a~0!base, offset: ~a~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem4=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L650] COND FALSE !(3 == #t~mem4) [L650] havoc #t~mem4; [L651] ~flag~0 := 1; [L652] ~l1~0 := { base: 0, offset: 0 }; [L653] ~l2~0 := { base: 0, offset: 0 }; [L654] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~l1~0!base=0, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L655] FCALL call #t~mem5 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~l1~0!base=0, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L655-L667] COND FALSE !(!(3 != #t~mem5)) [L655] havoc #t~mem5; [L656] ~t~0 := ~p~0; [L657] FCALL call #t~mem6 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L657] ~p~0 := #t~mem6; [L657] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=1, ~l1~0!base=0, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L658-L666] COND TRUE 0 != ~flag~0 [L659] FCALL call write~$Pointer$(~l1~0, { base: ~t~0!base, offset: 4 + ~t~0!offset }, 4); [L660] ~l1~0 := ~t~0; [L661] ~flag~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L655] FCALL call #t~mem5 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5=3, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L655-L667] COND TRUE !(3 != #t~mem5) [L655] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L668] ~p~0 := ~l1~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L669-L672] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L670] FCALL call #t~mem7 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem7=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L670] COND TRUE 2 != #t~mem7 [L670] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L679] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~l1~0!base=14, ~l1~0!offset=0, ~l2~0!base=0, ~l2~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=14, ~t~0!offset=0] [L627] int flag = 1; [L628] List a = (List) malloc(sizeof(struct node)); VAL [a={14:0}, flag=1, malloc(sizeof(struct node))={14:0}] [L629] COND FALSE !(a == 0) VAL [a={14:0}, flag=1, malloc(sizeof(struct node))={14:0}] [L630] List t; [L631] List l1; [L632] List l2; [L633] List b; [L634] List u; [L635] List p = a; VAL [a={14:0}, flag=1, malloc(sizeof(struct node))={14:0}, p={14:0}] [L636] COND TRUE __VERIFIER_nondet_int() [L637] COND TRUE \read(flag) [L638] p->h = 1 [L639] flag = 0 VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, p={14:0}] [L644] t = (List) malloc(sizeof(struct node)) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, t={17:0}] [L645] COND FALSE !(t == 0) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, t={17:0}] [L646] p->n = t [L647] EXPR p->n [L647] p = p->n [L636] COND FALSE !(__VERIFIER_nondet_int()) [L649] p->h = 3 [L650] EXPR a->h VAL [a={14:0}, a->h=1, flag=0, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={17:0}, t={17:0}] [L650] COND FALSE !(a->h == 3) [L651] flag = 1 [L652] l1 = 0 [L653] l2 = 0 [L654] p = a VAL [a={14:0}, flag=1, l1={0:0}, l2={0:0}, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, t={17:0}] [L655] EXPR p->h VAL [a={14:0}, flag=1, l1={0:0}, l2={0:0}, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, p->h=1, t={17:0}] [L655] COND TRUE p->h != 3 [L656] t = p [L657] EXPR p->n [L657] p = p->n [L658] COND TRUE \read(flag) [L659] t->n = l1 [L660] l1 = t [L661] flag = 0 VAL [a={14:0}, flag=0, l1={14:0}, l2={0:0}, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={17:0}, t={14:0}] [L655] EXPR p->h VAL [a={14:0}, flag=0, l1={14:0}, l2={0:0}, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={17:0}, p->h=3, t={14:0}] [L655] COND FALSE !(p->h != 3) [L668] p = l1 VAL [a={14:0}, flag=0, l1={14:0}, l2={0:0}, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, t={14:0}] [L669] COND TRUE p != 0 [L670] EXPR p->h VAL [a={14:0}, flag=0, l1={14:0}, l2={0:0}, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, p->h=1, t={14:0}] [L670] COND TRUE p->h != 2 [L679] __VERIFIER_error() VAL [a={14:0}, flag=0, l1={14:0}, l2={0:0}, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, t={14:0}] ----- [2018-11-23 12:53:06,007 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/list-properties/splice_false-unreach-call_false-valid-memcleanup.i-witness.graphml [2018-11-23 12:53:06,007 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:53:06,008 INFO L168 Benchmark]: Toolchain (without parser) took 6770.41 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 701.0 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -399.7 MB). Peak memory consumption was 301.2 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:06,010 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:53:06,011 INFO L168 Benchmark]: CACSL2BoogieTranslator took 634.81 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:06,011 INFO L168 Benchmark]: Boogie Procedure Inliner took 110.10 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 701.0 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -781.3 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:06,012 INFO L168 Benchmark]: Boogie Preprocessor took 41.91 ms. Allocated memory is still 2.2 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:53:06,012 INFO L168 Benchmark]: RCFGBuilder took 1020.57 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 36.1 MB). Peak memory consumption was 36.1 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:06,013 INFO L168 Benchmark]: TraceAbstraction took 4818.42 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 300.2 MB). Peak memory consumption was 300.2 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:06,014 INFO L168 Benchmark]: Witness Printer took 138.92 ms. Allocated memory is still 2.2 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:06,018 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 634.81 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 110.10 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 701.0 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -781.3 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.91 ms. Allocated memory is still 2.2 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1020.57 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 36.1 MB). Peak memory consumption was 36.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4818.42 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 300.2 MB). Peak memory consumption was 300.2 MB. Max. memory is 7.1 GB. * Witness Printer took 138.92 ms. Allocated memory is still 2.2 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 679]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L627] int flag = 1; [L628] List a = (List) malloc(sizeof(struct node)); VAL [a={14:0}, flag=1, malloc(sizeof(struct node))={14:0}] [L629] COND FALSE !(a == 0) VAL [a={14:0}, flag=1, malloc(sizeof(struct node))={14:0}] [L630] List t; [L631] List l1; [L632] List l2; [L633] List b; [L634] List u; [L635] List p = a; VAL [a={14:0}, flag=1, malloc(sizeof(struct node))={14:0}, p={14:0}] [L636] COND TRUE __VERIFIER_nondet_int() [L637] COND TRUE \read(flag) [L638] p->h = 1 [L639] flag = 0 VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, p={14:0}] [L644] t = (List) malloc(sizeof(struct node)) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, t={17:0}] [L645] COND FALSE !(t == 0) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, t={17:0}] [L646] p->n = t [L647] EXPR p->n [L647] p = p->n [L636] COND FALSE !(__VERIFIER_nondet_int()) [L649] p->h = 3 [L650] EXPR a->h VAL [a={14:0}, a->h=1, flag=0, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={17:0}, t={17:0}] [L650] COND FALSE !(a->h == 3) [L651] flag = 1 [L652] l1 = 0 [L653] l2 = 0 [L654] p = a VAL [a={14:0}, flag=1, l1={0:0}, l2={0:0}, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, t={17:0}] [L655] EXPR p->h VAL [a={14:0}, flag=1, l1={0:0}, l2={0:0}, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, p->h=1, t={17:0}] [L655] COND TRUE p->h != 3 [L656] t = p [L657] EXPR p->n [L657] p = p->n [L658] COND TRUE \read(flag) [L659] t->n = l1 [L660] l1 = t [L661] flag = 0 VAL [a={14:0}, flag=0, l1={14:0}, l2={0:0}, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={17:0}, t={14:0}] [L655] EXPR p->h VAL [a={14:0}, flag=0, l1={14:0}, l2={0:0}, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={17:0}, p->h=3, t={14:0}] [L655] COND FALSE !(p->h != 3) [L668] p = l1 VAL [a={14:0}, flag=0, l1={14:0}, l2={0:0}, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, t={14:0}] [L669] COND TRUE p != 0 [L670] EXPR p->h VAL [a={14:0}, flag=0, l1={14:0}, l2={0:0}, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, p->h=1, t={14:0}] [L670] COND TRUE p->h != 2 [L679] __VERIFIER_error() VAL [a={14:0}, flag=0, l1={14:0}, l2={0:0}, malloc(sizeof(struct node))={17:0}, malloc(sizeof(struct node))={14:0}, p={14:0}, t={14:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 38 locations, 1 error locations. UNSAFE Result, 4.7s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 175 SDtfs, 44 SDslu, 193 SDs, 0 SdLazy, 105 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 21 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 3943 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...