java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-regression/alt_test_true-termination.c_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:53:29,544 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:53:29,546 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:53:29,562 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:53:29,563 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:53:29,564 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:53:29,565 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:53:29,567 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:53:29,571 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:53:29,572 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:53:29,572 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:53:29,573 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:53:29,575 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:53:29,576 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:53:29,585 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:53:29,586 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:53:29,587 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:53:29,589 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:53:29,596 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:53:29,598 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:53:29,599 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:53:29,601 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:53:29,605 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:53:29,605 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:53:29,606 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:53:29,606 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:53:29,607 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:53:29,609 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:53:29,610 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:53:29,612 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:53:29,612 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:53:29,614 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:53:29,614 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:53:29,614 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:53:29,615 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:53:29,617 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:53:29,617 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:53:29,643 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:53:29,644 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:53:29,645 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:53:29,645 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:53:29,645 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:53:29,646 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:53:29,646 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:53:29,646 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:53:29,646 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:53:29,646 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:53:29,647 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:53:29,647 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:53:29,647 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:53:29,647 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:53:29,647 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:53:29,647 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:53:29,649 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:53:29,649 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:53:29,649 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:53:29,649 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:53:29,650 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:53:29,650 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:53:29,650 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:53:29,650 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:53:29,650 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:53:29,651 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:53:29,651 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:53:29,651 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:53:29,651 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:53:29,651 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:53:29,652 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:53:29,722 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:53:29,739 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:53:29,744 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:53:29,746 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:53:29,746 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:53:29,747 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/alt_test_true-termination.c_false-unreach-call.i [2018-11-23 12:53:29,830 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d6e13411/90398e15f7f347939e6eb7e765b98c84/FLAG719d2fb40 [2018-11-23 12:53:30,435 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:53:30,436 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/alt_test_true-termination.c_false-unreach-call.i [2018-11-23 12:53:30,460 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d6e13411/90398e15f7f347939e6eb7e765b98c84/FLAG719d2fb40 [2018-11-23 12:53:30,683 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d6e13411/90398e15f7f347939e6eb7e765b98c84 [2018-11-23 12:53:30,692 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:53:30,694 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:53:30,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:53:30,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:53:30,699 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:53:30,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:53:30" (1/1) ... [2018-11-23 12:53:30,704 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a59a456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:30, skipping insertion in model container [2018-11-23 12:53:30,704 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:53:30" (1/1) ... [2018-11-23 12:53:30,715 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:53:30,784 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:53:31,265 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:53:31,286 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:53:31,388 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:53:31,526 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:53:31,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:31 WrapperNode [2018-11-23 12:53:31,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:53:31,528 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:53:31,528 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:53:31,529 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:53:31,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:31" (1/1) ... [2018-11-23 12:53:31,691 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:31" (1/1) ... [2018-11-23 12:53:31,704 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:53:31,704 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:53:31,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:53:31,705 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:53:31,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:31" (1/1) ... [2018-11-23 12:53:31,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:31" (1/1) ... [2018-11-23 12:53:31,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:31" (1/1) ... [2018-11-23 12:53:31,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:31" (1/1) ... [2018-11-23 12:53:31,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:31" (1/1) ... [2018-11-23 12:53:31,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:31" (1/1) ... [2018-11-23 12:53:31,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:31" (1/1) ... [2018-11-23 12:53:31,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:53:31,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:53:31,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:53:31,748 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:53:31,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:53:31,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:53:31,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:53:31,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:53:31,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:53:31,811 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:53:31,811 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:53:31,811 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2018-11-23 12:53:31,811 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2018-11-23 12:53:31,811 INFO L130 BoogieDeclarations]: Found specification of procedure l_malloc [2018-11-23 12:53:31,812 INFO L138 BoogieDeclarations]: Found implementation of procedure l_malloc [2018-11-23 12:53:31,812 INFO L130 BoogieDeclarations]: Found specification of procedure l_free [2018-11-23 12:53:31,812 INFO L138 BoogieDeclarations]: Found implementation of procedure l_free [2018-11-23 12:53:31,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:53:31,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:53:32,334 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:53:32,335 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 12:53:32,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:53:32 BoogieIcfgContainer [2018-11-23 12:53:32,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:53:32,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:53:32,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:53:32,340 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:53:32,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:53:30" (1/3) ... [2018-11-23 12:53:32,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3941aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:53:32, skipping insertion in model container [2018-11-23 12:53:32,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:31" (2/3) ... [2018-11-23 12:53:32,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3941aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:53:32, skipping insertion in model container [2018-11-23 12:53:32,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:53:32" (3/3) ... [2018-11-23 12:53:32,344 INFO L112 eAbstractionObserver]: Analyzing ICFG alt_test_true-termination.c_false-unreach-call.i [2018-11-23 12:53:32,352 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:53:32,360 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:53:32,379 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:53:32,416 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:53:32,416 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:53:32,417 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:53:32,417 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:53:32,417 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:53:32,417 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:53:32,417 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:53:32,418 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:53:32,418 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:53:32,438 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 12:53:32,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:53:32,444 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:32,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:32,448 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:32,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:32,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1044108918, now seen corresponding path program 1 times [2018-11-23 12:53:32,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:32,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:32,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:32,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:32,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:32,850 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 12:53:32,854 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~globalState~0 := 0; {34#true} is VALID [2018-11-23 12:53:32,855 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:53:32,855 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #43#return; {34#true} is VALID [2018-11-23 12:53:32,855 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret32 := main(#in~argc, #in~argv.base, #in~argv.offset); {34#true} is VALID [2018-11-23 12:53:32,856 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; {34#true} is VALID [2018-11-23 12:53:32,856 INFO L256 TraceCheckUtils]: 6: Hoare triple {34#true} call #t~ret30.base, #t~ret30.offset := l_malloc(4); {34#true} is VALID [2018-11-23 12:53:32,856 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#true} ~size := #in~size;call #t~malloc31.base, #t~malloc31.offset := #Ultimate.alloc(~size);~retVal~0.base, ~retVal~0.offset := #t~malloc31.base, #t~malloc31.offset; {34#true} is VALID [2018-11-23 12:53:32,859 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#true} assume ~retVal~0.base != 0 || ~retVal~0.offset != 0;~globalState~0 := 1; {36#(= 1 ~globalState~0)} is VALID [2018-11-23 12:53:32,862 INFO L273 TraceCheckUtils]: 9: Hoare triple {36#(= 1 ~globalState~0)} #res.base, #res.offset := ~retVal~0.base, ~retVal~0.offset; {36#(= 1 ~globalState~0)} is VALID [2018-11-23 12:53:32,866 INFO L273 TraceCheckUtils]: 10: Hoare triple {36#(= 1 ~globalState~0)} assume true; {36#(= 1 ~globalState~0)} is VALID [2018-11-23 12:53:32,868 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {36#(= 1 ~globalState~0)} {34#true} #47#return; {36#(= 1 ~globalState~0)} is VALID [2018-11-23 12:53:32,868 INFO L273 TraceCheckUtils]: 12: Hoare triple {36#(= 1 ~globalState~0)} ~a~0.base, ~a~0.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {36#(= 1 ~globalState~0)} is VALID [2018-11-23 12:53:32,878 INFO L256 TraceCheckUtils]: 13: Hoare triple {36#(= 1 ~globalState~0)} call l_free(~a~0.base, ~a~0.offset); {36#(= 1 ~globalState~0)} is VALID [2018-11-23 12:53:32,891 INFO L273 TraceCheckUtils]: 14: Hoare triple {36#(= 1 ~globalState~0)} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; {36#(= 1 ~globalState~0)} is VALID [2018-11-23 12:53:32,904 INFO L273 TraceCheckUtils]: 15: Hoare triple {36#(= 1 ~globalState~0)} assume ~ptr.base != 0 || ~ptr.offset != 0; {36#(= 1 ~globalState~0)} is VALID [2018-11-23 12:53:32,906 INFO L273 TraceCheckUtils]: 16: Hoare triple {36#(= 1 ~globalState~0)} assume !(1 == ~globalState~0); {35#false} is VALID [2018-11-23 12:53:32,906 INFO L256 TraceCheckUtils]: 17: Hoare triple {35#false} call __blast_assert(); {35#false} is VALID [2018-11-23 12:53:32,906 INFO L273 TraceCheckUtils]: 18: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 12:53:32,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:32,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:32,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:53:32,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:53:32,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:32,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:53:33,188 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:33,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:53:33,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:53:33,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:53:33,202 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2018-11-23 12:53:33,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:33,649 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2018-11-23 12:53:33,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:53:33,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:53:33,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:33,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:53:33,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-23 12:53:33,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:53:33,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-23 12:53:33,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2018-11-23 12:53:33,903 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:33,916 INFO L225 Difference]: With dead ends: 55 [2018-11-23 12:53:33,917 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 12:53:33,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:53:33,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 12:53:33,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-23 12:53:33,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:33,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 32 states. [2018-11-23 12:53:33,980 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 32 states. [2018-11-23 12:53:33,980 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 32 states. [2018-11-23 12:53:33,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:33,987 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 12:53:33,987 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 12:53:33,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:33,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:33,988 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states. [2018-11-23 12:53:33,989 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states. [2018-11-23 12:53:33,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:33,994 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 12:53:33,994 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 12:53:33,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:33,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:33,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:33,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:33,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:53:33,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-23 12:53:34,001 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2018-11-23 12:53:34,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:34,002 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-23 12:53:34,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:53:34,002 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:53:34,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:53:34,003 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:34,003 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:34,004 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:34,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:34,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1745173496, now seen corresponding path program 1 times [2018-11-23 12:53:34,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:34,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:34,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:34,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:34,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:34,102 INFO L256 TraceCheckUtils]: 0: Hoare triple {222#true} call ULTIMATE.init(); {222#true} is VALID [2018-11-23 12:53:34,102 INFO L273 TraceCheckUtils]: 1: Hoare triple {222#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~globalState~0 := 0; {222#true} is VALID [2018-11-23 12:53:34,103 INFO L273 TraceCheckUtils]: 2: Hoare triple {222#true} assume true; {222#true} is VALID [2018-11-23 12:53:34,103 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {222#true} {222#true} #43#return; {222#true} is VALID [2018-11-23 12:53:34,103 INFO L256 TraceCheckUtils]: 4: Hoare triple {222#true} call #t~ret32 := main(#in~argc, #in~argv.base, #in~argv.offset); {222#true} is VALID [2018-11-23 12:53:34,104 INFO L273 TraceCheckUtils]: 5: Hoare triple {222#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; {222#true} is VALID [2018-11-23 12:53:34,104 INFO L256 TraceCheckUtils]: 6: Hoare triple {222#true} call #t~ret30.base, #t~ret30.offset := l_malloc(4); {222#true} is VALID [2018-11-23 12:53:34,107 INFO L273 TraceCheckUtils]: 7: Hoare triple {222#true} ~size := #in~size;call #t~malloc31.base, #t~malloc31.offset := #Ultimate.alloc(~size);~retVal~0.base, ~retVal~0.offset := #t~malloc31.base, #t~malloc31.offset; {224#(not (= 0 l_malloc_~retVal~0.base))} is VALID [2018-11-23 12:53:34,108 INFO L273 TraceCheckUtils]: 8: Hoare triple {224#(not (= 0 l_malloc_~retVal~0.base))} assume !(~retVal~0.base != 0 || ~retVal~0.offset != 0); {223#false} is VALID [2018-11-23 12:53:34,108 INFO L273 TraceCheckUtils]: 9: Hoare triple {223#false} #res.base, #res.offset := ~retVal~0.base, ~retVal~0.offset; {223#false} is VALID [2018-11-23 12:53:34,108 INFO L273 TraceCheckUtils]: 10: Hoare triple {223#false} assume true; {223#false} is VALID [2018-11-23 12:53:34,109 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {223#false} {222#true} #47#return; {223#false} is VALID [2018-11-23 12:53:34,109 INFO L273 TraceCheckUtils]: 12: Hoare triple {223#false} ~a~0.base, ~a~0.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {223#false} is VALID [2018-11-23 12:53:34,109 INFO L256 TraceCheckUtils]: 13: Hoare triple {223#false} call l_free(~a~0.base, ~a~0.offset); {223#false} is VALID [2018-11-23 12:53:34,109 INFO L273 TraceCheckUtils]: 14: Hoare triple {223#false} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; {223#false} is VALID [2018-11-23 12:53:34,110 INFO L273 TraceCheckUtils]: 15: Hoare triple {223#false} assume ~ptr.base != 0 || ~ptr.offset != 0; {223#false} is VALID [2018-11-23 12:53:34,110 INFO L273 TraceCheckUtils]: 16: Hoare triple {223#false} assume !(1 == ~globalState~0); {223#false} is VALID [2018-11-23 12:53:34,110 INFO L256 TraceCheckUtils]: 17: Hoare triple {223#false} call __blast_assert(); {223#false} is VALID [2018-11-23 12:53:34,110 INFO L273 TraceCheckUtils]: 18: Hoare triple {223#false} assume !false; {223#false} is VALID [2018-11-23 12:53:34,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:34,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:34,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:53:34,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:53:34,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:34,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:53:34,224 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:34,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:53:34,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:53:34,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:53:34,225 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 3 states. [2018-11-23 12:53:34,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:34,577 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-23 12:53:34,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:53:34,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:53:34,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:34,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:53:34,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-23 12:53:34,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:53:34,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-23 12:53:34,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2018-11-23 12:53:34,667 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:34,670 INFO L225 Difference]: With dead ends: 42 [2018-11-23 12:53:34,670 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 12:53:34,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:53:34,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 12:53:34,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 12:53:34,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:34,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-23 12:53:34,694 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 12:53:34,695 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 12:53:34,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:34,697 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 12:53:34,697 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 12:53:34,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:34,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:34,698 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 12:53:34,699 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 12:53:34,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:34,701 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 12:53:34,701 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 12:53:34,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:34,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:34,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:34,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:34,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:53:34,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-23 12:53:34,705 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 19 [2018-11-23 12:53:34,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:34,705 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-23 12:53:34,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:53:34,706 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 12:53:34,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:53:34,707 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:34,707 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] [2018-11-23 12:53:34,707 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:34,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:34,708 INFO L82 PathProgramCache]: Analyzing trace with hash 124895752, now seen corresponding path program 1 times [2018-11-23 12:53:34,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:34,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:34,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:34,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:34,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:35,114 INFO L256 TraceCheckUtils]: 0: Hoare triple {379#true} call ULTIMATE.init(); {379#true} is VALID [2018-11-23 12:53:35,114 INFO L273 TraceCheckUtils]: 1: Hoare triple {379#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~globalState~0 := 0; {379#true} is VALID [2018-11-23 12:53:35,114 INFO L273 TraceCheckUtils]: 2: Hoare triple {379#true} assume true; {379#true} is VALID [2018-11-23 12:53:35,115 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {379#true} {379#true} #43#return; {379#true} is VALID [2018-11-23 12:53:35,115 INFO L256 TraceCheckUtils]: 4: Hoare triple {379#true} call #t~ret32 := main(#in~argc, #in~argv.base, #in~argv.offset); {379#true} is VALID [2018-11-23 12:53:35,115 INFO L273 TraceCheckUtils]: 5: Hoare triple {379#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; {379#true} is VALID [2018-11-23 12:53:35,115 INFO L256 TraceCheckUtils]: 6: Hoare triple {379#true} call #t~ret30.base, #t~ret30.offset := l_malloc(4); {379#true} is VALID [2018-11-23 12:53:35,116 INFO L273 TraceCheckUtils]: 7: Hoare triple {379#true} ~size := #in~size;call #t~malloc31.base, #t~malloc31.offset := #Ultimate.alloc(~size);~retVal~0.base, ~retVal~0.offset := #t~malloc31.base, #t~malloc31.offset; {381#(not (= 0 l_malloc_~retVal~0.base))} is VALID [2018-11-23 12:53:35,117 INFO L273 TraceCheckUtils]: 8: Hoare triple {381#(not (= 0 l_malloc_~retVal~0.base))} assume ~retVal~0.base != 0 || ~retVal~0.offset != 0;~globalState~0 := 1; {381#(not (= 0 l_malloc_~retVal~0.base))} is VALID [2018-11-23 12:53:35,117 INFO L273 TraceCheckUtils]: 9: Hoare triple {381#(not (= 0 l_malloc_~retVal~0.base))} #res.base, #res.offset := ~retVal~0.base, ~retVal~0.offset; {382#(not (= 0 |l_malloc_#res.base|))} is VALID [2018-11-23 12:53:35,118 INFO L273 TraceCheckUtils]: 10: Hoare triple {382#(not (= 0 |l_malloc_#res.base|))} assume true; {382#(not (= 0 |l_malloc_#res.base|))} is VALID [2018-11-23 12:53:35,121 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {382#(not (= 0 |l_malloc_#res.base|))} {379#true} #47#return; {383#(not (= 0 |main_#t~ret30.base|))} is VALID [2018-11-23 12:53:35,126 INFO L273 TraceCheckUtils]: 12: Hoare triple {383#(not (= 0 |main_#t~ret30.base|))} ~a~0.base, ~a~0.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {384#(not (= 0 main_~a~0.base))} is VALID [2018-11-23 12:53:35,127 INFO L256 TraceCheckUtils]: 13: Hoare triple {384#(not (= 0 main_~a~0.base))} call l_free(~a~0.base, ~a~0.offset); {379#true} is VALID [2018-11-23 12:53:35,128 INFO L273 TraceCheckUtils]: 14: Hoare triple {379#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; {385#(= |l_free_#in~ptr.base| l_free_~ptr.base)} is VALID [2018-11-23 12:53:35,133 INFO L273 TraceCheckUtils]: 15: Hoare triple {385#(= |l_free_#in~ptr.base| l_free_~ptr.base)} assume !(~ptr.base != 0 || ~ptr.offset != 0); {386#(= 0 |l_free_#in~ptr.base|)} is VALID [2018-11-23 12:53:35,134 INFO L273 TraceCheckUtils]: 16: Hoare triple {386#(= 0 |l_free_#in~ptr.base|)} ~globalState~0 := 0;call ULTIMATE.dealloc(~ptr.base, ~ptr.offset); {386#(= 0 |l_free_#in~ptr.base|)} is VALID [2018-11-23 12:53:35,135 INFO L273 TraceCheckUtils]: 17: Hoare triple {386#(= 0 |l_free_#in~ptr.base|)} assume true; {386#(= 0 |l_free_#in~ptr.base|)} is VALID [2018-11-23 12:53:35,136 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {386#(= 0 |l_free_#in~ptr.base|)} {384#(not (= 0 main_~a~0.base))} #49#return; {380#false} is VALID [2018-11-23 12:53:35,136 INFO L256 TraceCheckUtils]: 19: Hoare triple {380#false} call l_free(~a~0.base, ~a~0.offset); {380#false} is VALID [2018-11-23 12:53:35,136 INFO L273 TraceCheckUtils]: 20: Hoare triple {380#false} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; {380#false} is VALID [2018-11-23 12:53:35,136 INFO L273 TraceCheckUtils]: 21: Hoare triple {380#false} assume ~ptr.base != 0 || ~ptr.offset != 0; {380#false} is VALID [2018-11-23 12:53:35,137 INFO L273 TraceCheckUtils]: 22: Hoare triple {380#false} assume !(1 == ~globalState~0); {380#false} is VALID [2018-11-23 12:53:35,137 INFO L256 TraceCheckUtils]: 23: Hoare triple {380#false} call __blast_assert(); {380#false} is VALID [2018-11-23 12:53:35,137 INFO L273 TraceCheckUtils]: 24: Hoare triple {380#false} assume !false; {380#false} is VALID [2018-11-23 12:53:35,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:35,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:35,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 12:53:35,140 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-23 12:53:35,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:35,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:53:35,242 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:35,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:53:35,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:53:35,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:53:35,243 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 8 states. [2018-11-23 12:53:35,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:35,662 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-23 12:53:35,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:53:35,663 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-23 12:53:35,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:35,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:53:35,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2018-11-23 12:53:35,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:53:35,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2018-11-23 12:53:35,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 38 transitions. [2018-11-23 12:53:35,752 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:35,754 INFO L225 Difference]: With dead ends: 40 [2018-11-23 12:53:35,755 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 12:53:35,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:53:35,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 12:53:35,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 12:53:35,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:35,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-23 12:53:35,790 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 12:53:35,790 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 12:53:35,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:35,793 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-23 12:53:35,793 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 12:53:35,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:35,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:35,794 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 12:53:35,794 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 12:53:35,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:35,796 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-23 12:53:35,797 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 12:53:35,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:35,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:35,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:35,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:35,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:53:35,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-23 12:53:35,800 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-11-23 12:53:35,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:35,800 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-23 12:53:35,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:53:35,801 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 12:53:35,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:53:35,802 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:35,802 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:35,802 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:35,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:35,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1592798083, now seen corresponding path program 1 times [2018-11-23 12:53:35,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:35,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:35,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:35,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:35,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:53:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:53:35,880 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=10, |#NULL.offset|=5, |old(#NULL.base)|=10, |old(#NULL.offset)|=5, |old(~globalState~0)|=8, ~globalState~0=8] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~globalState~0 := 0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=10, |old(#NULL.offset)|=5, |old(~globalState~0)|=8, ~globalState~0=0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=10, |old(#NULL.offset)|=5, |old(~globalState~0)|=8, ~globalState~0=0] [?] RET #43#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~globalState~0=0] [?] CALL call #t~ret32 := main(#in~argc, #in~argv.base, #in~argv.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#in~argc|=11, |main_#in~argv.base|=9, |main_#in~argv.offset|=6, |old(~globalState~0)|=0, ~globalState~0=0] [?] ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; VAL [main_~argc=11, main_~argv.base=9, main_~argv.offset=6, |#NULL.base|=0, |#NULL.offset|=0, |main_#in~argc|=11, |main_#in~argv.base|=9, |main_#in~argv.offset|=6, |old(~globalState~0)|=0, ~globalState~0=0] [?] CALL call #t~ret30.base, #t~ret30.offset := l_malloc(4); VAL [|#NULL.base|=0, |#NULL.offset|=0, |l_malloc_#in~size|=4, |old(~globalState~0)|=0, ~globalState~0=0] [?] ~size := #in~size;call #t~malloc31.base, #t~malloc31.offset := #Ultimate.alloc(~size);~retVal~0.base, ~retVal~0.offset := #t~malloc31.base, #t~malloc31.offset; VAL [l_malloc_~retVal~0.base=7, l_malloc_~retVal~0.offset=0, l_malloc_~size=4, |#NULL.base|=0, |#NULL.offset|=0, |l_malloc_#in~size|=4, |l_malloc_#t~malloc31.base|=7, |l_malloc_#t~malloc31.offset|=0, |old(~globalState~0)|=0, ~globalState~0=0] [?] assume ~retVal~0.base != 0 || ~retVal~0.offset != 0;~globalState~0 := 1; VAL [l_malloc_~retVal~0.base=7, l_malloc_~retVal~0.offset=0, l_malloc_~size=4, |#NULL.base|=0, |#NULL.offset|=0, |l_malloc_#in~size|=4, |l_malloc_#t~malloc31.base|=7, |l_malloc_#t~malloc31.offset|=0, |old(~globalState~0)|=0, ~globalState~0=1] [?] #res.base, #res.offset := ~retVal~0.base, ~retVal~0.offset; VAL [l_malloc_~retVal~0.base=7, l_malloc_~retVal~0.offset=0, l_malloc_~size=4, |#NULL.base|=0, |#NULL.offset|=0, |l_malloc_#in~size|=4, |l_malloc_#res.base|=7, |l_malloc_#res.offset|=0, |l_malloc_#t~malloc31.base|=7, |l_malloc_#t~malloc31.offset|=0, |old(~globalState~0)|=0, ~globalState~0=1] [?] assume true; VAL [l_malloc_~retVal~0.base=7, l_malloc_~retVal~0.offset=0, l_malloc_~size=4, |#NULL.base|=0, |#NULL.offset|=0, |l_malloc_#in~size|=4, |l_malloc_#res.base|=7, |l_malloc_#res.offset|=0, |l_malloc_#t~malloc31.base|=7, |l_malloc_#t~malloc31.offset|=0, |old(~globalState~0)|=0, ~globalState~0=1] [?] RET #47#return; VAL [main_~argc=11, main_~argv.base=9, main_~argv.offset=6, |#NULL.base|=0, |#NULL.offset|=0, |main_#in~argc|=11, |main_#in~argv.base|=9, |main_#in~argv.offset|=6, |main_#t~ret30.base|=7, |main_#t~ret30.offset|=0, |old(~globalState~0)|=0, ~globalState~0=1] [?] ~a~0.base, ~a~0.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; VAL [main_~argc=11, main_~argv.base=9, main_~argv.offset=6, main_~a~0.base=7, main_~a~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#in~argc|=11, |main_#in~argv.base|=9, |main_#in~argv.offset|=6, |old(~globalState~0)|=0, ~globalState~0=1] [?] CALL call l_free(~a~0.base, ~a~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |l_free_#in~ptr.base|=7, |l_free_#in~ptr.offset|=0, |old(~globalState~0)|=1, ~globalState~0=1] [?] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; VAL [l_free_~ptr.base=7, l_free_~ptr.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |l_free_#in~ptr.base|=7, |l_free_#in~ptr.offset|=0, |old(~globalState~0)|=1, ~globalState~0=1] [?] assume ~ptr.base != 0 || ~ptr.offset != 0; VAL [l_free_~ptr.base=7, l_free_~ptr.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |l_free_#in~ptr.base|=7, |l_free_#in~ptr.offset|=0, |old(~globalState~0)|=1, ~globalState~0=1] [?] assume 1 == ~globalState~0; VAL [l_free_~ptr.base=7, l_free_~ptr.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |l_free_#in~ptr.base|=7, |l_free_#in~ptr.offset|=0, |old(~globalState~0)|=1, ~globalState~0=1] [?] ~globalState~0 := 0;call ULTIMATE.dealloc(~ptr.base, ~ptr.offset); VAL [l_free_~ptr.base=7, l_free_~ptr.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |l_free_#in~ptr.base|=7, |l_free_#in~ptr.offset|=0, |old(~globalState~0)|=1, ~globalState~0=0] [?] assume true; VAL [l_free_~ptr.base=7, l_free_~ptr.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |l_free_#in~ptr.base|=7, |l_free_#in~ptr.offset|=0, |old(~globalState~0)|=1, ~globalState~0=0] [?] RET #49#return; VAL [main_~argc=11, main_~argv.base=9, main_~argv.offset=6, main_~a~0.base=7, main_~a~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#in~argc|=11, |main_#in~argv.base|=9, |main_#in~argv.offset|=6, |old(~globalState~0)|=0, ~globalState~0=0] [?] CALL call l_free(~a~0.base, ~a~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |l_free_#in~ptr.base|=7, |l_free_#in~ptr.offset|=0, |old(~globalState~0)|=0, ~globalState~0=0] [?] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; VAL [l_free_~ptr.base=7, l_free_~ptr.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |l_free_#in~ptr.base|=7, |l_free_#in~ptr.offset|=0, |old(~globalState~0)|=0, ~globalState~0=0] [?] assume ~ptr.base != 0 || ~ptr.offset != 0; VAL [l_free_~ptr.base=7, l_free_~ptr.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |l_free_#in~ptr.base|=7, |l_free_#in~ptr.offset|=0, |old(~globalState~0)|=0, ~globalState~0=0] [?] assume !(1 == ~globalState~0); VAL [l_free_~ptr.base=7, l_free_~ptr.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |l_free_#in~ptr.base|=7, |l_free_#in~ptr.offset|=0, |old(~globalState~0)|=0, ~globalState~0=0] [?] CALL call __blast_assert(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~globalState~0)|=0, ~globalState~0=0] [?] assume !false; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~globalState~0)|=0, ~globalState~0=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=10, #NULL.offset=5, old(#NULL.base)=10, old(#NULL.offset)=5, old(~globalState~0)=8, ~globalState~0=8] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L1606] ~globalState~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=10, old(#NULL.offset)=5, old(~globalState~0)=8, ~globalState~0=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=10, old(#NULL.offset)=5, old(~globalState~0)=8, ~globalState~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~globalState~0=0] [?] CALL call #t~ret32 := main(#in~argc, #in~argv.base, #in~argv.offset); VAL [#in~argc=11, #in~argv.base=9, #in~argv.offset=6, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1610-L1616] ~argc := #in~argc; [L1610-L1616] ~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; VAL [#in~argc=11, #in~argv.base=9, #in~argv.offset=6, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~argc=11, ~argv.base=9, ~argv.offset=6, ~globalState~0=0] [L1612] CALL call #t~ret30.base, #t~ret30.offset := l_malloc(4); VAL [#in~size=4, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1618-L1623] ~size := #in~size; [L1619] call #t~malloc31.base, #t~malloc31.offset := #Ultimate.alloc(~size); [L1619] ~retVal~0.base, ~retVal~0.offset := #t~malloc31.base, #t~malloc31.offset; VAL [#in~size=4, #NULL.base=0, #NULL.offset=0, #t~malloc31.base=7, #t~malloc31.offset=0, old(~globalState~0)=0, ~globalState~0=0, ~retVal~0.base=7, ~retVal~0.offset=0, ~size=4] [L1620-L1621] assume ~retVal~0.base != 0 || ~retVal~0.offset != 0; [L1621] ~globalState~0 := 1; VAL [#in~size=4, #NULL.base=0, #NULL.offset=0, #t~malloc31.base=7, #t~malloc31.offset=0, old(~globalState~0)=0, ~globalState~0=1, ~retVal~0.base=7, ~retVal~0.offset=0, ~size=4] [L1622] #res.base, #res.offset := ~retVal~0.base, ~retVal~0.offset; VAL [#in~size=4, #NULL.base=0, #NULL.offset=0, #res.base=7, #res.offset=0, #t~malloc31.base=7, #t~malloc31.offset=0, old(~globalState~0)=0, ~globalState~0=1, ~retVal~0.base=7, ~retVal~0.offset=0, ~size=4] [L1607] ensures true; VAL [#in~size=4, #NULL.base=0, #NULL.offset=0, #res.base=7, #res.offset=0, #t~malloc31.base=7, #t~malloc31.offset=0, old(~globalState~0)=0, ~globalState~0=1, ~retVal~0.base=7, ~retVal~0.offset=0, ~size=4] [L1612] RET call #t~ret30.base, #t~ret30.offset := l_malloc(4); VAL [#in~argc=11, #in~argv.base=9, #in~argv.offset=6, #NULL.base=0, #NULL.offset=0, #t~ret30.base=7, #t~ret30.offset=0, old(~globalState~0)=0, ~argc=11, ~argv.base=9, ~argv.offset=6, ~globalState~0=1] [L1612] ~a~0.base, ~a~0.offset := #t~ret30.base, #t~ret30.offset; [L1612] havoc #t~ret30.base, #t~ret30.offset; VAL [#in~argc=11, #in~argv.base=9, #in~argv.offset=6, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~argc=11, ~argv.base=9, ~argv.offset=6, ~a~0.base=7, ~a~0.offset=0, ~globalState~0=1] [L1613] CALL call l_free(~a~0.base, ~a~0.offset); VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=1, ~globalState~0=1] [L1625-L1632] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr.base=7, ~ptr.offset=0] [L1629] assume ~ptr.base != 0 || ~ptr.offset != 0; VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr.base=7, ~ptr.offset=0] [L1629] assume 1 == ~globalState~0; VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr.base=7, ~ptr.offset=0] [L1630] ~globalState~0 := 0; [L1631] call ULTIMATE.dealloc(~ptr.base, ~ptr.offset); VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=1, ~globalState~0=0, ~ptr.base=7, ~ptr.offset=0] [L1608] ensures true; VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=1, ~globalState~0=0, ~ptr.base=7, ~ptr.offset=0] [L1613] RET call l_free(~a~0.base, ~a~0.offset); VAL [#in~argc=11, #in~argv.base=9, #in~argv.offset=6, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~argc=11, ~argv.base=9, ~argv.offset=6, ~a~0.base=7, ~a~0.offset=0, ~globalState~0=0] [L1614] CALL call l_free(~a~0.base, ~a~0.offset); VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1625-L1632] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr.base=7, ~ptr.offset=0] [L1629] assume ~ptr.base != 0 || ~ptr.offset != 0; VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr.base=7, ~ptr.offset=0] [L1629] assume !(1 == ~globalState~0); VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr.base=7, ~ptr.offset=0] [L1629] CALL call __blast_assert(); VAL [#NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1601] assert false; VAL [#NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~globalState~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=10, #NULL.offset=5, old(#NULL.base)=10, old(#NULL.offset)=5, old(~globalState~0)=8, ~globalState~0=8] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L1606] ~globalState~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=10, old(#NULL.offset)=5, old(~globalState~0)=8, ~globalState~0=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=10, old(#NULL.offset)=5, old(~globalState~0)=8, ~globalState~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~globalState~0=0] [?] CALL call #t~ret32 := main(#in~argc, #in~argv.base, #in~argv.offset); VAL [#in~argc=11, #in~argv.base=9, #in~argv.offset=6, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1610-L1616] ~argc := #in~argc; [L1610-L1616] ~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; VAL [#in~argc=11, #in~argv.base=9, #in~argv.offset=6, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~argc=11, ~argv.base=9, ~argv.offset=6, ~globalState~0=0] [L1612] CALL call #t~ret30.base, #t~ret30.offset := l_malloc(4); VAL [#in~size=4, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1618-L1623] ~size := #in~size; [L1619] call #t~malloc31.base, #t~malloc31.offset := #Ultimate.alloc(~size); [L1619] ~retVal~0.base, ~retVal~0.offset := #t~malloc31.base, #t~malloc31.offset; VAL [#in~size=4, #NULL.base=0, #NULL.offset=0, #t~malloc31.base=7, #t~malloc31.offset=0, old(~globalState~0)=0, ~globalState~0=0, ~retVal~0.base=7, ~retVal~0.offset=0, ~size=4] [L1620-L1621] assume ~retVal~0.base != 0 || ~retVal~0.offset != 0; [L1621] ~globalState~0 := 1; VAL [#in~size=4, #NULL.base=0, #NULL.offset=0, #t~malloc31.base=7, #t~malloc31.offset=0, old(~globalState~0)=0, ~globalState~0=1, ~retVal~0.base=7, ~retVal~0.offset=0, ~size=4] [L1622] #res.base, #res.offset := ~retVal~0.base, ~retVal~0.offset; VAL [#in~size=4, #NULL.base=0, #NULL.offset=0, #res.base=7, #res.offset=0, #t~malloc31.base=7, #t~malloc31.offset=0, old(~globalState~0)=0, ~globalState~0=1, ~retVal~0.base=7, ~retVal~0.offset=0, ~size=4] [L1607] ensures true; VAL [#in~size=4, #NULL.base=0, #NULL.offset=0, #res.base=7, #res.offset=0, #t~malloc31.base=7, #t~malloc31.offset=0, old(~globalState~0)=0, ~globalState~0=1, ~retVal~0.base=7, ~retVal~0.offset=0, ~size=4] [L1612] RET call #t~ret30.base, #t~ret30.offset := l_malloc(4); VAL [#in~argc=11, #in~argv.base=9, #in~argv.offset=6, #NULL.base=0, #NULL.offset=0, #t~ret30.base=7, #t~ret30.offset=0, old(~globalState~0)=0, ~argc=11, ~argv.base=9, ~argv.offset=6, ~globalState~0=1] [L1612] ~a~0.base, ~a~0.offset := #t~ret30.base, #t~ret30.offset; [L1612] havoc #t~ret30.base, #t~ret30.offset; VAL [#in~argc=11, #in~argv.base=9, #in~argv.offset=6, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~argc=11, ~argv.base=9, ~argv.offset=6, ~a~0.base=7, ~a~0.offset=0, ~globalState~0=1] [L1613] CALL call l_free(~a~0.base, ~a~0.offset); VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=1, ~globalState~0=1] [L1625-L1632] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr.base=7, ~ptr.offset=0] [L1629] assume ~ptr.base != 0 || ~ptr.offset != 0; VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr.base=7, ~ptr.offset=0] [L1629] assume 1 == ~globalState~0; VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr.base=7, ~ptr.offset=0] [L1630] ~globalState~0 := 0; [L1631] call ULTIMATE.dealloc(~ptr.base, ~ptr.offset); VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=1, ~globalState~0=0, ~ptr.base=7, ~ptr.offset=0] [L1608] ensures true; VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=1, ~globalState~0=0, ~ptr.base=7, ~ptr.offset=0] [L1613] RET call l_free(~a~0.base, ~a~0.offset); VAL [#in~argc=11, #in~argv.base=9, #in~argv.offset=6, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~argc=11, ~argv.base=9, ~argv.offset=6, ~a~0.base=7, ~a~0.offset=0, ~globalState~0=0] [L1614] CALL call l_free(~a~0.base, ~a~0.offset); VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1625-L1632] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr.base=7, ~ptr.offset=0] [L1629] assume ~ptr.base != 0 || ~ptr.offset != 0; VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr.base=7, ~ptr.offset=0] [L1629] assume !(1 == ~globalState~0); VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr.base=7, ~ptr.offset=0] [L1629] CALL call __blast_assert(); VAL [#NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1601] assert false; VAL [#NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~globalState~0=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=10, #NULL!offset=5, old(#NULL!base)=10, old(#NULL!offset)=5, old(~globalState~0)=8, ~globalState~0=8] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L1606] ~globalState~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=10, old(#NULL!offset)=5, old(~globalState~0)=8, ~globalState~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~globalState~0=0] [?] CALL call #t~ret32 := main(#in~argc, #in~argv); VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1610-L1616] ~argc := #in~argc; [L1610-L1616] ~argv := #in~argv; VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~argc=11, ~argv!base=9, ~argv!offset=6, ~globalState~0=0] [L1612] CALL call #t~ret30 := l_malloc(4); VAL [#in~size=4, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1618-L1623] ~size := #in~size; [L1619] FCALL call #t~malloc31 := #Ultimate.alloc(~size); [L1619] ~retVal~0 := #t~malloc31; VAL [#in~size=4, #NULL!base=0, #NULL!offset=0, #t~malloc31!base=7, #t~malloc31!offset=0, old(~globalState~0)=0, ~globalState~0=0, ~retVal~0!base=7, ~retVal~0!offset=0, ~size=4] [L1620] COND TRUE ~retVal~0 != { base: 0, offset: 0 } [L1621] ~globalState~0 := 1; VAL [#in~size=4, #NULL!base=0, #NULL!offset=0, #t~malloc31!base=7, #t~malloc31!offset=0, old(~globalState~0)=0, ~globalState~0=1, ~retVal~0!base=7, ~retVal~0!offset=0, ~size=4] [L1622] #res := ~retVal~0; VAL [#in~size=4, #NULL!base=0, #NULL!offset=0, #res!base=7, #res!offset=0, #t~malloc31!base=7, #t~malloc31!offset=0, old(~globalState~0)=0, ~globalState~0=1, ~retVal~0!base=7, ~retVal~0!offset=0, ~size=4] [L1612] RET call #t~ret30 := l_malloc(4); VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, #t~ret30!base=7, #t~ret30!offset=0, old(~globalState~0)=0, ~argc=11, ~argv!base=9, ~argv!offset=6, ~globalState~0=1] [L1612] ~a~0 := #t~ret30; [L1612] havoc #t~ret30; VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~argc=11, ~argv!base=9, ~argv!offset=6, ~a~0!base=7, ~a~0!offset=0, ~globalState~0=1] [L1613] CALL call l_free(~a~0); VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=1] [L1625-L1632] ~ptr := #in~ptr; VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr!base=7, ~ptr!offset=0] [L1629] COND TRUE ~ptr != { base: 0, offset: 0 } VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr!base=7, ~ptr!offset=0] [L1629] COND TRUE 1 == ~globalState~0 VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr!base=7, ~ptr!offset=0] [L1630] ~globalState~0 := 0; [L1631] FCALL call ULTIMATE.dealloc(~ptr); VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=0, ~ptr!base=7, ~ptr!offset=0] [L1613] RET call l_free(~a~0); VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~argc=11, ~argv!base=9, ~argv!offset=6, ~a~0!base=7, ~a~0!offset=0, ~globalState~0=0] [L1614] CALL call l_free(~a~0); VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1625-L1632] ~ptr := #in~ptr; VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr!base=7, ~ptr!offset=0] [L1629] COND TRUE ~ptr != { base: 0, offset: 0 } VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr!base=7, ~ptr!offset=0] [L1629] COND FALSE !(1 == ~globalState~0) VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr!base=7, ~ptr!offset=0] [L1629] CALL call __blast_assert(); VAL [#NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1601] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=10, #NULL!offset=5, old(#NULL!base)=10, old(#NULL!offset)=5, old(~globalState~0)=8, ~globalState~0=8] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L1606] ~globalState~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=10, old(#NULL!offset)=5, old(~globalState~0)=8, ~globalState~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~globalState~0=0] [?] CALL call #t~ret32 := main(#in~argc, #in~argv); VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1610-L1616] ~argc := #in~argc; [L1610-L1616] ~argv := #in~argv; VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~argc=11, ~argv!base=9, ~argv!offset=6, ~globalState~0=0] [L1612] CALL call #t~ret30 := l_malloc(4); VAL [#in~size=4, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1618-L1623] ~size := #in~size; [L1619] FCALL call #t~malloc31 := #Ultimate.alloc(~size); [L1619] ~retVal~0 := #t~malloc31; VAL [#in~size=4, #NULL!base=0, #NULL!offset=0, #t~malloc31!base=7, #t~malloc31!offset=0, old(~globalState~0)=0, ~globalState~0=0, ~retVal~0!base=7, ~retVal~0!offset=0, ~size=4] [L1620] COND TRUE ~retVal~0 != { base: 0, offset: 0 } [L1621] ~globalState~0 := 1; VAL [#in~size=4, #NULL!base=0, #NULL!offset=0, #t~malloc31!base=7, #t~malloc31!offset=0, old(~globalState~0)=0, ~globalState~0=1, ~retVal~0!base=7, ~retVal~0!offset=0, ~size=4] [L1622] #res := ~retVal~0; VAL [#in~size=4, #NULL!base=0, #NULL!offset=0, #res!base=7, #res!offset=0, #t~malloc31!base=7, #t~malloc31!offset=0, old(~globalState~0)=0, ~globalState~0=1, ~retVal~0!base=7, ~retVal~0!offset=0, ~size=4] [L1612] RET call #t~ret30 := l_malloc(4); VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, #t~ret30!base=7, #t~ret30!offset=0, old(~globalState~0)=0, ~argc=11, ~argv!base=9, ~argv!offset=6, ~globalState~0=1] [L1612] ~a~0 := #t~ret30; [L1612] havoc #t~ret30; VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~argc=11, ~argv!base=9, ~argv!offset=6, ~a~0!base=7, ~a~0!offset=0, ~globalState~0=1] [L1613] CALL call l_free(~a~0); VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=1] [L1625-L1632] ~ptr := #in~ptr; VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr!base=7, ~ptr!offset=0] [L1629] COND TRUE ~ptr != { base: 0, offset: 0 } VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr!base=7, ~ptr!offset=0] [L1629] COND TRUE 1 == ~globalState~0 VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr!base=7, ~ptr!offset=0] [L1630] ~globalState~0 := 0; [L1631] FCALL call ULTIMATE.dealloc(~ptr); VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=0, ~ptr!base=7, ~ptr!offset=0] [L1613] RET call l_free(~a~0); VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~argc=11, ~argv!base=9, ~argv!offset=6, ~a~0!base=7, ~a~0!offset=0, ~globalState~0=0] [L1614] CALL call l_free(~a~0); VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1625-L1632] ~ptr := #in~ptr; VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr!base=7, ~ptr!offset=0] [L1629] COND TRUE ~ptr != { base: 0, offset: 0 } VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr!base=7, ~ptr!offset=0] [L1629] COND FALSE !(1 == ~globalState~0) VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr!base=7, ~ptr!offset=0] [L1629] CALL call __blast_assert(); VAL [#NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1601] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=10, #NULL!offset=5, old(#NULL!base)=10, old(#NULL!offset)=5, old(~globalState~0)=8, ~globalState~0=8] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L1606] ~globalState~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=10, old(#NULL!offset)=5, old(~globalState~0)=8, ~globalState~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~globalState~0=0] [?] CALL call #t~ret32 := main(#in~argc, #in~argv); VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1610-L1616] ~argc := #in~argc; [L1610-L1616] ~argv := #in~argv; VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~argc=11, ~argv!base=9, ~argv!offset=6, ~globalState~0=0] [L1612] CALL call #t~ret30 := l_malloc(4); VAL [#in~size=4, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1618-L1623] ~size := #in~size; [L1619] FCALL call #t~malloc31 := #Ultimate.alloc(~size); [L1619] ~retVal~0 := #t~malloc31; VAL [#in~size=4, #NULL!base=0, #NULL!offset=0, #t~malloc31!base=7, #t~malloc31!offset=0, old(~globalState~0)=0, ~globalState~0=0, ~retVal~0!base=7, ~retVal~0!offset=0, ~size=4] [L1620] COND TRUE ~retVal~0 != { base: 0, offset: 0 } [L1621] ~globalState~0 := 1; VAL [#in~size=4, #NULL!base=0, #NULL!offset=0, #t~malloc31!base=7, #t~malloc31!offset=0, old(~globalState~0)=0, ~globalState~0=1, ~retVal~0!base=7, ~retVal~0!offset=0, ~size=4] [L1622] #res := ~retVal~0; VAL [#in~size=4, #NULL!base=0, #NULL!offset=0, #res!base=7, #res!offset=0, #t~malloc31!base=7, #t~malloc31!offset=0, old(~globalState~0)=0, ~globalState~0=1, ~retVal~0!base=7, ~retVal~0!offset=0, ~size=4] [L1612] RET call #t~ret30 := l_malloc(4); VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, #t~ret30!base=7, #t~ret30!offset=0, old(~globalState~0)=0, ~argc=11, ~argv!base=9, ~argv!offset=6, ~globalState~0=1] [L1612] ~a~0 := #t~ret30; [L1612] havoc #t~ret30; VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~argc=11, ~argv!base=9, ~argv!offset=6, ~a~0!base=7, ~a~0!offset=0, ~globalState~0=1] [L1613] CALL call l_free(~a~0); VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=1] [L1625-L1632] ~ptr := #in~ptr; VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr!base=7, ~ptr!offset=0] [L1629] COND TRUE ~ptr != { base: 0, offset: 0 } VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr!base=7, ~ptr!offset=0] [L1629] COND TRUE 1 == ~globalState~0 VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr!base=7, ~ptr!offset=0] [L1630] ~globalState~0 := 0; [L1631] FCALL call ULTIMATE.dealloc(~ptr); VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=0, ~ptr!base=7, ~ptr!offset=0] [L1613] RET call l_free(~a~0); VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~argc=11, ~argv!base=9, ~argv!offset=6, ~a~0!base=7, ~a~0!offset=0, ~globalState~0=0] [L1614] CALL call l_free(~a~0); VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1625-L1632] ~ptr := #in~ptr; VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr!base=7, ~ptr!offset=0] [L1629] COND TRUE ~ptr != { base: 0, offset: 0 } VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr!base=7, ~ptr!offset=0] [L1629] COND FALSE !(1 == ~globalState~0) VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr!base=7, ~ptr!offset=0] [L1629] CALL call __blast_assert(); VAL [#NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1601] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=10, #NULL!offset=5, old(#NULL!base)=10, old(#NULL!offset)=5, old(~globalState~0)=8, ~globalState~0=8] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L1606] ~globalState~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=10, old(#NULL!offset)=5, old(~globalState~0)=8, ~globalState~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~globalState~0=0] [?] CALL call #t~ret32 := main(#in~argc, #in~argv); VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1610-L1616] ~argc := #in~argc; [L1610-L1616] ~argv := #in~argv; VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~argc=11, ~argv!base=9, ~argv!offset=6, ~globalState~0=0] [L1612] CALL call #t~ret30 := l_malloc(4); VAL [#in~size=4, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1618-L1623] ~size := #in~size; [L1619] FCALL call #t~malloc31 := #Ultimate.alloc(~size); [L1619] ~retVal~0 := #t~malloc31; VAL [#in~size=4, #NULL!base=0, #NULL!offset=0, #t~malloc31!base=7, #t~malloc31!offset=0, old(~globalState~0)=0, ~globalState~0=0, ~retVal~0!base=7, ~retVal~0!offset=0, ~size=4] [L1620] COND TRUE ~retVal~0 != { base: 0, offset: 0 } [L1621] ~globalState~0 := 1; VAL [#in~size=4, #NULL!base=0, #NULL!offset=0, #t~malloc31!base=7, #t~malloc31!offset=0, old(~globalState~0)=0, ~globalState~0=1, ~retVal~0!base=7, ~retVal~0!offset=0, ~size=4] [L1622] #res := ~retVal~0; VAL [#in~size=4, #NULL!base=0, #NULL!offset=0, #res!base=7, #res!offset=0, #t~malloc31!base=7, #t~malloc31!offset=0, old(~globalState~0)=0, ~globalState~0=1, ~retVal~0!base=7, ~retVal~0!offset=0, ~size=4] [L1612] RET call #t~ret30 := l_malloc(4); VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, #t~ret30!base=7, #t~ret30!offset=0, old(~globalState~0)=0, ~argc=11, ~argv!base=9, ~argv!offset=6, ~globalState~0=1] [L1612] ~a~0 := #t~ret30; [L1612] havoc #t~ret30; VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~argc=11, ~argv!base=9, ~argv!offset=6, ~a~0!base=7, ~a~0!offset=0, ~globalState~0=1] [L1613] CALL call l_free(~a~0); VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=1] [L1625-L1632] ~ptr := #in~ptr; VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr!base=7, ~ptr!offset=0] [L1629] COND TRUE ~ptr != { base: 0, offset: 0 } VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr!base=7, ~ptr!offset=0] [L1629] COND TRUE 1 == ~globalState~0 VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr!base=7, ~ptr!offset=0] [L1630] ~globalState~0 := 0; [L1631] FCALL call ULTIMATE.dealloc(~ptr); VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=0, ~ptr!base=7, ~ptr!offset=0] [L1613] RET call l_free(~a~0); VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~argc=11, ~argv!base=9, ~argv!offset=6, ~a~0!base=7, ~a~0!offset=0, ~globalState~0=0] [L1614] CALL call l_free(~a~0); VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1625-L1632] ~ptr := #in~ptr; VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr!base=7, ~ptr!offset=0] [L1629] COND TRUE ~ptr != { base: 0, offset: 0 } VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr!base=7, ~ptr!offset=0] [L1629] COND FALSE !(1 == ~globalState~0) VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr!base=7, ~ptr!offset=0] [L1629] CALL call __blast_assert(); VAL [#NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1601] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1606] int globalState = 0; VAL [\old(globalState)=8, globalState=0] [L1612] CALL, EXPR l_malloc(sizeof(int)) VAL [\old(globalState)=0, \old(size)=4, globalState=0] [L1619] void *retVal = malloc(size); VAL [\old(globalState)=0, \old(size)=4, globalState=0, malloc(size)={7:0}, retVal={7:0}, size=4] [L1620] COND TRUE retVal != ((void *)0) [L1621] globalState=1 VAL [\old(globalState)=0, \old(size)=4, globalState=1, malloc(size)={7:0}, retVal={7:0}, size=4] [L1622] return retVal; VAL [\old(globalState)=0, \old(size)=4, \result={7:0}, globalState=1, malloc(size)={7:0}, retVal={7:0}, size=4] [L1612] RET, EXPR l_malloc(sizeof(int)) VAL [\old(argc)=11, \old(globalState)=0, argc=11, argv={9:6}, argv={9:6}, globalState=1, l_malloc(sizeof(int))={7:0}] [L1612] int *a = (int*) l_malloc(sizeof(int)); [L1613] CALL l_free(a) VAL [\old(globalState)=1, globalState=1, ptr={7:0}] [L1629] COND TRUE ptr!=((void *)0) VAL [\old(globalState)=1, globalState=1, ptr={7:0}, ptr={7:0}] [L1629] (globalState == 1) ? (0) : __blast_assert () VAL [\old(globalState)=1, globalState=1, ptr={7:0}, ptr={7:0}] [L1630] globalState = 0 [L1613] RET l_free(a) VAL [\old(argc)=11, \old(globalState)=0, a={7:0}, argc=11, argv={9:6}, argv={9:6}, globalState=0] [L1614] CALL l_free(a) VAL [\old(globalState)=0, globalState=0, ptr={7:0}] [L1629] COND TRUE ptr!=((void *)0) VAL [\old(globalState)=0, globalState=0, ptr={7:0}, ptr={7:0}] [L1629] (globalState == 1) ? (0) : __blast_assert () VAL [\old(globalState)=0, globalState=0, ptr={7:0}, ptr={7:0}] [L1629] CALL __blast_assert () VAL [\old(globalState)=0, globalState=0] [L1601] __VERIFIER_error() VAL [\old(globalState)=0, globalState=0] ----- [2018-11-23 12:53:35,965 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 12:53:35,965 WARN L170 areAnnotationChecker]: l_mallocENTRY has no Hoare annotation [2018-11-23 12:53:35,965 WARN L170 areAnnotationChecker]: __blast_assertENTRY has no Hoare annotation [2018-11-23 12:53:35,965 WARN L170 areAnnotationChecker]: __blast_assertENTRY has no Hoare annotation [2018-11-23 12:53:35,965 WARN L170 areAnnotationChecker]: l_freeENTRY has no Hoare annotation [2018-11-23 12:53:35,968 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:53:35,969 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:53:35,969 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 12:53:35,969 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:53:35,969 WARN L170 areAnnotationChecker]: L1620 has no Hoare annotation [2018-11-23 12:53:35,969 WARN L170 areAnnotationChecker]: L1620 has no Hoare annotation [2018-11-23 12:53:35,969 WARN L170 areAnnotationChecker]: __blast_assertFINAL has no Hoare annotation [2018-11-23 12:53:35,969 WARN L170 areAnnotationChecker]: L1629 has no Hoare annotation [2018-11-23 12:53:35,970 WARN L170 areAnnotationChecker]: L1629 has no Hoare annotation [2018-11-23 12:53:35,970 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:53:35,970 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:53:35,970 WARN L170 areAnnotationChecker]: L1612 has no Hoare annotation [2018-11-23 12:53:35,970 WARN L170 areAnnotationChecker]: L1612 has no Hoare annotation [2018-11-23 12:53:35,970 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:53:35,970 WARN L170 areAnnotationChecker]: L1620-2 has no Hoare annotation [2018-11-23 12:53:35,970 WARN L170 areAnnotationChecker]: __blast_assertEXIT has no Hoare annotation [2018-11-23 12:53:35,971 WARN L170 areAnnotationChecker]: L1629-1 has no Hoare annotation [2018-11-23 12:53:35,971 WARN L170 areAnnotationChecker]: L1629-1 has no Hoare annotation [2018-11-23 12:53:35,971 WARN L170 areAnnotationChecker]: L1629-5 has no Hoare annotation [2018-11-23 12:53:35,971 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:53:35,971 WARN L170 areAnnotationChecker]: L1612-1 has no Hoare annotation [2018-11-23 12:53:35,971 WARN L170 areAnnotationChecker]: l_mallocFINAL has no Hoare annotation [2018-11-23 12:53:35,971 WARN L170 areAnnotationChecker]: L1629-3 has no Hoare annotation [2018-11-23 12:53:35,972 WARN L170 areAnnotationChecker]: L1629-3 has no Hoare annotation [2018-11-23 12:53:35,972 WARN L170 areAnnotationChecker]: l_freeFINAL has no Hoare annotation [2018-11-23 12:53:35,972 WARN L170 areAnnotationChecker]: L1613 has no Hoare annotation [2018-11-23 12:53:35,972 WARN L170 areAnnotationChecker]: L1613 has no Hoare annotation [2018-11-23 12:53:35,972 WARN L170 areAnnotationChecker]: l_mallocEXIT has no Hoare annotation [2018-11-23 12:53:35,972 WARN L170 areAnnotationChecker]: l_freeEXIT has no Hoare annotation [2018-11-23 12:53:35,972 WARN L170 areAnnotationChecker]: l_freeEXIT has no Hoare annotation [2018-11-23 12:53:35,973 WARN L170 areAnnotationChecker]: L1613-1 has no Hoare annotation [2018-11-23 12:53:35,973 WARN L170 areAnnotationChecker]: L1613-1 has no Hoare annotation [2018-11-23 12:53:35,973 WARN L170 areAnnotationChecker]: L1614 has no Hoare annotation [2018-11-23 12:53:35,973 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:53:35,973 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:53:35,973 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 12:53:35,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:53:35 BoogieIcfgContainer [2018-11-23 12:53:35,979 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:53:35,980 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:53:35,980 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:53:35,980 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:53:35,981 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:53:32" (3/4) ... [2018-11-23 12:53:35,984 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|=10, |#NULL.offset|=5, |old(#NULL.base)|=10, |old(#NULL.offset)|=5, |old(~globalState~0)|=8, ~globalState~0=8] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~globalState~0 := 0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=10, |old(#NULL.offset)|=5, |old(~globalState~0)|=8, ~globalState~0=0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=10, |old(#NULL.offset)|=5, |old(~globalState~0)|=8, ~globalState~0=0] [?] RET #43#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~globalState~0=0] [?] CALL call #t~ret32 := main(#in~argc, #in~argv.base, #in~argv.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_#in~argc|=11, |main_#in~argv.base|=9, |main_#in~argv.offset|=6, |old(~globalState~0)|=0, ~globalState~0=0] [?] ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; VAL [main_~argc=11, main_~argv.base=9, main_~argv.offset=6, |#NULL.base|=0, |#NULL.offset|=0, |main_#in~argc|=11, |main_#in~argv.base|=9, |main_#in~argv.offset|=6, |old(~globalState~0)|=0, ~globalState~0=0] [?] CALL call #t~ret30.base, #t~ret30.offset := l_malloc(4); VAL [|#NULL.base|=0, |#NULL.offset|=0, |l_malloc_#in~size|=4, |old(~globalState~0)|=0, ~globalState~0=0] [?] ~size := #in~size;call #t~malloc31.base, #t~malloc31.offset := #Ultimate.alloc(~size);~retVal~0.base, ~retVal~0.offset := #t~malloc31.base, #t~malloc31.offset; VAL [l_malloc_~retVal~0.base=7, l_malloc_~retVal~0.offset=0, l_malloc_~size=4, |#NULL.base|=0, |#NULL.offset|=0, |l_malloc_#in~size|=4, |l_malloc_#t~malloc31.base|=7, |l_malloc_#t~malloc31.offset|=0, |old(~globalState~0)|=0, ~globalState~0=0] [?] assume ~retVal~0.base != 0 || ~retVal~0.offset != 0;~globalState~0 := 1; VAL [l_malloc_~retVal~0.base=7, l_malloc_~retVal~0.offset=0, l_malloc_~size=4, |#NULL.base|=0, |#NULL.offset|=0, |l_malloc_#in~size|=4, |l_malloc_#t~malloc31.base|=7, |l_malloc_#t~malloc31.offset|=0, |old(~globalState~0)|=0, ~globalState~0=1] [?] #res.base, #res.offset := ~retVal~0.base, ~retVal~0.offset; VAL [l_malloc_~retVal~0.base=7, l_malloc_~retVal~0.offset=0, l_malloc_~size=4, |#NULL.base|=0, |#NULL.offset|=0, |l_malloc_#in~size|=4, |l_malloc_#res.base|=7, |l_malloc_#res.offset|=0, |l_malloc_#t~malloc31.base|=7, |l_malloc_#t~malloc31.offset|=0, |old(~globalState~0)|=0, ~globalState~0=1] [?] assume true; VAL [l_malloc_~retVal~0.base=7, l_malloc_~retVal~0.offset=0, l_malloc_~size=4, |#NULL.base|=0, |#NULL.offset|=0, |l_malloc_#in~size|=4, |l_malloc_#res.base|=7, |l_malloc_#res.offset|=0, |l_malloc_#t~malloc31.base|=7, |l_malloc_#t~malloc31.offset|=0, |old(~globalState~0)|=0, ~globalState~0=1] [?] RET #47#return; VAL [main_~argc=11, main_~argv.base=9, main_~argv.offset=6, |#NULL.base|=0, |#NULL.offset|=0, |main_#in~argc|=11, |main_#in~argv.base|=9, |main_#in~argv.offset|=6, |main_#t~ret30.base|=7, |main_#t~ret30.offset|=0, |old(~globalState~0)|=0, ~globalState~0=1] [?] ~a~0.base, ~a~0.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; VAL [main_~argc=11, main_~argv.base=9, main_~argv.offset=6, main_~a~0.base=7, main_~a~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#in~argc|=11, |main_#in~argv.base|=9, |main_#in~argv.offset|=6, |old(~globalState~0)|=0, ~globalState~0=1] [?] CALL call l_free(~a~0.base, ~a~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |l_free_#in~ptr.base|=7, |l_free_#in~ptr.offset|=0, |old(~globalState~0)|=1, ~globalState~0=1] [?] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; VAL [l_free_~ptr.base=7, l_free_~ptr.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |l_free_#in~ptr.base|=7, |l_free_#in~ptr.offset|=0, |old(~globalState~0)|=1, ~globalState~0=1] [?] assume ~ptr.base != 0 || ~ptr.offset != 0; VAL [l_free_~ptr.base=7, l_free_~ptr.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |l_free_#in~ptr.base|=7, |l_free_#in~ptr.offset|=0, |old(~globalState~0)|=1, ~globalState~0=1] [?] assume 1 == ~globalState~0; VAL [l_free_~ptr.base=7, l_free_~ptr.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |l_free_#in~ptr.base|=7, |l_free_#in~ptr.offset|=0, |old(~globalState~0)|=1, ~globalState~0=1] [?] ~globalState~0 := 0;call ULTIMATE.dealloc(~ptr.base, ~ptr.offset); VAL [l_free_~ptr.base=7, l_free_~ptr.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |l_free_#in~ptr.base|=7, |l_free_#in~ptr.offset|=0, |old(~globalState~0)|=1, ~globalState~0=0] [?] assume true; VAL [l_free_~ptr.base=7, l_free_~ptr.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |l_free_#in~ptr.base|=7, |l_free_#in~ptr.offset|=0, |old(~globalState~0)|=1, ~globalState~0=0] [?] RET #49#return; VAL [main_~argc=11, main_~argv.base=9, main_~argv.offset=6, main_~a~0.base=7, main_~a~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#in~argc|=11, |main_#in~argv.base|=9, |main_#in~argv.offset|=6, |old(~globalState~0)|=0, ~globalState~0=0] [?] CALL call l_free(~a~0.base, ~a~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |l_free_#in~ptr.base|=7, |l_free_#in~ptr.offset|=0, |old(~globalState~0)|=0, ~globalState~0=0] [?] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; VAL [l_free_~ptr.base=7, l_free_~ptr.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |l_free_#in~ptr.base|=7, |l_free_#in~ptr.offset|=0, |old(~globalState~0)|=0, ~globalState~0=0] [?] assume ~ptr.base != 0 || ~ptr.offset != 0; VAL [l_free_~ptr.base=7, l_free_~ptr.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |l_free_#in~ptr.base|=7, |l_free_#in~ptr.offset|=0, |old(~globalState~0)|=0, ~globalState~0=0] [?] assume !(1 == ~globalState~0); VAL [l_free_~ptr.base=7, l_free_~ptr.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |l_free_#in~ptr.base|=7, |l_free_#in~ptr.offset|=0, |old(~globalState~0)|=0, ~globalState~0=0] [?] CALL call __blast_assert(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~globalState~0)|=0, ~globalState~0=0] [?] assume !false; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~globalState~0)|=0, ~globalState~0=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=10, #NULL.offset=5, old(#NULL.base)=10, old(#NULL.offset)=5, old(~globalState~0)=8, ~globalState~0=8] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L1606] ~globalState~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=10, old(#NULL.offset)=5, old(~globalState~0)=8, ~globalState~0=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=10, old(#NULL.offset)=5, old(~globalState~0)=8, ~globalState~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~globalState~0=0] [?] CALL call #t~ret32 := main(#in~argc, #in~argv.base, #in~argv.offset); VAL [#in~argc=11, #in~argv.base=9, #in~argv.offset=6, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1610-L1616] ~argc := #in~argc; [L1610-L1616] ~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; VAL [#in~argc=11, #in~argv.base=9, #in~argv.offset=6, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~argc=11, ~argv.base=9, ~argv.offset=6, ~globalState~0=0] [L1612] CALL call #t~ret30.base, #t~ret30.offset := l_malloc(4); VAL [#in~size=4, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1618-L1623] ~size := #in~size; [L1619] call #t~malloc31.base, #t~malloc31.offset := #Ultimate.alloc(~size); [L1619] ~retVal~0.base, ~retVal~0.offset := #t~malloc31.base, #t~malloc31.offset; VAL [#in~size=4, #NULL.base=0, #NULL.offset=0, #t~malloc31.base=7, #t~malloc31.offset=0, old(~globalState~0)=0, ~globalState~0=0, ~retVal~0.base=7, ~retVal~0.offset=0, ~size=4] [L1620-L1621] assume ~retVal~0.base != 0 || ~retVal~0.offset != 0; [L1621] ~globalState~0 := 1; VAL [#in~size=4, #NULL.base=0, #NULL.offset=0, #t~malloc31.base=7, #t~malloc31.offset=0, old(~globalState~0)=0, ~globalState~0=1, ~retVal~0.base=7, ~retVal~0.offset=0, ~size=4] [L1622] #res.base, #res.offset := ~retVal~0.base, ~retVal~0.offset; VAL [#in~size=4, #NULL.base=0, #NULL.offset=0, #res.base=7, #res.offset=0, #t~malloc31.base=7, #t~malloc31.offset=0, old(~globalState~0)=0, ~globalState~0=1, ~retVal~0.base=7, ~retVal~0.offset=0, ~size=4] [L1607] ensures true; VAL [#in~size=4, #NULL.base=0, #NULL.offset=0, #res.base=7, #res.offset=0, #t~malloc31.base=7, #t~malloc31.offset=0, old(~globalState~0)=0, ~globalState~0=1, ~retVal~0.base=7, ~retVal~0.offset=0, ~size=4] [L1612] RET call #t~ret30.base, #t~ret30.offset := l_malloc(4); VAL [#in~argc=11, #in~argv.base=9, #in~argv.offset=6, #NULL.base=0, #NULL.offset=0, #t~ret30.base=7, #t~ret30.offset=0, old(~globalState~0)=0, ~argc=11, ~argv.base=9, ~argv.offset=6, ~globalState~0=1] [L1612] ~a~0.base, ~a~0.offset := #t~ret30.base, #t~ret30.offset; [L1612] havoc #t~ret30.base, #t~ret30.offset; VAL [#in~argc=11, #in~argv.base=9, #in~argv.offset=6, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~argc=11, ~argv.base=9, ~argv.offset=6, ~a~0.base=7, ~a~0.offset=0, ~globalState~0=1] [L1613] CALL call l_free(~a~0.base, ~a~0.offset); VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=1, ~globalState~0=1] [L1625-L1632] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr.base=7, ~ptr.offset=0] [L1629] assume ~ptr.base != 0 || ~ptr.offset != 0; VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr.base=7, ~ptr.offset=0] [L1629] assume 1 == ~globalState~0; VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr.base=7, ~ptr.offset=0] [L1630] ~globalState~0 := 0; [L1631] call ULTIMATE.dealloc(~ptr.base, ~ptr.offset); VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=1, ~globalState~0=0, ~ptr.base=7, ~ptr.offset=0] [L1608] ensures true; VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=1, ~globalState~0=0, ~ptr.base=7, ~ptr.offset=0] [L1613] RET call l_free(~a~0.base, ~a~0.offset); VAL [#in~argc=11, #in~argv.base=9, #in~argv.offset=6, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~argc=11, ~argv.base=9, ~argv.offset=6, ~a~0.base=7, ~a~0.offset=0, ~globalState~0=0] [L1614] CALL call l_free(~a~0.base, ~a~0.offset); VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1625-L1632] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr.base=7, ~ptr.offset=0] [L1629] assume ~ptr.base != 0 || ~ptr.offset != 0; VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr.base=7, ~ptr.offset=0] [L1629] assume !(1 == ~globalState~0); VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr.base=7, ~ptr.offset=0] [L1629] CALL call __blast_assert(); VAL [#NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1601] assert false; VAL [#NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~globalState~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=10, #NULL.offset=5, old(#NULL.base)=10, old(#NULL.offset)=5, old(~globalState~0)=8, ~globalState~0=8] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L1606] ~globalState~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=10, old(#NULL.offset)=5, old(~globalState~0)=8, ~globalState~0=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=10, old(#NULL.offset)=5, old(~globalState~0)=8, ~globalState~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~globalState~0=0] [?] CALL call #t~ret32 := main(#in~argc, #in~argv.base, #in~argv.offset); VAL [#in~argc=11, #in~argv.base=9, #in~argv.offset=6, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1610-L1616] ~argc := #in~argc; [L1610-L1616] ~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; VAL [#in~argc=11, #in~argv.base=9, #in~argv.offset=6, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~argc=11, ~argv.base=9, ~argv.offset=6, ~globalState~0=0] [L1612] CALL call #t~ret30.base, #t~ret30.offset := l_malloc(4); VAL [#in~size=4, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1618-L1623] ~size := #in~size; [L1619] call #t~malloc31.base, #t~malloc31.offset := #Ultimate.alloc(~size); [L1619] ~retVal~0.base, ~retVal~0.offset := #t~malloc31.base, #t~malloc31.offset; VAL [#in~size=4, #NULL.base=0, #NULL.offset=0, #t~malloc31.base=7, #t~malloc31.offset=0, old(~globalState~0)=0, ~globalState~0=0, ~retVal~0.base=7, ~retVal~0.offset=0, ~size=4] [L1620-L1621] assume ~retVal~0.base != 0 || ~retVal~0.offset != 0; [L1621] ~globalState~0 := 1; VAL [#in~size=4, #NULL.base=0, #NULL.offset=0, #t~malloc31.base=7, #t~malloc31.offset=0, old(~globalState~0)=0, ~globalState~0=1, ~retVal~0.base=7, ~retVal~0.offset=0, ~size=4] [L1622] #res.base, #res.offset := ~retVal~0.base, ~retVal~0.offset; VAL [#in~size=4, #NULL.base=0, #NULL.offset=0, #res.base=7, #res.offset=0, #t~malloc31.base=7, #t~malloc31.offset=0, old(~globalState~0)=0, ~globalState~0=1, ~retVal~0.base=7, ~retVal~0.offset=0, ~size=4] [L1607] ensures true; VAL [#in~size=4, #NULL.base=0, #NULL.offset=0, #res.base=7, #res.offset=0, #t~malloc31.base=7, #t~malloc31.offset=0, old(~globalState~0)=0, ~globalState~0=1, ~retVal~0.base=7, ~retVal~0.offset=0, ~size=4] [L1612] RET call #t~ret30.base, #t~ret30.offset := l_malloc(4); VAL [#in~argc=11, #in~argv.base=9, #in~argv.offset=6, #NULL.base=0, #NULL.offset=0, #t~ret30.base=7, #t~ret30.offset=0, old(~globalState~0)=0, ~argc=11, ~argv.base=9, ~argv.offset=6, ~globalState~0=1] [L1612] ~a~0.base, ~a~0.offset := #t~ret30.base, #t~ret30.offset; [L1612] havoc #t~ret30.base, #t~ret30.offset; VAL [#in~argc=11, #in~argv.base=9, #in~argv.offset=6, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~argc=11, ~argv.base=9, ~argv.offset=6, ~a~0.base=7, ~a~0.offset=0, ~globalState~0=1] [L1613] CALL call l_free(~a~0.base, ~a~0.offset); VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=1, ~globalState~0=1] [L1625-L1632] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr.base=7, ~ptr.offset=0] [L1629] assume ~ptr.base != 0 || ~ptr.offset != 0; VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr.base=7, ~ptr.offset=0] [L1629] assume 1 == ~globalState~0; VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr.base=7, ~ptr.offset=0] [L1630] ~globalState~0 := 0; [L1631] call ULTIMATE.dealloc(~ptr.base, ~ptr.offset); VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=1, ~globalState~0=0, ~ptr.base=7, ~ptr.offset=0] [L1608] ensures true; VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=1, ~globalState~0=0, ~ptr.base=7, ~ptr.offset=0] [L1613] RET call l_free(~a~0.base, ~a~0.offset); VAL [#in~argc=11, #in~argv.base=9, #in~argv.offset=6, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~argc=11, ~argv.base=9, ~argv.offset=6, ~a~0.base=7, ~a~0.offset=0, ~globalState~0=0] [L1614] CALL call l_free(~a~0.base, ~a~0.offset); VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1625-L1632] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr.base=7, ~ptr.offset=0] [L1629] assume ~ptr.base != 0 || ~ptr.offset != 0; VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr.base=7, ~ptr.offset=0] [L1629] assume !(1 == ~globalState~0); VAL [#in~ptr.base=7, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr.base=7, ~ptr.offset=0] [L1629] CALL call __blast_assert(); VAL [#NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1601] assert false; VAL [#NULL.base=0, #NULL.offset=0, old(~globalState~0)=0, ~globalState~0=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=10, #NULL!offset=5, old(#NULL!base)=10, old(#NULL!offset)=5, old(~globalState~0)=8, ~globalState~0=8] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L1606] ~globalState~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=10, old(#NULL!offset)=5, old(~globalState~0)=8, ~globalState~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~globalState~0=0] [?] CALL call #t~ret32 := main(#in~argc, #in~argv); VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1610-L1616] ~argc := #in~argc; [L1610-L1616] ~argv := #in~argv; VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~argc=11, ~argv!base=9, ~argv!offset=6, ~globalState~0=0] [L1612] CALL call #t~ret30 := l_malloc(4); VAL [#in~size=4, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1618-L1623] ~size := #in~size; [L1619] FCALL call #t~malloc31 := #Ultimate.alloc(~size); [L1619] ~retVal~0 := #t~malloc31; VAL [#in~size=4, #NULL!base=0, #NULL!offset=0, #t~malloc31!base=7, #t~malloc31!offset=0, old(~globalState~0)=0, ~globalState~0=0, ~retVal~0!base=7, ~retVal~0!offset=0, ~size=4] [L1620] COND TRUE ~retVal~0 != { base: 0, offset: 0 } [L1621] ~globalState~0 := 1; VAL [#in~size=4, #NULL!base=0, #NULL!offset=0, #t~malloc31!base=7, #t~malloc31!offset=0, old(~globalState~0)=0, ~globalState~0=1, ~retVal~0!base=7, ~retVal~0!offset=0, ~size=4] [L1622] #res := ~retVal~0; VAL [#in~size=4, #NULL!base=0, #NULL!offset=0, #res!base=7, #res!offset=0, #t~malloc31!base=7, #t~malloc31!offset=0, old(~globalState~0)=0, ~globalState~0=1, ~retVal~0!base=7, ~retVal~0!offset=0, ~size=4] [L1612] RET call #t~ret30 := l_malloc(4); VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, #t~ret30!base=7, #t~ret30!offset=0, old(~globalState~0)=0, ~argc=11, ~argv!base=9, ~argv!offset=6, ~globalState~0=1] [L1612] ~a~0 := #t~ret30; [L1612] havoc #t~ret30; VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~argc=11, ~argv!base=9, ~argv!offset=6, ~a~0!base=7, ~a~0!offset=0, ~globalState~0=1] [L1613] CALL call l_free(~a~0); VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=1] [L1625-L1632] ~ptr := #in~ptr; VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr!base=7, ~ptr!offset=0] [L1629] COND TRUE ~ptr != { base: 0, offset: 0 } VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr!base=7, ~ptr!offset=0] [L1629] COND TRUE 1 == ~globalState~0 VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr!base=7, ~ptr!offset=0] [L1630] ~globalState~0 := 0; [L1631] FCALL call ULTIMATE.dealloc(~ptr); VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=0, ~ptr!base=7, ~ptr!offset=0] [L1613] RET call l_free(~a~0); VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~argc=11, ~argv!base=9, ~argv!offset=6, ~a~0!base=7, ~a~0!offset=0, ~globalState~0=0] [L1614] CALL call l_free(~a~0); VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1625-L1632] ~ptr := #in~ptr; VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr!base=7, ~ptr!offset=0] [L1629] COND TRUE ~ptr != { base: 0, offset: 0 } VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr!base=7, ~ptr!offset=0] [L1629] COND FALSE !(1 == ~globalState~0) VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr!base=7, ~ptr!offset=0] [L1629] CALL call __blast_assert(); VAL [#NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1601] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=10, #NULL!offset=5, old(#NULL!base)=10, old(#NULL!offset)=5, old(~globalState~0)=8, ~globalState~0=8] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L1606] ~globalState~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=10, old(#NULL!offset)=5, old(~globalState~0)=8, ~globalState~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~globalState~0=0] [?] CALL call #t~ret32 := main(#in~argc, #in~argv); VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1610-L1616] ~argc := #in~argc; [L1610-L1616] ~argv := #in~argv; VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~argc=11, ~argv!base=9, ~argv!offset=6, ~globalState~0=0] [L1612] CALL call #t~ret30 := l_malloc(4); VAL [#in~size=4, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1618-L1623] ~size := #in~size; [L1619] FCALL call #t~malloc31 := #Ultimate.alloc(~size); [L1619] ~retVal~0 := #t~malloc31; VAL [#in~size=4, #NULL!base=0, #NULL!offset=0, #t~malloc31!base=7, #t~malloc31!offset=0, old(~globalState~0)=0, ~globalState~0=0, ~retVal~0!base=7, ~retVal~0!offset=0, ~size=4] [L1620] COND TRUE ~retVal~0 != { base: 0, offset: 0 } [L1621] ~globalState~0 := 1; VAL [#in~size=4, #NULL!base=0, #NULL!offset=0, #t~malloc31!base=7, #t~malloc31!offset=0, old(~globalState~0)=0, ~globalState~0=1, ~retVal~0!base=7, ~retVal~0!offset=0, ~size=4] [L1622] #res := ~retVal~0; VAL [#in~size=4, #NULL!base=0, #NULL!offset=0, #res!base=7, #res!offset=0, #t~malloc31!base=7, #t~malloc31!offset=0, old(~globalState~0)=0, ~globalState~0=1, ~retVal~0!base=7, ~retVal~0!offset=0, ~size=4] [L1612] RET call #t~ret30 := l_malloc(4); VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, #t~ret30!base=7, #t~ret30!offset=0, old(~globalState~0)=0, ~argc=11, ~argv!base=9, ~argv!offset=6, ~globalState~0=1] [L1612] ~a~0 := #t~ret30; [L1612] havoc #t~ret30; VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~argc=11, ~argv!base=9, ~argv!offset=6, ~a~0!base=7, ~a~0!offset=0, ~globalState~0=1] [L1613] CALL call l_free(~a~0); VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=1] [L1625-L1632] ~ptr := #in~ptr; VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr!base=7, ~ptr!offset=0] [L1629] COND TRUE ~ptr != { base: 0, offset: 0 } VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr!base=7, ~ptr!offset=0] [L1629] COND TRUE 1 == ~globalState~0 VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr!base=7, ~ptr!offset=0] [L1630] ~globalState~0 := 0; [L1631] FCALL call ULTIMATE.dealloc(~ptr); VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=0, ~ptr!base=7, ~ptr!offset=0] [L1613] RET call l_free(~a~0); VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~argc=11, ~argv!base=9, ~argv!offset=6, ~a~0!base=7, ~a~0!offset=0, ~globalState~0=0] [L1614] CALL call l_free(~a~0); VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1625-L1632] ~ptr := #in~ptr; VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr!base=7, ~ptr!offset=0] [L1629] COND TRUE ~ptr != { base: 0, offset: 0 } VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr!base=7, ~ptr!offset=0] [L1629] COND FALSE !(1 == ~globalState~0) VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr!base=7, ~ptr!offset=0] [L1629] CALL call __blast_assert(); VAL [#NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1601] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=10, #NULL!offset=5, old(#NULL!base)=10, old(#NULL!offset)=5, old(~globalState~0)=8, ~globalState~0=8] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L1606] ~globalState~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=10, old(#NULL!offset)=5, old(~globalState~0)=8, ~globalState~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~globalState~0=0] [?] CALL call #t~ret32 := main(#in~argc, #in~argv); VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1610-L1616] ~argc := #in~argc; [L1610-L1616] ~argv := #in~argv; VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~argc=11, ~argv!base=9, ~argv!offset=6, ~globalState~0=0] [L1612] CALL call #t~ret30 := l_malloc(4); VAL [#in~size=4, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1618-L1623] ~size := #in~size; [L1619] FCALL call #t~malloc31 := #Ultimate.alloc(~size); [L1619] ~retVal~0 := #t~malloc31; VAL [#in~size=4, #NULL!base=0, #NULL!offset=0, #t~malloc31!base=7, #t~malloc31!offset=0, old(~globalState~0)=0, ~globalState~0=0, ~retVal~0!base=7, ~retVal~0!offset=0, ~size=4] [L1620] COND TRUE ~retVal~0 != { base: 0, offset: 0 } [L1621] ~globalState~0 := 1; VAL [#in~size=4, #NULL!base=0, #NULL!offset=0, #t~malloc31!base=7, #t~malloc31!offset=0, old(~globalState~0)=0, ~globalState~0=1, ~retVal~0!base=7, ~retVal~0!offset=0, ~size=4] [L1622] #res := ~retVal~0; VAL [#in~size=4, #NULL!base=0, #NULL!offset=0, #res!base=7, #res!offset=0, #t~malloc31!base=7, #t~malloc31!offset=0, old(~globalState~0)=0, ~globalState~0=1, ~retVal~0!base=7, ~retVal~0!offset=0, ~size=4] [L1612] RET call #t~ret30 := l_malloc(4); VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, #t~ret30!base=7, #t~ret30!offset=0, old(~globalState~0)=0, ~argc=11, ~argv!base=9, ~argv!offset=6, ~globalState~0=1] [L1612] ~a~0 := #t~ret30; [L1612] havoc #t~ret30; VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~argc=11, ~argv!base=9, ~argv!offset=6, ~a~0!base=7, ~a~0!offset=0, ~globalState~0=1] [L1613] CALL call l_free(~a~0); VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=1] [L1625-L1632] ~ptr := #in~ptr; VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr!base=7, ~ptr!offset=0] [L1629] COND TRUE ~ptr != { base: 0, offset: 0 } VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr!base=7, ~ptr!offset=0] [L1629] COND TRUE 1 == ~globalState~0 VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr!base=7, ~ptr!offset=0] [L1630] ~globalState~0 := 0; [L1631] FCALL call ULTIMATE.dealloc(~ptr); VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=0, ~ptr!base=7, ~ptr!offset=0] [L1613] RET call l_free(~a~0); VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~argc=11, ~argv!base=9, ~argv!offset=6, ~a~0!base=7, ~a~0!offset=0, ~globalState~0=0] [L1614] CALL call l_free(~a~0); VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1625-L1632] ~ptr := #in~ptr; VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr!base=7, ~ptr!offset=0] [L1629] COND TRUE ~ptr != { base: 0, offset: 0 } VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr!base=7, ~ptr!offset=0] [L1629] COND FALSE !(1 == ~globalState~0) VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr!base=7, ~ptr!offset=0] [L1629] CALL call __blast_assert(); VAL [#NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1601] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=10, #NULL!offset=5, old(#NULL!base)=10, old(#NULL!offset)=5, old(~globalState~0)=8, ~globalState~0=8] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L1606] ~globalState~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=10, old(#NULL!offset)=5, old(~globalState~0)=8, ~globalState~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~globalState~0=0] [?] CALL call #t~ret32 := main(#in~argc, #in~argv); VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1610-L1616] ~argc := #in~argc; [L1610-L1616] ~argv := #in~argv; VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~argc=11, ~argv!base=9, ~argv!offset=6, ~globalState~0=0] [L1612] CALL call #t~ret30 := l_malloc(4); VAL [#in~size=4, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1618-L1623] ~size := #in~size; [L1619] FCALL call #t~malloc31 := #Ultimate.alloc(~size); [L1619] ~retVal~0 := #t~malloc31; VAL [#in~size=4, #NULL!base=0, #NULL!offset=0, #t~malloc31!base=7, #t~malloc31!offset=0, old(~globalState~0)=0, ~globalState~0=0, ~retVal~0!base=7, ~retVal~0!offset=0, ~size=4] [L1620] COND TRUE ~retVal~0 != { base: 0, offset: 0 } [L1621] ~globalState~0 := 1; VAL [#in~size=4, #NULL!base=0, #NULL!offset=0, #t~malloc31!base=7, #t~malloc31!offset=0, old(~globalState~0)=0, ~globalState~0=1, ~retVal~0!base=7, ~retVal~0!offset=0, ~size=4] [L1622] #res := ~retVal~0; VAL [#in~size=4, #NULL!base=0, #NULL!offset=0, #res!base=7, #res!offset=0, #t~malloc31!base=7, #t~malloc31!offset=0, old(~globalState~0)=0, ~globalState~0=1, ~retVal~0!base=7, ~retVal~0!offset=0, ~size=4] [L1612] RET call #t~ret30 := l_malloc(4); VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, #t~ret30!base=7, #t~ret30!offset=0, old(~globalState~0)=0, ~argc=11, ~argv!base=9, ~argv!offset=6, ~globalState~0=1] [L1612] ~a~0 := #t~ret30; [L1612] havoc #t~ret30; VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~argc=11, ~argv!base=9, ~argv!offset=6, ~a~0!base=7, ~a~0!offset=0, ~globalState~0=1] [L1613] CALL call l_free(~a~0); VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=1] [L1625-L1632] ~ptr := #in~ptr; VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr!base=7, ~ptr!offset=0] [L1629] COND TRUE ~ptr != { base: 0, offset: 0 } VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr!base=7, ~ptr!offset=0] [L1629] COND TRUE 1 == ~globalState~0 VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=1, ~ptr!base=7, ~ptr!offset=0] [L1630] ~globalState~0 := 0; [L1631] FCALL call ULTIMATE.dealloc(~ptr); VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=1, ~globalState~0=0, ~ptr!base=7, ~ptr!offset=0] [L1613] RET call l_free(~a~0); VAL [#in~argc=11, #in~argv!base=9, #in~argv!offset=6, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~argc=11, ~argv!base=9, ~argv!offset=6, ~a~0!base=7, ~a~0!offset=0, ~globalState~0=0] [L1614] CALL call l_free(~a~0); VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1625-L1632] ~ptr := #in~ptr; VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr!base=7, ~ptr!offset=0] [L1629] COND TRUE ~ptr != { base: 0, offset: 0 } VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr!base=7, ~ptr!offset=0] [L1629] COND FALSE !(1 == ~globalState~0) VAL [#in~ptr!base=7, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0, ~ptr!base=7, ~ptr!offset=0] [L1629] CALL call __blast_assert(); VAL [#NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1601] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~globalState~0)=0, ~globalState~0=0] [L1606] int globalState = 0; VAL [\old(globalState)=8, globalState=0] [L1612] CALL, EXPR l_malloc(sizeof(int)) VAL [\old(globalState)=0, \old(size)=4, globalState=0] [L1619] void *retVal = malloc(size); VAL [\old(globalState)=0, \old(size)=4, globalState=0, malloc(size)={7:0}, retVal={7:0}, size=4] [L1620] COND TRUE retVal != ((void *)0) [L1621] globalState=1 VAL [\old(globalState)=0, \old(size)=4, globalState=1, malloc(size)={7:0}, retVal={7:0}, size=4] [L1622] return retVal; VAL [\old(globalState)=0, \old(size)=4, \result={7:0}, globalState=1, malloc(size)={7:0}, retVal={7:0}, size=4] [L1612] RET, EXPR l_malloc(sizeof(int)) VAL [\old(argc)=11, \old(globalState)=0, argc=11, argv={9:6}, argv={9:6}, globalState=1, l_malloc(sizeof(int))={7:0}] [L1612] int *a = (int*) l_malloc(sizeof(int)); [L1613] CALL l_free(a) VAL [\old(globalState)=1, globalState=1, ptr={7:0}] [L1629] COND TRUE ptr!=((void *)0) VAL [\old(globalState)=1, globalState=1, ptr={7:0}, ptr={7:0}] [L1629] (globalState == 1) ? (0) : __blast_assert () VAL [\old(globalState)=1, globalState=1, ptr={7:0}, ptr={7:0}] [L1630] globalState = 0 [L1613] RET l_free(a) VAL [\old(argc)=11, \old(globalState)=0, a={7:0}, argc=11, argv={9:6}, argv={9:6}, globalState=0] [L1614] CALL l_free(a) VAL [\old(globalState)=0, globalState=0, ptr={7:0}] [L1629] COND TRUE ptr!=((void *)0) VAL [\old(globalState)=0, globalState=0, ptr={7:0}, ptr={7:0}] [L1629] (globalState == 1) ? (0) : __blast_assert () VAL [\old(globalState)=0, globalState=0, ptr={7:0}, ptr={7:0}] [L1629] CALL __blast_assert () VAL [\old(globalState)=0, globalState=0] [L1601] __VERIFIER_error() VAL [\old(globalState)=0, globalState=0] ----- [2018-11-23 12:53:36,091 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/alt_test_true-termination.c_false-unreach-call.i-witness.graphml [2018-11-23 12:53:36,092 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:53:36,093 INFO L168 Benchmark]: Toolchain (without parser) took 5400.28 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -588.5 MB). Peak memory consumption was 153.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:36,095 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:53:36,096 INFO L168 Benchmark]: CACSL2BoogieTranslator took 833.10 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:36,097 INFO L168 Benchmark]: Boogie Procedure Inliner took 175.90 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -841.0 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:36,097 INFO L168 Benchmark]: Boogie Preprocessor took 43.00 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:53:36,104 INFO L168 Benchmark]: RCFGBuilder took 587.74 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:36,104 INFO L168 Benchmark]: TraceAbstraction took 3643.21 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: 175.4 MB). Peak memory consumption was 175.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:36,107 INFO L168 Benchmark]: Witness Printer took 111.77 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 12:53:36,114 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 833.10 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 175.90 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -841.0 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.00 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 587.74 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3643.21 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: 175.4 MB). Peak memory consumption was 175.4 MB. Max. memory is 7.1 GB. * Witness Printer took 111.77 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: 1601]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1606] int globalState = 0; VAL [\old(globalState)=8, globalState=0] [L1612] CALL, EXPR l_malloc(sizeof(int)) VAL [\old(globalState)=0, \old(size)=4, globalState=0] [L1619] void *retVal = malloc(size); VAL [\old(globalState)=0, \old(size)=4, globalState=0, malloc(size)={7:0}, retVal={7:0}, size=4] [L1620] COND TRUE retVal != ((void *)0) [L1621] globalState=1 VAL [\old(globalState)=0, \old(size)=4, globalState=1, malloc(size)={7:0}, retVal={7:0}, size=4] [L1622] return retVal; VAL [\old(globalState)=0, \old(size)=4, \result={7:0}, globalState=1, malloc(size)={7:0}, retVal={7:0}, size=4] [L1612] RET, EXPR l_malloc(sizeof(int)) VAL [\old(argc)=11, \old(globalState)=0, argc=11, argv={9:6}, argv={9:6}, globalState=1, l_malloc(sizeof(int))={7:0}] [L1612] int *a = (int*) l_malloc(sizeof(int)); [L1613] CALL l_free(a) VAL [\old(globalState)=1, globalState=1, ptr={7:0}] [L1629] COND TRUE ptr!=((void *)0) VAL [\old(globalState)=1, globalState=1, ptr={7:0}, ptr={7:0}] [L1629] (globalState == 1) ? (0) : __blast_assert () VAL [\old(globalState)=1, globalState=1, ptr={7:0}, ptr={7:0}] [L1630] globalState = 0 [L1613] RET l_free(a) VAL [\old(argc)=11, \old(globalState)=0, a={7:0}, argc=11, argv={9:6}, argv={9:6}, globalState=0] [L1614] CALL l_free(a) VAL [\old(globalState)=0, globalState=0, ptr={7:0}] [L1629] COND TRUE ptr!=((void *)0) VAL [\old(globalState)=0, globalState=0, ptr={7:0}, ptr={7:0}] [L1629] (globalState == 1) ? (0) : __blast_assert () VAL [\old(globalState)=0, globalState=0, ptr={7:0}, ptr={7:0}] [L1629] CALL __blast_assert () VAL [\old(globalState)=0, globalState=0] [L1601] __VERIFIER_error() VAL [\old(globalState)=0, globalState=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 31 locations, 1 error locations. UNSAFE Result, 3.5s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 72 SDtfs, 15 SDslu, 143 SDs, 0 SdLazy, 51 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=1, 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.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 60 ConstructedInterpolants, 0 QuantifiedInterpolants, 2190 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...