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_Bitvector.epf -i ../../../trunk/examples/svcomp/ldv-regression/1_3_true-termination.c_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:05:52,398 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:05:52,400 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:05:52,412 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:05:52,413 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:05:52,414 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:05:52,415 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:05:52,417 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:05:52,419 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:05:52,420 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:05:52,421 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:05:52,421 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:05:52,422 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:05:52,423 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:05:52,424 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:05:52,426 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:05:52,426 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:05:52,428 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:05:52,431 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:05:52,432 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:05:52,434 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:05:52,437 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:05:52,442 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:05:52,443 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:05:52,443 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:05:52,445 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:05:52,445 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:05:52,446 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:05:52,449 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:05:52,451 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:05:52,451 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:05:52,452 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:05:52,452 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:05:52,452 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:05:52,453 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:05:52,454 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:05:52,454 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:05:52,479 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:05:52,479 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:05:52,482 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:05:52,482 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:05:52,485 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:05:52,485 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:05:52,486 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:05:52,486 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:05:52,486 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:05:52,486 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:05:52,487 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:05:52,487 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:05:52,487 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:05:52,487 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:05:52,487 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:05:52,487 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:05:52,488 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:05:52,489 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:05:52,489 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:05:52,489 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:05:52,489 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:05:52,489 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:05:52,490 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:05:52,490 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:05:52,490 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:05:52,490 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:05:52,490 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:05:52,491 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:05:52,491 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:05:52,491 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:05:52,492 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:05:52,492 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:05:52,492 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:05:52,558 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:05:52,572 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:05:52,576 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:05:52,577 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:05:52,578 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:05:52,578 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/1_3_true-termination.c_false-unreach-call.i [2018-11-23 11:05:52,641 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ca836c78/74e098d555014b86b506d4e77bc67a26/FLAGb86e720ea [2018-11-23 11:05:53,117 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:05:53,118 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/1_3_true-termination.c_false-unreach-call.i [2018-11-23 11:05:53,124 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ca836c78/74e098d555014b86b506d4e77bc67a26/FLAGb86e720ea [2018-11-23 11:05:53,459 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ca836c78/74e098d555014b86b506d4e77bc67a26 [2018-11-23 11:05:53,469 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:05:53,470 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:05:53,471 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:05:53,471 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:05:53,475 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:05:53,478 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:05:53" (1/1) ... [2018-11-23 11:05:53,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a89a825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:53, skipping insertion in model container [2018-11-23 11:05:53,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:05:53" (1/1) ... [2018-11-23 11:05:53,490 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:05:53,512 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:05:53,749 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:05:53,765 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:05:53,787 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:05:53,807 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:05:53,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:53 WrapperNode [2018-11-23 11:05:53,808 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:05:53,809 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:05:53,809 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:05:53,809 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:05:53,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:53" (1/1) ... [2018-11-23 11:05:53,831 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:53" (1/1) ... [2018-11-23 11:05:53,839 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:05:53,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:05:53,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:05:53,840 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:05:53,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:53" (1/1) ... [2018-11-23 11:05:53,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:53" (1/1) ... [2018-11-23 11:05:53,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:53" (1/1) ... [2018-11-23 11:05:53,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:53" (1/1) ... [2018-11-23 11:05:53,872 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:53" (1/1) ... [2018-11-23 11:05:53,875 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:53" (1/1) ... [2018-11-23 11:05:53,876 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:53" (1/1) ... [2018-11-23 11:05:53,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:05:53,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:05:53,881 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:05:53,881 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:05:53,883 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:53" (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 11:05:54,021 INFO L130 BoogieDeclarations]: Found specification of procedure freePtr [2018-11-23 11:05:54,021 INFO L138 BoogieDeclarations]: Found implementation of procedure freePtr [2018-11-23 11:05:54,021 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2018-11-23 11:05:54,021 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2018-11-23 11:05:54,022 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:05:54,022 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:05:54,022 INFO L130 BoogieDeclarations]: Found specification of procedure getrr [2018-11-23 11:05:54,022 INFO L138 BoogieDeclarations]: Found implementation of procedure getrr [2018-11-23 11:05:54,022 INFO L130 BoogieDeclarations]: Found specification of procedure getPtr [2018-11-23 11:05:54,022 INFO L138 BoogieDeclarations]: Found implementation of procedure getPtr [2018-11-23 11:05:54,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:05:54,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:05:54,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:05:54,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:05:54,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:05:54,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:05:54,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:05:54,557 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:05:54,557 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 11:05:54,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:05:54 BoogieIcfgContainer [2018-11-23 11:05:54,558 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:05:54,559 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:05:54,559 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:05:54,562 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:05:54,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:05:53" (1/3) ... [2018-11-23 11:05:54,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61542e0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:05:54, skipping insertion in model container [2018-11-23 11:05:54,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:53" (2/3) ... [2018-11-23 11:05:54,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61542e0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:05:54, skipping insertion in model container [2018-11-23 11:05:54,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:05:54" (3/3) ... [2018-11-23 11:05:54,567 INFO L112 eAbstractionObserver]: Analyzing ICFG 1_3_true-termination.c_false-unreach-call.i [2018-11-23 11:05:54,577 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:05:54,586 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:05:54,605 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:05:54,639 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:05:54,640 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:05:54,640 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:05:54,641 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:05:54,641 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:05:54,641 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:05:54,642 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:05:54,642 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:05:54,642 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:05:54,661 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-23 11:05:54,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:05:54,668 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:05:54,670 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 11:05:54,672 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:05:54,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:05:54,679 INFO L82 PathProgramCache]: Analyzing trace with hash 546623417, now seen corresponding path program 1 times [2018-11-23 11:05:54,683 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:05:54,684 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:05:54,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:05:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:54,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:05:55,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:05:55,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:05:55,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:55,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:55,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:55,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 11:05:55,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 11:05:55,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 11:05:55,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:55,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:55,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:55,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-23 11:05:55,864 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:55,864 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |freePtr_#in~ptr.base|]. (let ((.cse0 (select (select |#memory_int| |freePtr_#in~ptr.base|) (_ bv0 32)))) (and (= (_ bv1 32) .cse0) (= .cse0 |freePtr_#t~mem2|))) [2018-11-23 11:05:55,865 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv1 32) |freePtr_#t~mem2|) [2018-11-23 11:05:56,006 INFO L256 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2018-11-23 11:05:56,010 INFO L273 TraceCheckUtils]: 1: Hoare triple {35#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {35#true} is VALID [2018-11-23 11:05:56,011 INFO L273 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 11:05:56,012 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #35#return; {35#true} is VALID [2018-11-23 11:05:56,012 INFO L256 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret4 := main(); {35#true} is VALID [2018-11-23 11:05:56,012 INFO L273 TraceCheckUtils]: 5: Hoare triple {35#true} ~ptr1~0.base, ~ptr1~0.offset := 0bv32, 0bv32; {35#true} is VALID [2018-11-23 11:05:56,013 INFO L256 TraceCheckUtils]: 6: Hoare triple {35#true} call #t~ret3.base, #t~ret3.offset := getPtr(); {35#true} is VALID [2018-11-23 11:05:56,013 INFO L256 TraceCheckUtils]: 7: Hoare triple {35#true} call #t~ret1.base, #t~ret1.offset := getrr(); {35#true} is VALID [2018-11-23 11:05:56,027 INFO L273 TraceCheckUtils]: 8: Hoare triple {35#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(4bv32);~r~0.base, ~r~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~intINTTYPE4(0bv32, ~r~0.base, ~r~0.offset, 4bv32);#res.base, #res.offset := ~r~0.base, ~r~0.offset; {64#(= (_ bv0 32) |getrr_#res.offset|)} is VALID [2018-11-23 11:05:56,043 INFO L273 TraceCheckUtils]: 9: Hoare triple {64#(= (_ bv0 32) |getrr_#res.offset|)} assume true; {64#(= (_ bv0 32) |getrr_#res.offset|)} is VALID [2018-11-23 11:05:56,053 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {64#(= (_ bv0 32) |getrr_#res.offset|)} {35#true} #33#return; {71#(= (_ bv0 32) |getPtr_#t~ret1.offset|)} is VALID [2018-11-23 11:05:56,066 INFO L273 TraceCheckUtils]: 11: Hoare triple {71#(= (_ bv0 32) |getPtr_#t~ret1.offset|)} ~r~1.base, ~r~1.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset;call write~intINTTYPE4(1bv32, ~r~1.base, ~r~1.offset, 4bv32);#res.base, #res.offset := ~r~1.base, ~r~1.offset; {75#(and (= (_ bv0 32) |getPtr_#res.offset|) (= (bvadd (select (select |#memory_int| |getPtr_#res.base|) |getPtr_#res.offset|) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:56,085 INFO L273 TraceCheckUtils]: 12: Hoare triple {75#(and (= (_ bv0 32) |getPtr_#res.offset|) (= (bvadd (select (select |#memory_int| |getPtr_#res.base|) |getPtr_#res.offset|) (_ bv4294967295 32)) (_ bv0 32)))} assume true; {75#(and (= (_ bv0 32) |getPtr_#res.offset|) (= (bvadd (select (select |#memory_int| |getPtr_#res.base|) |getPtr_#res.offset|) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:56,103 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {75#(and (= (_ bv0 32) |getPtr_#res.offset|) (= (bvadd (select (select |#memory_int| |getPtr_#res.base|) |getPtr_#res.offset|) (_ bv4294967295 32)) (_ bv0 32)))} {35#true} #39#return; {82#(and (= |main_#t~ret3.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_#t~ret3.base|) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:56,117 INFO L273 TraceCheckUtils]: 14: Hoare triple {82#(and (= |main_#t~ret3.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_#t~ret3.base|) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)))} ~ptr1~0.base, ~ptr1~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset; {86#(and (= (_ bv0 32) main_~ptr1~0.offset) (= (_ bv1 32) (select (select |#memory_int| main_~ptr1~0.base) (_ bv0 32))))} is VALID [2018-11-23 11:05:56,132 INFO L256 TraceCheckUtils]: 15: Hoare triple {86#(and (= (_ bv0 32) main_~ptr1~0.offset) (= (_ bv1 32) (select (select |#memory_int| main_~ptr1~0.base) (_ bv0 32))))} call freePtr(~ptr1~0.base, ~ptr1~0.offset); {90#(and (= (_ bv0 32) |freePtr_#in~ptr.offset|) (= (_ bv1 32) (select (select |#memory_int| |freePtr_#in~ptr.base|) (_ bv0 32))))} is VALID [2018-11-23 11:05:56,148 INFO L273 TraceCheckUtils]: 16: Hoare triple {90#(and (= (_ bv0 32) |freePtr_#in~ptr.offset|) (= (_ bv1 32) (select (select |#memory_int| |freePtr_#in~ptr.base|) (_ bv0 32))))} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;call #t~mem2 := read~intINTTYPE4(~ptr.base, ~ptr.offset, 4bv32); {94#(= (_ bv1 32) |freePtr_#t~mem2|)} is VALID [2018-11-23 11:05:56,153 INFO L273 TraceCheckUtils]: 17: Hoare triple {94#(= (_ bv1 32) |freePtr_#t~mem2|)} assume !(1bv32 == #t~mem2); {36#false} is VALID [2018-11-23 11:05:56,154 INFO L256 TraceCheckUtils]: 18: Hoare triple {36#false} call __blast_assert(); {36#false} is VALID [2018-11-23 11:05:56,154 INFO L273 TraceCheckUtils]: 19: Hoare triple {36#false} assume !false; {36#false} is VALID [2018-11-23 11:05:56,159 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 11:05:56,159 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:05:56,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:05:56,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 11:05:56,171 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-11-23 11:05:56,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:05:56,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:05:56,248 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 11:05:56,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:05:56,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:05:56,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:05:56,260 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 9 states. [2018-11-23 11:05:57,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:57,367 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-23 11:05:57,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:05:57,367 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-11-23 11:05:57,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:05:57,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:05:57,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2018-11-23 11:05:57,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:05:57,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2018-11-23 11:05:57,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2018-11-23 11:05:57,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:05:57,538 INFO L225 Difference]: With dead ends: 49 [2018-11-23 11:05:57,539 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 11:05:57,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:05:57,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 11:05:57,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 11:05:57,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:05:57,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-23 11:05:57,599 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 11:05:57,600 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 11:05:57,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:57,605 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2018-11-23 11:05:57,605 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2018-11-23 11:05:57,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:05:57,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:05:57,606 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 11:05:57,606 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 11:05:57,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:57,610 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2018-11-23 11:05:57,611 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2018-11-23 11:05:57,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:05:57,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:05:57,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:05:57,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:05:57,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:05:57,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2018-11-23 11:05:57,617 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 20 [2018-11-23 11:05:57,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:05:57,617 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2018-11-23 11:05:57,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:05:57,618 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2018-11-23 11:05:57,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:05:57,619 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:05:57,619 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, 1, 1, 1, 1, 1] [2018-11-23 11:05:57,620 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:05:57,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:05:57,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1159927970, now seen corresponding path program 1 times [2018-11-23 11:05:57,621 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:05:57,621 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:05:57,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:05:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:05:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:05:57,772 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=(_ bv3 32), |#NULL.offset|=(_ bv5 32), |old(#NULL.base)|=(_ bv3 32), |old(#NULL.offset)|=(_ bv5 32)] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv3 32), |old(#NULL.offset)|=(_ bv5 32)] [?] assume true; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv3 32), |old(#NULL.offset)|=(_ bv5 32)] [?] RET #35#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret4 := main(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] ~ptr1~0.base, ~ptr1~0.offset := 0bv32, 0bv32; VAL [main_~ptr1~0.base=(_ bv0 32), main_~ptr1~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret3.base, #t~ret3.offset := getPtr(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret1.base, #t~ret1.offset := getrr(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(4bv32);~r~0.base, ~r~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~intINTTYPE4(0bv32, ~r~0.base, ~r~0.offset, 4bv32);#res.base, #res.offset := ~r~0.base, ~r~0.offset; VAL [getrr_~r~0.base=(_ bv6 32), getrr_~r~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |getrr_#res.base|=(_ bv6 32), |getrr_#res.offset|=(_ bv0 32), |getrr_#t~malloc0.base|=(_ bv6 32), |getrr_#t~malloc0.offset|=(_ bv0 32)] [?] assume true; VAL [getrr_~r~0.base=(_ bv6 32), getrr_~r~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |getrr_#res.base|=(_ bv6 32), |getrr_#res.offset|=(_ bv0 32), |getrr_#t~malloc0.base|=(_ bv6 32), |getrr_#t~malloc0.offset|=(_ bv0 32)] [?] RET #33#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |getPtr_#t~ret1.base|=(_ bv6 32), |getPtr_#t~ret1.offset|=(_ bv0 32)] [?] ~r~1.base, ~r~1.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset;call write~intINTTYPE4(1bv32, ~r~1.base, ~r~1.offset, 4bv32);#res.base, #res.offset := ~r~1.base, ~r~1.offset; VAL [getPtr_~r~1.base=(_ bv6 32), getPtr_~r~1.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |getPtr_#res.base|=(_ bv6 32), |getPtr_#res.offset|=(_ bv0 32)] [?] assume true; VAL [getPtr_~r~1.base=(_ bv6 32), getPtr_~r~1.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |getPtr_#res.base|=(_ bv6 32), |getPtr_#res.offset|=(_ bv0 32)] [?] RET #39#return; VAL [main_~ptr1~0.base=(_ bv0 32), main_~ptr1~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~ret3.base|=(_ bv6 32), |main_#t~ret3.offset|=(_ bv0 32)] [?] ~ptr1~0.base, ~ptr1~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset; VAL [main_~ptr1~0.base=(_ bv6 32), main_~ptr1~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call freePtr(~ptr1~0.base, ~ptr1~0.offset); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |freePtr_#in~ptr.base|=(_ bv6 32), |freePtr_#in~ptr.offset|=(_ bv0 32)] [?] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;call #t~mem2 := read~intINTTYPE4(~ptr.base, ~ptr.offset, 4bv32); VAL [freePtr_~ptr.base=(_ bv6 32), freePtr_~ptr.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |freePtr_#in~ptr.base|=(_ bv6 32), |freePtr_#in~ptr.offset|=(_ bv0 32), |freePtr_#t~mem2|=(_ bv1 32)] [?] assume 1bv32 == #t~mem2; VAL [freePtr_~ptr.base=(_ bv6 32), freePtr_~ptr.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |freePtr_#in~ptr.base|=(_ bv6 32), |freePtr_#in~ptr.offset|=(_ bv0 32), |freePtr_#t~mem2|=(_ bv1 32)] [?] havoc #t~mem2;call write~intINTTYPE4(2bv32, ~ptr.base, ~ptr.offset, 4bv32); VAL [freePtr_~ptr.base=(_ bv6 32), freePtr_~ptr.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |freePtr_#in~ptr.base|=(_ bv6 32), |freePtr_#in~ptr.offset|=(_ bv0 32)] [?] assume true; VAL [freePtr_~ptr.base=(_ bv6 32), freePtr_~ptr.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |freePtr_#in~ptr.base|=(_ bv6 32), |freePtr_#in~ptr.offset|=(_ bv0 32)] [?] RET #41#return; VAL [main_~ptr1~0.base=(_ bv6 32), main_~ptr1~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call freePtr(~ptr1~0.base, ~ptr1~0.offset); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |freePtr_#in~ptr.base|=(_ bv6 32), |freePtr_#in~ptr.offset|=(_ bv0 32)] [?] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;call #t~mem2 := read~intINTTYPE4(~ptr.base, ~ptr.offset, 4bv32); VAL [freePtr_~ptr.base=(_ bv6 32), freePtr_~ptr.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |freePtr_#in~ptr.base|=(_ bv6 32), |freePtr_#in~ptr.offset|=(_ bv0 32), |freePtr_#t~mem2|=(_ bv2 32)] [?] assume !(1bv32 == #t~mem2); VAL [freePtr_~ptr.base=(_ bv6 32), freePtr_~ptr.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |freePtr_#in~ptr.base|=(_ bv6 32), |freePtr_#in~ptr.offset|=(_ bv0 32), |freePtr_#t~mem2|=(_ bv2 32)] [?] CALL call __blast_assert(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] assume !false; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=3bv32, #NULL.offset=5bv32, old(#NULL.base)=3bv32, old(#NULL.offset)=5bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=3bv32, old(#NULL.offset)=5bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=3bv32, old(#NULL.offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret4 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L51] ~ptr1~0.base, ~ptr1~0.offset := 0bv32, 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~ptr1~0.base=0bv32, ~ptr1~0.offset=0bv32] [L52] CALL call #t~ret3.base, #t~ret3.offset := getPtr(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L38] CALL call #t~ret1.base, #t~ret1.offset := getrr(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L31] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(4bv32); [L31] ~r~0.base, ~r~0.offset := #t~malloc0.base, #t~malloc0.offset; [L32] call write~intINTTYPE4(0bv32, ~r~0.base, ~r~0.offset, 4bv32); [L33] #res.base, #res.offset := ~r~0.base, ~r~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #res.base=6bv32, #res.offset=0bv32, #t~malloc0.base=6bv32, #t~malloc0.offset=0bv32, ~r~0.base=6bv32, ~r~0.offset=0bv32] [L29-L34] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #res.base=6bv32, #res.offset=0bv32, #t~malloc0.base=6bv32, #t~malloc0.offset=0bv32, ~r~0.base=6bv32, ~r~0.offset=0bv32] [L38] RET call #t~ret1.base, #t~ret1.offset := getrr(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret1.base=6bv32, #t~ret1.offset=0bv32] [L38] ~r~1.base, ~r~1.offset := #t~ret1.base, #t~ret1.offset; [L38] havoc #t~ret1.base, #t~ret1.offset; [L39] call write~intINTTYPE4(1bv32, ~r~1.base, ~r~1.offset, 4bv32); [L40] #res.base, #res.offset := ~r~1.base, ~r~1.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #res.base=6bv32, #res.offset=0bv32, ~r~1.base=6bv32, ~r~1.offset=0bv32] [L36-L41] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #res.base=6bv32, #res.offset=0bv32, ~r~1.base=6bv32, ~r~1.offset=0bv32] [L52] RET call #t~ret3.base, #t~ret3.offset := getPtr(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret3.base=6bv32, #t~ret3.offset=0bv32, ~ptr1~0.base=0bv32, ~ptr1~0.offset=0bv32] [L52] ~ptr1~0.base, ~ptr1~0.offset := #t~ret3.base, #t~ret3.offset; [L52] havoc #t~ret3.base, #t~ret3.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~ptr1~0.base=6bv32, ~ptr1~0.offset=0bv32] [L53] CALL call freePtr(~ptr1~0.base, ~ptr1~0.offset); VAL [#in~ptr.base=6bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L43-L47] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; [L45] call #t~mem2 := read~intINTTYPE4(~ptr.base, ~ptr.offset, 4bv32); VAL [#in~ptr.base=6bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem2=1bv32, ~ptr.base=6bv32, ~ptr.offset=0bv32] [L45] assume 1bv32 == #t~mem2; VAL [#in~ptr.base=6bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem2=1bv32, ~ptr.base=6bv32, ~ptr.offset=0bv32] [L45] havoc #t~mem2; [L46] call write~intINTTYPE4(2bv32, ~ptr.base, ~ptr.offset, 4bv32); VAL [#in~ptr.base=6bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~ptr.base=6bv32, ~ptr.offset=0bv32] [L43-L47] ensures true; VAL [#in~ptr.base=6bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~ptr.base=6bv32, ~ptr.offset=0bv32] [L53] RET call freePtr(~ptr1~0.base, ~ptr1~0.offset); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~ptr1~0.base=6bv32, ~ptr1~0.offset=0bv32] [L55] CALL call freePtr(~ptr1~0.base, ~ptr1~0.offset); VAL [#in~ptr.base=6bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L43-L47] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; [L45] call #t~mem2 := read~intINTTYPE4(~ptr.base, ~ptr.offset, 4bv32); VAL [#in~ptr.base=6bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem2=2bv32, ~ptr.base=6bv32, ~ptr.offset=0bv32] [L45] assume !(1bv32 == #t~mem2); VAL [#in~ptr.base=6bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem2=2bv32, ~ptr.base=6bv32, ~ptr.offset=0bv32] [L45] CALL call __blast_assert(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L6] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=3bv32, #NULL.offset=5bv32, old(#NULL.base)=3bv32, old(#NULL.offset)=5bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=3bv32, old(#NULL.offset)=5bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=3bv32, old(#NULL.offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret4 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L51] ~ptr1~0.base, ~ptr1~0.offset := 0bv32, 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~ptr1~0.base=0bv32, ~ptr1~0.offset=0bv32] [L52] CALL call #t~ret3.base, #t~ret3.offset := getPtr(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L38] CALL call #t~ret1.base, #t~ret1.offset := getrr(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L31] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(4bv32); [L31] ~r~0.base, ~r~0.offset := #t~malloc0.base, #t~malloc0.offset; [L32] call write~intINTTYPE4(0bv32, ~r~0.base, ~r~0.offset, 4bv32); [L33] #res.base, #res.offset := ~r~0.base, ~r~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #res.base=6bv32, #res.offset=0bv32, #t~malloc0.base=6bv32, #t~malloc0.offset=0bv32, ~r~0.base=6bv32, ~r~0.offset=0bv32] [L29-L34] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #res.base=6bv32, #res.offset=0bv32, #t~malloc0.base=6bv32, #t~malloc0.offset=0bv32, ~r~0.base=6bv32, ~r~0.offset=0bv32] [L38] RET call #t~ret1.base, #t~ret1.offset := getrr(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret1.base=6bv32, #t~ret1.offset=0bv32] [L38] ~r~1.base, ~r~1.offset := #t~ret1.base, #t~ret1.offset; [L38] havoc #t~ret1.base, #t~ret1.offset; [L39] call write~intINTTYPE4(1bv32, ~r~1.base, ~r~1.offset, 4bv32); [L40] #res.base, #res.offset := ~r~1.base, ~r~1.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #res.base=6bv32, #res.offset=0bv32, ~r~1.base=6bv32, ~r~1.offset=0bv32] [L36-L41] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #res.base=6bv32, #res.offset=0bv32, ~r~1.base=6bv32, ~r~1.offset=0bv32] [L52] RET call #t~ret3.base, #t~ret3.offset := getPtr(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret3.base=6bv32, #t~ret3.offset=0bv32, ~ptr1~0.base=0bv32, ~ptr1~0.offset=0bv32] [L52] ~ptr1~0.base, ~ptr1~0.offset := #t~ret3.base, #t~ret3.offset; [L52] havoc #t~ret3.base, #t~ret3.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~ptr1~0.base=6bv32, ~ptr1~0.offset=0bv32] [L53] CALL call freePtr(~ptr1~0.base, ~ptr1~0.offset); VAL [#in~ptr.base=6bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L43-L47] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; [L45] call #t~mem2 := read~intINTTYPE4(~ptr.base, ~ptr.offset, 4bv32); VAL [#in~ptr.base=6bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem2=1bv32, ~ptr.base=6bv32, ~ptr.offset=0bv32] [L45] assume 1bv32 == #t~mem2; VAL [#in~ptr.base=6bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem2=1bv32, ~ptr.base=6bv32, ~ptr.offset=0bv32] [L45] havoc #t~mem2; [L46] call write~intINTTYPE4(2bv32, ~ptr.base, ~ptr.offset, 4bv32); VAL [#in~ptr.base=6bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~ptr.base=6bv32, ~ptr.offset=0bv32] [L43-L47] ensures true; VAL [#in~ptr.base=6bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~ptr.base=6bv32, ~ptr.offset=0bv32] [L53] RET call freePtr(~ptr1~0.base, ~ptr1~0.offset); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~ptr1~0.base=6bv32, ~ptr1~0.offset=0bv32] [L55] CALL call freePtr(~ptr1~0.base, ~ptr1~0.offset); VAL [#in~ptr.base=6bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L43-L47] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; [L45] call #t~mem2 := read~intINTTYPE4(~ptr.base, ~ptr.offset, 4bv32); VAL [#in~ptr.base=6bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem2=2bv32, ~ptr.base=6bv32, ~ptr.offset=0bv32] [L45] assume !(1bv32 == #t~mem2); VAL [#in~ptr.base=6bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem2=2bv32, ~ptr.base=6bv32, ~ptr.offset=0bv32] [L45] CALL call __blast_assert(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L6] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=3bv32, #NULL!offset=5bv32, old(#NULL!base)=3bv32, old(#NULL!offset)=5bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=3bv32, old(#NULL!offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L51] ~ptr1~0 := { base: 0bv32, offset: 0bv32 }; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~ptr1~0!base=0bv32, ~ptr1~0!offset=0bv32] [L52] CALL call #t~ret3 := getPtr(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L38] CALL call #t~ret1 := getrr(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L31] FCALL call #t~malloc0 := #Ultimate.alloc(4bv32); [L31] ~r~0 := #t~malloc0; [L32] FCALL call write~intINTTYPE4(0bv32, { base: ~r~0!base, offset: ~r~0!offset }, 4bv32); [L33] #res := ~r~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #res!base=6bv32, #res!offset=0bv32, #t~malloc0!base=6bv32, #t~malloc0!offset=0bv32, ~r~0!base=6bv32, ~r~0!offset=0bv32] [L38] RET call #t~ret1 := getrr(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret1!base=6bv32, #t~ret1!offset=0bv32] [L38] ~r~1 := #t~ret1; [L38] havoc #t~ret1; [L39] FCALL call write~intINTTYPE4(1bv32, { base: ~r~1!base, offset: ~r~1!offset }, 4bv32); [L40] #res := ~r~1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #res!base=6bv32, #res!offset=0bv32, ~r~1!base=6bv32, ~r~1!offset=0bv32] [L52] RET call #t~ret3 := getPtr(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret3!base=6bv32, #t~ret3!offset=0bv32, ~ptr1~0!base=0bv32, ~ptr1~0!offset=0bv32] [L52] ~ptr1~0 := #t~ret3; [L52] havoc #t~ret3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~ptr1~0!base=6bv32, ~ptr1~0!offset=0bv32] [L53] CALL call freePtr(~ptr1~0); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L43-L47] ~ptr := #in~ptr; [L45] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~ptr!base, offset: ~ptr!offset }, 4bv32); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=1bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L45] COND TRUE 1bv32 == #t~mem2 VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=1bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L45] havoc #t~mem2; [L46] FCALL call write~intINTTYPE4(2bv32, { base: ~ptr!base, offset: ~ptr!offset }, 4bv32); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L53] RET call freePtr(~ptr1~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~ptr1~0!base=6bv32, ~ptr1~0!offset=0bv32] [L55] CALL call freePtr(~ptr1~0); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L43-L47] ~ptr := #in~ptr; [L45] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~ptr!base, offset: ~ptr!offset }, 4bv32); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=2bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L45] COND FALSE !(1bv32 == #t~mem2) VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=2bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L45] CALL call __blast_assert(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L6] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=3bv32, #NULL!offset=5bv32, old(#NULL!base)=3bv32, old(#NULL!offset)=5bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=3bv32, old(#NULL!offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L51] ~ptr1~0 := { base: 0bv32, offset: 0bv32 }; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~ptr1~0!base=0bv32, ~ptr1~0!offset=0bv32] [L52] CALL call #t~ret3 := getPtr(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L38] CALL call #t~ret1 := getrr(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L31] FCALL call #t~malloc0 := #Ultimate.alloc(4bv32); [L31] ~r~0 := #t~malloc0; [L32] FCALL call write~intINTTYPE4(0bv32, { base: ~r~0!base, offset: ~r~0!offset }, 4bv32); [L33] #res := ~r~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #res!base=6bv32, #res!offset=0bv32, #t~malloc0!base=6bv32, #t~malloc0!offset=0bv32, ~r~0!base=6bv32, ~r~0!offset=0bv32] [L38] RET call #t~ret1 := getrr(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret1!base=6bv32, #t~ret1!offset=0bv32] [L38] ~r~1 := #t~ret1; [L38] havoc #t~ret1; [L39] FCALL call write~intINTTYPE4(1bv32, { base: ~r~1!base, offset: ~r~1!offset }, 4bv32); [L40] #res := ~r~1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #res!base=6bv32, #res!offset=0bv32, ~r~1!base=6bv32, ~r~1!offset=0bv32] [L52] RET call #t~ret3 := getPtr(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret3!base=6bv32, #t~ret3!offset=0bv32, ~ptr1~0!base=0bv32, ~ptr1~0!offset=0bv32] [L52] ~ptr1~0 := #t~ret3; [L52] havoc #t~ret3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~ptr1~0!base=6bv32, ~ptr1~0!offset=0bv32] [L53] CALL call freePtr(~ptr1~0); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L43-L47] ~ptr := #in~ptr; [L45] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~ptr!base, offset: ~ptr!offset }, 4bv32); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=1bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L45] COND TRUE 1bv32 == #t~mem2 VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=1bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L45] havoc #t~mem2; [L46] FCALL call write~intINTTYPE4(2bv32, { base: ~ptr!base, offset: ~ptr!offset }, 4bv32); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L53] RET call freePtr(~ptr1~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~ptr1~0!base=6bv32, ~ptr1~0!offset=0bv32] [L55] CALL call freePtr(~ptr1~0); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L43-L47] ~ptr := #in~ptr; [L45] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~ptr!base, offset: ~ptr!offset }, 4bv32); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=2bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L45] COND FALSE !(1bv32 == #t~mem2) VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=2bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L45] CALL call __blast_assert(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L6] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=3bv32, #NULL!offset=5bv32, old(#NULL!base)=3bv32, old(#NULL!offset)=5bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=3bv32, old(#NULL!offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L51] ~ptr1~0 := { base: 0bv32, offset: 0bv32 }; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~ptr1~0!base=0bv32, ~ptr1~0!offset=0bv32] [L52] CALL call #t~ret3 := getPtr(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L38] CALL call #t~ret1 := getrr(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L31] FCALL call #t~malloc0 := #Ultimate.alloc(4bv32); [L31] ~r~0 := #t~malloc0; [L32] FCALL call write~intINTTYPE4(0bv32, { base: ~r~0!base, offset: ~r~0!offset }, 4bv32); [L33] #res := ~r~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #res!base=6bv32, #res!offset=0bv32, #t~malloc0!base=6bv32, #t~malloc0!offset=0bv32, ~r~0!base=6bv32, ~r~0!offset=0bv32] [L38] RET call #t~ret1 := getrr(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret1!base=6bv32, #t~ret1!offset=0bv32] [L38] ~r~1 := #t~ret1; [L38] havoc #t~ret1; [L39] FCALL call write~intINTTYPE4(1bv32, { base: ~r~1!base, offset: ~r~1!offset }, 4bv32); [L40] #res := ~r~1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #res!base=6bv32, #res!offset=0bv32, ~r~1!base=6bv32, ~r~1!offset=0bv32] [L52] RET call #t~ret3 := getPtr(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret3!base=6bv32, #t~ret3!offset=0bv32, ~ptr1~0!base=0bv32, ~ptr1~0!offset=0bv32] [L52] ~ptr1~0 := #t~ret3; [L52] havoc #t~ret3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~ptr1~0!base=6bv32, ~ptr1~0!offset=0bv32] [L53] CALL call freePtr(~ptr1~0); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L43-L47] ~ptr := #in~ptr; [L45] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~ptr!base, offset: ~ptr!offset }, 4bv32); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=1bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L45] COND TRUE 1bv32 == #t~mem2 VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=1bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L45] havoc #t~mem2; [L46] FCALL call write~intINTTYPE4(2bv32, { base: ~ptr!base, offset: ~ptr!offset }, 4bv32); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L53] RET call freePtr(~ptr1~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~ptr1~0!base=6bv32, ~ptr1~0!offset=0bv32] [L55] CALL call freePtr(~ptr1~0); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L43-L47] ~ptr := #in~ptr; [L45] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~ptr!base, offset: ~ptr!offset }, 4bv32); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=2bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L45] COND FALSE !(1bv32 == #t~mem2) VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=2bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L45] CALL call __blast_assert(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L6] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=3bv32, #NULL!offset=5bv32, old(#NULL!base)=3bv32, old(#NULL!offset)=5bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=3bv32, old(#NULL!offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L51] ~ptr1~0 := { base: 0bv32, offset: 0bv32 }; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~ptr1~0!base=0bv32, ~ptr1~0!offset=0bv32] [L52] CALL call #t~ret3 := getPtr(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L38] CALL call #t~ret1 := getrr(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L31] FCALL call #t~malloc0 := #Ultimate.alloc(4bv32); [L31] ~r~0 := #t~malloc0; [L32] FCALL call write~intINTTYPE4(0bv32, { base: ~r~0!base, offset: ~r~0!offset }, 4bv32); [L33] #res := ~r~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #res!base=6bv32, #res!offset=0bv32, #t~malloc0!base=6bv32, #t~malloc0!offset=0bv32, ~r~0!base=6bv32, ~r~0!offset=0bv32] [L38] RET call #t~ret1 := getrr(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret1!base=6bv32, #t~ret1!offset=0bv32] [L38] ~r~1 := #t~ret1; [L38] havoc #t~ret1; [L39] FCALL call write~intINTTYPE4(1bv32, { base: ~r~1!base, offset: ~r~1!offset }, 4bv32); [L40] #res := ~r~1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #res!base=6bv32, #res!offset=0bv32, ~r~1!base=6bv32, ~r~1!offset=0bv32] [L52] RET call #t~ret3 := getPtr(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret3!base=6bv32, #t~ret3!offset=0bv32, ~ptr1~0!base=0bv32, ~ptr1~0!offset=0bv32] [L52] ~ptr1~0 := #t~ret3; [L52] havoc #t~ret3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~ptr1~0!base=6bv32, ~ptr1~0!offset=0bv32] [L53] CALL call freePtr(~ptr1~0); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L43-L47] ~ptr := #in~ptr; [L45] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~ptr!base, offset: ~ptr!offset }, 4bv32); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=1bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L45] COND TRUE 1bv32 == #t~mem2 VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=1bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L45] havoc #t~mem2; [L46] FCALL call write~intINTTYPE4(2bv32, { base: ~ptr!base, offset: ~ptr!offset }, 4bv32); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L53] RET call freePtr(~ptr1~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~ptr1~0!base=6bv32, ~ptr1~0!offset=0bv32] [L55] CALL call freePtr(~ptr1~0); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L43-L47] ~ptr := #in~ptr; [L45] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~ptr!base, offset: ~ptr!offset }, 4bv32); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=2bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L45] COND FALSE !(1bv32 == #t~mem2) VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=2bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L45] CALL call __blast_assert(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L6] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L51] rr * ptr1 = 0; VAL [ptr1={0:0}] [L52] CALL, EXPR getPtr() [L38] CALL, EXPR getrr() [L31] rr * r = (rr *)malloc(sizeof *r); [L32] r -> state = 0 [L33] return r; VAL [\result={6:0}, malloc(sizeof *r)={6:0}, r={6:0}] [L38] RET, EXPR getrr() VAL [getrr()={6:0}] [L38] rr * r = getrr(); [L39] r -> state = 1 [L40] return r; VAL [\result={6:0}, r={6:0}] [L52] RET, EXPR getPtr() VAL [getPtr()={6:0}, ptr1={0:0}] [L52] ptr1 = getPtr() [L53] CALL freePtr(ptr1) VAL [ptr={6:0}] [L45] EXPR ptr -> state VAL [ptr={6:0}, ptr={6:0}, ptr -> state=1] [L45] (ptr -> state == 1) ? (0) : __blast_assert () VAL [ptr={6:0}, ptr={6:0}, ptr -> state=1] [L46] ptr -> state = 2 VAL [ptr={6:0}, ptr={6:0}] [L53] RET freePtr(ptr1) VAL [ptr1={6:0}] [L55] CALL freePtr(ptr1) VAL [ptr={6:0}] [L45] EXPR ptr -> state VAL [ptr={6:0}, ptr={6:0}, ptr -> state=2] [L45] (ptr -> state == 1) ? (0) : __blast_assert () VAL [ptr={6:0}, ptr={6:0}, ptr -> state=2] [L45] CALL __blast_assert () [L6] __VERIFIER_error() ----- [2018-11-23 11:05:57,867 WARN L170 areAnnotationChecker]: freePtrENTRY has no Hoare annotation [2018-11-23 11:05:57,868 WARN L170 areAnnotationChecker]: getPtrENTRY has no Hoare annotation [2018-11-23 11:05:57,868 WARN L170 areAnnotationChecker]: getPtrENTRY has no Hoare annotation [2018-11-23 11:05:57,868 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 11:05:57,868 WARN L170 areAnnotationChecker]: __blast_assertENTRY has no Hoare annotation [2018-11-23 11:05:57,868 WARN L170 areAnnotationChecker]: __blast_assertENTRY has no Hoare annotation [2018-11-23 11:05:57,868 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 11:05:57,868 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 11:05:57,869 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 11:05:57,869 WARN L170 areAnnotationChecker]: getrrENTRY has no Hoare annotation [2018-11-23 11:05:57,869 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2018-11-23 11:05:57,869 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2018-11-23 11:05:57,869 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2018-11-23 11:05:57,869 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:05:57,870 WARN L170 areAnnotationChecker]: __blast_assertFINAL has no Hoare annotation [2018-11-23 11:05:57,870 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 11:05:57,870 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 11:05:57,870 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2018-11-23 11:05:57,870 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2018-11-23 11:05:57,871 WARN L170 areAnnotationChecker]: getrrFINAL has no Hoare annotation [2018-11-23 11:05:57,871 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2018-11-23 11:05:57,871 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2018-11-23 11:05:57,871 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2018-11-23 11:05:57,871 WARN L170 areAnnotationChecker]: getPtrFINAL has no Hoare annotation [2018-11-23 11:05:57,872 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:05:57,872 WARN L170 areAnnotationChecker]: __blast_assertEXIT has no Hoare annotation [2018-11-23 11:05:57,872 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:05:57,872 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2018-11-23 11:05:57,872 WARN L170 areAnnotationChecker]: getrrEXIT has no Hoare annotation [2018-11-23 11:05:57,873 WARN L170 areAnnotationChecker]: freePtrFINAL has no Hoare annotation [2018-11-23 11:05:57,873 WARN L170 areAnnotationChecker]: getPtrEXIT has no Hoare annotation [2018-11-23 11:05:57,873 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2018-11-23 11:05:57,873 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2018-11-23 11:05:57,873 WARN L170 areAnnotationChecker]: freePtrEXIT has no Hoare annotation [2018-11-23 11:05:57,873 WARN L170 areAnnotationChecker]: freePtrEXIT has no Hoare annotation [2018-11-23 11:05:57,874 WARN L170 areAnnotationChecker]: L53-1 has no Hoare annotation [2018-11-23 11:05:57,874 WARN L170 areAnnotationChecker]: L53-1 has no Hoare annotation [2018-11-23 11:05:57,874 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2018-11-23 11:05:57,874 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:05:57,874 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:05:57,875 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 11:05:57,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:05:57 BoogieIcfgContainer [2018-11-23 11:05:57,877 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:05:57,878 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:05:57,878 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:05:57,878 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:05:57,879 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:05:54" (3/4) ... [2018-11-23 11:05:57,882 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|=(_ bv3 32), |#NULL.offset|=(_ bv5 32), |old(#NULL.base)|=(_ bv3 32), |old(#NULL.offset)|=(_ bv5 32)] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv3 32), |old(#NULL.offset)|=(_ bv5 32)] [?] assume true; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv3 32), |old(#NULL.offset)|=(_ bv5 32)] [?] RET #35#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret4 := main(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] ~ptr1~0.base, ~ptr1~0.offset := 0bv32, 0bv32; VAL [main_~ptr1~0.base=(_ bv0 32), main_~ptr1~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret3.base, #t~ret3.offset := getPtr(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret1.base, #t~ret1.offset := getrr(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(4bv32);~r~0.base, ~r~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~intINTTYPE4(0bv32, ~r~0.base, ~r~0.offset, 4bv32);#res.base, #res.offset := ~r~0.base, ~r~0.offset; VAL [getrr_~r~0.base=(_ bv6 32), getrr_~r~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |getrr_#res.base|=(_ bv6 32), |getrr_#res.offset|=(_ bv0 32), |getrr_#t~malloc0.base|=(_ bv6 32), |getrr_#t~malloc0.offset|=(_ bv0 32)] [?] assume true; VAL [getrr_~r~0.base=(_ bv6 32), getrr_~r~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |getrr_#res.base|=(_ bv6 32), |getrr_#res.offset|=(_ bv0 32), |getrr_#t~malloc0.base|=(_ bv6 32), |getrr_#t~malloc0.offset|=(_ bv0 32)] [?] RET #33#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |getPtr_#t~ret1.base|=(_ bv6 32), |getPtr_#t~ret1.offset|=(_ bv0 32)] [?] ~r~1.base, ~r~1.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset;call write~intINTTYPE4(1bv32, ~r~1.base, ~r~1.offset, 4bv32);#res.base, #res.offset := ~r~1.base, ~r~1.offset; VAL [getPtr_~r~1.base=(_ bv6 32), getPtr_~r~1.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |getPtr_#res.base|=(_ bv6 32), |getPtr_#res.offset|=(_ bv0 32)] [?] assume true; VAL [getPtr_~r~1.base=(_ bv6 32), getPtr_~r~1.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |getPtr_#res.base|=(_ bv6 32), |getPtr_#res.offset|=(_ bv0 32)] [?] RET #39#return; VAL [main_~ptr1~0.base=(_ bv0 32), main_~ptr1~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~ret3.base|=(_ bv6 32), |main_#t~ret3.offset|=(_ bv0 32)] [?] ~ptr1~0.base, ~ptr1~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset; VAL [main_~ptr1~0.base=(_ bv6 32), main_~ptr1~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call freePtr(~ptr1~0.base, ~ptr1~0.offset); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |freePtr_#in~ptr.base|=(_ bv6 32), |freePtr_#in~ptr.offset|=(_ bv0 32)] [?] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;call #t~mem2 := read~intINTTYPE4(~ptr.base, ~ptr.offset, 4bv32); VAL [freePtr_~ptr.base=(_ bv6 32), freePtr_~ptr.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |freePtr_#in~ptr.base|=(_ bv6 32), |freePtr_#in~ptr.offset|=(_ bv0 32), |freePtr_#t~mem2|=(_ bv1 32)] [?] assume 1bv32 == #t~mem2; VAL [freePtr_~ptr.base=(_ bv6 32), freePtr_~ptr.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |freePtr_#in~ptr.base|=(_ bv6 32), |freePtr_#in~ptr.offset|=(_ bv0 32), |freePtr_#t~mem2|=(_ bv1 32)] [?] havoc #t~mem2;call write~intINTTYPE4(2bv32, ~ptr.base, ~ptr.offset, 4bv32); VAL [freePtr_~ptr.base=(_ bv6 32), freePtr_~ptr.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |freePtr_#in~ptr.base|=(_ bv6 32), |freePtr_#in~ptr.offset|=(_ bv0 32)] [?] assume true; VAL [freePtr_~ptr.base=(_ bv6 32), freePtr_~ptr.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |freePtr_#in~ptr.base|=(_ bv6 32), |freePtr_#in~ptr.offset|=(_ bv0 32)] [?] RET #41#return; VAL [main_~ptr1~0.base=(_ bv6 32), main_~ptr1~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call freePtr(~ptr1~0.base, ~ptr1~0.offset); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |freePtr_#in~ptr.base|=(_ bv6 32), |freePtr_#in~ptr.offset|=(_ bv0 32)] [?] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;call #t~mem2 := read~intINTTYPE4(~ptr.base, ~ptr.offset, 4bv32); VAL [freePtr_~ptr.base=(_ bv6 32), freePtr_~ptr.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |freePtr_#in~ptr.base|=(_ bv6 32), |freePtr_#in~ptr.offset|=(_ bv0 32), |freePtr_#t~mem2|=(_ bv2 32)] [?] assume !(1bv32 == #t~mem2); VAL [freePtr_~ptr.base=(_ bv6 32), freePtr_~ptr.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |freePtr_#in~ptr.base|=(_ bv6 32), |freePtr_#in~ptr.offset|=(_ bv0 32), |freePtr_#t~mem2|=(_ bv2 32)] [?] CALL call __blast_assert(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] assume !false; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=3bv32, #NULL.offset=5bv32, old(#NULL.base)=3bv32, old(#NULL.offset)=5bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=3bv32, old(#NULL.offset)=5bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=3bv32, old(#NULL.offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret4 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L51] ~ptr1~0.base, ~ptr1~0.offset := 0bv32, 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~ptr1~0.base=0bv32, ~ptr1~0.offset=0bv32] [L52] CALL call #t~ret3.base, #t~ret3.offset := getPtr(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L38] CALL call #t~ret1.base, #t~ret1.offset := getrr(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L31] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(4bv32); [L31] ~r~0.base, ~r~0.offset := #t~malloc0.base, #t~malloc0.offset; [L32] call write~intINTTYPE4(0bv32, ~r~0.base, ~r~0.offset, 4bv32); [L33] #res.base, #res.offset := ~r~0.base, ~r~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #res.base=6bv32, #res.offset=0bv32, #t~malloc0.base=6bv32, #t~malloc0.offset=0bv32, ~r~0.base=6bv32, ~r~0.offset=0bv32] [L29-L34] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #res.base=6bv32, #res.offset=0bv32, #t~malloc0.base=6bv32, #t~malloc0.offset=0bv32, ~r~0.base=6bv32, ~r~0.offset=0bv32] [L38] RET call #t~ret1.base, #t~ret1.offset := getrr(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret1.base=6bv32, #t~ret1.offset=0bv32] [L38] ~r~1.base, ~r~1.offset := #t~ret1.base, #t~ret1.offset; [L38] havoc #t~ret1.base, #t~ret1.offset; [L39] call write~intINTTYPE4(1bv32, ~r~1.base, ~r~1.offset, 4bv32); [L40] #res.base, #res.offset := ~r~1.base, ~r~1.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #res.base=6bv32, #res.offset=0bv32, ~r~1.base=6bv32, ~r~1.offset=0bv32] [L36-L41] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #res.base=6bv32, #res.offset=0bv32, ~r~1.base=6bv32, ~r~1.offset=0bv32] [L52] RET call #t~ret3.base, #t~ret3.offset := getPtr(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret3.base=6bv32, #t~ret3.offset=0bv32, ~ptr1~0.base=0bv32, ~ptr1~0.offset=0bv32] [L52] ~ptr1~0.base, ~ptr1~0.offset := #t~ret3.base, #t~ret3.offset; [L52] havoc #t~ret3.base, #t~ret3.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~ptr1~0.base=6bv32, ~ptr1~0.offset=0bv32] [L53] CALL call freePtr(~ptr1~0.base, ~ptr1~0.offset); VAL [#in~ptr.base=6bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L43-L47] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; [L45] call #t~mem2 := read~intINTTYPE4(~ptr.base, ~ptr.offset, 4bv32); VAL [#in~ptr.base=6bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem2=1bv32, ~ptr.base=6bv32, ~ptr.offset=0bv32] [L45] assume 1bv32 == #t~mem2; VAL [#in~ptr.base=6bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem2=1bv32, ~ptr.base=6bv32, ~ptr.offset=0bv32] [L45] havoc #t~mem2; [L46] call write~intINTTYPE4(2bv32, ~ptr.base, ~ptr.offset, 4bv32); VAL [#in~ptr.base=6bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~ptr.base=6bv32, ~ptr.offset=0bv32] [L43-L47] ensures true; VAL [#in~ptr.base=6bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~ptr.base=6bv32, ~ptr.offset=0bv32] [L53] RET call freePtr(~ptr1~0.base, ~ptr1~0.offset); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~ptr1~0.base=6bv32, ~ptr1~0.offset=0bv32] [L55] CALL call freePtr(~ptr1~0.base, ~ptr1~0.offset); VAL [#in~ptr.base=6bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L43-L47] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; [L45] call #t~mem2 := read~intINTTYPE4(~ptr.base, ~ptr.offset, 4bv32); VAL [#in~ptr.base=6bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem2=2bv32, ~ptr.base=6bv32, ~ptr.offset=0bv32] [L45] assume !(1bv32 == #t~mem2); VAL [#in~ptr.base=6bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem2=2bv32, ~ptr.base=6bv32, ~ptr.offset=0bv32] [L45] CALL call __blast_assert(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L6] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=3bv32, #NULL.offset=5bv32, old(#NULL.base)=3bv32, old(#NULL.offset)=5bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=3bv32, old(#NULL.offset)=5bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=3bv32, old(#NULL.offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret4 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L51] ~ptr1~0.base, ~ptr1~0.offset := 0bv32, 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~ptr1~0.base=0bv32, ~ptr1~0.offset=0bv32] [L52] CALL call #t~ret3.base, #t~ret3.offset := getPtr(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L38] CALL call #t~ret1.base, #t~ret1.offset := getrr(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L31] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(4bv32); [L31] ~r~0.base, ~r~0.offset := #t~malloc0.base, #t~malloc0.offset; [L32] call write~intINTTYPE4(0bv32, ~r~0.base, ~r~0.offset, 4bv32); [L33] #res.base, #res.offset := ~r~0.base, ~r~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #res.base=6bv32, #res.offset=0bv32, #t~malloc0.base=6bv32, #t~malloc0.offset=0bv32, ~r~0.base=6bv32, ~r~0.offset=0bv32] [L29-L34] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #res.base=6bv32, #res.offset=0bv32, #t~malloc0.base=6bv32, #t~malloc0.offset=0bv32, ~r~0.base=6bv32, ~r~0.offset=0bv32] [L38] RET call #t~ret1.base, #t~ret1.offset := getrr(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret1.base=6bv32, #t~ret1.offset=0bv32] [L38] ~r~1.base, ~r~1.offset := #t~ret1.base, #t~ret1.offset; [L38] havoc #t~ret1.base, #t~ret1.offset; [L39] call write~intINTTYPE4(1bv32, ~r~1.base, ~r~1.offset, 4bv32); [L40] #res.base, #res.offset := ~r~1.base, ~r~1.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #res.base=6bv32, #res.offset=0bv32, ~r~1.base=6bv32, ~r~1.offset=0bv32] [L36-L41] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #res.base=6bv32, #res.offset=0bv32, ~r~1.base=6bv32, ~r~1.offset=0bv32] [L52] RET call #t~ret3.base, #t~ret3.offset := getPtr(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret3.base=6bv32, #t~ret3.offset=0bv32, ~ptr1~0.base=0bv32, ~ptr1~0.offset=0bv32] [L52] ~ptr1~0.base, ~ptr1~0.offset := #t~ret3.base, #t~ret3.offset; [L52] havoc #t~ret3.base, #t~ret3.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~ptr1~0.base=6bv32, ~ptr1~0.offset=0bv32] [L53] CALL call freePtr(~ptr1~0.base, ~ptr1~0.offset); VAL [#in~ptr.base=6bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L43-L47] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; [L45] call #t~mem2 := read~intINTTYPE4(~ptr.base, ~ptr.offset, 4bv32); VAL [#in~ptr.base=6bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem2=1bv32, ~ptr.base=6bv32, ~ptr.offset=0bv32] [L45] assume 1bv32 == #t~mem2; VAL [#in~ptr.base=6bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem2=1bv32, ~ptr.base=6bv32, ~ptr.offset=0bv32] [L45] havoc #t~mem2; [L46] call write~intINTTYPE4(2bv32, ~ptr.base, ~ptr.offset, 4bv32); VAL [#in~ptr.base=6bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~ptr.base=6bv32, ~ptr.offset=0bv32] [L43-L47] ensures true; VAL [#in~ptr.base=6bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~ptr.base=6bv32, ~ptr.offset=0bv32] [L53] RET call freePtr(~ptr1~0.base, ~ptr1~0.offset); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~ptr1~0.base=6bv32, ~ptr1~0.offset=0bv32] [L55] CALL call freePtr(~ptr1~0.base, ~ptr1~0.offset); VAL [#in~ptr.base=6bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L43-L47] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; [L45] call #t~mem2 := read~intINTTYPE4(~ptr.base, ~ptr.offset, 4bv32); VAL [#in~ptr.base=6bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem2=2bv32, ~ptr.base=6bv32, ~ptr.offset=0bv32] [L45] assume !(1bv32 == #t~mem2); VAL [#in~ptr.base=6bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem2=2bv32, ~ptr.base=6bv32, ~ptr.offset=0bv32] [L45] CALL call __blast_assert(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L6] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=3bv32, #NULL!offset=5bv32, old(#NULL!base)=3bv32, old(#NULL!offset)=5bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=3bv32, old(#NULL!offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L51] ~ptr1~0 := { base: 0bv32, offset: 0bv32 }; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~ptr1~0!base=0bv32, ~ptr1~0!offset=0bv32] [L52] CALL call #t~ret3 := getPtr(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L38] CALL call #t~ret1 := getrr(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L31] FCALL call #t~malloc0 := #Ultimate.alloc(4bv32); [L31] ~r~0 := #t~malloc0; [L32] FCALL call write~intINTTYPE4(0bv32, { base: ~r~0!base, offset: ~r~0!offset }, 4bv32); [L33] #res := ~r~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #res!base=6bv32, #res!offset=0bv32, #t~malloc0!base=6bv32, #t~malloc0!offset=0bv32, ~r~0!base=6bv32, ~r~0!offset=0bv32] [L38] RET call #t~ret1 := getrr(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret1!base=6bv32, #t~ret1!offset=0bv32] [L38] ~r~1 := #t~ret1; [L38] havoc #t~ret1; [L39] FCALL call write~intINTTYPE4(1bv32, { base: ~r~1!base, offset: ~r~1!offset }, 4bv32); [L40] #res := ~r~1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #res!base=6bv32, #res!offset=0bv32, ~r~1!base=6bv32, ~r~1!offset=0bv32] [L52] RET call #t~ret3 := getPtr(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret3!base=6bv32, #t~ret3!offset=0bv32, ~ptr1~0!base=0bv32, ~ptr1~0!offset=0bv32] [L52] ~ptr1~0 := #t~ret3; [L52] havoc #t~ret3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~ptr1~0!base=6bv32, ~ptr1~0!offset=0bv32] [L53] CALL call freePtr(~ptr1~0); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L43-L47] ~ptr := #in~ptr; [L45] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~ptr!base, offset: ~ptr!offset }, 4bv32); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=1bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L45] COND TRUE 1bv32 == #t~mem2 VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=1bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L45] havoc #t~mem2; [L46] FCALL call write~intINTTYPE4(2bv32, { base: ~ptr!base, offset: ~ptr!offset }, 4bv32); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L53] RET call freePtr(~ptr1~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~ptr1~0!base=6bv32, ~ptr1~0!offset=0bv32] [L55] CALL call freePtr(~ptr1~0); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L43-L47] ~ptr := #in~ptr; [L45] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~ptr!base, offset: ~ptr!offset }, 4bv32); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=2bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L45] COND FALSE !(1bv32 == #t~mem2) VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=2bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L45] CALL call __blast_assert(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L6] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=3bv32, #NULL!offset=5bv32, old(#NULL!base)=3bv32, old(#NULL!offset)=5bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=3bv32, old(#NULL!offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L51] ~ptr1~0 := { base: 0bv32, offset: 0bv32 }; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~ptr1~0!base=0bv32, ~ptr1~0!offset=0bv32] [L52] CALL call #t~ret3 := getPtr(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L38] CALL call #t~ret1 := getrr(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L31] FCALL call #t~malloc0 := #Ultimate.alloc(4bv32); [L31] ~r~0 := #t~malloc0; [L32] FCALL call write~intINTTYPE4(0bv32, { base: ~r~0!base, offset: ~r~0!offset }, 4bv32); [L33] #res := ~r~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #res!base=6bv32, #res!offset=0bv32, #t~malloc0!base=6bv32, #t~malloc0!offset=0bv32, ~r~0!base=6bv32, ~r~0!offset=0bv32] [L38] RET call #t~ret1 := getrr(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret1!base=6bv32, #t~ret1!offset=0bv32] [L38] ~r~1 := #t~ret1; [L38] havoc #t~ret1; [L39] FCALL call write~intINTTYPE4(1bv32, { base: ~r~1!base, offset: ~r~1!offset }, 4bv32); [L40] #res := ~r~1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #res!base=6bv32, #res!offset=0bv32, ~r~1!base=6bv32, ~r~1!offset=0bv32] [L52] RET call #t~ret3 := getPtr(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret3!base=6bv32, #t~ret3!offset=0bv32, ~ptr1~0!base=0bv32, ~ptr1~0!offset=0bv32] [L52] ~ptr1~0 := #t~ret3; [L52] havoc #t~ret3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~ptr1~0!base=6bv32, ~ptr1~0!offset=0bv32] [L53] CALL call freePtr(~ptr1~0); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L43-L47] ~ptr := #in~ptr; [L45] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~ptr!base, offset: ~ptr!offset }, 4bv32); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=1bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L45] COND TRUE 1bv32 == #t~mem2 VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=1bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L45] havoc #t~mem2; [L46] FCALL call write~intINTTYPE4(2bv32, { base: ~ptr!base, offset: ~ptr!offset }, 4bv32); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L53] RET call freePtr(~ptr1~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~ptr1~0!base=6bv32, ~ptr1~0!offset=0bv32] [L55] CALL call freePtr(~ptr1~0); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L43-L47] ~ptr := #in~ptr; [L45] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~ptr!base, offset: ~ptr!offset }, 4bv32); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=2bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L45] COND FALSE !(1bv32 == #t~mem2) VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=2bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L45] CALL call __blast_assert(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L6] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=3bv32, #NULL!offset=5bv32, old(#NULL!base)=3bv32, old(#NULL!offset)=5bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=3bv32, old(#NULL!offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L51] ~ptr1~0 := { base: 0bv32, offset: 0bv32 }; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~ptr1~0!base=0bv32, ~ptr1~0!offset=0bv32] [L52] CALL call #t~ret3 := getPtr(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L38] CALL call #t~ret1 := getrr(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L31] FCALL call #t~malloc0 := #Ultimate.alloc(4bv32); [L31] ~r~0 := #t~malloc0; [L32] FCALL call write~intINTTYPE4(0bv32, { base: ~r~0!base, offset: ~r~0!offset }, 4bv32); [L33] #res := ~r~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #res!base=6bv32, #res!offset=0bv32, #t~malloc0!base=6bv32, #t~malloc0!offset=0bv32, ~r~0!base=6bv32, ~r~0!offset=0bv32] [L38] RET call #t~ret1 := getrr(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret1!base=6bv32, #t~ret1!offset=0bv32] [L38] ~r~1 := #t~ret1; [L38] havoc #t~ret1; [L39] FCALL call write~intINTTYPE4(1bv32, { base: ~r~1!base, offset: ~r~1!offset }, 4bv32); [L40] #res := ~r~1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #res!base=6bv32, #res!offset=0bv32, ~r~1!base=6bv32, ~r~1!offset=0bv32] [L52] RET call #t~ret3 := getPtr(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret3!base=6bv32, #t~ret3!offset=0bv32, ~ptr1~0!base=0bv32, ~ptr1~0!offset=0bv32] [L52] ~ptr1~0 := #t~ret3; [L52] havoc #t~ret3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~ptr1~0!base=6bv32, ~ptr1~0!offset=0bv32] [L53] CALL call freePtr(~ptr1~0); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L43-L47] ~ptr := #in~ptr; [L45] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~ptr!base, offset: ~ptr!offset }, 4bv32); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=1bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L45] COND TRUE 1bv32 == #t~mem2 VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=1bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L45] havoc #t~mem2; [L46] FCALL call write~intINTTYPE4(2bv32, { base: ~ptr!base, offset: ~ptr!offset }, 4bv32); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L53] RET call freePtr(~ptr1~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~ptr1~0!base=6bv32, ~ptr1~0!offset=0bv32] [L55] CALL call freePtr(~ptr1~0); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L43-L47] ~ptr := #in~ptr; [L45] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~ptr!base, offset: ~ptr!offset }, 4bv32); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=2bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L45] COND FALSE !(1bv32 == #t~mem2) VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=2bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L45] CALL call __blast_assert(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L6] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=3bv32, #NULL!offset=5bv32, old(#NULL!base)=3bv32, old(#NULL!offset)=5bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=3bv32, old(#NULL!offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L51] ~ptr1~0 := { base: 0bv32, offset: 0bv32 }; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~ptr1~0!base=0bv32, ~ptr1~0!offset=0bv32] [L52] CALL call #t~ret3 := getPtr(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L38] CALL call #t~ret1 := getrr(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L31] FCALL call #t~malloc0 := #Ultimate.alloc(4bv32); [L31] ~r~0 := #t~malloc0; [L32] FCALL call write~intINTTYPE4(0bv32, { base: ~r~0!base, offset: ~r~0!offset }, 4bv32); [L33] #res := ~r~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #res!base=6bv32, #res!offset=0bv32, #t~malloc0!base=6bv32, #t~malloc0!offset=0bv32, ~r~0!base=6bv32, ~r~0!offset=0bv32] [L38] RET call #t~ret1 := getrr(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret1!base=6bv32, #t~ret1!offset=0bv32] [L38] ~r~1 := #t~ret1; [L38] havoc #t~ret1; [L39] FCALL call write~intINTTYPE4(1bv32, { base: ~r~1!base, offset: ~r~1!offset }, 4bv32); [L40] #res := ~r~1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #res!base=6bv32, #res!offset=0bv32, ~r~1!base=6bv32, ~r~1!offset=0bv32] [L52] RET call #t~ret3 := getPtr(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret3!base=6bv32, #t~ret3!offset=0bv32, ~ptr1~0!base=0bv32, ~ptr1~0!offset=0bv32] [L52] ~ptr1~0 := #t~ret3; [L52] havoc #t~ret3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~ptr1~0!base=6bv32, ~ptr1~0!offset=0bv32] [L53] CALL call freePtr(~ptr1~0); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L43-L47] ~ptr := #in~ptr; [L45] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~ptr!base, offset: ~ptr!offset }, 4bv32); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=1bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L45] COND TRUE 1bv32 == #t~mem2 VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=1bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L45] havoc #t~mem2; [L46] FCALL call write~intINTTYPE4(2bv32, { base: ~ptr!base, offset: ~ptr!offset }, 4bv32); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L53] RET call freePtr(~ptr1~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~ptr1~0!base=6bv32, ~ptr1~0!offset=0bv32] [L55] CALL call freePtr(~ptr1~0); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L43-L47] ~ptr := #in~ptr; [L45] FCALL call #t~mem2 := read~intINTTYPE4({ base: ~ptr!base, offset: ~ptr!offset }, 4bv32); VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=2bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L45] COND FALSE !(1bv32 == #t~mem2) VAL [#in~ptr!base=6bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem2=2bv32, ~ptr!base=6bv32, ~ptr!offset=0bv32] [L45] CALL call __blast_assert(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L6] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L51] rr * ptr1 = 0; VAL [ptr1={0:0}] [L52] CALL, EXPR getPtr() [L38] CALL, EXPR getrr() [L31] rr * r = (rr *)malloc(sizeof *r); [L32] r -> state = 0 [L33] return r; VAL [\result={6:0}, malloc(sizeof *r)={6:0}, r={6:0}] [L38] RET, EXPR getrr() VAL [getrr()={6:0}] [L38] rr * r = getrr(); [L39] r -> state = 1 [L40] return r; VAL [\result={6:0}, r={6:0}] [L52] RET, EXPR getPtr() VAL [getPtr()={6:0}, ptr1={0:0}] [L52] ptr1 = getPtr() [L53] CALL freePtr(ptr1) VAL [ptr={6:0}] [L45] EXPR ptr -> state VAL [ptr={6:0}, ptr={6:0}, ptr -> state=1] [L45] (ptr -> state == 1) ? (0) : __blast_assert () VAL [ptr={6:0}, ptr={6:0}, ptr -> state=1] [L46] ptr -> state = 2 VAL [ptr={6:0}, ptr={6:0}] [L53] RET freePtr(ptr1) VAL [ptr1={6:0}] [L55] CALL freePtr(ptr1) VAL [ptr={6:0}] [L45] EXPR ptr -> state VAL [ptr={6:0}, ptr={6:0}, ptr -> state=2] [L45] (ptr -> state == 1) ? (0) : __blast_assert () VAL [ptr={6:0}, ptr={6:0}, ptr -> state=2] [L45] CALL __blast_assert () [L6] __VERIFIER_error() ----- [2018-11-23 11:05:57,982 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/1_3_true-termination.c_false-unreach-call.i-witness.graphml [2018-11-23 11:05:57,982 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:05:57,983 INFO L168 Benchmark]: Toolchain (without parser) took 4514.25 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 722.5 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -589.0 MB). Peak memory consumption was 133.4 MB. Max. memory is 7.1 GB. [2018-11-23 11:05:57,985 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:05:57,986 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.57 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:05:57,987 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.47 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 11:05:57,987 INFO L168 Benchmark]: Boogie Preprocessor took 40.29 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 11:05:57,988 INFO L168 Benchmark]: RCFGBuilder took 677.69 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 722.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -755.9 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-23 11:05:57,988 INFO L168 Benchmark]: TraceAbstraction took 3318.64 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 156.3 MB). Peak memory consumption was 156.3 MB. Max. memory is 7.1 GB. [2018-11-23 11:05:57,989 INFO L168 Benchmark]: Witness Printer took 104.01 ms. Allocated memory is still 2.3 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:05:57,993 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 337.57 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 30.47 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 677.69 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 722.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -755.9 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3318.64 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 156.3 MB). Peak memory consumption was 156.3 MB. Max. memory is 7.1 GB. * Witness Printer took 104.01 ms. Allocated memory is still 2.3 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L51] rr * ptr1 = 0; VAL [ptr1={0:0}] [L52] CALL, EXPR getPtr() [L38] CALL, EXPR getrr() [L31] rr * r = (rr *)malloc(sizeof *r); [L32] r -> state = 0 [L33] return r; VAL [\result={6:0}, malloc(sizeof *r)={6:0}, r={6:0}] [L38] RET, EXPR getrr() VAL [getrr()={6:0}] [L38] rr * r = getrr(); [L39] r -> state = 1 [L40] return r; VAL [\result={6:0}, r={6:0}] [L52] RET, EXPR getPtr() VAL [getPtr()={6:0}, ptr1={0:0}] [L52] ptr1 = getPtr() [L53] CALL freePtr(ptr1) VAL [ptr={6:0}] [L45] EXPR ptr -> state VAL [ptr={6:0}, ptr={6:0}, ptr -> state=1] [L45] (ptr -> state == 1) ? (0) : __blast_assert () VAL [ptr={6:0}, ptr={6:0}, ptr -> state=1] [L46] ptr -> state = 2 VAL [ptr={6:0}, ptr={6:0}] [L53] RET freePtr(ptr1) VAL [ptr1={6:0}] [L55] CALL freePtr(ptr1) VAL [ptr={6:0}] [L45] EXPR ptr -> state VAL [ptr={6:0}, ptr={6:0}, ptr -> state=2] [L45] (ptr -> state == 1) ? (0) : __blast_assert () VAL [ptr={6:0}, ptr={6:0}, ptr -> state=2] [L45] CALL __blast_assert () [L6] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 32 locations, 1 error locations. UNSAFE Result, 3.2s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 25 SDtfs, 3 SDslu, 156 SDs, 0 SdLazy, 50 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 1577 SizeOfPredicates, 12 NumberOfNonLiveVariables, 72 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...