java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/ldv-regression/alt_test_true-termination.c_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:05:59,438 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:05:59,441 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:05:59,455 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:05:59,456 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:05:59,457 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:05:59,458 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:05:59,460 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:05:59,462 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:05:59,463 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:05:59,464 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:05:59,464 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:05:59,465 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:05:59,466 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:05:59,467 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:05:59,468 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:05:59,469 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:05:59,471 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:05:59,473 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:05:59,475 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:05:59,476 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:05:59,477 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:05:59,480 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:05:59,480 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:05:59,480 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:05:59,481 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:05:59,482 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:05:59,483 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:05:59,484 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:05:59,485 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:05:59,486 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:05:59,486 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:05:59,487 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:05:59,489 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:05:59,490 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:05:59,494 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:05:59,494 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:05:59,523 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:05:59,523 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:05:59,525 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:05:59,525 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:05:59,525 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:05:59,526 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:05:59,526 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:05:59,526 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:05:59,526 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:05:59,526 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:05:59,528 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:05:59,528 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:05:59,528 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:05:59,528 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:05:59,528 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:05:59,529 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:05:59,529 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:05:59,529 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:05:59,529 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:05:59,529 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:05:59,530 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:05:59,530 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:05:59,530 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:05:59,530 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:05:59,530 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:05:59,531 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:05:59,531 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:05:59,531 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:05:59,531 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:05:59,531 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:05:59,532 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:05:59,533 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:05:59,533 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:05:59,604 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:05:59,625 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:05:59,630 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:05:59,632 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:05:59,632 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:05:59,633 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 11:05:59,715 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8ef5c063/91a22e6df93f42f9a8d63223609bf251/FLAG2fd32797d [2018-11-23 11:06:00,361 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:06:00,362 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/alt_test_true-termination.c_false-unreach-call.i [2018-11-23 11:06:00,380 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8ef5c063/91a22e6df93f42f9a8d63223609bf251/FLAG2fd32797d [2018-11-23 11:06:00,584 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8ef5c063/91a22e6df93f42f9a8d63223609bf251 [2018-11-23 11:06:00,593 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:06:00,595 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:06:00,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:06:00,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:06:00,600 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:06:00,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:06:00" (1/1) ... [2018-11-23 11:06:00,606 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c1e412f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:00, skipping insertion in model container [2018-11-23 11:06:00,606 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:06:00" (1/1) ... [2018-11-23 11:06:00,617 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:06:00,700 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:06:01,182 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:06:01,193 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:06:01,268 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:06:01,509 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:06:01,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:01 WrapperNode [2018-11-23 11:06:01,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:06:01,510 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:06:01,510 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:06:01,511 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:06:01,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:01" (1/1) ... [2018-11-23 11:06:01,542 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:01" (1/1) ... [2018-11-23 11:06:01,553 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:06:01,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:06:01,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:06:01,553 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:06:01,563 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:01" (1/1) ... [2018-11-23 11:06:01,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:01" (1/1) ... [2018-11-23 11:06:01,569 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:01" (1/1) ... [2018-11-23 11:06:01,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:01" (1/1) ... [2018-11-23 11:06:01,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:01" (1/1) ... [2018-11-23 11:06:01,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:01" (1/1) ... [2018-11-23 11:06:01,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:01" (1/1) ... [2018-11-23 11:06:01,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:06:01,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:06:01,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:06:01,610 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:06:01,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:06:01,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:06:01,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:06:01,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:06:01,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:06:01,680 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:06:01,681 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:06:01,681 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2018-11-23 11:06:01,681 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2018-11-23 11:06:01,681 INFO L130 BoogieDeclarations]: Found specification of procedure l_malloc [2018-11-23 11:06:01,681 INFO L138 BoogieDeclarations]: Found implementation of procedure l_malloc [2018-11-23 11:06:01,681 INFO L130 BoogieDeclarations]: Found specification of procedure l_free [2018-11-23 11:06:01,682 INFO L138 BoogieDeclarations]: Found implementation of procedure l_free [2018-11-23 11:06:01,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:06:01,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:06:02,213 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:06:02,214 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 11:06:02,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:06:02 BoogieIcfgContainer [2018-11-23 11:06:02,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:06:02,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:06:02,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:06:02,219 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:06:02,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:06:00" (1/3) ... [2018-11-23 11:06:02,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a92a850 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:06:02, skipping insertion in model container [2018-11-23 11:06:02,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:01" (2/3) ... [2018-11-23 11:06:02,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a92a850 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:06:02, skipping insertion in model container [2018-11-23 11:06:02,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:06:02" (3/3) ... [2018-11-23 11:06:02,223 INFO L112 eAbstractionObserver]: Analyzing ICFG alt_test_true-termination.c_false-unreach-call.i [2018-11-23 11:06:02,234 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:06:02,242 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:06:02,261 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:06:02,294 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:06:02,295 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:06:02,295 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:06:02,295 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:06:02,295 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:06:02,295 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:06:02,296 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:06:02,296 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:06:02,296 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:06:02,314 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 11:06:02,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:06:02,321 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:06:02,322 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 11:06:02,324 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:06:02,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:06:02,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1044108918, now seen corresponding path program 1 times [2018-11-23 11:06:02,336 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:06:02,337 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:06:02,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:06:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:02,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:06:02,679 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 11:06:02,682 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~globalState~0 := 0bv32; {34#true} is VALID [2018-11-23 11:06:02,683 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 11:06:02,683 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #43#return; {34#true} is VALID [2018-11-23 11:06:02,684 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 11:06:02,684 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 11:06:02,684 INFO L256 TraceCheckUtils]: 6: Hoare triple {34#true} call #t~ret30.base, #t~ret30.offset := l_malloc(4bv32); {34#true} is VALID [2018-11-23 11:06:02,685 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 11:06:02,686 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#true} assume ~retVal~0.base != 0bv32 || ~retVal~0.offset != 0bv32;~globalState~0 := 1bv32; {63#(= (_ bv1 32) ~globalState~0)} is VALID [2018-11-23 11:06:02,698 INFO L273 TraceCheckUtils]: 9: Hoare triple {63#(= (_ bv1 32) ~globalState~0)} #res.base, #res.offset := ~retVal~0.base, ~retVal~0.offset; {63#(= (_ bv1 32) ~globalState~0)} is VALID [2018-11-23 11:06:02,711 INFO L273 TraceCheckUtils]: 10: Hoare triple {63#(= (_ bv1 32) ~globalState~0)} assume true; {63#(= (_ bv1 32) ~globalState~0)} is VALID [2018-11-23 11:06:02,725 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {63#(= (_ bv1 32) ~globalState~0)} {34#true} #47#return; {63#(= (_ bv1 32) ~globalState~0)} is VALID [2018-11-23 11:06:02,730 INFO L273 TraceCheckUtils]: 12: Hoare triple {63#(= (_ bv1 32) ~globalState~0)} ~a~0.base, ~a~0.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {63#(= (_ bv1 32) ~globalState~0)} is VALID [2018-11-23 11:06:02,731 INFO L256 TraceCheckUtils]: 13: Hoare triple {63#(= (_ bv1 32) ~globalState~0)} call l_free(~a~0.base, ~a~0.offset); {63#(= (_ bv1 32) ~globalState~0)} is VALID [2018-11-23 11:06:02,741 INFO L273 TraceCheckUtils]: 14: Hoare triple {63#(= (_ bv1 32) ~globalState~0)} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; {63#(= (_ bv1 32) ~globalState~0)} is VALID [2018-11-23 11:06:02,754 INFO L273 TraceCheckUtils]: 15: Hoare triple {63#(= (_ bv1 32) ~globalState~0)} assume ~ptr.base != 0bv32 || ~ptr.offset != 0bv32; {63#(= (_ bv1 32) ~globalState~0)} is VALID [2018-11-23 11:06:02,765 INFO L273 TraceCheckUtils]: 16: Hoare triple {63#(= (_ bv1 32) ~globalState~0)} assume !(1bv32 == ~globalState~0); {35#false} is VALID [2018-11-23 11:06:02,765 INFO L256 TraceCheckUtils]: 17: Hoare triple {35#false} call __blast_assert(); {35#false} is VALID [2018-11-23 11:06:02,766 INFO L273 TraceCheckUtils]: 18: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 11:06:02,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:06:02,770 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:06:02,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:06:02,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:06:02,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 11:06:02,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:06:02,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:06:03,045 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 11:06:03,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:06:03,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:06:03,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:06:03,060 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2018-11-23 11:06:03,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:03,345 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2018-11-23 11:06:03,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:06:03,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 11:06:03,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:06:03,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:06:03,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-23 11:06:03,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:06:03,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-23 11:06:03,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2018-11-23 11:06:03,569 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 11:06:03,582 INFO L225 Difference]: With dead ends: 55 [2018-11-23 11:06:03,583 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 11:06:03,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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 11:06:03,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 11:06:03,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-23 11:06:03,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:06:03,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 32 states. [2018-11-23 11:06:03,718 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 32 states. [2018-11-23 11:06:03,719 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 32 states. [2018-11-23 11:06:03,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:03,735 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 11:06:03,735 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 11:06:03,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:03,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:03,737 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states. [2018-11-23 11:06:03,737 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states. [2018-11-23 11:06:03,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:03,746 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 11:06:03,746 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 11:06:03,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:03,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:03,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:06:03,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:06:03,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:06:03,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-23 11:06:03,761 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2018-11-23 11:06:03,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:06:03,762 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-23 11:06:03,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:06:03,762 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 11:06:03,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:06:03,763 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:06:03,764 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 11:06:03,765 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:06:03,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:06:03,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1745173496, now seen corresponding path program 1 times [2018-11-23 11:06:03,766 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:06:03,766 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:06:03,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:06:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:03,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:06:04,056 INFO L256 TraceCheckUtils]: 0: Hoare triple {276#true} call ULTIMATE.init(); {276#true} is VALID [2018-11-23 11:06:04,057 INFO L273 TraceCheckUtils]: 1: Hoare triple {276#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~globalState~0 := 0bv32; {276#true} is VALID [2018-11-23 11:06:04,057 INFO L273 TraceCheckUtils]: 2: Hoare triple {276#true} assume true; {276#true} is VALID [2018-11-23 11:06:04,057 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {276#true} {276#true} #43#return; {276#true} is VALID [2018-11-23 11:06:04,058 INFO L256 TraceCheckUtils]: 4: Hoare triple {276#true} call #t~ret32 := main(#in~argc, #in~argv.base, #in~argv.offset); {276#true} is VALID [2018-11-23 11:06:04,058 INFO L273 TraceCheckUtils]: 5: Hoare triple {276#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; {276#true} is VALID [2018-11-23 11:06:04,058 INFO L256 TraceCheckUtils]: 6: Hoare triple {276#true} call #t~ret30.base, #t~ret30.offset := l_malloc(4bv32); {276#true} is VALID [2018-11-23 11:06:04,073 INFO L273 TraceCheckUtils]: 7: Hoare triple {276#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; {302#(not (= l_malloc_~retVal~0.base (_ bv0 32)))} is VALID [2018-11-23 11:06:04,090 INFO L273 TraceCheckUtils]: 8: Hoare triple {302#(not (= l_malloc_~retVal~0.base (_ bv0 32)))} assume !(~retVal~0.base != 0bv32 || ~retVal~0.offset != 0bv32); {277#false} is VALID [2018-11-23 11:06:04,091 INFO L273 TraceCheckUtils]: 9: Hoare triple {277#false} #res.base, #res.offset := ~retVal~0.base, ~retVal~0.offset; {277#false} is VALID [2018-11-23 11:06:04,091 INFO L273 TraceCheckUtils]: 10: Hoare triple {277#false} assume true; {277#false} is VALID [2018-11-23 11:06:04,092 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {277#false} {276#true} #47#return; {277#false} is VALID [2018-11-23 11:06:04,092 INFO L273 TraceCheckUtils]: 12: Hoare triple {277#false} ~a~0.base, ~a~0.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {277#false} is VALID [2018-11-23 11:06:04,092 INFO L256 TraceCheckUtils]: 13: Hoare triple {277#false} call l_free(~a~0.base, ~a~0.offset); {277#false} is VALID [2018-11-23 11:06:04,093 INFO L273 TraceCheckUtils]: 14: Hoare triple {277#false} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; {277#false} is VALID [2018-11-23 11:06:04,093 INFO L273 TraceCheckUtils]: 15: Hoare triple {277#false} assume ~ptr.base != 0bv32 || ~ptr.offset != 0bv32; {277#false} is VALID [2018-11-23 11:06:04,093 INFO L273 TraceCheckUtils]: 16: Hoare triple {277#false} assume !(1bv32 == ~globalState~0); {277#false} is VALID [2018-11-23 11:06:04,094 INFO L256 TraceCheckUtils]: 17: Hoare triple {277#false} call __blast_assert(); {277#false} is VALID [2018-11-23 11:06:04,094 INFO L273 TraceCheckUtils]: 18: Hoare triple {277#false} assume !false; {277#false} is VALID [2018-11-23 11:06:04,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:06:04,101 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:06:04,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:06:04,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:06:04,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 11:06:04,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:06:04,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:06:04,241 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 11:06:04,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:06:04,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:06:04,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:06:04,242 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 3 states. [2018-11-23 11:06:04,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:04,417 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-23 11:06:04,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:06:04,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 11:06:04,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:06:04,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:06:04,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-23 11:06:04,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:06:04,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-23 11:06:04,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2018-11-23 11:06:04,513 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 11:06:04,515 INFO L225 Difference]: With dead ends: 42 [2018-11-23 11:06:04,516 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 11:06:04,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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 11:06:04,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 11:06:04,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 11:06:04,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:06:04,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-23 11:06:04,537 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 11:06:04,538 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 11:06:04,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:04,540 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 11:06:04,540 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 11:06:04,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:04,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:04,541 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 11:06:04,541 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 11:06:04,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:04,549 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 11:06:04,549 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 11:06:04,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:04,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:04,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:06:04,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:06:04,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:06:04,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-23 11:06:04,554 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 19 [2018-11-23 11:06:04,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:06:04,555 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-23 11:06:04,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:06:04,555 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 11:06:04,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:06:04,556 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:06:04,556 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 11:06:04,557 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:06:04,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:06:04,557 INFO L82 PathProgramCache]: Analyzing trace with hash 124895752, now seen corresponding path program 1 times [2018-11-23 11:06:04,558 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:06:04,558 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:06:04,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:06:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:04,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:06:05,004 INFO L256 TraceCheckUtils]: 0: Hoare triple {487#true} call ULTIMATE.init(); {487#true} is VALID [2018-11-23 11:06:05,005 INFO L273 TraceCheckUtils]: 1: Hoare triple {487#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~globalState~0 := 0bv32; {487#true} is VALID [2018-11-23 11:06:05,005 INFO L273 TraceCheckUtils]: 2: Hoare triple {487#true} assume true; {487#true} is VALID [2018-11-23 11:06:05,005 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {487#true} {487#true} #43#return; {487#true} is VALID [2018-11-23 11:06:05,006 INFO L256 TraceCheckUtils]: 4: Hoare triple {487#true} call #t~ret32 := main(#in~argc, #in~argv.base, #in~argv.offset); {487#true} is VALID [2018-11-23 11:06:05,006 INFO L273 TraceCheckUtils]: 5: Hoare triple {487#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; {487#true} is VALID [2018-11-23 11:06:05,007 INFO L256 TraceCheckUtils]: 6: Hoare triple {487#true} call #t~ret30.base, #t~ret30.offset := l_malloc(4bv32); {487#true} is VALID [2018-11-23 11:06:05,008 INFO L273 TraceCheckUtils]: 7: Hoare triple {487#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; {513#(not (= l_malloc_~retVal~0.base (_ bv0 32)))} is VALID [2018-11-23 11:06:05,009 INFO L273 TraceCheckUtils]: 8: Hoare triple {513#(not (= l_malloc_~retVal~0.base (_ bv0 32)))} assume ~retVal~0.base != 0bv32 || ~retVal~0.offset != 0bv32;~globalState~0 := 1bv32; {513#(not (= l_malloc_~retVal~0.base (_ bv0 32)))} is VALID [2018-11-23 11:06:05,010 INFO L273 TraceCheckUtils]: 9: Hoare triple {513#(not (= l_malloc_~retVal~0.base (_ bv0 32)))} #res.base, #res.offset := ~retVal~0.base, ~retVal~0.offset; {520#(not (= |l_malloc_#res.base| (_ bv0 32)))} is VALID [2018-11-23 11:06:05,011 INFO L273 TraceCheckUtils]: 10: Hoare triple {520#(not (= |l_malloc_#res.base| (_ bv0 32)))} assume true; {520#(not (= |l_malloc_#res.base| (_ bv0 32)))} is VALID [2018-11-23 11:06:05,021 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {520#(not (= |l_malloc_#res.base| (_ bv0 32)))} {487#true} #47#return; {527#(not (= |main_#t~ret30.base| (_ bv0 32)))} is VALID [2018-11-23 11:06:05,025 INFO L273 TraceCheckUtils]: 12: Hoare triple {527#(not (= |main_#t~ret30.base| (_ bv0 32)))} ~a~0.base, ~a~0.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {531#(not (= (_ bv0 32) main_~a~0.base))} is VALID [2018-11-23 11:06:05,026 INFO L256 TraceCheckUtils]: 13: Hoare triple {531#(not (= (_ bv0 32) main_~a~0.base))} call l_free(~a~0.base, ~a~0.offset); {487#true} is VALID [2018-11-23 11:06:05,026 INFO L273 TraceCheckUtils]: 14: Hoare triple {487#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; {538#(= |l_free_#in~ptr.base| l_free_~ptr.base)} is VALID [2018-11-23 11:06:05,027 INFO L273 TraceCheckUtils]: 15: Hoare triple {538#(= |l_free_#in~ptr.base| l_free_~ptr.base)} assume !(~ptr.base != 0bv32 || ~ptr.offset != 0bv32); {542#(= |l_free_#in~ptr.base| (_ bv0 32))} is VALID [2018-11-23 11:06:05,027 INFO L273 TraceCheckUtils]: 16: Hoare triple {542#(= |l_free_#in~ptr.base| (_ bv0 32))} ~globalState~0 := 0bv32;call ULTIMATE.dealloc(~ptr.base, ~ptr.offset); {542#(= |l_free_#in~ptr.base| (_ bv0 32))} is VALID [2018-11-23 11:06:05,028 INFO L273 TraceCheckUtils]: 17: Hoare triple {542#(= |l_free_#in~ptr.base| (_ bv0 32))} assume true; {542#(= |l_free_#in~ptr.base| (_ bv0 32))} is VALID [2018-11-23 11:06:05,029 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {542#(= |l_free_#in~ptr.base| (_ bv0 32))} {531#(not (= (_ bv0 32) main_~a~0.base))} #49#return; {488#false} is VALID [2018-11-23 11:06:05,030 INFO L256 TraceCheckUtils]: 19: Hoare triple {488#false} call l_free(~a~0.base, ~a~0.offset); {488#false} is VALID [2018-11-23 11:06:05,030 INFO L273 TraceCheckUtils]: 20: Hoare triple {488#false} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; {488#false} is VALID [2018-11-23 11:06:05,030 INFO L273 TraceCheckUtils]: 21: Hoare triple {488#false} assume ~ptr.base != 0bv32 || ~ptr.offset != 0bv32; {488#false} is VALID [2018-11-23 11:06:05,031 INFO L273 TraceCheckUtils]: 22: Hoare triple {488#false} assume !(1bv32 == ~globalState~0); {488#false} is VALID [2018-11-23 11:06:05,031 INFO L256 TraceCheckUtils]: 23: Hoare triple {488#false} call __blast_assert(); {488#false} is VALID [2018-11-23 11:06:05,032 INFO L273 TraceCheckUtils]: 24: Hoare triple {488#false} assume !false; {488#false} is VALID [2018-11-23 11:06:05,034 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 11:06:05,034 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:06:05,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:06:05,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:06:05,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-23 11:06:05,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:06:05,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:06:05,201 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 11:06:05,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:06:05,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:06:05,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:06:05,202 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 8 states. [2018-11-23 11:06:05,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:05,707 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-23 11:06:05,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:06:05,708 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-23 11:06:05,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:06:05,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:06:05,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2018-11-23 11:06:05,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:06:05,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2018-11-23 11:06:05,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 38 transitions. [2018-11-23 11:06:05,792 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 11:06:05,794 INFO L225 Difference]: With dead ends: 40 [2018-11-23 11:06:05,795 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 11:06:05,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:06:05,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 11:06:05,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 11:06:05,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:06:05,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-23 11:06:05,826 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 11:06:05,826 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 11:06:05,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:05,828 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-23 11:06:05,828 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 11:06:05,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:05,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:05,829 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 11:06:05,829 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 11:06:05,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:05,832 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-23 11:06:05,832 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 11:06:05,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:05,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:05,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:06:05,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:06:05,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:06:05,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-23 11:06:05,835 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-11-23 11:06:05,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:06:05,836 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-23 11:06:05,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:06:05,836 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 11:06:05,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:06:05,837 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:06:05,837 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 11:06:05,838 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:06:05,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:06:05,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1592798083, now seen corresponding path program 1 times [2018-11-23 11:06:05,839 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:06:05,839 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:06:05,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:06:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:06:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:06:05,984 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=(_ bv5 32), |#NULL.offset|=(_ bv6 32), |old(#NULL.base)|=(_ bv5 32), |old(#NULL.offset)|=(_ bv6 32), |old(~globalState~0)|=(_ bv7 32), ~globalState~0=(_ bv7 32)] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~globalState~0 := 0bv32; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv5 32), |old(#NULL.offset)|=(_ bv6 32), |old(~globalState~0)|=(_ bv7 32), ~globalState~0=(_ bv0 32)] [?] assume true; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv5 32), |old(#NULL.offset)|=(_ bv6 32), |old(~globalState~0)|=(_ bv7 32), ~globalState~0=(_ bv0 32)] [?] RET #43#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), ~globalState~0=(_ bv0 32)] [?] CALL call #t~ret32 := main(#in~argc, #in~argv.base, #in~argv.offset); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#in~argc|=(_ bv10 32), |main_#in~argv.base|=(_ bv8 32), |main_#in~argv.offset|=(_ bv9 32), |old(~globalState~0)|=(_ bv0 32), ~globalState~0=(_ bv0 32)] [?] ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; VAL [main_~argc=(_ bv10 32), main_~argv.base=(_ bv8 32), main_~argv.offset=(_ bv9 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#in~argc|=(_ bv10 32), |main_#in~argv.base|=(_ bv8 32), |main_#in~argv.offset|=(_ bv9 32), |old(~globalState~0)|=(_ bv0 32), ~globalState~0=(_ bv0 32)] [?] CALL call #t~ret30.base, #t~ret30.offset := l_malloc(4bv32); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |l_malloc_#in~size|=(_ bv4 32), |old(~globalState~0)|=(_ bv0 32), ~globalState~0=(_ bv0 32)] [?] ~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=(_ bv11 32), l_malloc_~retVal~0.offset=(_ bv0 32), l_malloc_~size=(_ bv4 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |l_malloc_#in~size|=(_ bv4 32), |l_malloc_#t~malloc31.base|=(_ bv11 32), |l_malloc_#t~malloc31.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv0 32), ~globalState~0=(_ bv0 32)] [?] assume ~retVal~0.base != 0bv32 || ~retVal~0.offset != 0bv32;~globalState~0 := 1bv32; VAL [l_malloc_~retVal~0.base=(_ bv11 32), l_malloc_~retVal~0.offset=(_ bv0 32), l_malloc_~size=(_ bv4 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |l_malloc_#in~size|=(_ bv4 32), |l_malloc_#t~malloc31.base|=(_ bv11 32), |l_malloc_#t~malloc31.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv0 32), ~globalState~0=(_ bv1 32)] [?] #res.base, #res.offset := ~retVal~0.base, ~retVal~0.offset; VAL [l_malloc_~retVal~0.base=(_ bv11 32), l_malloc_~retVal~0.offset=(_ bv0 32), l_malloc_~size=(_ bv4 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |l_malloc_#in~size|=(_ bv4 32), |l_malloc_#res.base|=(_ bv11 32), |l_malloc_#res.offset|=(_ bv0 32), |l_malloc_#t~malloc31.base|=(_ bv11 32), |l_malloc_#t~malloc31.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv0 32), ~globalState~0=(_ bv1 32)] [?] assume true; VAL [l_malloc_~retVal~0.base=(_ bv11 32), l_malloc_~retVal~0.offset=(_ bv0 32), l_malloc_~size=(_ bv4 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |l_malloc_#in~size|=(_ bv4 32), |l_malloc_#res.base|=(_ bv11 32), |l_malloc_#res.offset|=(_ bv0 32), |l_malloc_#t~malloc31.base|=(_ bv11 32), |l_malloc_#t~malloc31.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv0 32), ~globalState~0=(_ bv1 32)] [?] RET #47#return; VAL [main_~argc=(_ bv10 32), main_~argv.base=(_ bv8 32), main_~argv.offset=(_ bv9 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#in~argc|=(_ bv10 32), |main_#in~argv.base|=(_ bv8 32), |main_#in~argv.offset|=(_ bv9 32), |main_#t~ret30.base|=(_ bv11 32), |main_#t~ret30.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv0 32), ~globalState~0=(_ bv1 32)] [?] ~a~0.base, ~a~0.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; VAL [main_~argc=(_ bv10 32), main_~argv.base=(_ bv8 32), main_~argv.offset=(_ bv9 32), main_~a~0.base=(_ bv11 32), main_~a~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#in~argc|=(_ bv10 32), |main_#in~argv.base|=(_ bv8 32), |main_#in~argv.offset|=(_ bv9 32), |old(~globalState~0)|=(_ bv0 32), ~globalState~0=(_ bv1 32)] [?] CALL call l_free(~a~0.base, ~a~0.offset); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |l_free_#in~ptr.base|=(_ bv11 32), |l_free_#in~ptr.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv1 32), ~globalState~0=(_ bv1 32)] [?] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; VAL [l_free_~ptr.base=(_ bv11 32), l_free_~ptr.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |l_free_#in~ptr.base|=(_ bv11 32), |l_free_#in~ptr.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv1 32), ~globalState~0=(_ bv1 32)] [?] assume ~ptr.base != 0bv32 || ~ptr.offset != 0bv32; VAL [l_free_~ptr.base=(_ bv11 32), l_free_~ptr.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |l_free_#in~ptr.base|=(_ bv11 32), |l_free_#in~ptr.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv1 32), ~globalState~0=(_ bv1 32)] [?] assume 1bv32 == ~globalState~0; VAL [l_free_~ptr.base=(_ bv11 32), l_free_~ptr.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |l_free_#in~ptr.base|=(_ bv11 32), |l_free_#in~ptr.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv1 32), ~globalState~0=(_ bv1 32)] [?] ~globalState~0 := 0bv32;call ULTIMATE.dealloc(~ptr.base, ~ptr.offset); VAL [l_free_~ptr.base=(_ bv11 32), l_free_~ptr.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |l_free_#in~ptr.base|=(_ bv11 32), |l_free_#in~ptr.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv1 32), ~globalState~0=(_ bv0 32)] [?] assume true; VAL [l_free_~ptr.base=(_ bv11 32), l_free_~ptr.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |l_free_#in~ptr.base|=(_ bv11 32), |l_free_#in~ptr.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv1 32), ~globalState~0=(_ bv0 32)] [?] RET #49#return; VAL [main_~argc=(_ bv10 32), main_~argv.base=(_ bv8 32), main_~argv.offset=(_ bv9 32), main_~a~0.base=(_ bv11 32), main_~a~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#in~argc|=(_ bv10 32), |main_#in~argv.base|=(_ bv8 32), |main_#in~argv.offset|=(_ bv9 32), |old(~globalState~0)|=(_ bv0 32), ~globalState~0=(_ bv0 32)] [?] CALL call l_free(~a~0.base, ~a~0.offset); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |l_free_#in~ptr.base|=(_ bv11 32), |l_free_#in~ptr.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv0 32), ~globalState~0=(_ bv0 32)] [?] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; VAL [l_free_~ptr.base=(_ bv11 32), l_free_~ptr.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |l_free_#in~ptr.base|=(_ bv11 32), |l_free_#in~ptr.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv0 32), ~globalState~0=(_ bv0 32)] [?] assume ~ptr.base != 0bv32 || ~ptr.offset != 0bv32; VAL [l_free_~ptr.base=(_ bv11 32), l_free_~ptr.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |l_free_#in~ptr.base|=(_ bv11 32), |l_free_#in~ptr.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv0 32), ~globalState~0=(_ bv0 32)] [?] assume !(1bv32 == ~globalState~0); VAL [l_free_~ptr.base=(_ bv11 32), l_free_~ptr.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |l_free_#in~ptr.base|=(_ bv11 32), |l_free_#in~ptr.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv0 32), ~globalState~0=(_ bv0 32)] [?] CALL call __blast_assert(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv0 32), ~globalState~0=(_ bv0 32)] [?] assume !false; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv0 32), ~globalState~0=(_ bv0 32)] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=5bv32, #NULL.offset=6bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=6bv32, old(~globalState~0)=7bv32, ~globalState~0=7bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; [L1606] ~globalState~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=6bv32, old(~globalState~0)=7bv32, ~globalState~0=0bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=6bv32, old(~globalState~0)=7bv32, ~globalState~0=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~globalState~0=0bv32] [?] CALL call #t~ret32 := main(#in~argc, #in~argv.base, #in~argv.offset); VAL [#in~argc=10bv32, #in~argv.base=8bv32, #in~argv.offset=9bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1610-L1616] ~argc := #in~argc; [L1610-L1616] ~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; VAL [#in~argc=10bv32, #in~argv.base=8bv32, #in~argv.offset=9bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv.base=8bv32, ~argv.offset=9bv32, ~globalState~0=0bv32] [L1612] CALL call #t~ret30.base, #t~ret30.offset := l_malloc(4bv32); VAL [#in~size=4bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [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=4bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc31.base=11bv32, #t~malloc31.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~retVal~0.base=11bv32, ~retVal~0.offset=0bv32, ~size=4bv32] [L1620-L1621] assume ~retVal~0.base != 0bv32 || ~retVal~0.offset != 0bv32; [L1621] ~globalState~0 := 1bv32; VAL [#in~size=4bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc31.base=11bv32, #t~malloc31.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=1bv32, ~retVal~0.base=11bv32, ~retVal~0.offset=0bv32, ~size=4bv32] [L1622] #res.base, #res.offset := ~retVal~0.base, ~retVal~0.offset; VAL [#in~size=4bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #res.base=11bv32, #res.offset=0bv32, #t~malloc31.base=11bv32, #t~malloc31.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=1bv32, ~retVal~0.base=11bv32, ~retVal~0.offset=0bv32, ~size=4bv32] [L1607] ensures true; VAL [#in~size=4bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #res.base=11bv32, #res.offset=0bv32, #t~malloc31.base=11bv32, #t~malloc31.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=1bv32, ~retVal~0.base=11bv32, ~retVal~0.offset=0bv32, ~size=4bv32] [L1612] RET call #t~ret30.base, #t~ret30.offset := l_malloc(4bv32); VAL [#in~argc=10bv32, #in~argv.base=8bv32, #in~argv.offset=9bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~ret30.base=11bv32, #t~ret30.offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv.base=8bv32, ~argv.offset=9bv32, ~globalState~0=1bv32] [L1612] ~a~0.base, ~a~0.offset := #t~ret30.base, #t~ret30.offset; [L1612] havoc #t~ret30.base, #t~ret30.offset; VAL [#in~argc=10bv32, #in~argv.base=8bv32, #in~argv.offset=9bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv.base=8bv32, ~argv.offset=9bv32, ~a~0.base=11bv32, ~a~0.offset=0bv32, ~globalState~0=1bv32] [L1613] CALL call l_free(~a~0.base, ~a~0.offset); VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32] [L1625-L1632] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr.base=11bv32, ~ptr.offset=0bv32] [L1629] assume ~ptr.base != 0bv32 || ~ptr.offset != 0bv32; VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr.base=11bv32, ~ptr.offset=0bv32] [L1629] assume 1bv32 == ~globalState~0; VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr.base=11bv32, ~ptr.offset=0bv32] [L1630] ~globalState~0 := 0bv32; [L1631] call ULTIMATE.dealloc(~ptr.base, ~ptr.offset); VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=0bv32, ~ptr.base=11bv32, ~ptr.offset=0bv32] [L1608] ensures true; VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=0bv32, ~ptr.base=11bv32, ~ptr.offset=0bv32] [L1613] RET call l_free(~a~0.base, ~a~0.offset); VAL [#in~argc=10bv32, #in~argv.base=8bv32, #in~argv.offset=9bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv.base=8bv32, ~argv.offset=9bv32, ~a~0.base=11bv32, ~a~0.offset=0bv32, ~globalState~0=0bv32] [L1614] CALL call l_free(~a~0.base, ~a~0.offset); VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1625-L1632] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr.base=11bv32, ~ptr.offset=0bv32] [L1629] assume ~ptr.base != 0bv32 || ~ptr.offset != 0bv32; VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr.base=11bv32, ~ptr.offset=0bv32] [L1629] assume !(1bv32 == ~globalState~0); VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr.base=11bv32, ~ptr.offset=0bv32] [L1629] CALL call __blast_assert(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1601] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=5bv32, #NULL.offset=6bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=6bv32, old(~globalState~0)=7bv32, ~globalState~0=7bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; [L1606] ~globalState~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=6bv32, old(~globalState~0)=7bv32, ~globalState~0=0bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=6bv32, old(~globalState~0)=7bv32, ~globalState~0=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~globalState~0=0bv32] [?] CALL call #t~ret32 := main(#in~argc, #in~argv.base, #in~argv.offset); VAL [#in~argc=10bv32, #in~argv.base=8bv32, #in~argv.offset=9bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1610-L1616] ~argc := #in~argc; [L1610-L1616] ~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; VAL [#in~argc=10bv32, #in~argv.base=8bv32, #in~argv.offset=9bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv.base=8bv32, ~argv.offset=9bv32, ~globalState~0=0bv32] [L1612] CALL call #t~ret30.base, #t~ret30.offset := l_malloc(4bv32); VAL [#in~size=4bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [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=4bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc31.base=11bv32, #t~malloc31.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~retVal~0.base=11bv32, ~retVal~0.offset=0bv32, ~size=4bv32] [L1620-L1621] assume ~retVal~0.base != 0bv32 || ~retVal~0.offset != 0bv32; [L1621] ~globalState~0 := 1bv32; VAL [#in~size=4bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc31.base=11bv32, #t~malloc31.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=1bv32, ~retVal~0.base=11bv32, ~retVal~0.offset=0bv32, ~size=4bv32] [L1622] #res.base, #res.offset := ~retVal~0.base, ~retVal~0.offset; VAL [#in~size=4bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #res.base=11bv32, #res.offset=0bv32, #t~malloc31.base=11bv32, #t~malloc31.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=1bv32, ~retVal~0.base=11bv32, ~retVal~0.offset=0bv32, ~size=4bv32] [L1607] ensures true; VAL [#in~size=4bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #res.base=11bv32, #res.offset=0bv32, #t~malloc31.base=11bv32, #t~malloc31.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=1bv32, ~retVal~0.base=11bv32, ~retVal~0.offset=0bv32, ~size=4bv32] [L1612] RET call #t~ret30.base, #t~ret30.offset := l_malloc(4bv32); VAL [#in~argc=10bv32, #in~argv.base=8bv32, #in~argv.offset=9bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~ret30.base=11bv32, #t~ret30.offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv.base=8bv32, ~argv.offset=9bv32, ~globalState~0=1bv32] [L1612] ~a~0.base, ~a~0.offset := #t~ret30.base, #t~ret30.offset; [L1612] havoc #t~ret30.base, #t~ret30.offset; VAL [#in~argc=10bv32, #in~argv.base=8bv32, #in~argv.offset=9bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv.base=8bv32, ~argv.offset=9bv32, ~a~0.base=11bv32, ~a~0.offset=0bv32, ~globalState~0=1bv32] [L1613] CALL call l_free(~a~0.base, ~a~0.offset); VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32] [L1625-L1632] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr.base=11bv32, ~ptr.offset=0bv32] [L1629] assume ~ptr.base != 0bv32 || ~ptr.offset != 0bv32; VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr.base=11bv32, ~ptr.offset=0bv32] [L1629] assume 1bv32 == ~globalState~0; VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr.base=11bv32, ~ptr.offset=0bv32] [L1630] ~globalState~0 := 0bv32; [L1631] call ULTIMATE.dealloc(~ptr.base, ~ptr.offset); VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=0bv32, ~ptr.base=11bv32, ~ptr.offset=0bv32] [L1608] ensures true; VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=0bv32, ~ptr.base=11bv32, ~ptr.offset=0bv32] [L1613] RET call l_free(~a~0.base, ~a~0.offset); VAL [#in~argc=10bv32, #in~argv.base=8bv32, #in~argv.offset=9bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv.base=8bv32, ~argv.offset=9bv32, ~a~0.base=11bv32, ~a~0.offset=0bv32, ~globalState~0=0bv32] [L1614] CALL call l_free(~a~0.base, ~a~0.offset); VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1625-L1632] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr.base=11bv32, ~ptr.offset=0bv32] [L1629] assume ~ptr.base != 0bv32 || ~ptr.offset != 0bv32; VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr.base=11bv32, ~ptr.offset=0bv32] [L1629] assume !(1bv32 == ~globalState~0); VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr.base=11bv32, ~ptr.offset=0bv32] [L1629] CALL call __blast_assert(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1601] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5bv32, #NULL!offset=6bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=6bv32, old(~globalState~0)=7bv32, ~globalState~0=7bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; [L1606] ~globalState~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=6bv32, old(~globalState~0)=7bv32, ~globalState~0=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~globalState~0=0bv32] [?] CALL call #t~ret32 := main(#in~argc, #in~argv); VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1610-L1616] ~argc := #in~argc; [L1610-L1616] ~argv := #in~argv; VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv!base=8bv32, ~argv!offset=9bv32, ~globalState~0=0bv32] [L1612] CALL call #t~ret30 := l_malloc(4bv32); VAL [#in~size=4bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1618-L1623] ~size := #in~size; [L1619] FCALL call #t~malloc31 := #Ultimate.alloc(~size); [L1619] ~retVal~0 := #t~malloc31; VAL [#in~size=4bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc31!base=11bv32, #t~malloc31!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~retVal~0!base=11bv32, ~retVal~0!offset=0bv32, ~size=4bv32] [L1620] COND TRUE ~retVal~0 != { base: 0bv32, offset: 0bv32 } [L1621] ~globalState~0 := 1bv32; VAL [#in~size=4bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc31!base=11bv32, #t~malloc31!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=1bv32, ~retVal~0!base=11bv32, ~retVal~0!offset=0bv32, ~size=4bv32] [L1622] #res := ~retVal~0; VAL [#in~size=4bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #res!base=11bv32, #res!offset=0bv32, #t~malloc31!base=11bv32, #t~malloc31!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=1bv32, ~retVal~0!base=11bv32, ~retVal~0!offset=0bv32, ~size=4bv32] [L1612] RET call #t~ret30 := l_malloc(4bv32); VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret30!base=11bv32, #t~ret30!offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv!base=8bv32, ~argv!offset=9bv32, ~globalState~0=1bv32] [L1612] ~a~0 := #t~ret30; [L1612] havoc #t~ret30; VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv!base=8bv32, ~argv!offset=9bv32, ~a~0!base=11bv32, ~a~0!offset=0bv32, ~globalState~0=1bv32] [L1613] CALL call l_free(~a~0); VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32] [L1625-L1632] ~ptr := #in~ptr; VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] COND TRUE ~ptr != { base: 0bv32, offset: 0bv32 } VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] COND TRUE 1bv32 == ~globalState~0 VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1630] ~globalState~0 := 0bv32; [L1631] FCALL call ULTIMATE.dealloc(~ptr); VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=0bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1613] RET call l_free(~a~0); VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv!base=8bv32, ~argv!offset=9bv32, ~a~0!base=11bv32, ~a~0!offset=0bv32, ~globalState~0=0bv32] [L1614] CALL call l_free(~a~0); VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1625-L1632] ~ptr := #in~ptr; VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] COND TRUE ~ptr != { base: 0bv32, offset: 0bv32 } VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] COND FALSE !(1bv32 == ~globalState~0) VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] CALL call __blast_assert(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1601] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5bv32, #NULL!offset=6bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=6bv32, old(~globalState~0)=7bv32, ~globalState~0=7bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; [L1606] ~globalState~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=6bv32, old(~globalState~0)=7bv32, ~globalState~0=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~globalState~0=0bv32] [?] CALL call #t~ret32 := main(#in~argc, #in~argv); VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1610-L1616] ~argc := #in~argc; [L1610-L1616] ~argv := #in~argv; VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv!base=8bv32, ~argv!offset=9bv32, ~globalState~0=0bv32] [L1612] CALL call #t~ret30 := l_malloc(4bv32); VAL [#in~size=4bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1618-L1623] ~size := #in~size; [L1619] FCALL call #t~malloc31 := #Ultimate.alloc(~size); [L1619] ~retVal~0 := #t~malloc31; VAL [#in~size=4bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc31!base=11bv32, #t~malloc31!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~retVal~0!base=11bv32, ~retVal~0!offset=0bv32, ~size=4bv32] [L1620] COND TRUE ~retVal~0 != { base: 0bv32, offset: 0bv32 } [L1621] ~globalState~0 := 1bv32; VAL [#in~size=4bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc31!base=11bv32, #t~malloc31!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=1bv32, ~retVal~0!base=11bv32, ~retVal~0!offset=0bv32, ~size=4bv32] [L1622] #res := ~retVal~0; VAL [#in~size=4bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #res!base=11bv32, #res!offset=0bv32, #t~malloc31!base=11bv32, #t~malloc31!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=1bv32, ~retVal~0!base=11bv32, ~retVal~0!offset=0bv32, ~size=4bv32] [L1612] RET call #t~ret30 := l_malloc(4bv32); VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret30!base=11bv32, #t~ret30!offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv!base=8bv32, ~argv!offset=9bv32, ~globalState~0=1bv32] [L1612] ~a~0 := #t~ret30; [L1612] havoc #t~ret30; VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv!base=8bv32, ~argv!offset=9bv32, ~a~0!base=11bv32, ~a~0!offset=0bv32, ~globalState~0=1bv32] [L1613] CALL call l_free(~a~0); VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32] [L1625-L1632] ~ptr := #in~ptr; VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] COND TRUE ~ptr != { base: 0bv32, offset: 0bv32 } VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] COND TRUE 1bv32 == ~globalState~0 VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1630] ~globalState~0 := 0bv32; [L1631] FCALL call ULTIMATE.dealloc(~ptr); VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=0bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1613] RET call l_free(~a~0); VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv!base=8bv32, ~argv!offset=9bv32, ~a~0!base=11bv32, ~a~0!offset=0bv32, ~globalState~0=0bv32] [L1614] CALL call l_free(~a~0); VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1625-L1632] ~ptr := #in~ptr; VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] COND TRUE ~ptr != { base: 0bv32, offset: 0bv32 } VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] COND FALSE !(1bv32 == ~globalState~0) VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] CALL call __blast_assert(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1601] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5bv32, #NULL!offset=6bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=6bv32, old(~globalState~0)=7bv32, ~globalState~0=7bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; [L1606] ~globalState~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=6bv32, old(~globalState~0)=7bv32, ~globalState~0=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~globalState~0=0bv32] [?] CALL call #t~ret32 := main(#in~argc, #in~argv); VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1610-L1616] ~argc := #in~argc; [L1610-L1616] ~argv := #in~argv; VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv!base=8bv32, ~argv!offset=9bv32, ~globalState~0=0bv32] [L1612] CALL call #t~ret30 := l_malloc(4bv32); VAL [#in~size=4bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1618-L1623] ~size := #in~size; [L1619] FCALL call #t~malloc31 := #Ultimate.alloc(~size); [L1619] ~retVal~0 := #t~malloc31; VAL [#in~size=4bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc31!base=11bv32, #t~malloc31!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~retVal~0!base=11bv32, ~retVal~0!offset=0bv32, ~size=4bv32] [L1620] COND TRUE ~retVal~0 != { base: 0bv32, offset: 0bv32 } [L1621] ~globalState~0 := 1bv32; VAL [#in~size=4bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc31!base=11bv32, #t~malloc31!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=1bv32, ~retVal~0!base=11bv32, ~retVal~0!offset=0bv32, ~size=4bv32] [L1622] #res := ~retVal~0; VAL [#in~size=4bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #res!base=11bv32, #res!offset=0bv32, #t~malloc31!base=11bv32, #t~malloc31!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=1bv32, ~retVal~0!base=11bv32, ~retVal~0!offset=0bv32, ~size=4bv32] [L1612] RET call #t~ret30 := l_malloc(4bv32); VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret30!base=11bv32, #t~ret30!offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv!base=8bv32, ~argv!offset=9bv32, ~globalState~0=1bv32] [L1612] ~a~0 := #t~ret30; [L1612] havoc #t~ret30; VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv!base=8bv32, ~argv!offset=9bv32, ~a~0!base=11bv32, ~a~0!offset=0bv32, ~globalState~0=1bv32] [L1613] CALL call l_free(~a~0); VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32] [L1625-L1632] ~ptr := #in~ptr; VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] COND TRUE ~ptr != { base: 0bv32, offset: 0bv32 } VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] COND TRUE 1bv32 == ~globalState~0 VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1630] ~globalState~0 := 0bv32; [L1631] FCALL call ULTIMATE.dealloc(~ptr); VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=0bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1613] RET call l_free(~a~0); VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv!base=8bv32, ~argv!offset=9bv32, ~a~0!base=11bv32, ~a~0!offset=0bv32, ~globalState~0=0bv32] [L1614] CALL call l_free(~a~0); VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1625-L1632] ~ptr := #in~ptr; VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] COND TRUE ~ptr != { base: 0bv32, offset: 0bv32 } VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] COND FALSE !(1bv32 == ~globalState~0) VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] CALL call __blast_assert(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1601] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5bv32, #NULL!offset=6bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=6bv32, old(~globalState~0)=7bv32, ~globalState~0=7bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; [L1606] ~globalState~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=6bv32, old(~globalState~0)=7bv32, ~globalState~0=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~globalState~0=0bv32] [?] CALL call #t~ret32 := main(#in~argc, #in~argv); VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1610-L1616] ~argc := #in~argc; [L1610-L1616] ~argv := #in~argv; VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv!base=8bv32, ~argv!offset=9bv32, ~globalState~0=0bv32] [L1612] CALL call #t~ret30 := l_malloc(4bv32); VAL [#in~size=4bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1618-L1623] ~size := #in~size; [L1619] FCALL call #t~malloc31 := #Ultimate.alloc(~size); [L1619] ~retVal~0 := #t~malloc31; VAL [#in~size=4bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc31!base=11bv32, #t~malloc31!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~retVal~0!base=11bv32, ~retVal~0!offset=0bv32, ~size=4bv32] [L1620] COND TRUE ~retVal~0 != { base: 0bv32, offset: 0bv32 } [L1621] ~globalState~0 := 1bv32; VAL [#in~size=4bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc31!base=11bv32, #t~malloc31!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=1bv32, ~retVal~0!base=11bv32, ~retVal~0!offset=0bv32, ~size=4bv32] [L1622] #res := ~retVal~0; VAL [#in~size=4bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #res!base=11bv32, #res!offset=0bv32, #t~malloc31!base=11bv32, #t~malloc31!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=1bv32, ~retVal~0!base=11bv32, ~retVal~0!offset=0bv32, ~size=4bv32] [L1612] RET call #t~ret30 := l_malloc(4bv32); VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret30!base=11bv32, #t~ret30!offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv!base=8bv32, ~argv!offset=9bv32, ~globalState~0=1bv32] [L1612] ~a~0 := #t~ret30; [L1612] havoc #t~ret30; VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv!base=8bv32, ~argv!offset=9bv32, ~a~0!base=11bv32, ~a~0!offset=0bv32, ~globalState~0=1bv32] [L1613] CALL call l_free(~a~0); VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32] [L1625-L1632] ~ptr := #in~ptr; VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] COND TRUE ~ptr != { base: 0bv32, offset: 0bv32 } VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] COND TRUE 1bv32 == ~globalState~0 VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1630] ~globalState~0 := 0bv32; [L1631] FCALL call ULTIMATE.dealloc(~ptr); VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=0bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1613] RET call l_free(~a~0); VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv!base=8bv32, ~argv!offset=9bv32, ~a~0!base=11bv32, ~a~0!offset=0bv32, ~globalState~0=0bv32] [L1614] CALL call l_free(~a~0); VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1625-L1632] ~ptr := #in~ptr; VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] COND TRUE ~ptr != { base: 0bv32, offset: 0bv32 } VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] COND FALSE !(1bv32 == ~globalState~0) VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] CALL call __blast_assert(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1601] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1606] int globalState = 0; VAL [\old(globalState)=7, 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)={11:0}, retVal={11:0}, size=4] [L1620] COND TRUE retVal != ((void *)0) [L1621] globalState=1 VAL [\old(globalState)=0, \old(size)=4, globalState=1, malloc(size)={11:0}, retVal={11:0}, size=4] [L1622] return retVal; VAL [\old(globalState)=0, \old(size)=4, \result={11:0}, globalState=1, malloc(size)={11:0}, retVal={11:0}, size=4] [L1612] RET, EXPR l_malloc(sizeof(int)) VAL [\old(argc)=10, \old(globalState)=0, argc=10, argv={8:9}, argv={8:9}, globalState=1, l_malloc(sizeof(int))={11:0}] [L1612] int *a = (int*) l_malloc(sizeof(int)); [L1613] CALL l_free(a) VAL [\old(globalState)=1, globalState=1, ptr={11:0}] [L1629] COND TRUE ptr!=((void *)0) VAL [\old(globalState)=1, globalState=1, ptr={11:0}, ptr={11:0}] [L1629] (globalState == 1) ? (0) : __blast_assert () VAL [\old(globalState)=1, globalState=1, ptr={11:0}, ptr={11:0}] [L1630] globalState = 0 [L1613] RET l_free(a) VAL [\old(argc)=10, \old(globalState)=0, a={11:0}, argc=10, argv={8:9}, argv={8:9}, globalState=0] [L1614] CALL l_free(a) VAL [\old(globalState)=0, globalState=0, ptr={11:0}] [L1629] COND TRUE ptr!=((void *)0) VAL [\old(globalState)=0, globalState=0, ptr={11:0}, ptr={11:0}] [L1629] (globalState == 1) ? (0) : __blast_assert () VAL [\old(globalState)=0, globalState=0, ptr={11:0}, ptr={11:0}] [L1629] CALL __blast_assert () VAL [\old(globalState)=0, globalState=0] [L1601] __VERIFIER_error() VAL [\old(globalState)=0, globalState=0] ----- [2018-11-23 11:06:06,105 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 11:06:06,105 WARN L170 areAnnotationChecker]: l_mallocENTRY has no Hoare annotation [2018-11-23 11:06:06,105 WARN L170 areAnnotationChecker]: __blast_assertENTRY has no Hoare annotation [2018-11-23 11:06:06,105 WARN L170 areAnnotationChecker]: __blast_assertENTRY has no Hoare annotation [2018-11-23 11:06:06,106 WARN L170 areAnnotationChecker]: l_freeENTRY has no Hoare annotation [2018-11-23 11:06:06,106 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 11:06:06,106 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 11:06:06,106 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 11:06:06,106 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:06:06,107 WARN L170 areAnnotationChecker]: L1620 has no Hoare annotation [2018-11-23 11:06:06,107 WARN L170 areAnnotationChecker]: L1620 has no Hoare annotation [2018-11-23 11:06:06,107 WARN L170 areAnnotationChecker]: __blast_assertFINAL has no Hoare annotation [2018-11-23 11:06:06,107 WARN L170 areAnnotationChecker]: L1629 has no Hoare annotation [2018-11-23 11:06:06,107 WARN L170 areAnnotationChecker]: L1629 has no Hoare annotation [2018-11-23 11:06:06,108 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 11:06:06,108 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 11:06:06,108 WARN L170 areAnnotationChecker]: L1612 has no Hoare annotation [2018-11-23 11:06:06,108 WARN L170 areAnnotationChecker]: L1612 has no Hoare annotation [2018-11-23 11:06:06,108 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:06:06,108 WARN L170 areAnnotationChecker]: L1620-2 has no Hoare annotation [2018-11-23 11:06:06,109 WARN L170 areAnnotationChecker]: __blast_assertEXIT has no Hoare annotation [2018-11-23 11:06:06,109 WARN L170 areAnnotationChecker]: L1629-1 has no Hoare annotation [2018-11-23 11:06:06,109 WARN L170 areAnnotationChecker]: L1629-1 has no Hoare annotation [2018-11-23 11:06:06,109 WARN L170 areAnnotationChecker]: L1629-5 has no Hoare annotation [2018-11-23 11:06:06,109 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:06:06,110 WARN L170 areAnnotationChecker]: L1612-1 has no Hoare annotation [2018-11-23 11:06:06,110 WARN L170 areAnnotationChecker]: l_mallocFINAL has no Hoare annotation [2018-11-23 11:06:06,110 WARN L170 areAnnotationChecker]: L1629-3 has no Hoare annotation [2018-11-23 11:06:06,110 WARN L170 areAnnotationChecker]: L1629-3 has no Hoare annotation [2018-11-23 11:06:06,110 WARN L170 areAnnotationChecker]: l_freeFINAL has no Hoare annotation [2018-11-23 11:06:06,110 WARN L170 areAnnotationChecker]: L1613 has no Hoare annotation [2018-11-23 11:06:06,111 WARN L170 areAnnotationChecker]: L1613 has no Hoare annotation [2018-11-23 11:06:06,111 WARN L170 areAnnotationChecker]: l_mallocEXIT has no Hoare annotation [2018-11-23 11:06:06,111 WARN L170 areAnnotationChecker]: l_freeEXIT has no Hoare annotation [2018-11-23 11:06:06,111 WARN L170 areAnnotationChecker]: l_freeEXIT has no Hoare annotation [2018-11-23 11:06:06,111 WARN L170 areAnnotationChecker]: L1613-1 has no Hoare annotation [2018-11-23 11:06:06,111 WARN L170 areAnnotationChecker]: L1613-1 has no Hoare annotation [2018-11-23 11:06:06,112 WARN L170 areAnnotationChecker]: L1614 has no Hoare annotation [2018-11-23 11:06:06,112 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:06:06,112 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:06:06,112 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:06:06,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:06:06 BoogieIcfgContainer [2018-11-23 11:06:06,115 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:06:06,116 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:06:06,116 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:06:06,116 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:06:06,117 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:06:02" (3/4) ... [2018-11-23 11:06:06,120 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|=(_ bv5 32), |#NULL.offset|=(_ bv6 32), |old(#NULL.base)|=(_ bv5 32), |old(#NULL.offset)|=(_ bv6 32), |old(~globalState~0)|=(_ bv7 32), ~globalState~0=(_ bv7 32)] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~globalState~0 := 0bv32; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv5 32), |old(#NULL.offset)|=(_ bv6 32), |old(~globalState~0)|=(_ bv7 32), ~globalState~0=(_ bv0 32)] [?] assume true; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv5 32), |old(#NULL.offset)|=(_ bv6 32), |old(~globalState~0)|=(_ bv7 32), ~globalState~0=(_ bv0 32)] [?] RET #43#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), ~globalState~0=(_ bv0 32)] [?] CALL call #t~ret32 := main(#in~argc, #in~argv.base, #in~argv.offset); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#in~argc|=(_ bv10 32), |main_#in~argv.base|=(_ bv8 32), |main_#in~argv.offset|=(_ bv9 32), |old(~globalState~0)|=(_ bv0 32), ~globalState~0=(_ bv0 32)] [?] ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; VAL [main_~argc=(_ bv10 32), main_~argv.base=(_ bv8 32), main_~argv.offset=(_ bv9 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#in~argc|=(_ bv10 32), |main_#in~argv.base|=(_ bv8 32), |main_#in~argv.offset|=(_ bv9 32), |old(~globalState~0)|=(_ bv0 32), ~globalState~0=(_ bv0 32)] [?] CALL call #t~ret30.base, #t~ret30.offset := l_malloc(4bv32); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |l_malloc_#in~size|=(_ bv4 32), |old(~globalState~0)|=(_ bv0 32), ~globalState~0=(_ bv0 32)] [?] ~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=(_ bv11 32), l_malloc_~retVal~0.offset=(_ bv0 32), l_malloc_~size=(_ bv4 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |l_malloc_#in~size|=(_ bv4 32), |l_malloc_#t~malloc31.base|=(_ bv11 32), |l_malloc_#t~malloc31.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv0 32), ~globalState~0=(_ bv0 32)] [?] assume ~retVal~0.base != 0bv32 || ~retVal~0.offset != 0bv32;~globalState~0 := 1bv32; VAL [l_malloc_~retVal~0.base=(_ bv11 32), l_malloc_~retVal~0.offset=(_ bv0 32), l_malloc_~size=(_ bv4 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |l_malloc_#in~size|=(_ bv4 32), |l_malloc_#t~malloc31.base|=(_ bv11 32), |l_malloc_#t~malloc31.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv0 32), ~globalState~0=(_ bv1 32)] [?] #res.base, #res.offset := ~retVal~0.base, ~retVal~0.offset; VAL [l_malloc_~retVal~0.base=(_ bv11 32), l_malloc_~retVal~0.offset=(_ bv0 32), l_malloc_~size=(_ bv4 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |l_malloc_#in~size|=(_ bv4 32), |l_malloc_#res.base|=(_ bv11 32), |l_malloc_#res.offset|=(_ bv0 32), |l_malloc_#t~malloc31.base|=(_ bv11 32), |l_malloc_#t~malloc31.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv0 32), ~globalState~0=(_ bv1 32)] [?] assume true; VAL [l_malloc_~retVal~0.base=(_ bv11 32), l_malloc_~retVal~0.offset=(_ bv0 32), l_malloc_~size=(_ bv4 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |l_malloc_#in~size|=(_ bv4 32), |l_malloc_#res.base|=(_ bv11 32), |l_malloc_#res.offset|=(_ bv0 32), |l_malloc_#t~malloc31.base|=(_ bv11 32), |l_malloc_#t~malloc31.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv0 32), ~globalState~0=(_ bv1 32)] [?] RET #47#return; VAL [main_~argc=(_ bv10 32), main_~argv.base=(_ bv8 32), main_~argv.offset=(_ bv9 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#in~argc|=(_ bv10 32), |main_#in~argv.base|=(_ bv8 32), |main_#in~argv.offset|=(_ bv9 32), |main_#t~ret30.base|=(_ bv11 32), |main_#t~ret30.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv0 32), ~globalState~0=(_ bv1 32)] [?] ~a~0.base, ~a~0.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; VAL [main_~argc=(_ bv10 32), main_~argv.base=(_ bv8 32), main_~argv.offset=(_ bv9 32), main_~a~0.base=(_ bv11 32), main_~a~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#in~argc|=(_ bv10 32), |main_#in~argv.base|=(_ bv8 32), |main_#in~argv.offset|=(_ bv9 32), |old(~globalState~0)|=(_ bv0 32), ~globalState~0=(_ bv1 32)] [?] CALL call l_free(~a~0.base, ~a~0.offset); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |l_free_#in~ptr.base|=(_ bv11 32), |l_free_#in~ptr.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv1 32), ~globalState~0=(_ bv1 32)] [?] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; VAL [l_free_~ptr.base=(_ bv11 32), l_free_~ptr.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |l_free_#in~ptr.base|=(_ bv11 32), |l_free_#in~ptr.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv1 32), ~globalState~0=(_ bv1 32)] [?] assume ~ptr.base != 0bv32 || ~ptr.offset != 0bv32; VAL [l_free_~ptr.base=(_ bv11 32), l_free_~ptr.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |l_free_#in~ptr.base|=(_ bv11 32), |l_free_#in~ptr.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv1 32), ~globalState~0=(_ bv1 32)] [?] assume 1bv32 == ~globalState~0; VAL [l_free_~ptr.base=(_ bv11 32), l_free_~ptr.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |l_free_#in~ptr.base|=(_ bv11 32), |l_free_#in~ptr.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv1 32), ~globalState~0=(_ bv1 32)] [?] ~globalState~0 := 0bv32;call ULTIMATE.dealloc(~ptr.base, ~ptr.offset); VAL [l_free_~ptr.base=(_ bv11 32), l_free_~ptr.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |l_free_#in~ptr.base|=(_ bv11 32), |l_free_#in~ptr.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv1 32), ~globalState~0=(_ bv0 32)] [?] assume true; VAL [l_free_~ptr.base=(_ bv11 32), l_free_~ptr.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |l_free_#in~ptr.base|=(_ bv11 32), |l_free_#in~ptr.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv1 32), ~globalState~0=(_ bv0 32)] [?] RET #49#return; VAL [main_~argc=(_ bv10 32), main_~argv.base=(_ bv8 32), main_~argv.offset=(_ bv9 32), main_~a~0.base=(_ bv11 32), main_~a~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#in~argc|=(_ bv10 32), |main_#in~argv.base|=(_ bv8 32), |main_#in~argv.offset|=(_ bv9 32), |old(~globalState~0)|=(_ bv0 32), ~globalState~0=(_ bv0 32)] [?] CALL call l_free(~a~0.base, ~a~0.offset); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |l_free_#in~ptr.base|=(_ bv11 32), |l_free_#in~ptr.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv0 32), ~globalState~0=(_ bv0 32)] [?] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; VAL [l_free_~ptr.base=(_ bv11 32), l_free_~ptr.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |l_free_#in~ptr.base|=(_ bv11 32), |l_free_#in~ptr.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv0 32), ~globalState~0=(_ bv0 32)] [?] assume ~ptr.base != 0bv32 || ~ptr.offset != 0bv32; VAL [l_free_~ptr.base=(_ bv11 32), l_free_~ptr.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |l_free_#in~ptr.base|=(_ bv11 32), |l_free_#in~ptr.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv0 32), ~globalState~0=(_ bv0 32)] [?] assume !(1bv32 == ~globalState~0); VAL [l_free_~ptr.base=(_ bv11 32), l_free_~ptr.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |l_free_#in~ptr.base|=(_ bv11 32), |l_free_#in~ptr.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv0 32), ~globalState~0=(_ bv0 32)] [?] CALL call __blast_assert(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv0 32), ~globalState~0=(_ bv0 32)] [?] assume !false; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(~globalState~0)|=(_ bv0 32), ~globalState~0=(_ bv0 32)] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=5bv32, #NULL.offset=6bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=6bv32, old(~globalState~0)=7bv32, ~globalState~0=7bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; [L1606] ~globalState~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=6bv32, old(~globalState~0)=7bv32, ~globalState~0=0bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=6bv32, old(~globalState~0)=7bv32, ~globalState~0=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~globalState~0=0bv32] [?] CALL call #t~ret32 := main(#in~argc, #in~argv.base, #in~argv.offset); VAL [#in~argc=10bv32, #in~argv.base=8bv32, #in~argv.offset=9bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1610-L1616] ~argc := #in~argc; [L1610-L1616] ~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; VAL [#in~argc=10bv32, #in~argv.base=8bv32, #in~argv.offset=9bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv.base=8bv32, ~argv.offset=9bv32, ~globalState~0=0bv32] [L1612] CALL call #t~ret30.base, #t~ret30.offset := l_malloc(4bv32); VAL [#in~size=4bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [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=4bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc31.base=11bv32, #t~malloc31.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~retVal~0.base=11bv32, ~retVal~0.offset=0bv32, ~size=4bv32] [L1620-L1621] assume ~retVal~0.base != 0bv32 || ~retVal~0.offset != 0bv32; [L1621] ~globalState~0 := 1bv32; VAL [#in~size=4bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc31.base=11bv32, #t~malloc31.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=1bv32, ~retVal~0.base=11bv32, ~retVal~0.offset=0bv32, ~size=4bv32] [L1622] #res.base, #res.offset := ~retVal~0.base, ~retVal~0.offset; VAL [#in~size=4bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #res.base=11bv32, #res.offset=0bv32, #t~malloc31.base=11bv32, #t~malloc31.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=1bv32, ~retVal~0.base=11bv32, ~retVal~0.offset=0bv32, ~size=4bv32] [L1607] ensures true; VAL [#in~size=4bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #res.base=11bv32, #res.offset=0bv32, #t~malloc31.base=11bv32, #t~malloc31.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=1bv32, ~retVal~0.base=11bv32, ~retVal~0.offset=0bv32, ~size=4bv32] [L1612] RET call #t~ret30.base, #t~ret30.offset := l_malloc(4bv32); VAL [#in~argc=10bv32, #in~argv.base=8bv32, #in~argv.offset=9bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~ret30.base=11bv32, #t~ret30.offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv.base=8bv32, ~argv.offset=9bv32, ~globalState~0=1bv32] [L1612] ~a~0.base, ~a~0.offset := #t~ret30.base, #t~ret30.offset; [L1612] havoc #t~ret30.base, #t~ret30.offset; VAL [#in~argc=10bv32, #in~argv.base=8bv32, #in~argv.offset=9bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv.base=8bv32, ~argv.offset=9bv32, ~a~0.base=11bv32, ~a~0.offset=0bv32, ~globalState~0=1bv32] [L1613] CALL call l_free(~a~0.base, ~a~0.offset); VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32] [L1625-L1632] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr.base=11bv32, ~ptr.offset=0bv32] [L1629] assume ~ptr.base != 0bv32 || ~ptr.offset != 0bv32; VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr.base=11bv32, ~ptr.offset=0bv32] [L1629] assume 1bv32 == ~globalState~0; VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr.base=11bv32, ~ptr.offset=0bv32] [L1630] ~globalState~0 := 0bv32; [L1631] call ULTIMATE.dealloc(~ptr.base, ~ptr.offset); VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=0bv32, ~ptr.base=11bv32, ~ptr.offset=0bv32] [L1608] ensures true; VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=0bv32, ~ptr.base=11bv32, ~ptr.offset=0bv32] [L1613] RET call l_free(~a~0.base, ~a~0.offset); VAL [#in~argc=10bv32, #in~argv.base=8bv32, #in~argv.offset=9bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv.base=8bv32, ~argv.offset=9bv32, ~a~0.base=11bv32, ~a~0.offset=0bv32, ~globalState~0=0bv32] [L1614] CALL call l_free(~a~0.base, ~a~0.offset); VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1625-L1632] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr.base=11bv32, ~ptr.offset=0bv32] [L1629] assume ~ptr.base != 0bv32 || ~ptr.offset != 0bv32; VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr.base=11bv32, ~ptr.offset=0bv32] [L1629] assume !(1bv32 == ~globalState~0); VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr.base=11bv32, ~ptr.offset=0bv32] [L1629] CALL call __blast_assert(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1601] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=5bv32, #NULL.offset=6bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=6bv32, old(~globalState~0)=7bv32, ~globalState~0=7bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; [L1606] ~globalState~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=6bv32, old(~globalState~0)=7bv32, ~globalState~0=0bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=6bv32, old(~globalState~0)=7bv32, ~globalState~0=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~globalState~0=0bv32] [?] CALL call #t~ret32 := main(#in~argc, #in~argv.base, #in~argv.offset); VAL [#in~argc=10bv32, #in~argv.base=8bv32, #in~argv.offset=9bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1610-L1616] ~argc := #in~argc; [L1610-L1616] ~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset; VAL [#in~argc=10bv32, #in~argv.base=8bv32, #in~argv.offset=9bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv.base=8bv32, ~argv.offset=9bv32, ~globalState~0=0bv32] [L1612] CALL call #t~ret30.base, #t~ret30.offset := l_malloc(4bv32); VAL [#in~size=4bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [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=4bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc31.base=11bv32, #t~malloc31.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~retVal~0.base=11bv32, ~retVal~0.offset=0bv32, ~size=4bv32] [L1620-L1621] assume ~retVal~0.base != 0bv32 || ~retVal~0.offset != 0bv32; [L1621] ~globalState~0 := 1bv32; VAL [#in~size=4bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc31.base=11bv32, #t~malloc31.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=1bv32, ~retVal~0.base=11bv32, ~retVal~0.offset=0bv32, ~size=4bv32] [L1622] #res.base, #res.offset := ~retVal~0.base, ~retVal~0.offset; VAL [#in~size=4bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #res.base=11bv32, #res.offset=0bv32, #t~malloc31.base=11bv32, #t~malloc31.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=1bv32, ~retVal~0.base=11bv32, ~retVal~0.offset=0bv32, ~size=4bv32] [L1607] ensures true; VAL [#in~size=4bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #res.base=11bv32, #res.offset=0bv32, #t~malloc31.base=11bv32, #t~malloc31.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=1bv32, ~retVal~0.base=11bv32, ~retVal~0.offset=0bv32, ~size=4bv32] [L1612] RET call #t~ret30.base, #t~ret30.offset := l_malloc(4bv32); VAL [#in~argc=10bv32, #in~argv.base=8bv32, #in~argv.offset=9bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~ret30.base=11bv32, #t~ret30.offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv.base=8bv32, ~argv.offset=9bv32, ~globalState~0=1bv32] [L1612] ~a~0.base, ~a~0.offset := #t~ret30.base, #t~ret30.offset; [L1612] havoc #t~ret30.base, #t~ret30.offset; VAL [#in~argc=10bv32, #in~argv.base=8bv32, #in~argv.offset=9bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv.base=8bv32, ~argv.offset=9bv32, ~a~0.base=11bv32, ~a~0.offset=0bv32, ~globalState~0=1bv32] [L1613] CALL call l_free(~a~0.base, ~a~0.offset); VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32] [L1625-L1632] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr.base=11bv32, ~ptr.offset=0bv32] [L1629] assume ~ptr.base != 0bv32 || ~ptr.offset != 0bv32; VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr.base=11bv32, ~ptr.offset=0bv32] [L1629] assume 1bv32 == ~globalState~0; VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr.base=11bv32, ~ptr.offset=0bv32] [L1630] ~globalState~0 := 0bv32; [L1631] call ULTIMATE.dealloc(~ptr.base, ~ptr.offset); VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=0bv32, ~ptr.base=11bv32, ~ptr.offset=0bv32] [L1608] ensures true; VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=0bv32, ~ptr.base=11bv32, ~ptr.offset=0bv32] [L1613] RET call l_free(~a~0.base, ~a~0.offset); VAL [#in~argc=10bv32, #in~argv.base=8bv32, #in~argv.offset=9bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv.base=8bv32, ~argv.offset=9bv32, ~a~0.base=11bv32, ~a~0.offset=0bv32, ~globalState~0=0bv32] [L1614] CALL call l_free(~a~0.base, ~a~0.offset); VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1625-L1632] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr.base=11bv32, ~ptr.offset=0bv32] [L1629] assume ~ptr.base != 0bv32 || ~ptr.offset != 0bv32; VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr.base=11bv32, ~ptr.offset=0bv32] [L1629] assume !(1bv32 == ~globalState~0); VAL [#in~ptr.base=11bv32, #in~ptr.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr.base=11bv32, ~ptr.offset=0bv32] [L1629] CALL call __blast_assert(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1601] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5bv32, #NULL!offset=6bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=6bv32, old(~globalState~0)=7bv32, ~globalState~0=7bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; [L1606] ~globalState~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=6bv32, old(~globalState~0)=7bv32, ~globalState~0=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~globalState~0=0bv32] [?] CALL call #t~ret32 := main(#in~argc, #in~argv); VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1610-L1616] ~argc := #in~argc; [L1610-L1616] ~argv := #in~argv; VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv!base=8bv32, ~argv!offset=9bv32, ~globalState~0=0bv32] [L1612] CALL call #t~ret30 := l_malloc(4bv32); VAL [#in~size=4bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1618-L1623] ~size := #in~size; [L1619] FCALL call #t~malloc31 := #Ultimate.alloc(~size); [L1619] ~retVal~0 := #t~malloc31; VAL [#in~size=4bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc31!base=11bv32, #t~malloc31!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~retVal~0!base=11bv32, ~retVal~0!offset=0bv32, ~size=4bv32] [L1620] COND TRUE ~retVal~0 != { base: 0bv32, offset: 0bv32 } [L1621] ~globalState~0 := 1bv32; VAL [#in~size=4bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc31!base=11bv32, #t~malloc31!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=1bv32, ~retVal~0!base=11bv32, ~retVal~0!offset=0bv32, ~size=4bv32] [L1622] #res := ~retVal~0; VAL [#in~size=4bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #res!base=11bv32, #res!offset=0bv32, #t~malloc31!base=11bv32, #t~malloc31!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=1bv32, ~retVal~0!base=11bv32, ~retVal~0!offset=0bv32, ~size=4bv32] [L1612] RET call #t~ret30 := l_malloc(4bv32); VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret30!base=11bv32, #t~ret30!offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv!base=8bv32, ~argv!offset=9bv32, ~globalState~0=1bv32] [L1612] ~a~0 := #t~ret30; [L1612] havoc #t~ret30; VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv!base=8bv32, ~argv!offset=9bv32, ~a~0!base=11bv32, ~a~0!offset=0bv32, ~globalState~0=1bv32] [L1613] CALL call l_free(~a~0); VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32] [L1625-L1632] ~ptr := #in~ptr; VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] COND TRUE ~ptr != { base: 0bv32, offset: 0bv32 } VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] COND TRUE 1bv32 == ~globalState~0 VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1630] ~globalState~0 := 0bv32; [L1631] FCALL call ULTIMATE.dealloc(~ptr); VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=0bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1613] RET call l_free(~a~0); VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv!base=8bv32, ~argv!offset=9bv32, ~a~0!base=11bv32, ~a~0!offset=0bv32, ~globalState~0=0bv32] [L1614] CALL call l_free(~a~0); VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1625-L1632] ~ptr := #in~ptr; VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] COND TRUE ~ptr != { base: 0bv32, offset: 0bv32 } VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] COND FALSE !(1bv32 == ~globalState~0) VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] CALL call __blast_assert(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1601] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5bv32, #NULL!offset=6bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=6bv32, old(~globalState~0)=7bv32, ~globalState~0=7bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; [L1606] ~globalState~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=6bv32, old(~globalState~0)=7bv32, ~globalState~0=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~globalState~0=0bv32] [?] CALL call #t~ret32 := main(#in~argc, #in~argv); VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1610-L1616] ~argc := #in~argc; [L1610-L1616] ~argv := #in~argv; VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv!base=8bv32, ~argv!offset=9bv32, ~globalState~0=0bv32] [L1612] CALL call #t~ret30 := l_malloc(4bv32); VAL [#in~size=4bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1618-L1623] ~size := #in~size; [L1619] FCALL call #t~malloc31 := #Ultimate.alloc(~size); [L1619] ~retVal~0 := #t~malloc31; VAL [#in~size=4bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc31!base=11bv32, #t~malloc31!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~retVal~0!base=11bv32, ~retVal~0!offset=0bv32, ~size=4bv32] [L1620] COND TRUE ~retVal~0 != { base: 0bv32, offset: 0bv32 } [L1621] ~globalState~0 := 1bv32; VAL [#in~size=4bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc31!base=11bv32, #t~malloc31!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=1bv32, ~retVal~0!base=11bv32, ~retVal~0!offset=0bv32, ~size=4bv32] [L1622] #res := ~retVal~0; VAL [#in~size=4bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #res!base=11bv32, #res!offset=0bv32, #t~malloc31!base=11bv32, #t~malloc31!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=1bv32, ~retVal~0!base=11bv32, ~retVal~0!offset=0bv32, ~size=4bv32] [L1612] RET call #t~ret30 := l_malloc(4bv32); VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret30!base=11bv32, #t~ret30!offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv!base=8bv32, ~argv!offset=9bv32, ~globalState~0=1bv32] [L1612] ~a~0 := #t~ret30; [L1612] havoc #t~ret30; VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv!base=8bv32, ~argv!offset=9bv32, ~a~0!base=11bv32, ~a~0!offset=0bv32, ~globalState~0=1bv32] [L1613] CALL call l_free(~a~0); VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32] [L1625-L1632] ~ptr := #in~ptr; VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] COND TRUE ~ptr != { base: 0bv32, offset: 0bv32 } VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] COND TRUE 1bv32 == ~globalState~0 VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1630] ~globalState~0 := 0bv32; [L1631] FCALL call ULTIMATE.dealloc(~ptr); VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=0bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1613] RET call l_free(~a~0); VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv!base=8bv32, ~argv!offset=9bv32, ~a~0!base=11bv32, ~a~0!offset=0bv32, ~globalState~0=0bv32] [L1614] CALL call l_free(~a~0); VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1625-L1632] ~ptr := #in~ptr; VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] COND TRUE ~ptr != { base: 0bv32, offset: 0bv32 } VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] COND FALSE !(1bv32 == ~globalState~0) VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] CALL call __blast_assert(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1601] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5bv32, #NULL!offset=6bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=6bv32, old(~globalState~0)=7bv32, ~globalState~0=7bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; [L1606] ~globalState~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=6bv32, old(~globalState~0)=7bv32, ~globalState~0=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~globalState~0=0bv32] [?] CALL call #t~ret32 := main(#in~argc, #in~argv); VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1610-L1616] ~argc := #in~argc; [L1610-L1616] ~argv := #in~argv; VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv!base=8bv32, ~argv!offset=9bv32, ~globalState~0=0bv32] [L1612] CALL call #t~ret30 := l_malloc(4bv32); VAL [#in~size=4bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1618-L1623] ~size := #in~size; [L1619] FCALL call #t~malloc31 := #Ultimate.alloc(~size); [L1619] ~retVal~0 := #t~malloc31; VAL [#in~size=4bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc31!base=11bv32, #t~malloc31!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~retVal~0!base=11bv32, ~retVal~0!offset=0bv32, ~size=4bv32] [L1620] COND TRUE ~retVal~0 != { base: 0bv32, offset: 0bv32 } [L1621] ~globalState~0 := 1bv32; VAL [#in~size=4bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc31!base=11bv32, #t~malloc31!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=1bv32, ~retVal~0!base=11bv32, ~retVal~0!offset=0bv32, ~size=4bv32] [L1622] #res := ~retVal~0; VAL [#in~size=4bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #res!base=11bv32, #res!offset=0bv32, #t~malloc31!base=11bv32, #t~malloc31!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=1bv32, ~retVal~0!base=11bv32, ~retVal~0!offset=0bv32, ~size=4bv32] [L1612] RET call #t~ret30 := l_malloc(4bv32); VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret30!base=11bv32, #t~ret30!offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv!base=8bv32, ~argv!offset=9bv32, ~globalState~0=1bv32] [L1612] ~a~0 := #t~ret30; [L1612] havoc #t~ret30; VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv!base=8bv32, ~argv!offset=9bv32, ~a~0!base=11bv32, ~a~0!offset=0bv32, ~globalState~0=1bv32] [L1613] CALL call l_free(~a~0); VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32] [L1625-L1632] ~ptr := #in~ptr; VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] COND TRUE ~ptr != { base: 0bv32, offset: 0bv32 } VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] COND TRUE 1bv32 == ~globalState~0 VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1630] ~globalState~0 := 0bv32; [L1631] FCALL call ULTIMATE.dealloc(~ptr); VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=0bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1613] RET call l_free(~a~0); VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv!base=8bv32, ~argv!offset=9bv32, ~a~0!base=11bv32, ~a~0!offset=0bv32, ~globalState~0=0bv32] [L1614] CALL call l_free(~a~0); VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1625-L1632] ~ptr := #in~ptr; VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] COND TRUE ~ptr != { base: 0bv32, offset: 0bv32 } VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] COND FALSE !(1bv32 == ~globalState~0) VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] CALL call __blast_assert(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1601] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5bv32, #NULL!offset=6bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=6bv32, old(~globalState~0)=7bv32, ~globalState~0=7bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; [L1606] ~globalState~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=6bv32, old(~globalState~0)=7bv32, ~globalState~0=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~globalState~0=0bv32] [?] CALL call #t~ret32 := main(#in~argc, #in~argv); VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1610-L1616] ~argc := #in~argc; [L1610-L1616] ~argv := #in~argv; VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv!base=8bv32, ~argv!offset=9bv32, ~globalState~0=0bv32] [L1612] CALL call #t~ret30 := l_malloc(4bv32); VAL [#in~size=4bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1618-L1623] ~size := #in~size; [L1619] FCALL call #t~malloc31 := #Ultimate.alloc(~size); [L1619] ~retVal~0 := #t~malloc31; VAL [#in~size=4bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc31!base=11bv32, #t~malloc31!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~retVal~0!base=11bv32, ~retVal~0!offset=0bv32, ~size=4bv32] [L1620] COND TRUE ~retVal~0 != { base: 0bv32, offset: 0bv32 } [L1621] ~globalState~0 := 1bv32; VAL [#in~size=4bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc31!base=11bv32, #t~malloc31!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=1bv32, ~retVal~0!base=11bv32, ~retVal~0!offset=0bv32, ~size=4bv32] [L1622] #res := ~retVal~0; VAL [#in~size=4bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #res!base=11bv32, #res!offset=0bv32, #t~malloc31!base=11bv32, #t~malloc31!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=1bv32, ~retVal~0!base=11bv32, ~retVal~0!offset=0bv32, ~size=4bv32] [L1612] RET call #t~ret30 := l_malloc(4bv32); VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~ret30!base=11bv32, #t~ret30!offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv!base=8bv32, ~argv!offset=9bv32, ~globalState~0=1bv32] [L1612] ~a~0 := #t~ret30; [L1612] havoc #t~ret30; VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv!base=8bv32, ~argv!offset=9bv32, ~a~0!base=11bv32, ~a~0!offset=0bv32, ~globalState~0=1bv32] [L1613] CALL call l_free(~a~0); VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32] [L1625-L1632] ~ptr := #in~ptr; VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] COND TRUE ~ptr != { base: 0bv32, offset: 0bv32 } VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] COND TRUE 1bv32 == ~globalState~0 VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=1bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1630] ~globalState~0 := 0bv32; [L1631] FCALL call ULTIMATE.dealloc(~ptr); VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=1bv32, ~globalState~0=0bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1613] RET call l_free(~a~0); VAL [#in~argc=10bv32, #in~argv!base=8bv32, #in~argv!offset=9bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~argc=10bv32, ~argv!base=8bv32, ~argv!offset=9bv32, ~a~0!base=11bv32, ~a~0!offset=0bv32, ~globalState~0=0bv32] [L1614] CALL call l_free(~a~0); VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1625-L1632] ~ptr := #in~ptr; VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] COND TRUE ~ptr != { base: 0bv32, offset: 0bv32 } VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] COND FALSE !(1bv32 == ~globalState~0) VAL [#in~ptr!base=11bv32, #in~ptr!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32, ~ptr!base=11bv32, ~ptr!offset=0bv32] [L1629] CALL call __blast_assert(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1601] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~globalState~0)=0bv32, ~globalState~0=0bv32] [L1606] int globalState = 0; VAL [\old(globalState)=7, 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)={11:0}, retVal={11:0}, size=4] [L1620] COND TRUE retVal != ((void *)0) [L1621] globalState=1 VAL [\old(globalState)=0, \old(size)=4, globalState=1, malloc(size)={11:0}, retVal={11:0}, size=4] [L1622] return retVal; VAL [\old(globalState)=0, \old(size)=4, \result={11:0}, globalState=1, malloc(size)={11:0}, retVal={11:0}, size=4] [L1612] RET, EXPR l_malloc(sizeof(int)) VAL [\old(argc)=10, \old(globalState)=0, argc=10, argv={8:9}, argv={8:9}, globalState=1, l_malloc(sizeof(int))={11:0}] [L1612] int *a = (int*) l_malloc(sizeof(int)); [L1613] CALL l_free(a) VAL [\old(globalState)=1, globalState=1, ptr={11:0}] [L1629] COND TRUE ptr!=((void *)0) VAL [\old(globalState)=1, globalState=1, ptr={11:0}, ptr={11:0}] [L1629] (globalState == 1) ? (0) : __blast_assert () VAL [\old(globalState)=1, globalState=1, ptr={11:0}, ptr={11:0}] [L1630] globalState = 0 [L1613] RET l_free(a) VAL [\old(argc)=10, \old(globalState)=0, a={11:0}, argc=10, argv={8:9}, argv={8:9}, globalState=0] [L1614] CALL l_free(a) VAL [\old(globalState)=0, globalState=0, ptr={11:0}] [L1629] COND TRUE ptr!=((void *)0) VAL [\old(globalState)=0, globalState=0, ptr={11:0}, ptr={11:0}] [L1629] (globalState == 1) ? (0) : __blast_assert () VAL [\old(globalState)=0, globalState=0, ptr={11:0}, ptr={11:0}] [L1629] CALL __blast_assert () VAL [\old(globalState)=0, globalState=0] [L1601] __VERIFIER_error() VAL [\old(globalState)=0, globalState=0] ----- [2018-11-23 11:06:06,246 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 11:06:06,246 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:06:06,248 INFO L168 Benchmark]: Toolchain (without parser) took 5654.07 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.7 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -527.6 MB). Peak memory consumption was 210.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:06:06,250 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:06:06,250 INFO L168 Benchmark]: CACSL2BoogieTranslator took 913.91 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -785.6 MB). Peak memory consumption was 74.8 MB. Max. memory is 7.1 GB. [2018-11-23 11:06:06,256 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.52 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 11:06:06,257 INFO L168 Benchmark]: Boogie Preprocessor took 56.77 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 11:06:06,257 INFO L168 Benchmark]: RCFGBuilder took 604.28 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: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2018-11-23 11:06:06,258 INFO L168 Benchmark]: TraceAbstraction took 3900.18 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: 235.9 MB). Peak memory consumption was 235.9 MB. Max. memory is 7.1 GB. [2018-11-23 11:06:06,259 INFO L168 Benchmark]: Witness Printer took 130.67 ms. Allocated memory is still 2.3 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:06:06,262 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 913.91 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -785.6 MB). Peak memory consumption was 74.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.52 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. * Boogie Preprocessor took 56.77 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 604.28 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: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3900.18 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: 235.9 MB). Peak memory consumption was 235.9 MB. Max. memory is 7.1 GB. * Witness Printer took 130.67 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)=7, 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)={11:0}, retVal={11:0}, size=4] [L1620] COND TRUE retVal != ((void *)0) [L1621] globalState=1 VAL [\old(globalState)=0, \old(size)=4, globalState=1, malloc(size)={11:0}, retVal={11:0}, size=4] [L1622] return retVal; VAL [\old(globalState)=0, \old(size)=4, \result={11:0}, globalState=1, malloc(size)={11:0}, retVal={11:0}, size=4] [L1612] RET, EXPR l_malloc(sizeof(int)) VAL [\old(argc)=10, \old(globalState)=0, argc=10, argv={8:9}, argv={8:9}, globalState=1, l_malloc(sizeof(int))={11:0}] [L1612] int *a = (int*) l_malloc(sizeof(int)); [L1613] CALL l_free(a) VAL [\old(globalState)=1, globalState=1, ptr={11:0}] [L1629] COND TRUE ptr!=((void *)0) VAL [\old(globalState)=1, globalState=1, ptr={11:0}, ptr={11:0}] [L1629] (globalState == 1) ? (0) : __blast_assert () VAL [\old(globalState)=1, globalState=1, ptr={11:0}, ptr={11:0}] [L1630] globalState = 0 [L1613] RET l_free(a) VAL [\old(argc)=10, \old(globalState)=0, a={11:0}, argc=10, argv={8:9}, argv={8:9}, globalState=0] [L1614] CALL l_free(a) VAL [\old(globalState)=0, globalState=0, ptr={11:0}] [L1629] COND TRUE ptr!=((void *)0) VAL [\old(globalState)=0, globalState=0, ptr={11:0}, ptr={11:0}] [L1629] (globalState == 1) ? (0) : __blast_assert () VAL [\old(globalState)=0, globalState=0, ptr={11:0}, ptr={11: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.8s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 1.4s 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, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s 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.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 60 ConstructedInterpolants, 0 QuantifiedInterpolants, 2190 SizeOfPredicates, 5 NumberOfNonLiveVariables, 215 ConjunctsInSsa, 15 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...